The Setting
A rank sweep produces exchange edges when points leave and enter its marked set. The measures here record the rank labels of their initial endpoints and of the points where edges from different time windows cross.
An -point configuration is a map . For planar points , the orientation determinant and the slope are defined by (1). (1) A configuration is in general position when is injective and the orientation determinant is nonzero on every triple of distinct indices. A generic configuration is a configuration in general position whose first coordinates are pairwise distinct and whose unordered point pairs, represented by , have pairwise distinct slopes. A generic configuration also satisfies the following condition: a point in the common interior of two distinct point-pair segments belongs to no closed segment determined by a third point pair distinct from both.
The sweep projection and the directed set distance between finite sets of point indices are given by (2). (2) A marked set is separated at slope when for every and .✦ Uniform exchange batches of rank and distance are increasing sample slopes with separated marked sets , each of size , satisfying .✦ A generic batch configuration consists of such a system on a generic configuration, with positive.✦
A rank sweep sequence has increasing sample slopes and separated marked sets of size , with directed distance at most one between successive marked sets.✦ The critical slopes of are the slopes of its distinct point pairs.✦ A critical slope traversal is an increasing list of cuts whose interior cuts are exactly those critical slopes; the canonical traversal lists them in order with one additional cut at each end. The intercritical sample slopes of a critical slope traversal are the midpoints of its consecutive cuts.✦ For generic and , the canonical rank sweep is the rank sweep associated with this traversal.✦ A batch embedding into that sweep is a strictly increasing selection of its states with marked sets ; it requires .✦
Write . A dyadic time window is a pair , with and ; let be the set of these windows.✦ For a uniform partition into cells, the boundary with index , from zero through , is , and each cell is left-closed and right-open except the last, which includes . The carrier of is the cell in (3). (3)✦ Batch has midpoint time as in (4). For any finite family of ordered times , the earlier-time count is the number strictly below .✦ The starting index , stopping index , and batch count of a window are also defined in (4), where and are its boundaries. (4) A consecutive batch window starting at with length , where , retains the slopes and marked sets at stages through .✦ For a batch system , the time window system is the consecutive batch window with and .✦
Exchange Graphs and Rank Labels
The leaving and entering sets , exchange edge set , and participating vertex set of a batch system are defined by (5). (5) A straight-line graph drawing on is a finite vertex set and a finite set of ordered edges whose endpoints are vertices, each directed toward increasing first coordinate. The exchange graph drawing uses and .✦ Two edges cross when their open segments intersect.✦ The crossing edge pairs of a drawing count each unordered pair once, and a chosen crossing point lies in their common interior. Relative to a specified edge set, exterior crossing points are the drawing’s crossing points outside the closed segments of that set.✦
Choose enumerations and . For each cyclic shift , the batch perfect matching sends each to .✦ The matching-induced transport between marked sets fixes shared points and sends each leaving point to its matched entering point.✦ Cumulative token transport starts with the identity on and composes these transports through successive batches.✦ An edge token trace of is a batch , a shift , and an initial token which occupies before the batch and after it.✦ A chosen trace assigns an edge its batch time and its convex chain owner ; the owner of a pair outside is .
Convex chain graph extensions relative to a finite planar set are continuous convex functions on , with common secant slope bounds satisfying . Their secant bounds are those in (6), and every exchange edge lies on the graph assigned to its owner. A point of on a graph must lie on an exchange edge assigned to that graph. (6)
A convex graph family of size is a family of continuous convex functions with a positive scale .✦ The flat convex graph family is a family of zero functions with scale one.✦ For graph functions , the vertical rank counts the graphs strictly below a point, and its smoothed coordinate uses the real sigmoid function, as in (7). (7) The smoothed coordinate is defined for any real scale, with division by zero assigned value zero; it is zero for . For a convex graph family of positive size, the unit-interval rank coordinate of a planar point is its smoothed coordinate and belongs to .✦
The window rank graph family of at is a convex family of size . The window label space is .✦ The configuration rank label assigns to each point its window rank coordinates, as in (8). (8)✦
Measures and Their Limits
For a finite family in a measurable space and a nonnegative weight , the weighted atomic measure is .✦ The edge normalization is , and the chain normalization is . For windows , let be the exchange drawing’s crossing edge pairs with one edge in each window, and write for the chosen crossing point of .
The empirical point label measure and participating-vertex measure of a generic batch configuration use weight per point. The edge label and time measure uses initial-endpoint labels and batch times; its time restriction at is . The crossing label measure applies to the window crossing points. These measures are given by (9). (9) More generally, the window crossing point measure uses the last formula with any measurable-space labeling of planar points in place of ; the normalized vertex measure and label and time measure likewise allow any labeling of point indices.
Limiting rank measures are finite measures on and on , indexed by the indicated windows.✦ A sequence of generic batch configurations converges jointly to these measures when all the weak convergences in (10) hold, for every fixed window or pair of windows. (10)✦ The window edge label measure is the label marginal of .✦ Writing for the label projection, its definition is (11). (11)✦ For a window , the disjoint subwindow pairs form the countable set in (12). (12)✦
The Claim
Theorem 1. Let be generic batch configurations with parameters , each admitting a batch embedding into its canonical rank sweep. Suppose their measures converge jointly as in (10) and . Put . Assume that for some the bounds in (13) hold, with the inequality valid for every . (13) For every dyadic window , the absolute continuity statement (14) holds. (14)✦
In the paper, the result reads: in the same setup, for every window , over disjoint dyadic subwindows of , where the sum specifies null sets, equivalently every Borel set null for all these crossing measures satisfies .
What Is Checked
The claim is stated over generic uniform exchange batches embedded in canonical rank sweeps, their joint measure limits, and the bounds in (13) with . For positive exchange distance, every exchange edge has a token trace.✦