Erdős Problem #1187
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: solved (not automatically the live result).
Subject areas: number theory, primes, 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 #1187 is SOLVED — MIXED YES/NO in the maintained catalogue.
For \(k\ge3\) and every finite coloring of the integers, question (i) asks for arbitrarily long monochromatic progressions whose terms are all prime. Question (ii) asks whether there must be monochromatic integer APs with prime common difference. These differ: prime TERMS versus prime STEP. The second can be false even though the first is true.
A small example
The residue check verifies prime differences 2,3,5,7,11,13: each is nonzero modulo 4. In the two-color 0,1 / 2,3 scheme every length-3 AP with any tested prime difference changes color. The modular argument extends to all primes, but checking finitely many steps does not prove the Green–Tao positive-density theorem.
What is known
The maintained https://www.erdosproblems.com/1187 reports (i) YES from Green–Tao [GrTa08]'s theorem that positive relative density subsets of the primes contain arbitrarily long APs. One prime color class under any finite coloring has positive relative upper density. For (ii), color integers by residues modulo 4. A prime step is never 0 modulo 4, hence not even a monochromatic pair with prime difference exists in that four-coloring. Two-color residues 0,1 red versus 2,3 blue prevent 3-term prime-step APs.
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 Green–Tao 2008 to pin positive upper relative density of a prime color class, and provide an independent elementary proof of the modulo-4 prime-step obstruction. Preserve the distinction between prime-valued terms and prime-valued differences.
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/1187 ; [Er80,p.93],[GrTa08], related #219.
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: #2458 — 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.