Theorems · Definition · linear algebra
Lagrange.nodal
{R : Type u_1} → [inst : CommRing R] → {ι : Type u_2} → Finset ι → (ι → R) → Polynomial Rnodal s v is the unique monic polynomial whose roots are the nodes defined by v and s.
That is, the roots of nodal s v are exactly the image of v on s,
with appropriate multiplicity.
We can use nodal to define the barycentric forms of the evaluated interpolant.
- Defined in
- Mathlib.LinearAlgebra.Lagrange
- Cited by
- 24 results in Mathlib
- Foundations
- Depth 101 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommRing
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- CommRingstatement and proof · cited by 17,173
- Finsetstatement and proof · cited by 13,712
- Polynomialstatement · cited by 5,681
- Finset.prodproof · cited by 2,356
- Polynomial.Xproof · cited by 1,639
- Polynomial.Cproof · cited by 1,598
Cited by24
Results whose statement or proof uses this declaration.
- Lagrange.eval_nodalstatement · cited by 3
- Lagrange.basis_eq_prod_sub_inv_mul_nodal_divstatement and proof · cited by 2
- Lagrange.eval_interpolate_not_at_nodestatement and proof · cited by 2
- Lagrange.eval_nodal_at_nodestatement · cited by 2
- Lagrange.natDegree_nodalstatement · cited by 2
- Lagrange.nodal_eq_mul_nodal_erasestatement · cited by 2
- Lagrange.nodal_erase_eq_nodal_divstatement and proof · cited by 2
- Lagrange.nodal_insert_eq_nodalstatement · cited by 1
- Lagrange.nodal_monicstatement · cited by 1
- Lagrange.nodal_ne_zerostatement · cited by 1
- Lagrange.degree_nodalstatement · cited by 1
- Lagrange.derivative_nodalstatement and proof · cited by 1