Erdős Problem #42
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (not automatically the live result).
Subject areas: number theory, sidon sets, 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
A Sidon set is a set of integers where an unordered sum of two elements, including a repeated element, determines the summands uniquely. Erdős Problem #42 asks whether for every fixed positive integer \(M\) and all sufficiently large \(N\), every Sidon set \(A\) in \([1,N]\) has another Sidon set \(B\) of size \(M\) in the same interval with
The maintained external registry reports an affirmative solution and Lean verification. GCL has not independently replayed the reported deep proof.
A small example
In \([1,4]\), the set \(A=\{1,2,4\}\) is Sidon because its six unordered sums with repetition are \(2,3,5,4,6,8\), all different. Its positive differences are 1, 2 and 3. Every two-element set \(B\) inside this short interval has a difference from this list, so none is compatible.
This does not refute the theorem, since \(N\) must be sufficiently large depending on \(M\). Finite small cases cannot reverse the quantifiers.
What is known
The current contributor discussion attributes initial cases \(M=1,2,3\) to Daniil Sedov and a later general construction to GPT 5.5 Pro prompted by Harjas Sandhu. The public page labels the result SOLVED (LEAN). Attribution to that contemporary work is important; it is not a classical published proof.
There is a source-definition difference: the frozen Formal Conjectures theorem quantifies over inclusion-maximal Sidon sets \(A\), whereas the public problem quantifies over every Sidon set. There is a simple logical bridge. Every Sidon set in a finite interval extends to an inclusion-maximal Sidon superset \(A'\), and \(A-A\subseteq A'-A'\). A \(B\) whose nonzero differences avoid those of \(A'\) also works for \(A\). That elementary bridge does not reproduce the difficult construction of \(B\).
GCL's current state
GCL source audit #1311 checked the frozen provider statement, index and difference-set conventions and status provenance. The pinned main research theorem has an unfilled proof but cites an external Lean proof. The external proof and axioms have not been replayed under GCL controls.
What remains
The existence problem is reported solved externally. GCL's independent obligations are to check the external source proof and Lean axioms and to formalize the unrestricted-versus-maximal source bridge. None of that constitutes an unresolved original question or a new GCL theorem.
Sources and claim boundaries
- Erdős Problems #42: current attributed status and original problem.
- Contributor discussion: provenance of reported general proof and formal work.
- Frozen Formal Conjectures #42: maximal-set predicate, not an independently compiled GCL proof.
- GCL source return #1311: bounded mathematical analysis and unverified deep-proof boundary.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1311 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.