Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
For positive integers let (display (1.1), p. 1).
Definition (p. 3, display (1.14); restated on p. 13). A set is dissociated when it admits no nontrivial relation with coefficients : if with every , then . (The print of (1.14) reads "" [sic] for the range of each coefficient; the restatement on p. 13 has .) The paper notes on p. 14 that Hadamard lacunary sets are dissociated.
Proposition 1.3 (p. 3). If contains a dissociated set of size , then
The print leaves unquantified; the restatement in section 4 replaces by . The paper notes that (1.15) improves the Erdős--Szekeres bound (1.3) as soon as (1.16).
Section 4 states and proves the result as Proposition 4.1 (p. 14): if (printed "" [sic]) contains a dissociated set of size , then (4.1), which improves the general lower bound of Erdős and Szekeres provided . The remark after it (p. 14) recalls that, by a result of Pisier, containing a dissociated set of size is equivalent to containing a Sidon set in the harmonic-analysis sense of size about , its Sidon constant treated as a constant.
Source. J. Bourgain and M.-C. Chang, On a paper of Erdős and Szekeres, J. Anal. Math. 136 (2018), 253--271; Proposition 1.3 and display (1.14) on p. 3, the definition and Proposition 4.1 on pp. 13--14 of the arXiv version arXiv:1509.08411v2, whose labels and pages are used here; the [[analysis/bourgain_2018_paper_erdos_szekeres/_index|source card]] records the edition. The introduction refers to a §5 for the discussion of dissociated sets; this version has four sections, and that discussion is at the start of section 4.
Read depth. Claims checked: the definition and the statements of Propositions 1.3 and 4.1 were read clause by clause on the page images. The proof (pp. 14--19) was not read beyond its opening reduction (below); nothing here is independently reviewed.
Proof pointer
Since for every nonzero integer , the maximum over of is at least half its norm, so (4.1) follows from the lower bound (4.3), which the proof establishes from the expansion with (4.4). The rest of the proof, pp. 14--19, ends "This proves (4.3) and hence Proposition 4.1".
Dependencies
Pisier's characterization of Sidon sets (Bull. Amer. Math. Soc. 8 (1983), 87--89) is cited in the remark after the proposition; whether the proof uses it was not checked here.
Bears on
- Problem 256: the proposition bounds the product's maximum below for exponent sets that contain a large dissociated subset, and so improves on the Erdős--Szekeres lower bound for those sets. It gives no lower bound for or , which minimize over all exponent sets, and the paper says the general lower bound "remains unimproved" (p. 13).