Erdős Problem #840
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics, sidon sets.
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
A quasi-Sidon family has asymptotically almost no repeated unordered pair sums. Its asymptotic size may exceed that of a Sidon set. The precise leading square-root extremal constant remains unknown.
How large can quasi-Sidon \(A\subset[1,N]\) be as \(N\to\infty\), where \(|A+A|=(1+o(1))\binom{|A|}{2}\)? This is an ASYMPTOTIC condition on a family A_N, not a decidable Boolean property of one finite set A at one N without specifying an allowed error function. A+A includes equal summands; both O(|A|) diagonal sums and o(|A|²) collisions are tolerated.
A small example
For finite genuine Sidon \(A=\{1,2,4,8\}\), the unordered pair sums WITH repetitions are all ten distinct, so \(|A+A|=10\); \(\binom{4}{2}\)=6. The ratio 10/6 illustrates why o(1) allows diagonal O(|A|) overhead only as |A| grows and cannot be used as exact finite equality.
This finite calculation is not an asymptotic or all-parameter proof.
What is known
Maintained /latex/840 read 2026-10-14. Erdős–Freud [ErFr91] and Erdős [Er81h] establish lower \((2/\sqrt{3}+o(1))\sqrt{N}\) and upper \((2+o(1))\sqrt{N}\). Pikhurko [Pi06], Dense edge-magic graphs and thin additive bases (2006), improves upper to \(((1/4+1/(\pi+2)^2)^{-1/2}+o(1))\sqrt{N}\), roughly 1.863sqrt N. Exact leading constant still OPEN. Related #819. The finite f(N) definition needs quantified asymptotic family semantics and source validation.
For a family \(A_N\subseteq[1,N]\) with \(m_N=|A_N|\to\infty\), the quasi-Sidon condition means
A genuine Sidon set has \(\binom{m_N+1}{2}\) unordered pair sums with repetition, and the extra diagonal \(m_N\) is asymptotically negligible. The quasi-Sidon condition does not provide a Boolean test for a single isolated finite set without specifying a tolerance. The remaining square-root leading constant is open.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: open quasi sidon asymptotic family leading constant. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Build pair-sum multiplicities for genuine Sidon examples, verify unordered-with-repetition count m(m+1)/2, contrast asymptotic family o(1) with finite N. Check Pikhurko constant algebra and lower reflected construction; no exact constant certified.
The original primary mathematical proofs, quantified status, finite definitions and deployed rendering must be independently checked before protected admission. No such admission is claimed here.
Sources and claim boundaries
- Maintained Erdős problem #840, LaTeX/bibliography and authenticated issue source return, checked 14 October 2026.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. Original papers and unresolved proof obligations are identified in the source comment.
- Critical review: PENDING. Protected publication: NONE. Deployed MathJax: NOT VERIFIED. GCL theorem certification: NONE.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2111 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- 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.