The Setting
The Gaussian moat problem asks whether one can walk to infinity on the Gaussian primes, the irreducible elements of (primes on the coordinate axes included), with steps of bounded length. A walk is a sequence of Gaussian integers; it is self-avoiding when its terms are distinct, and it has steps at most , for a real number , when for every , distances being taken in . For a set and a real , denotes the set of self-avoiding walks with steps at most whose terms all lie in .
The sieve form of the problem replaces the Gaussian primes by the Gaussian integers that survive a finite sieve. A split sieve is a finite set of rational primes together with a Gaussian prime of norm for each ; denotes the conjugate of .โฆ The sieved set of a split sieve is the set of Gaussian integers divisible by neither nor for any : (1)โฆ It contains every Gaussian prime other than the associates of the and . The question is whether, for each real , some split sieve leaves no self-avoiding walk with steps at most in .โฆ
Dyadic Batches and Weights
The chosen split factor of a prime is a Gaussian prime of norm , fixed once for each such โฆ, and the split sieve of a finite set of primes is with the chosen split factors of its elements.โฆ The dyadic batch of index is the set (2)โฆ and the dyadic sieve of index is the split sieve of .โฆ
Let be a split sieve, enumerated once and for all as . The signed factor of a Gaussian integer with sign is , and with sign it is โฆ; the available factors of form the set of signed factors of the .โฆ A signed index of is a pair of a sign vector and an index โฆ, and its prime is .โฆ The mean logarithm of is .โฆ
The residue weight of a finite set is , with the norm.โฆ For split sieves , the preceding factors at index form the set .โฆ
For a real number , the lattice ball of radius is the set of with , and is the number of elements of this set.โฆ
Sieve Certificates
Fix a real and a split sieve , and write . A schedule is a finite sequence of natural numbers; is the sum of its entries, and is the concatenation of and . For reals and , the band scales , band lengths and band sizes , , are (3)
An entropy band for on a schedule , with smoothing length , size and deficit , consists of reals , , , a natural number and a splitting of the schedule, such that , , , and (4)โฆ
Coverage derivations for with smoothing length are defined by two rules, each giving a schedule a coverage derivation with a floor , thresholds indexed by the signed indices , and a parameter . By the base rule, a schedule has a coverage derivation with floor , thresholds and parameter when carries an entropy band with smoothing length , size and deficit , and some real satisfies (5)โฆ By the step rule, a schedule has a coverage derivation with floor , thresholds and parameter when carries an entropy band with smoothing length , size and deficit , for some real , the schedule has one with floor , thresholds and parameter , and there are and reals , , with , , , , , , , for every , and (6)
A batch certificate for with schedule , smoothing length , length , weight and rate consists of a splitting of the schedule, a scale , natural numbers and , reals , , , , thresholds for the signed indices, an entropy band on with smoothing length , size and deficit , and a coverage derivation of with smoothing length , floor , thresholds and parameter .โฆ Its conditions are that is nonempty with for every , that , , , , , and , that for every signed index (7) and that (8)โฆ
A sieve certificate for consists of a schedule , a smoothing length , an index , batch indices , lengths , rates , an error and, for each , a batch certificate for the dyadic sieve of index with schedule , smoothing length , length , rate and weight , where is the set of preceding factors of the dyadic sieves of indices , and likewise.โฆ Write for the binary entropy. Its conditions are that divides for , that (9) and that (10)โฆ The prime set of a sieve certificate is โฆ, its sieve is the split sieve of โฆ, with sieved set , and is the set of sieve certificates for .
The Claim
Theorem 1.
(Sieve form of the problem.) For every real there is a split sieve with (11)โฆ
Suppose every real has a sieve certificate. Then for every real some split sieve satisfies (12)โฆ
For every real , (13)โฆ
Let be real and a sieve certificate for . Then (14)โฆ
What Is Checked
The four statements are stated over self-avoiding walks in with steps measured in , split sieves whose factors are Gaussian primes of norm , their sieved sets , and sieve certificates, whose prime sets are finite unions of dyadic batches sieved by the chosen split factors.
Of these constructions, the library proves that every element of the prime set of a sieve certificate is a prime congruent to modulo .โฆ