OctoInformBeta

OpenAI preprint, September 2026 · §2. Periodicity and the uniform bound

Proposition 2.1: If for every D≥1D \ge 1 some A(𝒫)A(\mathcal{P}) contains no self-avoiding walk with steps at most DD, one bound covers all components of GDG_D

Sieves without self-avoiding walks bound the Gaussian prime components.

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 with steps of bounded length. For a real number DD, the graph GDG_D of step DD is the graph whose vertices are the Gaussian primes, primes on the coordinate axes included, two of them adjacent when they are distinct and lie at distance at most DD in ℂ\mathbb{C}.✦ A bound on the sizes of its components rules out a walk to infinity with steps at most DD.

Proposition 2.1 bounds these components by a sieve. Strike from ℤ[i]\mathbb{Z}[i] every multiple of a Gaussian prime of norm pp, for pp in a finite set of primes p≡1(mod⁡4)p \equiv 1 \pmod 4; if no infinite sequence of distinct Gaussian integers with steps at most DD survives in what is left, how large can a component of GDG_D be?

Walks and Components

A self-avoiding walk with steps at most DD is a sequence z0,z1,…z_0, z_1, \dots of distinct Gaussian integers with |zt+1−zt|≤D|z_{t+1} - z_t| \le D for every t≥0t \ge 0; it lies in a set A⊆ℤ[i]A \subseteq \mathbb{Z}[i] when all its terms do.

For a set AA of Gaussian integers, the graph ΓD(A)\Gamma_D(A) of step DD on AA is the graph on ℤ[i]\mathbb{Z}[i] in which two distinct Gaussian integers are adjacent when both lie in AA and their distance is at most DD.✦ With DD fixed and left out of the notation, the component CA(r)C_A(r) of a Gaussian integer rr is the set of Gaussian integers joined to rr by a path in ΓD(A)\Gamma_D(A), and the component C(ρ)C(\rho) of a Gaussian prime ρ\rho is the set of Gaussian primes joined to ρ\rho by a path in GDG_D.

Sieves and Restored Sets

A split prime 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 Gaussian prime πp\pi_p of norm pp, whose conjugate is π‾p\bar\pi_p.✦ The avoiding set A(𝒫)A(\mathcal{P}) of the sieve is the set of Gaussian integers divisible by neither πp\pi_p nor π‾p\bar\pi_p for any p∈𝒫p \in \mathcal{P}.✦

The exception set E(𝒫)E(\mathcal{P}) of the sieve is the set of Gaussian primes that do not lie in A(𝒫)A(\mathcal{P}).✦ The boundary ∂D(𝒫)\partial_D(\mathcal{P}) of the sieve at step DD is the set of points of A(𝒫)A(\mathcal{P}) at distance at most DD from a point of E(𝒫)E(\mathcal{P}).✦ The restored set RD(𝒫)R_D(\mathcal{P}) of the sieve at step DD is the set of Gaussian integers that lie in E(𝒫)E(\mathcal{P}) or in the component, in ΓD(A(𝒫))\Gamma_D(A(\mathcal{P})), of a point of ∂D(𝒫)\partial_D(\mathcal{P}): RD(𝒫)=E(𝒫)∪⋃v∈∂D(𝒫)CA(𝒫)(v).R_D(\mathcal{P}) = E(\mathcal{P}) \cup \bigcup_{v \in \partial_D(\mathcal{P})} C_{A(\mathcal{P})}(v).(1)✦

The finite sieve endpoint is the statement that for every real number D≥1D \ge 1 there is a split prime sieve 𝒫\mathcal{P} such that no self-avoiding walk with steps at most DD lies in A(𝒫)A(\mathcal{P}).✦

The Claim

Theorem 1. Let DD be a real number, AA a set of Gaussian integers and 𝒫\mathcal{P} a split prime sieve.

  1. Let r∈Ar \in A have an infinite component CA(r)C_A(r). Then there is a self-avoiding walk z0,z1,…z_0, z_1, \dots with steps at most DD such that zt∈Afor every t≥0.z_t \in A \quad \text{for every } t \ge 0.(2)✦

  2. Suppose that no self-avoiding walk with steps at most DD lies in AA. Then every r∈Ar \in A has a finite component: #CA(r)<∞.\#C_A(r) < \infty.(3)✦

  3. Let vv be a Gaussian integer with A+v⊆AA + v \subseteq A, and let r∈Ar \in A have a finite component CA(r)C_A(r). If xx and x+vx + v both lie in CA(r)C_A(r), then v=0.v = 0.(4)✦

  4. Let mm be a positive integer with A+mℤ[i]⊆AA + m\mathbb{Z}[i] \subseteq A, and let r∈Ar \in A have a finite component CA(r)C_A(r). Then #CA(r)≤m2.\#C_A(r) \le m^2.(5)✦

  5. The exception set of the sieve is finite: #E(𝒫)<∞.\#E(\mathcal{P}) < \infty.(6)✦

  6. If every r∈A(𝒫)r \in A(\mathcal{P}) has a finite component CA(𝒫)(r)C_{A(\mathcal{P})}(r), the restored set is finite: #RD(𝒫)<∞.\#R_D(\mathcal{P}) < \infty.(7)✦

  7. Every Gaussian prime ρ\rho satisfies C(ρ)⊆CA(𝒫)(ρ)∪RD(𝒫).C(\rho) \subseteq C_{A(\mathcal{P})}(\rho) \cup R_D(\mathcal{P}).(8)✦

  8. Suppose the finite sieve endpoint holds. Then there is a natural number BB such that every component of GDG_D is finite, with #C(ρ)≤Bfor every Gaussian prime ρ.\#C(\rho) \le B \quad \text{for every Gaussian prime } \rho.(9)✦

In the paper, the result reads: for D≥1D \ge 1 and a finite set 𝒫\mathcal{P} of rational primes p≡1(mod⁡4)p \equiv 1 \pmod 4 such that A(𝒫)A(\mathcal{P}) contains no infinite self-avoiding walk with steps at most DD, every component CC of GDG_D satisfies #C≤max⁡{Q2,#E+(KD−1)#EQ2}\#C \le \max\{Q^2, \#E + (K_D - 1)\,\#E\,Q^2\}, where Q=∏p∈𝒫pQ = \prod_{p \in \mathcal{P}} p, KD=#{v∈ℤ[i]:|v|≤D}K_D = \#\{v \in \mathbb{Z}[i] : |v| \le D\} and EE is the set of associates of the selected factors πp\pi_p and π‾p\bar\pi_p. The library takes this hypothesis for every D≥1D \ge 1 at once, as the finite sieve endpoint, and gives in (9) a bound BB without its value.

What Is Checked

Proposition 2.1 is stated over self-avoiding walks with steps at most DD, the graph ΓD(A)\Gamma_D(A) on a set of Gaussian integers and the graph GDG_D on the Gaussian primes with their components, and a split prime sieve 𝒫\mathcal{P} with its avoiding set A(𝒫)A(\mathcal{P}), exception set E(𝒫)E(\mathcal{P}), boundary ∂D(𝒫)\partial_D(\mathcal{P}) and restored set RD(𝒫)R_D(\mathcal{P}), the last part under the finite sieve endpoint as hypothesis.