Skip to content

Erdős Problem #157

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: 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.

The question in plain language

Is it possible to choose an infinite set \(S\) of positive integers with two seemingly conflicting properties? It must be Sidon, meaning every unordered sum \(s_1+s_2\) (including repeated elements) determines its pair uniquely. It must also be an asymptotic basis of order three, meaning every sufficiently large positive integer can be written as

\[ n=s_1+s_2+s_3,\qquad s_1,s_2,s_3\in S. \]

The three summands in the basis condition may repeat, unlike the uniqueness requirement for unordered two-term sums. Requiring representation of every positive integer rather than every sufficiently large one would be a different claim.

A small example

A small finite Sidon set such as \(\{1,2,4\}\) has six distinct unordered pair sums and three-fold sumset contained in \([3,12]\). It is not an asymptotic basis, because a finite set has bounded sums. A naive greedy infinite Sidon sequence, by contrast, may be too sparse to represent all sufficiently large integers by three terms. The challenge is to preserve uniqueness while retaining additive coverage.

What is known

PROVED. Cédric Pilatte's A solution to the Erdős–Sárközy–Sós problem on asymptotic Sidon bases of order 3, Compositio Mathematica 160 (2024), 1418–1432, constructs precisely such a set. The published primary abstract explicitly states both properties and that every sufficiently large \(n\) is a sum of three elements of the Sidon set.

Pilatte's construction uses ideas from Ruzsa's infinite Sidon sequence and a deep result of Sawin on the \(\mathbb F_q[t]\) analogue of Montgomery's conjecture for convolutions of the von Mangoldt function. The argument is not a simple consequence of a finite cyclic-group construction: a finite Sidon basis does not automatically concatenate into an infinite Sidon sequence without cross-block sum collisions.

Javier Cilleruelo's earlier Sidon basis obtained a \(B_2[2]\) asymptotic basis of order three and separate near-basis results for genuine Sidon sets. A \(B_2[2]\) set permits two representations of some sums, so that earlier result did not resolve the exact Sidon problem.

GCL's current state

The pinned and maintained Erdős #157 classify the problem PROVED. Original authenticated task: #1426. The Cambridge primary publication and theorem statement were inspected; full reconstruction of its function-field and probabilistic ingredients, and any formal proof, remain unverified.

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 semantic task checks two-term Sidon uniqueness and three-term coverage separately on finite truncations of proposed infinite sets. Acceptance: unordered sums including \(s+s\) are unique, and an indicated finite interval is covered by \(S+S+S\) with repeated summands allowed. This validates statement conventions, not the existence of one infinite set meeting both properties. A substantive proof audit would verify Pilatte's Section 4 Sidon property and Section 5 basis argument under their exact hypotheses.

Sources and claim boundaries

No new infinite construction, GCL kernel certification or editorial admission is claimed.

Catalogue and evidence provenance

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

Back to catalogue · Compendium introduction