The Setting
A planar rank sweep marks the points with the smallest values of the projection as the slope increases. Grouping its exchanges into batches gives a straight-line graph and rank coordinates indexed by dyadic time windows. The question concerns the derivatives of these coordinates inside a window carrying positive conditional edge mass.
An -point configuration is a map . A configuration in general position is an -point configuration in which is injective and no three distinct points are collinear, with orientation determinant .✦ A generic configuration is an -point configuration in general position with distinct first coordinates and distinct slopes for distinct unordered pairs , satisfying the following intersection condition: a point in the open segments of two distinct unordered pairs lies on no closed segment of a third distinct pair.✦
Batches and Time Windows
A marked set separated at slope is a set of point indices of a configuration for which for every and .✦ A rank sweep sequence consists of increasing sample slopes and separated -element marked sets, with directed set distance at most one between successive sets.✦ The critical slopes are the slopes of distinct point pairs.✦ A traversal of the critical slopes of a configuration is an increasing list of cuts whose interior cuts are those slopes, with one cut below and one above them; intercritical samples are the midpoints of successive cuts. For a generic configuration and , the canonical sweep is the rank sweep on this canonical traversal.✦
Uniform exchange batches on consist of increasing slopes and separated marked sets satisfying (1).✦ The leaving and entering sets of batch are and , respectively. (1) A generic batch configuration is a generic point map on points with and a system of uniform exchange batches satisfying (1).✦ An embedding into the canonical sweep is a strictly increasing selection of sweep states whose marked sets are ; it requires .✦
The exchange edges form , and the exchange vertices are all their endpoints. A straight-line drawing has a finite vertex set and ordered edges with endpoints in that set, each directed towards larger first coordinate; the exchange drawing uses these exchange vertices and edges. Two edges cross when their open segments intersect.✦ The crossing pairs of a straight-line drawing are its unordered pairs of crossing edges, each counted once, and a crossing point is a chosen point of their common interior. Exterior crossing points relative to an edge set are crossing points outside its closed segments.✦
Choose enumerations of each and by the cyclic indices of size . The cyclic perfect matching with index matches indices differing by modulo .✦ The transport induced by a cyclic perfect matching between successive marked sets is the bijection that fixes their common points and applies the matching to the leaving points.✦ For a fixed matching index and a stage , cumulative transport is the bijection from to obtained by composing the batch transports with matching index through the first batches; at stage zero it is the identity.✦ An edge token trace records a batch, a matching index and a point of the initial marked set, called an initial token, whose positions immediately before and after the batch are the leaving and entering endpoints of the edge.✦ The convex chain owner of an exchange edge is the matching index and initial token index of a chosen edge token trace, with owner assigned to a nonedge.✦
Convex chain graph extensions, relative to a finite set of planar points, are continuous convex functions and bounds satisfying (2). Every exchange segment lies on its owner’s graph, and every point of on a graph belongs to an exchange segment with that owner. (2)
Put . A dyadic window is a pair of integers with and ; its time interval is the uniform partition cell in (3). For a dyadic window , a subwindow of is a dyadic window whose time interval is contained in .✦ (3) Batch has midpoint time .✦ The starting and stopping indices of count the batch times strictly below its left and right boundaries, respectively. The batch count of a dyadic window is its stopping index minus its starting index.✦ A consecutive batch window with start and length , where , retains the original slopes and marked sets at indices ; the time window system uses these starting and stopping indices. An edge’s time is the midpoint time of the batch in its chosen token trace.✦
Rank Labels and Limiting Measures
A convex graph family of size consists of continuous convex functions and a scale .✦ The flat family is a convex graph family with and .✦ The vertical graph rank of a convex graph family at counts those graphs strictly below .✦ The smoothed rank coordinate and the vertical rank are given by (4); for an empty family the smoothed coordinate is zero. (4) The window rank graph family of a generic batch configuration has graphs. For a generic batch configuration, the rank label is the function defined by for every dyadic window , where is the unit interval rank coordinate of that window’s rank graph family.✦ The resulting rank label belongs to the window label space , where is the set of all dyadic windows.
A weighted atomic measure is for a finite index set , a nonnegative weight and points in a measurable space.✦ For a batch configuration, put and . Let be the vertices participating in its time window system, and let be the crossing pairs with an edge in each of the windows , with chosen crossing point . The empirical point label measure and participating-vertex measure , together with the edge-time measure , its time restrictions and the crossing label measures , are defined by (5); the vertex normalization uses the full point count. (5)
Limiting rank data consist of finite measures and on the respective spaces in (5).✦ A sequence of generic batch configurations has joint convergence to these data when all five weak convergences in (6) hold, for every choice of windows.✦ (6)✦ Here superscript denotes the finite measure of the th configuration.
The edge label marginal is , where .✦ The conditional time law is the conditional kernel of from to ; write .✦
Differentiable Coordinates
The signed coordinate pairs of are and .✦ For fixed windows and a label , use the first signed coordinate pair to define the rank coordinate point in (7).✦ Given a window , let be a function for each . At points of differentiability, denotes its real derivative, a linear form on . (7)✦
For the th batch configuration, denote its parameters by , and put and . The scale bounds used in the rank assertion are (8), with a constant . (8)
The Claim
Theorem 1. Let be a measurable space with a measure , let be measurable, and let be a countable family of measures. Let be measurable coordinate maps. Suppose the domination conditions (9) hold, where is planar Lebesgue measure. (9) Let , let , and let . Assume that, for every and , and is differentiable at . For -almost every with , (10)✦
Let a sequence of generic batch configurations have embeddings into their canonical sweeps, joint convergence (6), and the bounds (8). Fix dyadic windows and functions as above. For -almost every label at which every , , is differentiable at and satisfies , each with satisfies (11)✦
In the paper, the result reads: in the preceding positive chart on a set of labels, after deleting a further -null set, every has the property that each dyadic with contains disjoint dyadic subwindows with .
What Is Checked
The nonsingularity assertion (10) concerns countably many measurable planar coordinates with the domination conditions (9); the rank assertion (11) concerns the joint limits of generic sweep batch configurations and differentiable subwindow coordinates at the signed rank point (7).
Every exchange edge has a token trace.✦ The unit interval rank coordinate of a convex graph family of positive size lies strictly between zero and one.