Given a function f(x) on x € [a, b], and a set of distinct points x; € [a, b], i=0,1,--+ ,a. Let Pa(x) € Pn s.t., Pa(xi) = F(x), = OAs error function: e(x) = F(x) — Pax), x € [ab]. Theorem. There exists some value & € [a, b], such that 1 way OTe» for all x € [a,b]. (1) i=0 e(x) = Proof. If f € Pn, then by Uniqueness Theorem of polynomial interpolation we must have f(x) = Pp(x). Then e(x) = 0 and the proof is trivial. Now assume f ¢ Pp. If x = x; for some i, we have e(x;) = F(x:) — Pa(x;) = 0, and the result holds. Now consider x # x; for any i. W(x) = Tle —xi) © Posi, i=0 it holds W(x) =0, W(x)=x™B4e, WH) = (+1),Fix an y such that a < y < band y # x; for any /. We define a constant c= FY)= Pay) Wy)? and another function (x) = F(x) — Pa(x) — eW(x) We find all the zeros for (x). We see that x;'s are zeros since (xi) = F(xi) — Palxi) — eW(xi)=0, §=0,1,--+.0 and also y is a zero because ey) = f(y) — Pay) — eW(y) = 0 Here goes our deduction: p(x) has at least n+2 zeros on [a, b]. (x) has at least +1 zeros on [a, b]. y"(x) has at least n zeros on [a, ]. ypl))(x) has at least. = 1 zero on [a, b]. Call it € st. gM (€) =0. So we have ol D(E) = FO) — 0 — WNC) = 0. Recall W("*2) = (n+ 1)!, we have, for every y, D(C) = CW E) = ns eel (n+1)!, Writing y into x, we get el) = Fx) = Pal) = Grays MOO) = Gray MOTT — a rab for some € € [a,b]