The Setting
The Gaussian moat problem asks whether one can walk to infinity on the Gaussian primes with steps of bounded length: whether, for some , there is a self-avoiding walk of Gaussian primes with for every .
Sieving narrows the region such a walk can use. Take the primes and , the Gaussian primes and of norms and , and remove from every multiple of and of . Every Gaussian prime that is not an associate of one of these four lies in what remains, and so does every point of a self-avoiding walk on the Gaussian primes from some time on.
The Sieved Set
A split sieve is a finite set of rational primes together with, for each , a chosen Gaussian prime of norm .β¦
The sieved set of a split sieve is the set of Gaussian integers divisible by neither nor its conjugate for any : (1)β¦ The period of is the product of its primes, .β¦
The Claim
Theorem 1. Let be a rational prime with . Then there is a Gaussian prime with (2)β¦ Let be a split sieve with period , let be a point of its sieved set , and let . Then (3)β¦
What Is Checked
The claim (2) is stated over the Gaussian primes and their norm, and the claim (3) over a split sieve , its sieved set of (1) and its period .