Solution

ID: past-exam-of-the-numerical-analysis-course-of-the-university-of-oxford/2015/2/a/solution

The polynomial interpolates at the interpolation nodes when
For distinct interpolation nodes, define the Lagrange cardinal polynomials
The denominators are nonzero, each polynomial degree is at most , and , with the Kronecker delta. Therefore
is a Lagrange interpolation polynomial belonging to the vector space of univariate polynomials , and it has all the required sampled values.
If also works, has distinct roots of a polynomial while its polynomial degree is at most . The root bound for a polynomial forces it to be the zero polynomial, proving uniqueness. The phrase “degree ” denotes the allowed maximum; the actual polynomial degree may be smaller. No continuity assumption is needed merely to construct the interpolation polynomial from these finitely many values.

New to topics? Read the docs here!