The Setting
Fix a function , the vector density; in the main argument it is the gradient of a real function with compact support. Over a sequence of radii , indexed from the coarsest level , every point of the plane carries a random label: a unit direction from a finite palette, drawn at the coarsest level from the grid vertices around , and then, from one level to the next, kept or switched toward the directions of the mass of seen at nearby vertices of the finer grid. Two costs measure this label law at and level : how likely a switch is, and how fast the transition rows change as moves, in units of the radius.
The question is how these costs at are controlled by what happens at a nearby point : by the switch costs at and by the direction energies of grid vertices close to both points, with the coarser levels weighted by powers of .
Grids, Masses and Directions
The box norm of a point of the plane is , and the tent is the function on .✦ For a scale and a vertex of , the grid point of is ✦, and the bilinear hat of is the function on the plane given by (1)✦ The tent interpolation at scale of a real function on is the function on the plane, to which only the finitely many vertices whose hats do not vanish at contribute.✦
The vector mass of at a vertex and scale is the complex number ✦, and its scalar mass is the modulus .✦ The mass direction at is the direction of the vector mass: the unit complex number , and when .✦
The window of radius around a vertex is the square of vertices.✦ A maximizing vertex of a real function on is a vertex of the window at which attains its maximum over the window, chosen once and for all.✦ The chosen vertex of a vertex is the maximizing vertex of the scalar mass on ✦, and the chosen direction at is ✦. The worst vertex of is the maximizing vertex of on .✦ The direction energy of a vertex at scale is the value of this function at the worst vertex of , that is, its maximum over : (2)✦
The Label Law
A finite circle palette is a finite set of points of the unit circle such that every point of the unit circle lies at distance less than from one of them.✦ One such palette is fixed once and for all✦; its points are the palette labels.✦ The quantization of a complex number of modulus one is a label at distance less than from , chosen once and for all✦, and the target label of a vertex at scale is .✦
A law on a finite set is a probability vector on it: a nonnegative mass at each element, the masses summing to .✦ The point mass at an element gives mass to and to every other element.✦ The expectation of a real function on under a law is ✦, and the distance of two real functions and on is .✦
The thresholded probability of a distance at a tolerance is .✦ The switch chance of a label at a vertex and scale is (3)✦
Given an old element of a finite set , a target and a chance at each vertex of , the spatial transition row at scale and point is the law on with masses (4)✦ The transition row from a label is the spatial transition row on with old label , targets and chances .✦ The initial law at a point and scale is the spatial transition row on with old label , targets and chance at every vertex.✦
The label marginals along the radii at a point are the laws on defined from the coarsest level by (5)✦
The Costs
The switch rate of a label at a point and scale is the interpolated switch chance ✦, and the row derivative of at and scale is the number ✦. The switch cost and the derivative cost are the sequences of functions on the plane given by (6)✦ (7)✦
For vertices of , the energy rate at a point is the sequence (8)✦
The causal dyadic filter takes a real sequence to the sequence with and ; its terms are (9)✦
The comparison constant is , where is the number of labels✦, and the spatial constant is ✦.
The Claim
Theorem 1 (Spatial comparison). Let and real numbers be given, with their label marginals and costs and , and let and be points of the plane.
Let and let be vertices of such that, for every , , and . Then (10)✦ If moreover for every and , then (11)✦
Let and let be a vertex of such that , and . Then (12)✦ and (13)✦
In the paper, the result reads: for a particle, a level and a point , and with , one has for , the bound on holding almost everywhere, with uniform over particles, and ; the paper’s levels are the levels here.
What Is Checked
The claim is stated over the hats and tent interpolation of the grids , the vector masses of with their directions, the chosen directions and direction energies of the vertices, the fixed palette with its quantization and target labels, the transition rows, initial laws and label marginals built from the switch chances, the switch and derivative costs, the energy rate, the causal dyadic filter and the constants and .
The library proves that a finite circle palette exists✦ and that every real function on a window attains its maximum there.✦ It also proves for every label , vertex and scale .