Skip to content

Erdős Problem #198

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: additive combinatorics, sidon sets, arithmetic progressions.

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 \(A\subseteq\mathbb N\) has the property that each integer has at most one representation as \(a+b\) with \(a,b\in A\) and \(a\le b\). Erdős and Graham asked whether the complement of every Sidon set must contain some infinite arithmetic progression

\[ \{a,a+d,a+2d,\ldots\},\qquad d\ge1. \]

This would require one entire arithmetic progression to avoid \(A\). An infinite Sidon set meeting every infinite progression is enough to disprove the assertion.

A small example

The increasing sequence

\[ A=\{(n+1)!+n:n\ge0\}=\{1,3,8,27,124,\ldots\} \]

is a concrete counterexample, attributed on the maintained site to AlphaProof. Its terms grow so rapidly that all unordered sums are distinct. For every residue class \(a\bmod d\), take \(n=a+d\); the term \((n+1)!+n\) is congruent to \(a\bmod d\) and is at least \(a\). Thus every infinite positive arithmetic progression intersects \(A\), and none lies wholly in its complement.

A Sidon set must count the diagonal sums \(2a\) as well. Merely checking that distinct-element sums are unique would establish a weaker property.

What is known

DISPROVED. Erdős and Graham attributed the negative result to James E. Baumgartner, Partitioning vector spaces, Journal of Combinatorial Theory A 18 (1975), 231–233. Its vector-space theorem meets every infinite progression while avoiding three-term arithmetic progressions. For subsets of \(\mathbb N\), a simpler direct argument enumerates all countably many infinite progressions \(P_1,P_2,\ldots\) and chooses a point \(a_n\in P_n\) with \(a_n>2a_{n-1}\). This produces a Sidon set meeting every progression.

The factorial formula supplies an explicit witness without an enumeration of all infinite progressions. The maintained Erdős #198, updated April 2026, reports an external Lean formalization. That formalization was not independently kernel-replayed under the GCL provider lock.

GCL's current state

Pinned and maintained status: DISPROVED. Original issue: #1467. The direct factorial proof is elementary and checked below as a finite fixture; the relation between the historical vector-space argument and the exact Sidon construction is explicitly identified, without claiming that Baumgartner printed the factorial sequence.

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 task computes the first 12 factorial terms, enumerates all unordered pair sums, and verifies unique representations. For moduli \(d\le12\) and residue classes \(r\), produce the explicit term \((r+d+1)!+(r+d)\) and check its residue and lower bound. Acceptance: all checks pass and the argument for arbitrary \(d\) follows from factorial divisibility, separately from finite tests.

Sources and claim boundaries

No new counterexample, independent external Lean certification or editorial admission is claimed.

Catalogue and evidence provenance

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