Wiki
Wiki

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

Updated


Statement

Setting (p. 523): the Christoffel numbers of the weight pp are kν(n)=∫−11lν,n(t)p(t) dtk_\nu^{(n)}=\int_{-1}^1l_{\nu,n}(t)p(t)\,dt (display (28)); by (29b) (p. 524) also kν(n)=∫−11lν(t)2p(t) dtk_\nu^{(n)}=\int_{-1}^1l_\nu(t)^2p(t)\,dt.

Theorem IX (p. 542). Let p(x)1−x2p(x)\sqrt{1-x^2} be continuous and p(x)1−x2≥m>0p(x)\sqrt{1-x^2}\ge m>0 in [−1,1][-1,1]. Then, as n→∞n\to\infty, for every root xν(n)x_\nu^{(n)} of the nnth orthogonal polynomial with

−[1−log⁡nn2]1/2≤xν(n)≤[1−log⁡nn2]1/2\quad-\Bigl[1-\frac{\log n}{n^2}\Bigr]^{1/2}\le x_\nu^{(n)}\le \Bigl[1-\frac{\log n}{n^2}\Bigr]^{1/2}

one has

kν(n)=∫−11lν(t)2p(t) dt∼πp(xν(n))1−xν(n)2n.k_\nu^{(n)}=\int_{-1}^1l_\nu(t)^2p(t)\,dt\sim \frac{\pi p(x_\nu^{(n)})\sqrt{1-x_\nu^{(n)2}}}{n}.

Proof pointer

Pp. 539--543. The comparison polynomial ϕn−1\phi_{n-1} of (52) (p. 539), built from Chebyshev polynomials and normalized by ϕn−1(ξ0)=1\phi_{n-1}(\xi_0)=1, minimizes ∫−11f2/1−t2\int_{-1}^1f^2/\sqrt{1-t^2} among polynomials of degree n−1n-1 with f(ξ0)=1f(\xi_0)=1 (display (51)) and is bounded on [−1,1][-1,1] (55). Lemma IX (p. 540) evaluates lim⁡n∫−11ϕn−12p\lim n\int_{-1}^1\phi_{n-1}^2p in terms of πp(ξ0)1−ξ02\pi p(\xi_0)\sqrt{1-\xi_0^2}, and Lemma X (p. 541) shows that a polynomial normalized to 11 at ξ0\xi_0 whose weighted square integral near ξ0\xi_0 falls short of the Chebyshev extremal value must be exponentially large elsewhere. Lemma X and Shohat's minimum property give the lower bound (62)--(63); the minimum property with ϕn−1\phi_{n-1} as competitor gives the upper bound (64).

Read depth

Claims checked: Theorem IX, (28), (29b), (51), (52) and Lemmas IX and X were read clause by clause on the page images of the print; the proof was followed for structure. Nothing here is independently reviewed.

Dependencies

Lemmas II (Shohat's minimum property, Corollary I), IX and X of the same paper; the Christoffel--Darboux formula.

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.