Wiki
Wiki

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

Updated


Source. Theorem 2, p. 313, of P. Erdős, On divergence properties of the Lagrange interpolation parabolas, Ann. of Math. (2) 42 (1941), 309--315, doi:10.2307/1968999; the edition read is named on the source card.

Statement

The setting is that of Theorem 1: Ln(f(x0))L_n(f(x_0)) is the value at x0x_0 of the Lagrange interpolation polynomial of ff at the roots of the Chebyshev polynomial TnT_n.

Theorem 2 (p. 313). "If x0≠cos⁡pqπx_0\ne\cos\frac{p}{q}\pi, p≡q≡1p\equiv q\equiv1 (mod 2) then there exists for every continuous f(x)f(x) a sequence of integers n1<n2<⋯n_1<n_2<\cdots such that Lnk(f(x0))→f(x0)L_{n_k}(f(x_0))\to f(x_0)."

As printed the statement is false. The nodes are symmetric about 00. Take x0=cos⁡π3=12x_0=\cos\frac{\pi}{3}=\frac12, which is of the excluded form, and a continuous ff from Theorem 1 with Ln(f(12))→∞L_n(f(\frac12))\to\infty. Then g(x)=f(−x)g(x)=f(-x) is continuous and Ln(g(−12))=Ln(f(12))→∞L_n(g(-\frac12))=L_n(f(\frac12))\to\infty, so no subsequence converges at −12=cos⁡2π3-\frac12=\cos\frac{2\pi}{3}. That point is not of the excluded form, since cos⁡pqπ=−12\cos\frac{p}{q}\pi=-\frac12 forces p/qp/q to have even numerator in lowest terms. In the same way every cos⁡pqπ\cos\frac{p}{q}\pi with qq odd inside (−1,1)(-1,1) is a point of divergence, so the exceptional set must include these points as well. The introduction (p. 309) also attributes to Erdős and Turán the statement that divergence to infinity holds at no other point than those of the excluded form, citing Ann. of Math. 38 (1937), p. 155, where the paper says it was printed with a misprint; the same reflection applies to that statement.

Proof pointer

Pp. 313--315. The paper first seeks integers nkn_k with ∣Tnk(x0)∣<c13/nk|T_{n_k}(x_0)|<c_{13}/n_k, through Lemma 6 (p. 313): as printed, if x0≠p/qx_0\ne p/q with p≡q≡1(mod2)p\equiv q\equiv1\pmod 2, then ∣x0−2r−12nk∣<c14/nk2\bigl|x_0-\frac{2r-1}{2n_k}\bigr|<c_{14}/n_k^2 has infinitely many solutions. Lemma 6 is applied with x0x_0 in the role of the angle of the point divided by π\pi, and its proof (p. 314) asserts that a rational x0x_0 has the form 2r−12nk\frac{2r-1}{2n_k}, which fails for a fraction with odd denominator such as 23\frac23; this is where the argument misses the reflected points. Along such nkn_k the fundamental polynomials other than the one at the nearest node xrx_r have ∑k≠r∣lk(x0)∣=o(1)\sum_{k\ne r}|l_k(x_0)|=o(1), so lr(x0)=1−o(1)l_r(x_0)=1-o(1) and Lnk(f(x0))→f(x0)L_{n_k}(f(x_0))\to f(x_0) (pp. 314--315).

Read depth

Claims checked: the statement, Lemma 6 and the proof were read on the page images of the print. The counterexample above uses only Theorem 1 and the symmetry of the nodes.

Bears on

  • Problem 1151: the problem page reads its Statement at a point cos⁡(πp/q)\cos(\pi p/q) with p,qp,q odd, where Theorem 2 makes no assertion. At other points Theorem 2 as printed would make f(x0)f(x_0) a limit point for every continuous ff; it fails at the points cos⁡(πp/q)\cos(\pi p/q) inside (−1,1)(-1,1) with qq odd and pp even.