The Setting
Let be a walk in , to be read not at a fixed time but at a random one. The random time is built in stages: a stage started at time moves forward by a random advance of bounded size whose law may depend on , and the next stage starts where it stops. In the common schedule every stage but the last is a difference transition, driven by the differences between the points the walk visits just ahead of the current time, and the last stage adds a uniform random offset. If the stages start at time and end at time , what is observed is the residue of the displacement modulo a Gaussian prime of norm , or modulo its conjugate , for a prime .
Laws and Difference Transitions
A law on a finite set is a function from to the nonnegative reals with .✦ Given a law on and, for each , a law on a finite set , the joint law of and is the law on with mass at : the law of the pair obtained by drawing from and then from .✦ The pushforward of along a map is the law on that gives each point the total mass of its preimage under .✦ The uniform law on a nonempty finite set is the law on that gives every point mass ; the point mass at is the law on that gives mass and every other point mass . A time law of last time is a law on , the law of a random time at most .✦
Fix a walk , a time and . The segment of length from is the set of the points visited at times ✦, and its difference set is the set of all differences with ✦. For each , a pair of advances in with is chosen once and for all.✦ The difference pair law is the law of when is drawn uniformly from .✦ The difference transition of window at draws this pair and, independently, a fair coin, and advances by on heads and by on tails; its law on is (1)✦
Block Lengths
For reals and and for , the band scale is ✦, and the band length is (2)✦ Lists of lengths are written side by side, juxtaposition being concatenation. For a real and , the top block is the list of twenty band lengths at the top parameter ✦; for a finite set , the top blocks are the concatenation of the , , in decreasing order of ✦. An accurate block takes and a real : is the list of band lengths on the accurate grid .✦
Signed Factors
A split prime sieve is a finite set of rational primes together with, for each , a Gaussian prime of norm .✦ Its primes are enumerated once and for all as , where .✦ A signed index of is a pair of a sign pattern and a position .✦ The prime of a signed index of is , and its signed factor is when and the conjugate when ✦. The residue ring at is the quotient of by the multiples of ✦, and the residue map sends to its class ✦.
The Definition
Definition 1. A forward kernel of bound is a family of laws on the advances , one for each time : (3)✦ Two forward kernels and , of bounds and , compose to the forward kernel of bound that advances from by drawn from and then by drawn from : (4)✦ The uniform offset kernel , for , is the forward kernel of bound with the uniform law at every time: (5)✦ Given a walk , the difference kernel of window is the forward kernel of bound whose law at each time is of (1).✦ The common schedule of with segment lengths and offset is the forward kernel defined by recursion on the list: (6)✦ A time law of last time , advanced by a forward kernel of bound , gives the time law of last time , the law of with drawn from and then from : (7)✦ The exact start at is the time law of last time , the point mass at : (8)✦ A checkpoint is a time at which the schedule is started exactly, from the exact start . The terminal time of the common schedule started at a checkpoint is the random time of law .
A concrete schedule is given by a real , natural numbers and , and a finite set for each . The schedule has windows, indexed by . Window contributes the block , and the common block list of the concrete schedule runs through the windows from down to and ends with : (9)✦ The offset of the concrete schedule is the window smoothing length (10)✦ The relative residue law of a forward kernel of bound , a split prime sieve , a walk , a time and a signed index of is the law on of the class of the displacement modulo , with drawn from : (11)✦
In the paper, the result reads: the terminal time is reached by transitions of Lemma 4.3 at decreasing scales, in three bands per window, followed by one independent uniform offset in , with exact starts at checkpoints.
What Is Checked
The definitions are stated over laws on finite sets, a walk in with the difference sets of its segments and a chosen pair of advances for each difference, the band lengths (2) with their real parameters, and a split prime sieve with its signed indices, signed factors and residue rings. About these constructions the library proves that every element of the difference set of a segment is a difference with , the fact on which the choice of the pairs rests.✦