Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Theorem X (p. 543). In [−1,1][-1,1] let p(x)1−x2p(x)\sqrt{1-x^2} be continuous with p(x)1−x2≥m>0p(x)\sqrt{1-x^2}\ge m>0. Then for every ϵ>0\epsilon>0, n>n0(ϵ)n>n_0(\epsilon) and every node with ∣xν(n)∣≤[1−log⁡n/n2]1/2|x_\nu^{(n)}|\le[1-\log n/n^2]^{1/2}, uniformly for −1≤x≤1-1\le x\le1,

∣lν,n(x)−ϕn−1(x)∣=∣lν(x)−Tn−1(xν(n))Tn(x)−Tn(xν(n))Tn−1(x)(n−12+12sin⁡(2n−1)ϑν(n)sin⁡ϑν(n))(x−xν(n))∣<ϵ,|l_{\nu,n}(x)-\phi_{n-1}(x)| =\left|l_\nu(x)- \frac{T_{n-1}(x_\nu^{(n)})T_n(x)-T_n(x_\nu^{(n)})T_{n-1}(x)} {\Bigl(n-\frac12+\frac12\frac{\sin(2n-1)\vartheta_\nu^{(n)}}{\sin\vartheta_\nu^{(n)}}\Bigr)(x-x_\nu^{(n)})}\right| <\epsilon,

with xν(n)=cos⁡ϑν(n)x_\nu^{(n)}=\cos\vartheta_\nu^{(n)} and the Chebyshev polynomials Tr(cos⁡ϑ)=cos⁡rϑT_r(\cos\vartheta)=\cos r\vartheta; the theorem prints "r>1r>1" in this parenthesis, while the definition (52) (p. 539) sets T0(x)=1/2T_0(x)=1/\sqrt2 and Tr(cos⁡ϑ)=cos⁡rϑT_r(\cos\vartheta)=\cos r\vartheta for r≥1r\ge1. Here ϕn−1\phi_{n-1} is the polynomial (52) with ξ0=xν(n)\xi_0=x_\nu^{(n)}.

Remarks (pp. 544--545). Remark I says that if instead p(x)p(x) itself is continuous and at least mm on a subinterval [a,b][a,b], Theorems IX and X remain true for the nodes and points in [a+ϵ,b−ϵ][a+\epsilon,b-\epsilon], with Legendre polynomials replacing the Chebyshev polynomials in ϕn−1\phi_{n-1}. Remark II calls it probable that Theorem X holds for the fundamental functions of every node; this is not proved.

Proof pointer

Pp. 543--544. With Iν=∫−11(lν−ϕn−1)2pI_\nu=\int_{-1}^1(l_\nu-\phi_{n-1})^2p, identity (66) gives Iν=−kν+∫−11ϕn−12pI_\nu=-k_\nu+\int_{-1}^1\phi_{n-1}^2p, so Theorem IX and Lemma IX give nIν→0nI_\nu\to0 uniformly in ν\nu (67). Remark I to Theorem VIII and (55) bound lν−ϕn−1l_\nu-\phi_{n-1}, the Bernstein--Fejér inequality bounds its derivative by a constant times nn, so near a point where ∣lν−ϕn−1∣|l_\nu-\phi_{n-1}| reaches its maximum DνD_\nu it stays above Dν/2D_\nu/2 on an interval of length of order Dν/nD_\nu/n; this bounds nIνnI_\nu from below by a positive function of DνD_\nu, and (67) gives Dν→0D_\nu\to0.

Read depth

Claims checked: Theorem X, (52) and Remarks I and II were read clause by clause on the page images of the print; the proof was followed for structure. Nothing here is independently reviewed.

Dependencies

Theorem IX, Lemma IX and Remark I to Theorem VIII of the same paper; the Bernstein--Fejér inequality.

Source. P. Erdős and P. Turán, On interpolation. III. Interpolatory theory of polynomials, Annals of Mathematics (2) 41 (3) (1940), 510--553, DOI 10.2307/1968733; the edition read is named on the source card.

Bears on

None of the problem pages directly.