The Setting
Two time windows supply a pair of rank coordinates for a planar sweep. The question is whether the other window ranks have differentiable limits in these coordinates, and which directions their differentials permit at a given time.
An indexed configuration of points is a map . An indexed configuration of points in is in general position when its points are distinct and the orientation determinant is nonzero for three distinct indices.✦ A generic configuration is an indexed configuration in general position that has pairwise distinct first coordinates and distinct slopes for distinct unordered pairs . It also satisfies the following intersection condition: for three distinct unordered point pairs, a point in the open segments of the first two pairs never belongs to the closed segment of the third. Analytic notions on use the maximum norm on the product.
A system of uniform exchange batches at rank and distance consists of sample slopes and marked index sets , for , satisfying (1).✦ Projection separation compares the sweep projection of every marked point with every unmarked point. (1) The sets and in (1) are the leaving and entering points. The exchange graph has edge set and participating vertex set defined by (2). (2) A straight-line graph drawing on is a finite vertex set and a finite set of ordered edges whose endpoints lie in that vertex set, each edge oriented toward larger first coordinate. The exchange drawing of on is the straight-line graph drawing with edge set and vertex set given in (2). Two edges cross when their open segments intersect; crossing pairs count each unordered pair once. A crossing point of a pair of crossing edges is a chosen point in the intersection of their open segments.✦ For a specified edge set , the exterior crossing points are the drawing’s crossing points outside the closed segments of .✦
For , enumerate each leaving and entering set by . The cyclic perfect matching of shift matches a leaving index to the entering index modulo . The batch token transport for a cyclic perfect matching in a batch of is the map that fixes shared marked points and uses the matching on leaving points; the cumulative token transport from the initial marked set of is the composition of the batch token transport maps. An edge token trace for an exchange edge is a choice of a batch, a shift and an initial token occupying the source just before that batch and the target just after it, with the source leaving and the target entering.✦ Fix a chosen trace for each exchange edge. The convex chain owner of an exchange edge is the pair consisting of the shift and initial token index of its chosen trace, with owner for a pair outside .✦ The leaving point enumeration of each batch is a chosen bijection from its leaving points to the indices . The entering point enumeration of each batch is a chosen bijection from its entering points to the indices .
For and a finite test set , a convex chain graph extension of is a family of continuous convex functions on , indexed by chain owners, with bounds satisfying and . Every secant satisfies for . Each exchange segment lies on its owner’s graph, and any point of on a graph lies on an exchange segment with that owner.
Window Ranks and Their Measures
Put . A dyadic time window is a pair of indices with and ; its endpoints and carrier are given in (3).✦ These are cells of the uniform partition, whose boundaries for cells are , . For dyadic time windows and , write when .✦ (3) For , the batch midpoint times are .✦ The starting and stopping indices of a dyadic time window in a batch system are the numbers of batch midpoint times strictly below and , respectively. The batch count of a dyadic time window is the difference between its stopping and starting indices, truncated at zero.✦ The time window system for a batch system and a dyadic time window is the consecutive batch window of starting at the starting index of and having the batch count of as its length; its samples are the corresponding consecutive samples of .✦ Denote its edges and vertices by and . The time of an exchange edge is the midpoint time of its chosen trace’s batch.✦ For dyadic time windows and , let be the crossing edge pairs with one edge in and one in , and let be their crossing points in the exchange drawing.
A convex graph family of size consists of continuous convex functions and a scale .✦ For a convex graph family with scale , the vertical graph rank and smoothed rank coordinate are functions on given in (4), where denotes the logistic sigmoid. For the smoothed coordinate lies in and is the family’s -valued rank coordinate; for its value is zero. The flat family of size is the convex graph family whose graphs are all zero and whose scale is one.✦ (4) A generic batch configuration consists of a generic and a batch system with .✦ For a generic batch configuration and a dyadic time window , the window rank graph family of at is a convex graph family of size . The configuration rank label of a point for a generic batch configuration is the function assigning to each dyadic time window the rank coordinate of the window rank graph family of at , evaluated at .✦ Thus belongs to the window label space , where is the set of dyadic windows; write for the coordinate of a label .✦
For a finite family in a measurable space, the weighted atomic measure is , with .✦ A vertex labeling gives the normalized vertex measure by weighting each participating vertex by ; its label and time measure weights each edge by at its source label and edge time, where . For dyadic windows and a map to a measurable space, the window crossing point measure is the finite measure on with weight at for each crossing pair , where . For rank labels, the empirical point measure , window vertex measures , edge-time measure , time restrictions and crossing label measures are the measures in (5). (5) A limiting rank measure family consists of finite measures on and on .✦ A sequence of generic batch configurations converges jointly to a limiting rank measure family when all the weak convergences in (6) hold, for every window and pair .✦ The label marginal of is denoted by . (6)
Signed Coordinates and Direction Parameters
For windows , the signed coordinate pairs and are the points in (7).✦ The sign will correspond to windows before both and , and to windows after both. Write for the first coordinate reflection and for the reflected rank chart in (7). (7) For maps and , their monotone rank extension is the supremum in (8), with the coordinatewise order.✦ For a generic batch configuration , a dyadic time window and a sign , the configuration rank extension is the monotone rank extension formed from the signed rank pair of and its coordinate.✦ (8)
Definition 1. Let be an invertible linear map of , let be real linear forms, and let be real time endpoints. The admissible projective parameter set for the linear map , linear forms and time endpoints at time is the subset of defined by (9), using the simplex representative . (9)✦
The Claim
Theorem 1. Let be generic batch configurations with batch counts , converging jointly to a limiting rank measure family, with . Let and let be a countable family of windows. Choose with for every , or with for every . There are strictly increasing indices and functions satisfying (10) for every . (10)✦
Let instead be any sequence of generic batch configurations with , and let and be any family with . Suppose is differentiable almost everywhere for each and satisfies the joint limit in (10) along the full sequence with . At a point where every is differentiable, and for with , the conclusion is (11), where is the differential at . (11)✦
In the paper, the result reads: choose separated dyadic windows and a set of positive -measure where for the conditional time measures , then restrict further so that for disjoint ; in the chart , the bounded coordinatewise monotone limits , for , are differentiable and satisfy after null sets are discarded; for in the interior of , the set consists of unit directions in the common signed quadrant satisfying for strictly before and for strictly after , with strict separation requiring a positive time gap.
What Is Checked
The rank limit assertion is stated over joint weak limits of generic batch configurations and their signed rank extensions; the direction assertion is stated over the full sequence of extensions and simultaneous differentiability points in the reflected chart. The exchange edges satisfy the endpoint condition of the exchange drawing✦, and, for , every exchange edge has a token trace.✦