Uniqueness of the Lagrange interpolation polynomial
ProvedFamousTheorems.lagrange_interpolation_unique_6bUniqueness of the Lagrange interpolation polynomial. Let be a field, distinct nodes and values. If a polynomial has and for all , then equals the Lagrange interpolation polynomial
A polynomial of degree less than is therefore determined by its values at points. The result is used in secret sharing, Reed–Solomon codes, numerical analysis and the proof of the Chinese remainder theorem for polynomials.
Formalization note. Mathlib's Lagrange.eq_interpolate_of_eval_eq. The nodes are for in a finite set and are assumed distinct (Set.InjOn v s). Lagrange.interpolate s v r is the Lagrange polynomial through the points .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem lagrange_interpolation_unique_6b {F ι : Type*} [Field F] [DecidableEq ι] {s : Finset ι} {v : ι → F} (r : ι → F) {f : Polynomial F}
(hvs : Set.InjOn v s) (hf : f.degree < s.card) (heval : ∀ i ∈ s, f.eval (v i) = r i) :
f = Lagrange.interpolate s v r := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Lagrange.eq_interpolate_of_eval_eq`. Proof here reduces to that Mathlib result.