Answers are grounded in this paper and cite their sources.
Theoretical analysis establishes lower bounds and structural proofs for sumsets and product sets, highlighting machine-checked additive combinatorics in Lean 4.
This preprint provides an exhaustive mathematical treatise on the Erdős-Szemerédi sum-product conjecture (Problem #35 in Paul Erdős' collection), a cornerstone of modern additive combinatorics. The conjecture formalizes the fundamental dichotomy that a finite set cannot simultaneously behave like an arithmetic progression (small sumset) and a geometric progression (small product set). It asserts that for every finite subset A ⊂ R and every ε > 0: max(|A + A|, |A · A|) ≥ c_ε |A|2 - ε where A + A = + b : a, b ∈ A\ is the sumset and A · A = · b : a, b ∈ A\ is the product set. Key Mathematical Results & Contributions Fundamental Arithmetic-Geometric Dichotomy: Quantitative analysis comparing arithmetic progressions ($|A+A| = 2n-1$ vs. |A · A| n1.91 via the Erdős Multiplication Table Theorem) with geometric progressions (|A · A| = 2n-1 vs. |A+A| = Θ(n²)). Exact Discrete Sumset Lower Bound: Complete, non-elliptical proof that for every finite set A ⊂ N of size |A| = n ≥ 1: |A + A| ≥ 2n - 1 established via strictly ordered transversal chains a₁ + a₁ < < a₁ + aₙ < a₂ + aₙ < < aₙ + aₙ. Characterization of the Equality Case: Rigorous proof that equality $|A + A| = 2n - 1$ holds if and only if A is an exact arithmetic progression (via Freiman-type difference sets). Additive Energy & Cauchy-Schwarz Bounds: Derivation of the reciprocal energy bound |A + A| ≥ |A|⁴/E₊(A) connecting sumset expansion with the fourth-order representation function. Detailed Derivation of Elekes' Geometric Theorem (1997): Full pedagogical proof of György Elekes' bound max(|A+A|, |A · A|) ≥ c |A|5/4 by mapping the sum-product problem to a point-line incidence configuration in R² with points P = (A+A) × (A · A) and lines L = = a(x - b) a, b ∈ A\ bounded via the Szemerédi-Trotter theorem. 100% Machine-Checked Verification in Lean 4 Repository and Verification Artifacts The companion machine-checked code and formal verification artifacts are publicly hosted on GitHub: https://github. com/flouzzy/erdos-problems Primary MSC (2020): 11B13, 05B10, 68V20, 11B75, 52C10.
No takes yet. Share an insight, caveat, or question.
Charles EDOU NZE (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: