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 let be continuous with . Then for every , and every node with , uniformly for ,
with and the Chebyshev polynomials ; the theorem prints "" in this parenthesis, while the definition (52) (p. 539) sets and for . Here is the polynomial (52) with .
Remarks (pp. 544--545). Remark I says that if instead itself is continuous and at least on a subinterval , Theorems IX and X remain true for the nodes and points in , with Legendre polynomials replacing the Chebyshev polynomials in . 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 , identity (66) gives , so Theorem IX and Lemma IX give uniformly in (67). Remark I to Theorem VIII and (55) bound , the Bernstein--Fejér inequality bounds its derivative by a constant times , so near a point where reaches its maximum it stays above on an interval of length of order ; this bounds from below by a positive function of , and (67) gives .
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.