Erdős Problem #35
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, additive basis.
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
The Schnirelmann density of a set \(A\) is the smallest density seen in any finite initial interval:
Suppose \(B\) is an additive basis of fixed order \(k\) containing zero and \(A\) has Schnirelmann density \(\alpha\). Erdős Problem #35 asks whether
The problem is proved. It concerns Schnirelmann density, not ordinary asymptotic density.
A small example
Take \(A=\mathbb N\), interpreted with nonnegative integers, so \(\alpha=1\). Because \(0\in B\), the sumset \(A+B\) contains all of \(A\) and has Schnirelmann density one. Both sides of the proposed inequality equal one.
There is a more instructive elementary numerical inequality. For every \(0<\alpha\le1\) and \(k\ge1\), convexity of \(x^{-1/k}\) gives
Multiplying by \(\alpha\) yields
The case \(\alpha=0\) follows separately by equality of zeros.
What is known
Plünnecke (1970) established a stronger bound,
Ruzsa observed that the elementary inequality above transfers Plünnecke's theorem to the original Erdős estimate. Proving the real-number inequality is not a re-proof of the nontrivial additive-density theorem; the latter is the essential published input.
GCL's current state
Source audit #1304 records the theorem's hypotheses, the subtle difference between Schnirelmann and natural density, and a bounded convexity-based transfer. The complete primary Plünnecke argument has not been independently replayed and there is no GCL mathematical certification of it in this article.
What remains
The historical inequality is resolved. Further useful work would supply a fully pinned Plünnecke theorem with precise additive-basis assumptions and formalize its elementary consequence. Separate strengthened questions remain outside this article.
Sources and claim boundaries
- Erdős Problems #35: PROVED status and explicit Plünnecke reference.
- Plünnecke (1970), stronger Schnirelmann-density theorem, as cited by the maintained registry; detailed original proof not inspected.
- GCL source return #1304: algebraic consequence with proof boundaries.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1304 — 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.