Erdős Problem #41
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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
An infinite set of positive integers may be required to have distinct sums of three of its elements, ignoring permutations. Erdős Problem #41 asks whether such an infinite set must have arbitrarily large cutoffs where its counting function is small relative to \(N^{1/3}\), specifically a zero lower limit after that normalization.
A crucial ambiguity is whether summands may repeat. The pinned Formal Conjectures definition compares sums of three-element subsets (three distinct entries); the classical strong triple-Sidon convention compares three-element multisets (repetitions allowed). The source audit has not yet established which convention the original historical text intended.
A small example
For the set \(B=\{1,2,3\}\), there is only one three-element subset, so uniqueness among such subsets holds vacuously. But two different triple multisets give equal sums:
Therefore the frozen subset-based condition is genuinely weaker than the strong multiset condition, already in this tiny finite example. The example does not disprove any conjecture about infinite sets.
What is known
The maintained problem registry records the global question as OPEN. The source audit confirms the exact frozen definition and the elementary implication from strong multiset uniqueness to the weaker subset uniqueness, while warning that its converse fails. It does not establish that the original Erdős wording permits repeated summands; primary-source semantic checking remains necessary.
GCL's current state
Audit #1310 records the unfilled Lean research statements, the finite collision above, and an explicit source-fidelity follow-up. It is an evidence-only source return; it does not authorize mathematical certification or a novel result claim.
What remains
Determine and document the historical three-sum convention, then address the actual infinite-set density statement under that precise definition. A finite mismatch between subsets and multisets is a real formalization hazard, but not a global proof or counterexample.
Sources and claim boundaries
- Erdős Problems #41: original question, maintained literature and status.
- GCL source audit #1310: exact finite counterexample to predicate equivalence, not a result on the infinite problem.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1310 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- 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.