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 , the graph of step 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 in .✦ A bound on the sizes of its components rules out a walk to infinity with steps at most .
Proposition 2.1 bounds these components by a sieve. Strike from every multiple of a Gaussian prime of norm , for in a finite set of primes ; if no infinite sequence of distinct Gaussian integers with steps at most survives in what is left, how large can a component of be?
Walks and Components
A self-avoiding walk with steps at most is a sequence of distinct Gaussian integers with for every ; it lies in a set when all its terms do.
For a set of Gaussian integers, the graph of step on is the graph on in which two distinct Gaussian integers are adjacent when both lie in and their distance is at most .✦ With fixed and left out of the notation, the component of a Gaussian integer is the set of Gaussian integers joined to by a path in , and the component of a Gaussian prime is the set of Gaussian primes joined to by a path in .
Sieves and Restored Sets
A split prime sieve is a finite set of rational primes together with, for each , a Gaussian prime of norm , whose conjugate is .✦ The avoiding set of the sieve is the set of Gaussian integers divisible by neither nor for any .✦
The exception set of the sieve is the set of Gaussian primes that do not lie in .✦ The boundary of the sieve at step is the set of points of at distance at most from a point of .✦ The restored set of the sieve at step is the set of Gaussian integers that lie in or in the component, in , of a point of : (1)✦
The finite sieve endpoint is the statement that for every real number there is a split prime sieve such that no self-avoiding walk with steps at most lies in .✦
The Claim
Theorem 1. Let be a real number, a set of Gaussian integers and a split prime sieve.
Let have an infinite component . Then there is a self-avoiding walk with steps at most such that (2)✦
Suppose that no self-avoiding walk with steps at most lies in . Then every has a finite component: (3)✦
Let be a Gaussian integer with , and let have a finite component . If and both lie in , then (4)✦
Let be a positive integer with , and let have a finite component . Then (5)✦
The exception set of the sieve is finite: (6)✦
If every has a finite component , the restored set is finite: (7)✦
Every Gaussian prime satisfies (8)✦
Suppose the finite sieve endpoint holds. Then there is a natural number such that every component of is finite, with (9)✦
In the paper, the result reads: for and a finite set of rational primes such that contains no infinite self-avoiding walk with steps at most , every component of satisfies , where , and is the set of associates of the selected factors and . The library takes this hypothesis for every at once, as the finite sieve endpoint, and gives in (9) a bound without its value.
What Is Checked
Proposition 2.1 is stated over self-avoiding walks with steps at most , the graph on a set of Gaussian integers and the graph on the Gaussian primes with their components, and a split prime sieve with its avoiding set , exception set , boundary and restored set , the last part under the finite sieve endpoint as hypothesis.