Theorems · Theorem · linear algebra
Lagrange.eval_basis_not_at_node
∀ {F : Type u_1} [inst : Field F] {ι : Type u_2} [inst_1 : DecidableEq ι] {s : Finset ι} {v : ι → F} {i : ι} {x : F},
i ∈ s →
x ≠ v i →
Polynomial.eval x (Lagrange.basis s v i) =
Polynomial.eval x (Lagrange.nodal s v) * (Lagrange.nodalWeight s v i * (x - v i)⁻¹)- Defined in
- Mathlib.LinearAlgebra.Lagrange
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 124 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FieldDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- Fieldstatement and proof · cited by 7,404
- Polynomialproof · cited by 5,681
- one_mulproof · cited by 2,841
- Finset.prodproof · cited by 2,356
- mul_commproof · cited by 2,262
- mul_assocproof · cited by 1,667
- Polynomial.Xproof · cited by 1,639
- Polynomial.Cproof · cited by 1,598
- Polynomial.evalstatement and proof · cited by 796
- Finset.eraseproof · cited by 455
Cited by1
Results whose statement or proof uses this declaration.
- Lagrange.eval_interpolate_not_at_nodeproof · cited by 2