Skip to content

Erdős Problem #109

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: 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 \(A\) of positive integers has positive upper density when its proportion inside some arbitrarily large initial intervals stays bounded away from zero:

\[ \overline d(A)=\limsup_{N\to\infty}\frac{|A\cap[1,N]|}{N}>0. \]

The Erdős sumset conjecture asks whether any such \(A\) contains all the pairwise sums

\[ B+C=\{b+c:b\in B,\ c\in C\} \]

of two infinite sets \(B,C\subseteq\mathbb N\). Both summand sets must be infinite, and their entire sumset must lie in \(A\). Merely finding infinitely many individual representations \(a=b+c\) is much weaker.

A small example

Let \(A=2\mathbb N\), the positive even integers. Taking \(B=C=2\mathbb N\) gives \(B+C\subseteq A\); both summand sets are infinite. This simple case benefits from exact periodic structure.

By contrast, positive density alone does not immediately supply one common pair of infinite sets: a greedy construction may make infinitely many acceptable individual sums while failing to control all cross-sums between selected elements. This is the obstacle the general theorem overcomes.

What is known

PROVED. Joel Moreira, Florian Richter and Donald Robertson established the conjecture in A proof of a sumset conjecture of Erdős, Annals of Mathematics 189 (2019), 605–652. The primary publisher abstract explicitly says that any positive-density subset of \(\mathbb N\) contains \(B+C\) for two infinite subsets. Their proof decomposes bounded sequences into structured and pseudorandom components in two different ways, combining tools from ergodic theory and additive combinatorics; their methods also extend to countable amenable groups.

A shorter proof by Bernard Host appeared subsequently and is noted on Erdős #109. The two proof routes should not be equated without auditing their different prerequisites. Neither proof is claimed here to be a direct consequence of elementary finite pigeonhole arguments.

The relevant limit is upper density, not a demand that the ordinary asymptotic density exist. The protected source statement must preserve this distinction.

GCL's current state

The pinned catalogue and maintained page classify #109 PROVED. The original authenticated issue is #1378. GCL verified the 2019 primary Annals theorem and publication record; its full 48-page analytic proof and the later Host proof have not been independently reproduced or formalized.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded fixture is to prove the claim for periodic sets that contain a residue class stable under addition. For a fixed modulus \(m\) and allowed residue set \(R\), acceptance requires exhibiting two explicitly infinite arithmetic progressions \(B,C\) with residues \(b,c\) such that \(b+c\bmod m\) belongs to \(R\), and proving \(B+C\subseteq A\). Reject examples where either progression is finite or only selected pairwise sums lie in \(A\). This verifies the semantics, not the universal positive-upper-density theorem.

Sources and claim boundaries

No new sumset theorem, independent ergodic proof replay or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1378 — 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.

Back to catalogue · Compendium introduction