Suppose x 1 , ⋯ , x n , c 1 , ⋯ , c n ∈ R where x i are distinct from each other.
Let S be the set of all polynomials p ( x ) ∈ R [ x ] such that p ( x i ) = c i for all i .
Is i = 1 ∑ n j = 1 , j = i ∏ n ( x i − x j ) j = 1 , j = i ∏ n ( x − x j ) c i the polynomial of minimal degree for S ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes, except technically, L ( x ) can have degree less than n − 1 in some cases.
Problem Loading...
Note Loading...
Set Loading...
for x 1 , … , x n , y 1 , … , y n ∈ R
\displaystyle L(x) := \sum_{i=1}^{n} \left( y_i \prod_{\begin{smallmatrix}1\le j\le n\\ j\neq i\end{smallmatrix}} \frac{x-x_j}{x_i-x_j}\right)
The above is the definition of a Lagrange polynomial L ( x ) , which satisfies L ( x i ) = y i ∀ i
obviously L ( x ) is a polynomial of degree n − 1 .
A polynomial function of degree k can be determined if it passes through k + 1 known points, because it has k + 1 coefficients.
therefore L ( x ) is the polynomial of minimal degree for S