Erdős Problem #818
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: additive combinatorics.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
For a finite set of integers A whose doubling |A+A|<=K|A| for some fixed K, show the product set AA={ab:a,b in A} has size at least c_K |A|²/log|A| (for |A|>=2). K-dependence matters: the implied constant may depend on the doubling constant, not on |A|.
A small example
A={1,2,3,4} has A+A={2,...,8} of size 7, <=2|A|. Its product set is {1,2,3,4,6,8,9,12,16} of size 9. This small calculation demonstrates distinct-products counting but does not establish the asymptotic inequality.
What is known
Maintained https://www.erdosproblems.com/latex/818, read 2026-10-14, credits József Solymosi [So09d], Bounding multiplicative energy by the sumset, Advances in Mathematics (2009), 402–408. The stronger energy inequality |AA| >= const |A|^4/(|A+A|² log |A|) (with positivity and sufficiently large sets) implies the asserted K-dependent product bound. Full original 2009 proof not independently reconstructed; do not assert constant independent of K.
One formulation of the established energy result is
for finite positive sets with \(|A|>1\). If \(|A+A|\leq K|A|\), substitution gives \(|AA|\gg_K |A|^2/\log |A|\). The dependence on fixed additive-doubling constant \(K\) is important; neither a uniform constant over all \(K\) nor a theorem for arbitrary signed sets follows from this citation.
Extension to signed integer sets. The original Solymosi energy inequality is applied here to positive integers, but the catalogue asks about arbitrary integers. For an arbitrary finite integer set \(A\) of size at least four, one of its positive and negative subfamilies has at least \((|A|-1)/2\) elements. Call it \(P\). If it is negative, replace its elements by their absolute values. Then the numbers of pair sums and pair products do not change under the sign flip, and
Apply the positive-set inequality to \(P\) with doubling constant \(3K\). This yields \(|AA|\gg_K |A|^2/\log|A|\). Finitely many smaller cases can be absorbed by adjusting the constant depending on \(K\). Thus the signed-integer formulation follows by a direct elementary reduction; it is not an extra claim of Solymosi's positive-set theorem.
GCL's current state
The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.
Unclosed mathematical proof/source qualifications: ORIGINAL_SOLOMYOSI_FULL_PROOF_PENDING; SIGNED_EXTENSION_DRAFT_EXPLICIT_REDUCTION.
What remains
Verify exact sum/product enumerator on arithmetic progressions including {1,2,3,4}; identify Solymosi's precise published energy inequality, sign hypotheses (positive A) and logarithm argument, and clarify fixed K dependence.
For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.
Sources and claim boundaries
- Erdős problem #818, maintained LaTeX and original authenticated source return, checked 14 October 2026.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, Git blob 4e60263a80af6207aca494d2e1388e44fa372889. The source comment contains original bibliography and limits of direct proof inspection.
- Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2089 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.