The Setting
An exchange batch joins points leaving a rank set to points entering it during a planar sweep. Rank labels assign each point one coordinate for every dyadic time window. The associated measures record all points, the vertices participating in a window, edges with their batch times, and crossing points.
A configuration is in general position if it is injective and no three of its points are collinear✦; the orientation of three points is given by the determinant .✦ A generic configuration is a configuration in general position with distinct first coordinates and distinct slopes for distinct unordered point pairs, represented by . It also satisfies the following condition: an intersection of the open segments of two distinct pairs belongs to no closed segment of a third distinct pair.
A uniform exchange system of rank and distance on consists of strictly increasing slopes and marked index sets of size . Writing the coordinates of each point as , projection separation means that whenever and .✦ The leaving and entering sets, and the exchange graph, are defined by (1); the distance condition is . (1) The exchange graph drawing places at its images under and draws each edge as a straight segment, oriented from smaller to larger first coordinate.✦ Two edges cross when their open segments intersect✦; the crossing pairs count each unordered pair once✦, and a chosen crossing point lies in both open segments.✦
The sweep projection of a point at a real slope is the real number .✦
For a straight-line graph drawing and a finite set of ordered pairs of point indices, the exterior edge crossing points form the finite set of crossing points of exterior to .✦
A generic batch configuration consists of a generic configuration and a uniform exchange system on , with .✦ Its edge and crossing normalizations are respectively (2). (2)
Windows and Rank Labels
A dyadic window is a pair of integers with and .✦ Its carrier is the cell in , with the right endpoint included for the last cell.✦ Write for the set of these windows. The batch midpoint time , the number of earlier batch times, and the window’s starting and stopping indices are defined by (3). (3) The time window system is the consecutive subsystem starting at and containing batches.✦ A window precedes a window when the upper boundary of is at most the lower boundary of .✦
For finite sets of size , enumerations and define the cyclic perfect matching for each shift .✦ Applying this to the leaving and entering enumerations gives a batch perfect matching.✦ The induced transport fixes shared points and matches the remaining points; its inverse fixes shared points and uses the inverse matching.✦ For each matching number and stage , the cumulative token transport is the bijection from to obtained by composing the successive batch transports for , starting with the identity at stage zero; its value at an initial token is that token’s state at stage . An edge token trace specifies a batch , a matching number and an initial token whose states before and after are the leaving and entering endpoints of the edge.✦ For an exchange edge , write for the batch of a chosen edge token trace. The convex chain owner of an exchange edge is its trace’s matching number together with its initial token index.✦
A convex graph family is a finite family of continuous convex functions with a positive scale .✦ The flat family has every and scale .✦ The vertical graph rank and the smoothed rank coordinate of are given by (4), where is the number of functions in the convex graph family and is the sigmoid function. (4) The unit interval rank coordinate takes values in . For each window , the system assigns a rank graph family of functions. Write its rank coordinate as . The window rank label of a point is the element of the label space defined by (5). (5)
A full convex chain graph extension consists of continuous convex functions, indexed by the chain owners, with secant slopes between bounds . Each exchange segment lies on its owner’s graph. For a specified finite set , a full convex chain graph extension is clean on when any point of on one of its graphs lies on an exchange segment with that graph’s owner.
Finite Measures and Limiting Data
A weighted atomic measure on a finite indexed family assigns weight to each index, so it is .✦ Let be the vertex set of . The full point label measure , the window vertex measure , and the edge label and time measure are defined by (6). An edge’s batch time is ✦, and its label is taken at its source endpoint. (6) The time-restricted edge measure is the restriction of to , using the window’s carrier.✦ Let be the window crossing edge pairs for , and let be the chosen crossing point of . The window crossing label measure is defined by (7). (7)✦
Limiting measure data consist of finite measures , and on , together with and on , for every window and every pair .✦ For a sequence of generic batch configurations with point counts and exchange distances , joint convergence means the simultaneous weak convergences in (8) for every dyadic window and every pair of dyadic windows. (8)✦ The edge label marginal and the window edge marginal are the pushforwards in (9), where . The conditional edge time kernel is the conditional kernel of given its label coordinate.✦ For windows , write . (9)
The Claim
Theorem 1. Every sequence of generic batch configurations has a strictly increasing map and limiting measure data satisfying (10). (10)✦ For any jointly convergent sequence whose batch counts tend to infinity, every dyadic window and measurable set satisfy (11). (11)✦ If also , then every pair of windows preceding satisfies (12), where is planar Lebesgue measure. (12)✦
In the paper, the result reads: under the preceding extremal setup, weak limits of vertex weights , participating-vertex weights , edge weights with batch time, and crossing weights are , , and ; with , and , the measures are probabilities, , the time marginal of is Lebesgue measure, , a conditional-time probability satisfies , and for disjoint the projection of is dominated by planar Lebesgue measure.
What Is Checked
The claims are stated over sequences of generic planar configurations equipped with uniform exchange batch systems, with positive point counts, batch counts and exchange distances, and over their five families of finite measures and limiting measure data. The disintegration identity assumes that the batch counts tend to infinity; the crossing bound also assumes that the chain normalizations tend to infinity and that the first window precedes the second. Every exchange edge has an edge token trace.✦ Both endpoints of every exchange edge belong to the exchange graph’s vertex set.✦