The Setting
Let be an integrable vector density on the plane, and let be its total mass; the case of interest is for a real function with compact support. Fix a finest scale and an integer ; the dyadic scale of level is , so that level is the finest and each level doubles the one below it.✦ On each grid, whose vertices are the indices of its grid points, has a mass and a direction at every vertex. A random label, with values in a finite set of unit directions fixed below as the palette, follows these directions from the coarsest grid down to the finest and switches when it strays from them.
The question is whether the label’s switches and its variation in space, charged at each vertex with the mass of there, cost in total at most a constant times , with a constant that does not depend on the number of levels.
Masses and Directions on the Grid
For a scale and an index , the grid point of index is .✦ The tent is the function on ✦, and the bilinear hat of index at scale is the function on given by .✦ The vector mass and the scalar mass of at are the complex number and the nonnegative number (1) and the direction of at is the unit complex number , set to when .✦ The tent interpolation at scale of a real function on is the function on .✦
The box norm of a point is .✦ For , the index box is the set of with and ✦; for , the window of radius around a vertex is the set of with and .✦
The Label Law
A finite circle palette is a finite set of unit complex numbers 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 elements are the palette labels✦, and is their number. The quantization of a complex number of modulus one is a label chosen at distance less than from .✦
Fix a scale . The chosen vertex of a vertex is a vertex of the window , fixed by a choice, at which the scalar mass attains its maximum over that window✦, and the chosen direction at is .✦ The target label of is ✦, and the switch chance of a label at is the following, where denotes the positive part of a real number : (2) where is the thresholded probability at tolerance . The switching rate of at a point is the interpolated chance .✦
A law on a finite set is a probability distribution on it: a nonnegative mass at each element, the masses summing to .✦ Here is the point mass at ✦, and is the expectation of a real function under a law .✦ Given a finite set of labels, an old label , a target label and a chance at every vertex , the spatial transition row at scale and point is the law on the labels with masses (3)✦ The scale transition row from a palette label is the spatial transition row with old label , targets and chances .✦ The initial law is the spatial transition row with old label , targets and chance at every vertex.✦
Along a sequence of radii , the label marginal at a point is the sequence of laws on given by and (4)✦
Switching and Derivative Costs
The row derivative cost of a label at scale and point is .✦ Along the radii , the switching cost and the derivative cost are the real functions on given by , and (5)
Local Suprema and the Cell Cost
The square neighborhood of a vertex at scale is the closed square (6)✦ about the grid point , and the local supremum of a real function on at is (7)✦ The causal dyadic average of a real sequence is the sequence (8)✦
For an integer and radii , the cell cost of a vertex at an index is the number (9)✦
With the number of palette labels, put ✦ and ✦. The packing constant is the number (10)✦
The Claim
Theorem 1. Let and be real numbers, let be a natural number with , and let be an integer. Let be an integrable function that vanishes outside the closed disk , and let be the cell costs (9) of along the radii . Then (11)✦
In the paper, the result reads: for every real and every , , where is the scalar mass (1) of at at the scale , is the paper’s set of grid vertices at level , of scale in its indexing, , , and is an absolute constant independent of .
What Is Checked
The claim (11) is stated over an integrable vector density vanishing outside a disk of radius and the index box with , on which it weighs the scalar masses (1) against the cell costs (9) of the label law along the radii ; these combine the switching and derivative costs (5) through the local suprema (7) over the squares (6) and the causal dyadic average (8), and the constant is the explicit number (10). About these constructions the library proves that every switch chance lies between and and that a real function on attains its maximum on every window .✦ It also proves that a finite circle palette exists.✦