The Setting
A scheduling recursion maintains a finite list of job sets inside a current window. Flattening changes the distinguished entry of this list to a union with a rank suffix. The quantity of interest is the set of jobs covered inside the window.
Let be a set of jobs, let be a window, and let be a rank. The rank upper tail at threshold is the job set in (1). (1)✦ A global list on is a family of job sets with a finite set of listed indices.✦ The global entry union of a global list on is the job set defined in (2). (2)✦
Descriptions and Run Certificates
An atomic family is an assignment of a job set to each index in a set . A Boolean structural formula over is a positive or negative leaf at an index , or a conjunction or disjunction of two such formulas.✦ The interpretation of a Boolean structural formula over in the atomic family is the job set obtained by assigning to a positive leaf and to a negative leaf, and assigning intersection to conjunction and union to disjunction.✦ The leaf count of a Boolean structural formula over is the natural number equal to one for a leaf and to the sum of the two constituent counts for either operation.✦
A bounded description of a job set with allowance is a formula satisfying (3); write for the existence of such a formula. (3)✦
A rank threshold run certificate for consists of base sets , thresholds , and a distinguished second set satisfying (4), together with the following coverage and pairing conditions. Every job in belongs to . Whenever zero is listed, each job in belongs to and requires that one is listed. (4)✦ The flattened entry of is the job set defined in (5). (5)✦
The Claim
Theorem 1. Let and . Suppose that , , and . Then (6)✦ For any rank threshold run certificate for , its flattened entries satisfy (7)✦
In the paper, the result reads: if a run begins at an initial threshold by switching out of with entries and , where , and is a later parent at which the entry descended from the first switch entry survives an unpruned carry with current threshold , then the carried portion of the pair agrees on with .
What Is Checked
The pair identity (6) is stated over arbitrary job sets with a natural-number rank, and the union identity (7) is stated over finite global lists equipped with the base descriptions, coverage, and pairing conditions of a rank threshold run certificate.