Erdős Problem #1212
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes.
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 #1212 currently has source status OPEN — EXTRA COMPOSITE CONDITION.
On the graph of visible lattice points \((x,y)\in\mathbb N^2\) with \(\gcd(x,y)=1\), connect pairs differing by exactly \(\pm1\) in one coordinate. Does there exist an unbounded path all of whose vertices satisfy \(\min(x,y)>1\) and at least one coordinate composite? A known path with both coordinates prime at many vertices does not meet the extra composite requirement. Likewise, finding a connected finite cluster or a path in the full graph does not establish an infinite path inside the induced restricted subgraph.
A small example
Restrict to integer points \(2\le x,y\le17\) satisfying gcd one and at least one composite coordinate. The phase25 finite graph contains 116 vertices. Breadth-first search from \((4,3)\) finds only that vertex within the restricted graph because all its nearest visible neighbors violate one of the additional conditions. An isolated seed does not establish that every component is finite, and therefore is not a counterexample to an unbounded path elsewhere.
What is known
Erdős [Er80,p.114] and the maintained https://www.erdosproblems.com/1212 say Stewart proved an infinite path with \(\min(x,y)>1\) through pairs of consecutive primes, using a walk \((p_k,p_{k+1})\to(p_k,p_{k+2})\to(p_{k+1},p_{k+2})\) for sufficiently large \(k\). But this path includes points with both coordinates prime, hence does NOT solve the current strengthened question. The page notes the claimed Herzog–Stewart infinite-component theorem cannot be located in their [HeSt71] paper, and records further monotone/bounded-turn questions. Thus the strengthened composite-coordinate variant remains OPEN.
GCL's current state
Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.
What remains
Read Er80 and HeSt71 original graph definitions, independently verify prime-pair path and identify precisely why it fails composite-coordinate restriction. Use graph search to locate large components and candidate monotone paths, but produce a rigorous unbounded construction or obstruction rather than extrapolating box computations.
Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.
Sources and claim boundaries
https://www.erdosproblems.com/1212 ; [Er80,p.114],[HeSt71], Stewart prime-pair path as cited.
Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2483 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- 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.