OctoInformBeta

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

Theorem 1.1: For each DD the graph joining Gaussian primes at distance at most DD has components of bounded size, and no such walk is infinite

Self-avoiding Gaussian prime walks with bounded steps are uniformly short.

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

The Gaussian moat problem asks whether one can walk to infinity on the Gaussian primes in steps of bounded length: whether, for some real DD, there is an infinite sequence of distinct Gaussian primes whose consecutive terms lie at distance at most DD. Here a Gaussian prime is an irreducible element of β„€[i]\mathbb{Z}[i], the primes on the axes such as 33 and 7i7i included, and distances are taken in β„‚\mathbb{C}.✦

A walk is a sequence z0,z1,…z_0, z_1, \dots of Gaussian integers, finite or infinite, and a walk on the Gaussian primes when its terms are Gaussian primes. A walk z0,z1,…z_0, z_1, \dots is self-avoiding when its terms are distinct, and, for a real number DD, has steps at most DD when |zt+1βˆ’zt|≀D|z_{t+1} - z_t| \le D for every tt.

For a real number DD, the graph GDG_D is the graph whose vertices are the Gaussian primes, two distinct Gaussian primes zz and ww being joined when |zβˆ’w|≀D.|z - w| \le D.(1)✦ The component CD(Ο–)C_D(\varpi) of a Gaussian prime Ο–\varpi in GDG_D is the set of Gaussian primes joined to Ο–\varpi by a path in GDG_D.✦

Split Sieves

A split sieve is a finite set 𝒫\mathcal{P} of rational primes p≑1(mod⁡4)p \equiv 1 \pmod 4 together with, for each pβˆˆπ’«p \in \mathcal{P}, a chosen Gaussian prime Ο€p\pi_p of norm pp, whose conjugate is Ο€β€Ύp\bar\pi_p.✦ The set A(𝒫)A(\mathcal{P}) of Gaussian integers avoiding a split sieve 𝒫\mathcal{P} is A(𝒫)={zβˆˆβ„€[i]:Ο€p∀z and Ο€β€Ύp∀z for every pβˆˆπ’«}.A(\mathcal{P}) = \{\, z \in \mathbb{Z}[i] : \pi_p \nmid z \text{ and } \bar\pi_p \nmid z \text{ for every } p \in \mathcal{P} \,\}.(2)✦

The finite sieve obstruction (S) is the statement that, for every real Dβ‰₯1D \ge 1, there is a split sieve 𝒫\mathcal{P} such that every infinite self-avoiding walk z0,z1,…z_0, z_1, \dots with steps at most DD has ztβˆ‰A(𝒫)for some tβ‰₯0.z_t \notin A(\mathcal{P}) \quad \text{for some } t \ge 0.(3)✦

The Claim

Theorem 1. Let DD be a real number. There is a natural number BB such that the component CD(Ο–)C_D(\varpi) of every Gaussian prime Ο–\varpi has at most BB elements, every self-avoiding walk z0,…,znβˆ’1z_0, \dots, z_{n-1} on the Gaussian primes with steps at most DD has at most BB terms, and every infinite self-avoiding walk w0,w1,…w_0, w_1, \dots on the Gaussian primes has a step longer than DD; that is, |CD(Ο–)|≀B,n≀B,|wt+1βˆ’wt|>D for some tβ‰₯0.|C_D(\varpi)| \le B, \qquad n \le B, \qquad |w_{t+1} - w_t| > D \ \text{ for some } t \ge 0.(4)✦

Taken over all real DD, the last of these bounds answers the Gaussian moat problem in the negative.✦

What Is Checked

The theorem is stated over the graph GDG_D on the Gaussian primes and its components CD(Ο–)C_D(\varpi), for every real DD, and over walks on the Gaussian primes, finite and infinite.

For a real number DD and a natural number BB such that every component of GDG_D is finite with at most BB elements, the library states that every self-avoiding walk z0,…,znβˆ’1z_0, \dots, z_{n-1} on the Gaussian primes with steps at most DD has n≀B.n \le B.(5)✦

Under the finite sieve obstruction (S), the library states the theorem, and also states two of its bounds on their own, for an infinite self-avoiding walk w0,w1,…w_0, w_1, \dots on the Gaussian primes: $$\text{(S)} \;\Longrightarrow\; \eqref{eq:claim1},$$(6)✦ (S)β‡’|CD(Ο–)|≀B for every Gaussian prime Ο–,\text{(S)} \;\Longrightarrow\; |C_D(\varpi)| \le B \ \text{ for every Gaussian prime } \varpi,(7)✦ (S)β‡’|wt+1βˆ’wt|>D for some tβ‰₯0.\text{(S)} \;\Longrightarrow\; |w_{t+1} - w_t| > D \ \text{ for some } t \ge 0.(8)✦