The Setting
The raw depth of two distinct points of the complex plane is . Take a dyadic grid of the plane, randomly shifted, rotated and dilated, and the smallest of its square cells that contains both points: minus the logarithm of that cell’s side is a second depth of the pair. The question is how far it lies from the raw depth, and how the gap depends on the pair.
The library asks it for any two distinct complex numbers, and then, place by place, for the points of a set carried into a number field . An injective coordinate , with , and a place of give two distinct points the raw depth (1) where is the absolute value of . At an infinite place, for a complex embedding of inducing , and is the raw depth of the complex points and .
Random Dyadic Grids
An axis sequence is a real sequence . The axis law is the probability law on axis sequences under which the terms are independent, is uniform on , and is a fair binary step of length , equal to or with probability each.✦ The offset of at an integer scale is the partial sum (2)✦
For a length and an offset , the bin index of a real number is the integer , the with .✦
A grid sample is a pair of axis sequences✦; under the grid sample law the two are independent, each with the axis law.✦ Two points and of lie in the same cell at scale , written , when their coordinates have equal bin indices for the length and the offsets (2): (3)✦ The minimal shared scale of and is the infimum of the integers with ✦, and their grid depth is (4)✦
The Phase and the Grid Error
A phase is a pair of real numbers. The phase law is the probability law on phases under which is uniform on and , independently, uniform on .✦ A sample is a phase with a grid sample✦; the full law is the product of the phase law and the grid sample law, and and refer to it. The phase acts on by the rotation scaling (5)✦ with identified with through real and imaginary parts.
The hierarchy depth of two complex numbers under a sample is (6)✦ and their grid error is the excess of the hierarchy depth over the raw depth, (7)✦
For real numbers and , the polar mean is the mean grid depth, over the grid sample law, between the origin and the point of logarithmic radius and angle , plus : (8)✦ The error mean is the universal constant (9)✦
Depths at a Place
An ultrametric depth on a set is a symmetric function such that any three distinct points of satisfy (10)✦
Let be an infinite place of . A sample is good at when the hierarchy depths , for , satisfy (10) on every triple of distinct points of .✦ The archimedean depth at under a sample is the function on given by (11)✦
The Claim
Theorem 1. For any two points and almost every grid sample , (12)✦ For distinct , the grid error of a sample drawn from the full law is integrable, (13)✦ it has mean (14)✦ for every its tail satisfies (15)✦ and its absolute value has mean (16)✦ Let be a number field and injective. At an infinite place of , the archimedean depth of distinct has mean (17)✦ At a finite place of , the depth is the function on that vanishes on the diagonal and is the raw depth off it: (18)✦
In the paper, the result reads, with the grid error at a place : at every complex place the depths are almost surely finite on distinct pairs; the law of is independent of the pair, the place and the configuration, with finite mean an absolute constant , and for , where and are constants; at finite places .
What Is Checked
The claim is stated over the random dyadic grid: the axis law, the grid sample law, the phase law and the full law; the cells (3) and the grid depth (4); the hierarchy depth (6), the grid error (7) and the constant of (9); and, at the places of , the raw depth (1) and the archimedean depth (11). The library proves that the depth at a finite place, and the archimedean depth under every sample, are ultrametric depths on in the sense of (10).