Skip to content

Erdős Problem #1185

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: solved (not automatically the live result).
Subject areas: additive combinatorics, 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.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Erdős Problem #1185 is DISPROVED in the maintained catalogue.

Fix \(\delta>0\) and \(k\ge3\). Erdős–Mauldin asked whether some \(m=m(\delta,k)\) guarantees for every sufficiently large \(N\), whenever \(A,B\subseteq[1,N]\) have \(|A|\ge\delta N\) and \(|B|\ge m\), there is a nontrivial \(k\)‑term AP in \(A\) whose positive common difference belongs to \(B-B\). The phrase \(|B|\ge m\) is essential; a failure for one \(B\) of size two cannot refute the theorem for arbitrary large \(m\).

A small example

For \(N=20\), let \(A\) contain all ten odd integers and \(B=\{1,4\}\). Then the only positive difference in \(B-B\) is 3, but all three-term APs lying among odd numbers have even step. The finite obstruction is exact, but \(|B|=2\) fails to address arbitrarily large \(m\) and is not a standalone proof of the published counterexample.

What is known

The catalogue https://www.erdosproblems.com/1185 reports DISPROVED already for \(k=3\), via Furstenberg [Fu81]'s construction of an infinite \(B\) whose difference set is not \(2\)‑intersective. A \(2\)‑intersective set forces a 3-AP difference in any positive-density set. The full passage from an infinite nonintersectivity example to the exact uniform finite‑\(N\) quantifiers requires primary-source review; the site attributes the original motivation to Erdős–Mauldin [Er80,p.92].

GCL's current state

Authenticated original issue research return records an exact statement audit, primary-source references and the bounded mathematical evidence. GCL independently replayed only ci/erdos_compendium_007_phase22_checks.py; it did not certify all original external proofs or resolve open problems. The current manuscript is UNACCEPTED.

What remains

Read Furstenberg 1981 and Er80, extract the true infinite difference-set counterexample and its positive-density witness, and prove the quantifier transfer to finite \(N\) and \(|B|\ge m\) before calling it independent certification.

Protected admission separately requires source fidelity and the predetermined independent critical-review gate. Finite verification does not satisfy that gate.

Sources and claim boundaries

https://www.erdosproblems.com/1185 ; [Er80,p.92],[Fu81].

Persisted deterministic finite-check evidence is in governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE22.json. Original source issue body SHA unchanged; no public deployment, V2 approval or kernel certificate claimed.

Catalogue and evidence provenance

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