Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Inequality (3) (p. 185). Let be complex numbers with
and put and , the paper's (2). Then
The bound holds for every and every choice of subject to (1). The paper presents it, in its words (p. 185), "Without any suggestion that this is a precise value"; it makes no claim that is best possible.
Context (p. 185). Turán posed the problem of a positive lower bound for valid for all choices subject to (1). The paper records Turán's bound , de Bruijn's improvement to for some and sufficiently large , and Uchiyama's proof that could be taken arbitrarily close to ; (3) verifies the conjecture that has a positive lower bound independent of .
Source. F. V. Atkinson, On sums of powers of complex numbers, Acta Math. Acad. Sci. Hungar. 12 (1961), no. 1--2, 185--188, DOI 10.1007/BF02066680: (1), (2) and (3) on p. 185, the proof on pp. 185--188, (13) on p. 187 and the concluding deduction on p. 188. The edition read is identified on the source card.
Read depth. Claims checked: (1), (2), (3) and the inequality (13) with its hypothesis were read clause by clause on the page images. The proof was read for its structure, not checked line by line. Nothing here is independently reviewed.
Proof pointer
Sections 2 and 3, pp. 185--188. With $g(\theta)=-\sum_{m=1}^n m^{-1}s_m e^{mi\theta}$, the exponential equals plus a power series in starting at the exponent (equations (4), (5)); since , the product vanishes at . Reading the tail coefficients as Fourier coefficients and integrating by parts gives the identity (8),
Schwarz's inequality, Parseval's equality for (giving at most ), and separate bounds for the second factor on and , the latter assuming , give (13) (p. 187):
The right side is independent of and increasing on , and (13) fails at (p. 188), so . Not reconstructed further here.
Dependencies
None beyond classical analysis: the expansion (4), which the paper takes from Uchiyama (Acta Math. Acad. Sci. Hungar. 9 (1958), 275--278), Schwarz's inequality and Parseval's equality.
Bears on
- Problem 519: the problem asks whether exceeds an absolute constant for all complex with . Inequality (3) gives under the paper's condition (1), which adds that every is at most . The problem's hypothesis reduces to (1) (an observation of this page, not of the paper): dividing every by one of largest modulus divides by , and after relabeling the quotients satisfy (1), so the bound holds under the problem's hypothesis too. The problem's claim page for this paper records the result.