The Setting
For a chosen rank , an increasing slope sweep at slope selects the lowest points in the projection of a point with planar coordinates . Sampling the sweep in batches records exchanges of marked points. Each exchange edge receives a time and a label consisting of its rank coordinates in all dyadic time windows. The limiting edge measure has a conditional time law at each label.
The plane is , and a configuration of points is an indexed map . For points in , the orientation determinant and the slope of the pair are given by (1). (1) A configuration in is in general position if its points are distinct and no three are collinear.✦ A generic configuration in is a configuration in general position that has distinct horizontal coordinates and distinct slopes for distinct unordered pairs, and satisfies the following condition: for three distinct unordered pairs, represented by , and , a common point of the first two open segments does not belong to the third closed segment.✦
A system of uniform exchange batches on , with parameters , consists of strictly increasing slopes and marked index sets satisfying (2).✦ Projection separation means the strict inequality there✦; the directed set distance from to is .✦ A generic batch configuration has , a generic point configuration and such a batch system.✦ (2)
The critical slopes are the slopes of all distinct point pairs.✦ A critical slope traversal of a finite set of real slopes is a strictly increasing list of cuts whose interior cuts are precisely the members of .✦ The canonical critical slope traversal of a finite set of real slopes lists in increasing order between one additional cut below all its members and one above them.✦ In any critical slope traversal, each intercritical sample slope is the midpoint of two consecutive cuts.✦ A rank sweep sequence of a configuration is a sequence of strictly increasing sample slopes together with separating marked sets of size , with directed set distance at most one between successive marked sets.✦ For a generic configuration and , the canonical rank sweep has one more state than the number of interior cuts. Writing for the marked set at sweep state , a batch embedding of a rank batch system into its canonical rank sweep is a strictly increasing map from the batch sample indices to sweep states, with the mark matching in (3); the embedding also requires .✦ (3)
Time Windows and Exchange Edges
Write . A dyadic time window is a pair of integers with depth and .✦ For , the uniform partition boundaries are ✦; its cells and the carrier of a window are defined by (4). (4) The batch midpoint time is .✦ For any finite ordered family of times , let be its number of earlier times.✦ The window starting index , stopping index and batch count are given by (5), with subtraction truncated at zero. A consecutive batch window of a batch system, starting at with length and satisfying , is the subsystem consisting of the slopes and marked sets at indices ✦; the time window system uses and .✦ (5)
The leaving and entering index sets of batch are and in (6). The exchange edges form the set there, and the participating vertices form . Put and for the edge and chain normalizations, respectively. (6)
Chosen enumerations of and by the cyclic indices modulo give a perfect matching for each shift : an index numbered is matched to the entering index numbered .✦ The transport induced by a matching between two marked sets is the map that fixes their shared points and sends each leaving point to its matched entering point.✦ For a fixed shift and a stage , the cumulative token transport from to is the bijection obtained by composing the first batch transports with shift , starting with the identity at stage zero.✦ An edge token trace for an exchange edge is a choice of a batch , a shift and an initial token whose positions just before and after that batch are and , with and .✦ Choose one trace for every exchange edge.✦ For an exchange edge , the batch in its chosen trace determines its edge time , and the shift and initial token in that trace determine its convex chain owner. The owner of a pair outside is .
A straight-line graph drawing is a finite graph drawn by straight segments, with each edge oriented towards increasing horizontal coordinate and both endpoints in the vertex set.✦ The exchange drawing uses and .✦ Two edges cross when their open segments intersect.✦ Crossing edge pairs count each unordered pair once✦, and a chosen crossing point lies in their common interior.✦ The set of crossing pairs for windows and consists of unordered pairs of crossing exchange edges with one edge in each window✦; write for the chosen crossing point of a pair .✦ The exterior crossing points of a straight-line graph drawing relative to an edge set are its crossing points outside the closed segments represented by that set.✦
Window Rank Labels
For a generic batch configuration with chain normalization and a finite test set , full convex chain graph extensions consist of a family of continuous convex functions and bounds satisfying (7). Each exchange segment lies on the graph assigned by its convex chain owner. Every point of on a graph belongs to an exchange segment assigned to that graph. (7)
A convex graph family of size consists of continuous convex functions on and a scale .✦ The flat convex graph family of size consists of zero functions and has scale one.✦ For arbitrary real graph functions and a real scale , the vertical graph rank counts graphs strictly below ✦, and the smoothed rank coordinate uses the real sigmoid, as in (8).✦ The smoothed coordinate is zero when . For a convex graph family of positive size, the unit-interval rank coordinate of a point is the smoothed coordinate regarded as a point of .✦ (8)
Each dyadic window of a generic batch configuration has an associated convex rank graph family of size . The window label space consists of functions from the set of dyadic windows to .✦ The configuration rank label is the window rank label defined by (9).✦ (9)
Measures and Limits
A weighted atomic measure on a measurable space is a measure of the form , where the points form a finite indexed family in and is a nonnegative weight.✦ Write for the participating vertices of the time window system. The empirical point label measure , window vertex label measure , edge label and time measure , time-restricted edge measure , and crossing label measure are the finite measures in (10). The normalized vertex measure and the label and time measure allow arbitrary vertex labels in a measurable space; the former is zero when . The window crossing point measure allows an arbitrary planar labeling in the last sum. (10)
Limiting rank data consist of finite measures and on , and on .✦ A sequence of generic batch configurations converges jointly to when all five families converge weakly as specified in (11), for every fixed choice of windows.✦ (11) The edge label marginal is the pushforward in (12).✦ The conditional time kernel of is the family of conditional time laws on obtained by conditioning on its label in .✦ (12)
The Claim
Theorem 1. Let be generic batch configurations with parameters , admitting batch embeddings into their canonical rank sweeps and converging jointly to limiting rank data . Suppose . Set , and suppose there is a constant such that for every , while . Then (13)✦
In the paper, the result reads: in the same extremal limiting setup, is nonatomic for -almost every label .
What Is Checked
The claim (13) is stated over generic uniform exchange configurations, their sweep embeddings and the joint limits of their window measures, under the specified coefficient bound and vanishing error. The unit-interval rank coordinate of a positive convex graph family lies strictly between zero and one.