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 , there is an infinite sequence of distinct Gaussian primes whose consecutive terms lie at distance at most . Here a Gaussian prime is an irreducible element of , the primes on the axes such as and included, and distances are taken in .β¦
A walk is a sequence of Gaussian integers, finite or infinite, and a walk on the Gaussian primes when its terms are Gaussian primes. A walk is self-avoiding when its terms are distinct, and, for a real number , has steps at most when for every .
For a real number , the graph is the graph whose vertices are the Gaussian primes, two distinct Gaussian primes and being joined when (1)β¦ The component of a Gaussian prime in is the set of Gaussian primes joined to by a path in .β¦
Split Sieves
A split sieve is a finite set of rational primes together with, for each , a chosen Gaussian prime of norm , whose conjugate is .β¦ The set of Gaussian integers avoiding a split sieve is (2)β¦
The finite sieve obstruction (S) is the statement that, for every real , there is a split sieve such that every infinite self-avoiding walk with steps at most has (3)β¦
The Claim
Theorem 1. Let be a real number. There is a natural number such that the component of every Gaussian prime has at most elements, every self-avoiding walk on the Gaussian primes with steps at most has at most terms, and every infinite self-avoiding walk on the Gaussian primes has a step longer than ; that is, (4)β¦
Taken over all real , the last of these bounds answers the Gaussian moat problem in the negative.β¦
What Is Checked
The theorem is stated over the graph on the Gaussian primes and its components , for every real , and over walks on the Gaussian primes, finite and infinite.
For a real number and a natural number such that every component of is finite with at most elements, the library states that every self-avoiding walk on the Gaussian primes with steps at most has (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 on the Gaussian primes: $$\text{(S)} \;\Longrightarrow\; \eqref{eq:claim1},$$(6)β¦ (7)β¦ (8)β¦