Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Conventions (pp. 205, 207). carries the normalized measure , is taken with respect to it, and . The frequencies are distinct integers, is the set of nonnegative integers and the set of positive integers, is the set of with , and is a positive constant, not necessarily the same at each occurrence. For and , is the subspace of spanned by the functions with and , and (5)
Since , the quantities are nondecreasing in (p. 207).
Theorem (p. 207). Let with and for (6), and let be a positive integer such that for (7). Then (8)
where is an absolute constant.
Since , the paper records (p. 207) that the theorem contains the inequality . For distinct frequencies some satisfying (7) always exists, so this lower bound holds for every such ; with all it is Littlewood's conjecture, stated in the paper as Corollary 2.
Proof pointer
Pp. 207--223. The proof works with the dyadic averages of , whose Fourier series keep the frequencies divisible by , and their differences , which keep those divisible by but not by ((10), (11), p. 207); both have norm at most ((9), p. 207). The printed definition of omits the factor that the formula for and (9)--(11) require. Lemma 1 (p. 208) is a duality lower bound for in terms of and a bounded test function supported on frequencies divisible by ; with it Lemma 3 (p. 211) gives , where is the set of such that some is divisible by but not by (p. 208), and Lemma 4 (p. 212) gives for . Lemma 5 (pp. 213--214), which the paper calls a generalization and refinement of Lemma 5 of Pichorides (its reference [15], p. 208), is the second recursion inequality. Section 5 (pp. 218--223) proves by induction on the stronger bound (62): Lemma 8 (p. 218) splits into the case that many dyadic levels are occupied, handled by Lemma 3, and the case of a chain of levels each carrying many frequencies, handled by the induction hypothesis and the recursion inequalities.
Read depth
Claims checked: the conventions, the definition (5) and the theorem were read clause by clause on the page images of the English translation; the structure of the proof was followed but its estimates were not checked. Nothing here is independently reviewed.
Dependencies
None in the corpus. The paper cites a duality theorem (its reference [16], p. 142), facts on Hardy spaces from Zygmund's Trigonometric series and a lemma of Pichorides (its reference [15]).
Source. S. V. Konyagin, On the Littlewood problem, Izv. Akad. Nauk SSSR Ser. Mat. 45 (1981), no. 2, 243--265, 463; English translation, On a problem of Littlewood, Math. USSR Izvestija 18 (1982), no. 2, 205--225, whose pages are cited here; the edition read is named on the source card.
Bears on
- Problem 512: the inequality that the theorem contains, taken with all , is the problem's inequality for a set of integers: with the normalized measure, equals the problem's integral after the change of variable .