Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Proofs from Data fitting and polynomial interpolation

All proofs from Data fitting and polynomial interpolation.

Suppose a linear combination of the columns is zero. Its coefficients define

p(t)=λ1+λ2t+⋯+λntn−1,p(t)=\lambda_1+\lambda_2t+\cdots+\lambda_nt^{n-1},

and the zero combination says p(ti)=0p(t_i)=0 for every ii. By the factor theorem, each distinct root contributes a factor (t−ti)(t-t_i), so a non-zero polynomial of degree at most n−1n-1 cannot have all nn roots. Hence every λi\lambda_i is zero. The nn columns are independent in Rn\mathbb R^n, so they also span Rn\mathbb R^n, giving a unique solution to Ax=yAx=y.

If

λ1ℓ1(t)+⋯+λnℓn(t)=0,\lambda_1\ell_1(t)+\cdots+\lambda_n\ell_n(t)=0,

evaluate at t=tkt=t_k. Every term vanishes except λkℓk(tk)=λk\lambda_k\ell_k(t_k)=\lambda_k, so λk=0\lambda_k=0. This holds for every kk, so the Lagrange polynomials are linearly independent; with nn polynomials in Pn−1P_{n-1}, they form a basis.