Skip to content

Erdős Problem #193

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: geometry.

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

An \(S\) walk in the integer lattice \(\mathbb Z^3\) is an infinite sequence of distinct lattice points \(P_0,P_1,\ldots\) with every step \(P_{n+1}-P_n\) in a fixed finite set \(S\subseteq\mathbb Z^3\). Gerver and Ramsey asked whether every such walk contains three distinct collinear points.

The bounded-step condition is essential: allowing arbitrary jumps permits many easy examples, whereas requiring the same finite step set throughout looks restrictive. The question concerns collinearity of any three points in the walk, not only three consecutive ones.

A small example

On a two-dimensional integer grid, an infinite walk with bounded steps has unavoidable collinear triples, as shown by Gerver and Ramsey. Three consecutive points forming a corner are not collinear, but this says nothing about a much later point on the same line. In \(\mathbb Z^3\), test three lattice points \(a,b,c\) by checking whether \((b-a)\times(c-a)=0\); this is an exact integer condition.

A lattice walk without three collinear points cannot repeat a vertex, since the problem asks for a set of distinct visited points. Bounding the coordinate sizes of steps alone is not enough: the finite list of possible displacement vectors must also be fixed.

What is known

DISPROVED. Stijn Cambie and Erik Kalviainen, An infinite small-step \(\mathbb Z^3\) walk with no collinear triple, 1 September 2026, construct an infinite walk using at most 16 distinct step vectors and avoiding every collinear triple. Their Theorem 1 uses a Gaussian-integer walk, four directional states, and a height coordinate that increases strictly.

A reusable step in their proof is a 2-adic valuation invariant for the squared lengths of planar chords and differences of height coordinates. If three chosen points were collinear, the valuation equality applied to the three chords would force an impossible parity relation. The primary preprint includes an explicit attribution of AI-assisted drafting and externally maintained Lean verification. This does not make GCL a proof certifier.

The earlier Gerver–Ramsey 1979 theorem proves the positive two-dimensional case and bounded finite no-three-collinear runs in three dimensions. The newer infinite construction genuinely changes the dimension-three answer.

GCL's current state

The pinned and maintained Erdős #193 label the conjecture DISPROVED; original issue #1462. The preprint's theorem and 16-step claim were checked, but no GCL kernel replay of the source code or detailed 2-adic argument is claimed.

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 implements the published recurrence for the first 256 points, enumerates its distinct displacement vectors and checks every collinearity determinant over all point triples. Acceptance: no triple is collinear, height is strictly increasing, and the step set has cardinality at most 16. Then prove the author's exact 2-adic chord invariant separately; the finite check alone cannot certify the infinite theorem.

Sources and claim boundaries

No new construction, independently checked Lean theorem or editorial admission is claimed.

Catalogue and evidence provenance

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