The Setting
At a fixed center, a normalized scale moves each dyadic point along a short interval. The local tests record selector bits and the terminal bit reached by routing that point. Their dependence on scale is measured on periodic dyadic grids.
Fix natural parameters . The router has children , of which are nondefault and is default; its total number of children is .✦ A decision node is a path with ✦, and a terminal path is a path with .✦ Write for appending the child to . An admissible edge is a nonempty path with , identifying the edge into its last child.✦
Separated window data consist of a length function and natural-valued assignments on paths. Put for an admissible edge. Their defining conditions are (1), where and are admissible in the first four rows and are admissible in the last row. Here means prefix inclusion, means proper prefix inclusion, and is a continuation: (1)
Fix a decision node and a real center . The local windows and child grid levels are defined by (2); here is the height of and is the common window length: (2)
Grids and Routing
For , write . The periodic mesh key at a real parameter and its dyadic specialization at a natural level are defined in (3). The latter indexes the half-open cells of the periodic grid, including each cell’s left boundary. (3)
The selector window endpoint at a decision node and nondefault child is ✦; the terminal window endpoint at a terminal path is .✦ A selector table address consists of and a natural index below .✦ A terminal table address consists of and a natural index below .✦ A Boolean selector table and a terminal Boolean table assign bits to their respective addresses. The queried addresses at a point are those in (4). (4)
The extended selector value is when , and is otherwise.✦ A routing rule assigns a child to a path and a vector of bits. Its selector-dependent choice is defined by (5). (5)
For a child choice , the iterated routing path is the path obtained by successive choices from , as in (6).✦ When , the local routed leaf is the path obtained after successive choices from at , as in (6).✦ (6)
Choose a natural with for every . For a table outcome , the concrete local test is the Boolean conjunction in (7), written as a product of bits. (7)
For an outcome set , let be the collection of Boolean families , indexed by and , that take equal values whenever the corresponding keys agree. Write for the point tested at normalized scale .
The Claim
Theorem 1. Fix separated window data , a decision node , and a real center as above. Let routing depend on selector values through a rule as in (5), and let for every . For all table outcomes and real points , the concrete local tests of (7) have the grid factorization (8): (8)✦ For every outcome set , the universal window representatives satisfy (9): (9)✦ The concrete local test representatives satisfy (10): (10)✦
In the paper, the result reads: for a stable center and a full center-exposure atom whose first default node has height , with and denoting the paper’s total number of children, there is a finite , depending only on and the deterministic windows, with , such that every has a representative satisfying for every nondefault and every , simultaneously for every realization consistent with .
What Is Checked
The statements are over separated window data on a finite router, arbitrary real centers and Boolean tables with selector-dependent routing; the universal window statement ranges over arbitrary outcome sets and the families in .