The Setting
Fix a real number . A walk in has steps at most when for every , the distance being taken in , and it is self-avoiding when its terms are distinct. A split prime sieve is a finite set of rational primes together with a Gaussian prime of norm for each .✦ The avoiding set of a split prime sieve , where is the conjugate of , is (1)✦
In the proof of Theorem 1.2 of the paper, the question is which families of such sieves, one on each of several batches of primes, leave no self-avoiding walk with steps at most inside all their avoiding sets. The library’s answer is the sieve certificate for , a system of dyadic batches, word lengths, rates and an error tied together by explicit inequalities.
Batches, Factors and Weights
For a prime , the chosen split factor is one fixed Gaussian prime of norm ✦, and the sieve of a finite set of such primes pairs each of them with its chosen split factor.✦ The dyadic batch of index is the set of primes (2)✦ and the dyadic sieve of index is the sieve of .✦
Let be a split prime sieve. The signed factor of a Gaussian integer with sign is , and with sign it is .✦ The available factors of form the set .✦ The enumeration of numbers its primes once and for all as .✦ A signed index of is a pair of a sign pattern , which gives each position a sign or , and a position ✦; the prime of is ✦. The mean log of is .✦
The residue weight of a finite set of Gaussian integers is (3)✦ where the norm of a nonzero is the number of residues modulo . For a sequence of split prime sieves , the factors preceding index form the set of all available factors of .✦
The lattice ball of radius is the set of with , and is its number of elements.✦ Logarithms are natural, and is the binary entropy.
Certificates and Parameters
A low residue of a law on , a group of elements, is a class of probability below , for a floor .
A schedule is a list of phase lengths, and a smoothing length is a number attached to it. An entropy band for a split prime sieve , a schedule , a smoothing length , a number of primes and a deficit consists of a ratio , a scale , a number of bands and a cost rate , such that is a prefix, followed by the band lengths for , where is the band scale, followed by a suffix of sum , and such that is the band size.✦ Moreover, with and the larger of and the number of points of the lattice ball of radius , one has , , , , , , and .✦
A coverage derivation for a split prime sieve , a step bound and a smoothing length is a relation between a list of phase lengths, a floor , thresholds for the counts of low residues at the signed indices and an exception rate , defined by two rules.✦ By the base rule it holds when there are a number of primes with , an entropy band on with smoothing length , primes and deficit , and a constant , such that , for every and .✦ By the step rule it holds for followed by a list of sum , at floor with thresholds and rate , when there are numbers and , reals , , , , , and thresholds and at the signed indices, with an entropy band on with smoothing length , primes and deficit , and a coverage derivation of at floor with thresholds and rate , such that , , , , , , , , and , and such that every signed index has , , , and .✦
A word length is the length of the increment words of a walk. A batch certificate for , a schedule , a smoothing length , a split prime sieve , a word length , an error and a rate consists of: a splitting of , a list of phase lengths, into a prefix followed by a remainder of sum ; a scale such that is nonempty, lies in and has ; natural numbers and , a floor , a gain , an exception rate , a deficit and thresholds for the counts of low residues at the signed indices ; an entropy band on the prefix with smoothing length , primes and deficit ; and a coverage derivation of the remainder at floor with thresholds and exception rate .✦ These are subject to , to , and the list bound (4) at every signed index , and to the rate bound (5)
A sieve certificate for consists of a schedule , a smoothing length , a last index , batch indices , word lengths , rates and an error such that, with the dyadic sieve of index , every has a batch certificate for , , , , word length , error and rate , every has and the smoothing bound (6) and the excess bound (7)✦ holds. We write for the set of sieve certificates for .
The top coefficient of a real number is ✦, where is the top parameter✦ and the top iteration count.✦
The Claim
Theorem 1.
Let , and let , , , , and meet the conditions of a sieve certificate for with arbitrary split prime sieves in place of the dyadic sieves. Then every self-avoiding walk with steps at most satisfies (8)✦
Let be finite sets of Gaussian integers, a natural number and relations between finite sets of Gaussian integers, such that for every each is contained in some with . Then there are finite sets with (9)✦
For every real , (10)✦
There are reals , , and a natural number with , , , , and such that every sufficiently large real has a finite set of natural numbers with , with whenever lie in , and with (11)✦
Let , and be reals, a natural number and finite sets of natural numbers such that, for every , every has and . Then the union of the first sets satisfies (12)✦
In the paper, the result reads: averaging Lemma 8.1 and applying Proposition 7.1 gives for a constant , while the batches , consisting of the primes in , make the left side diverge, and this proves Theorem 1.2.
What Is Checked
The claim is stated over walks in with distances in , split prime sieves and their avoiding sets, the dyadic batches and dyadic sieves, residue weights of preceding factors, the lattice ball and its points, the binary entropy, batch certificates with their entropy bands and coverage derivations, sieve certificates and the top coefficient . About these constructions the library proves that every prime is the norm of a Gaussian prime, so that the chosen split factors exist and every dyadic sieve is a split prime sieve.