OctoInformBeta

OpenAI preprint, September 2026 · §1. The Gaussian moat problem

Gaussian primes and the graph G_D: The Gaussian primes, those on the axes included, the graph GDG_D joining distinct primes within distance DD, and the component of a prime

The graph joining Gaussian primes at bounded distance.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Up to the four units ±1\pm 1 and ±i\pm i, the Gaussian primes are 1+i1 + i, of norm 22; the two conjugate primes a+bia + bi and a−bia - bi of norm pp for each rational prime p=a2+b2≡1(mod⁡4)p = a^2 + b^2 \equiv 1 \pmod 4; and the rational primes q≡3(mod⁡4)q \equiv 3 \pmod 4, which with their associates ±q\pm q and ±qi\pm qi are the Gaussian primes on the coordinate axes.

The Gaussian moat problem asks whether one can walk to infinity on the Gaussian primes with steps of bounded length: whether, for some real number DD, there is a self-avoiding walk z0,z1,…z_0, z_1, \dots of Gaussian primes with steps at most DD. For each real DD, the library defines the graph GDG_D on the Gaussian primes along whose edges such walks move, and the components of GDG_D.

The Definition

Definition 1. The set VV of Gaussian primes is the set of irreducible elements of the ring ℤ[i]\mathbb{Z}[i]: V={z∈ℤ[i]:z is irreducible}.V = \{\, z \in \mathbb{Z}[i] : z \text{ is irreducible} \,\}.(1)✦ For a real number DD, the Gaussian prime graph GDG_D is the graph with vertex set VV in which two Gaussian primes zz and ww are adjacent when they are distinct and at distance at most DD in ℂ\mathbb{C}: z∼Dw⇔z≠w and |z−w|≤D.z \sim_D w \iff z \neq w \text{ and } |z - w| \le D.(2)✦ The component CD(p)C_D(p) of a Gaussian prime pp in GDG_D is the set of Gaussian primes reachable from pp along a finite chain of adjacent primes, pp itself included: CD(p)={q∈V:p=z0∼Dz1∼D⋯∼Dzn=q for some n≥0 and z0,…,zn∈V}.C_D(p) = \{\, q \in V : p = z_0 \sim_D z_1 \sim_D \cdots \sim_D z_n = q \text{ for some } n \ge 0 \text{ and } z_0, \dots, z_n \in V \,\}.(3)✦

What Is Checked

The three definitions are stated over the irreducible elements of ℤ[i]\mathbb{Z}[i] and the distance of ℂ\mathbb{C}, for every real number DD. The library proves that the adjacency (2) is symmetric and joins no prime to itself, which makes GDG_D a simple graph.