The Setting
Write a point of the plane as and give it the two coordinates and . For points and , (1) so the points at which takes one value lie on one circle about the pin . The points of a configuration at one distance from a pin form a fiber with source , the points of the fiber are its targets, and an edge joins the source to a target.
The points are also sorted into cells, at every place of a number field and at every level, and each cell carries a mass; the overlap of two points is the mass of the cells holding both. The question is how much of the mean overlap of a pair of points lies in the small cells, those with at most of the points of the configuration for a fixed exponent , and how the mean overlap of the two ends of a random edge compares with that of a random pair.
Fiber Systems and Prepared Graphs
A fiber system on a finite vertex set , with fibers indexed by a finite set , assigns to each fiber a source and a target set not containing , two distinct fibers with the same source having disjoint target sets.✦ The edge set of is the set of ordered pairs with ✦, and the edge law of is the uniform probability law on ✦. The weight of a fiber is , the mass that gives to the edges of .✦ The degree of a vertex is the number of vertices with plus the number of vertices with .✦
The size of a fiber in a set of vertices is ✦, and the heavy count of at a proportion is the total size in of the fibers that have their source in and keep at least the proportion of their targets there: (2)✦
Write and . A prepared graph with density , exponents and and error is a fiber system on with in which every vertex has degree at least , every fiber has more than targets, and (3)✦ for every set of vertices, with when .
On , is the uniform law✦, the uniform law on ordered pairs of distinct vertices✦ and the uniform law on ✦. The mass of a set under a law is the sum of its values on the points of , so that .✦
Cell Masses and the Overlap
A cell mass on is a real function on the subsets of . The integral of a real function of subsets against is (4)✦ The overlap of two vertices and of under a cell mass is .
For a subset of , is the probability that a uniform pair of distinct vertices lies in ✦, and the probability that an edge drawn from has both ends in ✦. The small fiber slice of at the proportion adds the weighted masses of the fibers whose source lies in and whose law gives mass less than : (5)✦
Cells at the Places of a Number Field
An ultrametric depth on a finite set is a symmetric real function on pairs of points of such that for pairwise distinct , , .✦ The cell of a point at a level is the set made of and the points with .✦ A cell is a giant when it holds more than half of the points of ✦, and is the union of the giants at level ✦. The transformed family is the multiset of subsets of made of the cells at level that are not giants and of the complements of the giants .✦ The cell mass of a subset of with at least two points is the total length of the levels at which it occurs in , (6)✦ and when . The potential of a point is the length of the set of levels at which there is a giant and .✦
Let be an injective map of into a number field . The depth at a finite place of is the function with at distinct points and on the diagonal.✦ A finite place is bad when fails to be a unit at for some pair of distinct points , .✦
At the archimedean places the cells come from a random dyadic grid. A grid sample is a phase together with two real axis sequences, one for each axis of .✦ Under the law of grid samples the phase is uniform on , the phase and all terms of the two sequences are independent, the term of index is uniform on and the term of index is or with probability each. At a scale each axis is cut into half-open intervals of length , one of them starting at the sum of the terms of index to of its sequence, and two points share a cell at scale when they lie in one interval on each axis.✦ The grid depth of two points is for the least scale at which they share a cell.✦ For a grid sample with phase and complex numbers and , the hierarchy depth of and is the grid depth for of and , read as points of , minus .✦
A grid sample is good at an archimedean place of when the hierarchy depth of the images of the points under the embedding of at is ultrametric on .✦ The depth on at an archimedean place of for a grid sample is, at distinct points, the hierarchy depth of the images of the points under the embedding of at when is good at , and otherwise.✦ With the weight of an archimedean place, where is for a real place and for a complex one, the cell mass of a subset of for the coordinate is (7)✦ the mean taken under the law of grid samples, and the potential of a point is given by the same formula with in place of ✦.
Two injective maps and of into give the total cell mass and the total potential ; write and . The overlap scale , the mean overlap of a uniform pair of distinct points, the potential scale and the small overlap scale , the part of carried by the small cells, are (8) and .
The Claim
For a density and an error , the bounds use the error factors (9) which vanish at , and, for and real numbers , and , the function (10)
Theorem 1. (i) Let be a prepared graph on , with vertices, density , exponents and and error , where , and let . If is a cell mass on , a real number and a nonnegative function on with for all distinct vertices and , then (11)✦ and, when is moreover nonnegative, (12)✦ If , and are injective maps of into a number field such that , as in (1), takes one value on the targets of each fiber , and and are real numbers with , and , then (13)✦
(ii) Let and let , , , and be sequences of real numbers with , and . If for every and every the bound holds for all large , then, as , (14)✦
(iii) Let and, for each , let be a prepared graph on a vertex set with density , exponents and and error , and let and be injective maps of into a number field such that takes one value on the targets of each fiber of . If and , then the scales , and of and satisfy, as , (15)✦
In the paper, the result reads: , its display (4.1), where is the constant of the upper bound, and , its display (4.5).
What Is Checked
The claim is stated over prepared graphs: in (11) with any cell mass whose overlap is off the diagonal, for a real number and a nonnegative function on , in (12) with any nonnegative cell mass of that kind, and in (13) and (15) with the total cell mass and the total potential of two injective maps into a number field, being constant on each fiber; (14) is stated over sequences of real numbers.
The library proves that the depth at each finite place of , and the depth at each archimedean place for every grid sample, are ultrametric depths, and that an injective map of a finite set into has finitely many bad places.