The Setting
Take a real function with compact support on the plane, identified with , so that gradients are complex numbers. For a point and a radius , the signed disk average of is the mean of itself, not of , over the open disk : (1)✦ The radius envelope of a family of functions over radii is its pointwise supremum on that closed interval.✦ For the disk averages of , the radius envelope over is the signed finite-radius envelope of , defined by (2) a centered maximal function of truncated to the radii in .
The question is how large can be when is a union of dyadic bands of radii . Proposition 1.2 of the OpenAI preprint An Endpoint Gradient Bound for the Centered Disk Maximal Operator is assembled from local data, one band at a time: bounds for the gradients of the disk averages at distinguished radii of each band, and a random direction from a finite palette whose law changes from one dyadic level to the next.
Radii and Majorants
Along a sequence of radii , the index of is its level, and the run envelope from level to level is .✦ A halving sequence is one with for every , so that level is the coarsest. For a finest scale , the dyadic scale of level is ✦, and the geometric grid of depth is the halving sequence ✦. Its index carries the dyadic scale of level .
Fix a point and a scale . A physical neighborhood radius of at and scale is a radius such that for every with .✦ A physical endpoint radius of at and scale is a radius that equals or or maximizes over .✦
A finite circle palette is a finite set of points of the unit circle in such that every point of the circle lies at distance less than from one of them.✦ The fixed palette is one finite circle palette chosen once and for all✦, and its points are the palette labels✦. The quantization of a complex number of modulus one is a palette label at distance less than from , likewise chosen once and for all.✦
For and a real number , the cone axis is ; for a palette label , the axes and are the unit vectors at angles from .✦ The unfavorable cone part of a vector relative to a palette label is (3)✦ where is the Euclidean inner product and .
Write for the gradient at of , the radius held fixed. Let be a scale, a family of nonnegative functions on indexed by the palette labels, and a nonnegative function on ; write for the function on the palette labels. The pair is a pair of majorants of at scale if, for almost every ,
for every palette label and every physical neighborhood radius of at and scale ;
for every physical endpoint radius of at and scale ;
for all radii and in .
The Label Law and Its Costs
A law on a finite set is a probability distribution on it: a mass for each , with .✦ The point mass is the law with mass at and elsewhere.✦ The expectation of a real function on under a law is .✦
The tent is the function on .✦ For a scale and a vertex of , the hat of at scale is the function on ✦, and the tent interpolation of a real function on is the function on ✦.
Fix a complex function on and a scale . The vector mass of at a vertex is ✦, and its scalar mass there is ✦. The mass direction at is the unit complex number , or when .✦
The window of radius around a vertex is the set of vertices with and ✦, and a maximizing vertex of a real function on in is a vertex of the window where the function attains its maximum over it, chosen once and for all✦. The chosen vertex of a vertex is the maximizing vertex of the scalar mass in .✦ The chosen direction at is ✦, and the target label of is its quantization ✦.
With the angular tolerance , the switch chance of a palette label at a vertex is the thresholded probability of the distance from to : (4)✦
Let be a finite set and an old label, and give each vertex a target and a chance . The spatial transition row at scale and point is the law on with masses (5)✦ The scale transition row from a palette label is the spatial transition row with old label , targets and chances , all at scale .✦ The initial law of at scale and point is the spatial transition row at scale and point with old label , targets and chance at every vertex.✦ The switch rate of a palette label at is ✦, and its row derivative is , with the gradient taken in and the sum over all palette labels ✦.
Along a sequence of radii , the label marginal of is the sequence of laws on the palette labels in which is the initial law at scale and (6)✦ The switch costs and the derivative costs of along are the functions on given by (7) For an integer , called the endpoint level, the boundary cost of along is for and . The causal dyadic filter of a real sequence is the sequence .✦ The point cost of at level for the endpoint level is (8)✦
A row jet on a finite set with values in a real inner product space is a law on together with vectors , one for each , whose sum is zero.✦
The Claim
Theorem 1. Let be a real function with compact support on , a complex function on , a halving sequence of positive radii, and an integer. For every level , let be a pair of majorants of at scale , with every and integrable when . Then, for the label marginal and the point costs of along , the run envelope from level to level satisfies (9)✦
Theorem 2. Let be a real function with compact support on , a finest scale, an integer, and the geometric grid of depth . For every level , let be a pair of majorants of at the dyadic scale , with every and integrable. Then, for the label marginal and the point costs of along the grid, the run envelope from level to level of the grid satisfies (10)✦
Theorem 3. Let be a finite set, a real inner product space, and with the vectors a row jet on with values in . For every family of vectors of and every vector , (11)✦
What Is Checked
The claims (9), (10) and (11) are stated over the signed disk averages (1) of a real function with compact support and their radius and run envelopes, the dyadic scales and the geometric grid, the physical neighborhood and endpoint radii, the unfavorable cone parts (3) along the axes of the labels of the fixed palette, the label marginal (6) built from the hats, masses, directions, targets, switch chances and transition rows of , the costs (7) and point costs (8) with the causal dyadic filter, and row jets on a finite set. Of these constructions, the library proves that a finite circle palette exists✦ and that a real function on a window of attains its maximum there✦. It also proves that every switch chance lies between and .