Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Théorème (printed p. 1041). Let and let distinct points be given in . Consider the trigonometric sums of order , with real or complex coefficients,
whose modulus is at most at each of the given points. Whatever the points, such a sum "pourra atteindre asymptotiquement" the value : the largest modulus attainable by these sums is at least as . Since the points are arbitrary for each , the does not depend on them.
The quantity bounded is, at each , the trigonometric Lebesgue function of the points, equation (37) on printed p. 1042: with (the paper normalizes in (36)),
the largest modulus at of an order- sum bounded by at the points; the extremal sums have real coefficients, or coefficients of one common argument (p. 1043). The proof ends with (58) on printed p. 1049, , at a point where attains its maximum.
Algebraic consequence (printed p. 1042). The paper then states that for any choice of points () of the segment , the polynomial of degree bounded by in absolute value at these points can reach the value asymptotically. In the notation of the source card, the maximum over the segment of the Lebesgue function of equation (1) is at least ; with the equal-maxima class of section 3 this is the asymptotic announced as equation (2) on printed p. 1026. The step on p. 1042 takes sums with for and for , argues that such a sum contains no sines, and substitutes .
Source. Serge Bernstein, Sur la limitation des valeurs d'un polynôme de degré sur tout un segment par ses valeurs en points du segment, Bull. Acad. Sci. URSS, Classe des sciences mathématiques et naturelles, VII série (1931), no. 8, 1025--1050; the Théorème on printed p. 1041, the algebraic consequence on p. 1042, the proof on pp. 1042--1049 (PDF pp. 17--25 of the 26-page scan). The copy read is identified on the source card.
Read depth. Claims checked: the Théorème, the algebraic consequence and the final display (58) were read clause by clause on the page images. The proof was read for its structure and not checked; this page reconstructs neither the trigonometric proof nor the algebraic transfer.
Proof pointer
Pages 1042--1049. The trigonometric interpolation formula (35)--(37) gives . For consecutive points the paper compares the midpoint quantity of (38)--(39), the analogue of the algebraic inequality (27), with a simpler product through (40)--(42), and shows on pp. 1044--1045, (43)--(45), that increases in its own gap, decreases in the others and is convex in each gap, so that a symmetric function of the with nonnegative successive derivatives is smallest for equal gaps . Over arcs of length it truncates the products, (47)--(52), bounds the error using the gap bound (28) and a lower bound (53) on the gaps obtained from a derivative estimate on p. 1048, and reaches the essential inequality (55), . Summing these arc estimates outward from a maximum point of , (56)--(57), gives , and letting gives (58).
Dependencies
Equation (28) of section 4 (printed p. 1038), used on p. 1047. The step on p. 1048 passes from to for some , which is Bernstein's inequality for trigonometric sums; the paper does not name it. The matching upper bound for equally spaced points is attributed on p. 1041 to Grandjot (Jahresber. Deutsch. Math.-Verein. 34 (1925)), cited on p. 1026. The proof-scope page lists these interfaces.
Bears on
- Problem 1129: the algebraic consequence, as the paper states it, is the lower half of the asymptotic value of the minimal Lebesgue constant that the problem's nodes minimize; an asymptotic value does not describe the minimizing nodes, which is what the problem asks.
- Problem 1153: the algebraic consequence concerns the whole segment, the problem's case , , with nodes where the problem has . That page records the remarks of Erdős (1961) and Tao (2026) on whether Bernstein gave the algebraic case in full, and credits the instance to Erdős 1961.
- Problem 1132: the site's commentary there attributes a density statement to Bernstein. The Théorème bounds a maximum over a period at a point that may change with ; this page does not derive the site's statement from it.