Erdős Problem #1191
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1191 is OPEN in the maintained catalogue.
An infinite Sidon set \(A\subset\mathbb N\) has unique sums of two elements up to order, including repeated summands. Erdős asks whether every such set satisfies
and separately whether some infinite Sidon set has \(\liminf_{x\to\infty}|A\cap[1,x]|(\log x)^c/\sqrt x>0\) for any fixed \(c>0\). These are not logical negations for arbitrary \(c\): for \(0<c<1/2\), both can hold. The \(\liminf\) differs materially from \(\limsup\) (see #729).
A small example
The ten powers of two \(1,2,4,\ldots,512\) form a finite Sidon set: exhaustive enumeration of all 55 unordered sums with repetition finds no collisions. The infinite powers-of-two set has counting function \(\lfloor\log_2x\rfloor+1\), far below \(\sqrt{x/\log x}\), and therefore is not an example of the potentially dense Sidon set sought in the second question. Its sparse growth is an elementary example, not a universal upper bound for all Sidon sets.
What is known
The maintained https://www.erdosproblems.com/1191 labels both questions OPEN, original [Er80,p.98]. Erdős proved a bounded \(\liminf\) at exponent \(1/2\) up to some constant [HaRo66], which does not yield zero. The second problem strengthens #39; the limsup belongs to #729. The page notes a historical $1000 prize for clarifying these problems, which should not be treated as evidence of an unclaimed active award or a proof.
GCL's current state
Authenticated original issue research return records an exact statement audit, primary-source references and the bounded mathematical evidence. GCL independently replayed only ci/erdos_compendium_007_phase22_checks.py; it did not certify all original external proofs or resolve open problems. The current manuscript is UNACCEPTED.
What remains
Read Erdős 1980 and Halberstam–Roth [HaRo66] for the exact liminf constant and proof hypotheses, compare dense infinite Sidon constructions associated with #39, and source-lock the requested logarithmic exponent. Avoid replacing the lower limit by an easier upper limit.
Protected admission separately requires source fidelity and the predetermined independent critical-review gate. Finite verification does not satisfy that gate.
Sources and claim boundaries
https://www.erdosproblems.com/1191 ; [Er80,p.98],[HaRo66], related #39 and #729.
Persisted deterministic finite-check evidence is in governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE22.json. Original source issue body SHA unchanged; no public deployment, V2 approval or kernel certificate claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2462 — 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.