Erdős Problem #199
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: 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
Let \(A\) be a subset of all real numbers containing no three distinct points in arithmetic progression: whenever \(a,c\in A\) are distinct, their midpoint \((a+c)/2\) is not in \(A\).
Erdős asked whether the complement \(\mathbb R\setminus A\) must contain some one-sided infinite arithmetic progression, meaning all real numbers \(x,x+d,x+2d,\ldots\) for one fixed \(x\in\mathbb R\) and nonzero real \(d\). The progression is allowed to have negative step. To disprove this, construct a midpoint-free set meeting every such infinite progression.
A small example
The finite set \(\{0,1,3\}\) has no three-term arithmetic progression, but its complement contains many infinite progressions, such as \(10,11,12,\ldots\). A finite witness can never refute the conjecture, because every finite set misses a distant infinite progression entirely.
A set meeting all progressions must work across uncountably many starting points and real steps; listing only rational progressions is insufficient. This distinguishes the real-vector-space question from Erdős #198, in which the relevant positive-integer progressions form a countable family.
What is known
DISPROVED. James E. Baumgartner, Partitioning vector spaces, Journal of Combinatorial Theory, Series A 18 (1975), 231–233, proves a theorem for every vector space over \(\mathbb Q\): it contains a subset with no three-term arithmetic progression yet meeting every infinite arithmetic progression. Taking the rational vector space \(V=\mathbb R\) proves the assertion false.
The theorem uses the axiom of choice, including selection of a Hamel basis of \(\mathbb R\) over \(\mathbb Q\). The source does not provide a simple explicitly computable subset of all reals analogous to the factorial sequence for positive integers. This matters: a proof for a countable dense subgroup of \(\mathbb R\) does not automatically handle arbitrary real steps.
The maintained Erdős #199 labels the conjecture DISPROVED. Its statement is genuinely different from #198: the ambient set is \(\mathbb R\), and avoiding only three-term arithmetic progressions is the assumed property.
GCL's current state
Pinned and maintained status: DISPROVED. Original issue: #1468. Baumgartner's original theorem and the vector-space quantifiers were located, but the complete proof has not been independently reconstructed in a named GCL formal environment.
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 formalizes the elementary reduction from Baumgartner's rational-vector-space theorem to the real-line counterexample. Acceptance: show that \(\mathbb R\) is a \(\mathbb Q\) vector space, that rational affine progressions with an arbitrary real step are covered, and that the theorem's no-three-term property is the exact midpoint prohibition. Explicitly list the choice assumptions; stop before claiming an effective or Borel construction.
Sources and claim boundaries
- Baumgartner, JCT A 18 (1975), 231–233, primary theorem.
- Erdős #199, original [Er75b], [ErGr79], [ErGr80].
- GCL source issue #1468.
No effective choice-free counterexample, independent formal proof or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1468 — 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.