The Setting
Pin a point of a finite configuration in the plane. The other points of lie on circles centred at , one circle for each distance from , and two circles around the same pin are disjoint. Writing a point as and setting , , the product (1) takes a single value on each circle around .
An arithmetic model keeps only this structure. The pins and their circles become the fibers of a graph on a finite vertex set; the coordinates become two injective maps , from the vertices into a number field containing a square root of ; and is required to be constant on each fiber. Closeness of two vertices is then read at every place of : at an archimedean place through a randomly rotated and shifted dyadic grid, at a finite place through the -adic absolute value of . Each reading is an ultrametric hierarchy of cells, and the cells of all of them together give two numbers, the overlap scale and the potential scale . The case at hand is a sequence of such models of growing size along which tends to infinity.
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 with , such that two distinct fibers with the same source have disjoint target sets.✦ The edge set of a fiber system is the set of pairs with and ; it has edges.
For a set of vertices and a level , the size of a fiber in is ✦, and is active when and its size in exceeds .✦ The graph of at level on has an edge from to when some active fiber has source and ✦, and the degree of a vertex in it is its out-degree plus its in-degree.✦ At level on all of every fiber is active and the edge set is ; the degree of a vertex of in , with no level named, is its degree in the graph of at level on .
For a fiber system , a real and a set of vertices, the heavy count of is the total number of targets inside of the fibers with source in that keep at least a fraction of their targets in : (2)✦
A fiber system on , with , is a prepared graph with density , exponents , and error when , every vertex has degree at least , every fiber has , (3) and every set of vertices satisfies, with , (4)✦
A prepared arithmetic model is a prepared graph on together with a number field and two injective maps such that, for every fiber , the product takes one value for all .
Ultrametric Hierarchies
An ultrametric depth on a finite set of points is a symmetric real function on pairs of points of such that for pairwise distinct , , .✦
Two points , of share a cell at level when they are equal or .✦ The cell is the set of points sharing a cell with at level ✦, and is the set of all cells at level ✦. A giant at level is a cell with ; the giants form the set ✦, and is their union✦. The transformed family is the multiset made of the cells with and the complements of the giants, a set occurring in both parts counted twice✦, and is the number of times occurs in it✦.
For an ultrametric depth on , the cell mass of a subset of with and the potential of a point of are the real numbers (5) and a subset with fewer than two points has cell mass .
Depths at the Places of a Number Field
A phase and grid sample is a phase , made of a scale shift and a rotation angle , together with a pair of axis sequences and of real numbers.✦ The axis law is the law of a sequence of independent real numbers whose term of index is uniform on and whose term of index equals or with probability each.✦ The full sample law on phase and grid samples makes uniform on , uniform on and the two sequences independent copies of the axis law, all four independent.✦
For and an integer , the offset of the sequence at scale is the partial sum when and when .✦ Two points , of lie in the same cell at scale when, in each coordinate , they have the same index .✦ The grid depth is for the infimum of the scales at which and share a cell✦, and the hierarchy depth of two complex numbers is (6)✦ the rotated and rescaled points read as points of through their real and imaginary parts.
Let be an injective map from a finite set into a number field . A sample is good at an archimedean place when , taken at the images under the complex embedding at , satisfies the ultrametric inequality for pairwise distinct points of .✦ The archimedean depth is at distinct points , when is good at , and otherwise.✦ At a finite place the finite place depth vanishes on the diagonal and is the raw depth at distinct points.✦ The bad places of are the finite places at which the difference of some pair of distinct points is not a unit.✦
Each archimedean place carries the weight , where is for a real place and for a complex one.✦ With the mean under the full sample law, the global cell mass of a subset of is (7)✦ and the potential of a point is the same sum with in place of .✦ For two injective maps , of into , the total cell mass and the total potential collect both coordinates: (8)
Overlap and Potential Scales
On a finite set , is the uniform law on ✦ and the uniform law on its distinct ordered pairs, which gives each pair of distinct points of the mass ✦; and are the means under them, and, for a subset of , is the probability that a -random pair lies in ✦. For a function on the subsets of and a real function on the subsets of , the weighted integral of is .✦ The weighted overlap of two points , of is (9)✦
For two injective maps , of into , with and the uniform laws on all of and , the overlap scale and the potential scale are (10)
Cut Distances
A family of subsets of a finite set is laminar when any two of its members are nested or disjoint.✦
Let be a finite family of subsets of , whose members are the cuts, each member having a real weight . A real weighting of is a real function on . The cut distance of two points , of and the cut cost of two real weightings , of are (11) where is the indicator of and is the total weight of . For a weighting of , the double mean fluctuation of at a point is (12)✦
The Claim
Theorem 1. (a) Let be a finite set of at least three points, a nonnegative function on the subsets of , a real number and a real function on such that for all distinct , . Put and for the uniform laws on . Then every point satisfies (13)✦
(b) Let , and . For each let , with coordinates , into a number field , be a prepared arithmetic model on a vertex set with density , exponents , and error , where , and , and let and be its potential and overlap scales. Then for all sufficiently large (14)✦
(c) Let be a laminar family of subsets of a finite set with weights on its members, let and be probability vectors on , let be a probability vector on for each , and let be a real function on . Then (15)✦
(d) Under the hypotheses of (b), if moreover , the overlap scales do not tend to infinity: (16)✦
In the paper, the result reads: with and a constant , this being inequality (6.1), and along a subsequence with the variance bounds and the tree transport contradict Lemma 6.1 of the paper.
What Is Checked
The claims are stated over fiber systems and prepared graphs with their edges, degrees and heavy counts; ultrametric depths with their cells, giants, transformed families, cell masses and potentials; the randomly rotated and shifted dyadic grid and its sample law; the archimedean and finite place depths of an injective map into a number field, with its bad places and the weights ; the total cell mass and total potential, with the overlap and potential scales built from them; and cut distances, cut costs and double mean fluctuations over a laminar family.
The library proves that the finite place depth and, for every phase and grid sample, the archimedean depth are ultrametric depths, and that an injective map of a finite set into a number field has only finitely many bad places.