The Setting
A global list in a scheduling computation retains sets of jobs as the current window changes. The relevant entry size is its Boolean formula leaf count. A rank threshold run certificate records descriptions of base sets separately from the rank cutoffs applied to them.
Let be a job set, a window, and a rank function. The rank upper tail of a rank function at a natural-number threshold is the subset of defined in (1). (1)✦
Descriptions and Global Lists
An atomic assignment on a job set is a family of subsets of , indexed by an atom set , with assigned to each atom . A Boolean structural formula over is an expression generated by (2), where negation is allowed only at a leaf. (2)✦ For Boolean structural formulas and over and an atomic assignment on , the interpretation is a subset of and the leaf count is a natural number, both defined by (3). (3) A description of a job set under an atomic assignment is a Boolean structural formula whose interpretation is ; the assertion that such a description has at most leaves is written , as in (4). (4)✦
An indexed global set family on consists of a finite set of listed indices and a job set at every natural-number index.✦ The next global list index of an indexed global set family is the natural number in (5), with . (5)✦ The appended family of an indexed global set family and a job set is the indexed global set family obtained by adding after the existing entries.✦ For job sets , the two-set global list is the indexed global set family with listed indices , entry at zero, and entry at every other index.✦
For natural-number cutoffs , the carry family of an indexed global set family is the indexed global set family obtained by discarding indices before , intersecting the entry at with , and retaining entries after .✦ For a subwindow , the pruned family of an indexed global set family is the indexed global set family obtained by retaining precisely the listed indices for which , leaving every global entry unchanged.✦
Run Certificates
A rank threshold run certificate for , , and is a family of base sets and thresholds , together with a distinguished second set , satisfying (6).✦ Write for the collection of these certificates. (6)
The Claim
Theorem 1. Let . If every rank upper tail has a description with at most one leaf, every listed entry satisfies (7). (7)✦ For natural-number cutoffs , carrying gives a certificate satisfying (8). (8)✦ For a subwindow , pruning gives a certificate satisfying (9). (9)✦ Injection with a job set satisfying extends to a certificate satisfying (10). (10)✦ Let satisfy , and . For a natural-number threshold , the direction switch gives a certificate satisfying (11). (11)✦
In the paper, the result reads: every constructed entry has fewer than leaves, and this remains true through any number of same-direction updates.
What Is Checked
The statements concern run certificates for finite indexed global families on an arbitrary job set, with an arbitrary rank function and atomic assignment; the entry bound assumes one-leaf descriptions of all rank upper tails.