The Setting
A finite dyadic router assigns a real point to a terminal path by testing ordered selector bits. Membership in the resulting set is decided by one terminal bit. For a center , write , where and . The question is which selector values at and must agree before a local test can determine membership.
Fix . The children are , with nondefault children and default child .✦ Thus the paper’s total number of children is in this notation. A decision node is a finite sequence of children of length , and a terminal path is a finite sequence of children of length . Write for the child edge obtained by appending , and for the root.
Ordered Routes
Let be a set of states and let be a selector value for each path , state and nondefault child . The first-success routing choice and the iterated route are defined by (1), where counts routing steps. (1)
Window Tables
An admissible window edge is a nonempty path of length at most . Separated window data with gap and minimum length consist of a length function and natural-valued functions on paths, satisfying (2). Here , means that is a prefix of , and means a proper prefix; all displayed edge paths are admissible, and is any continuation. (2)✦ The window of an edge is the integer interval . The selector and terminal endpoint assignments are respectively those in (3). (3)
For natural numbers and , the periodic mesh key and the finite dyadic grid key are the integer-valued functions on given by (4), where denotes the fractional part of . The dyadic cells are half-open and include their left endpoints. (4)
A Boolean selector table assigns a bit to every selector address with , and .✦ A terminal Boolean table assigns a bit to every terminal address with and .✦ Their queried addresses are defined in (5). (5) The extended selector value is defined by (6); its pointwise first-success choice is . (6)✦
Write . The root routed leaf and the local routed leaf are respectively and in (7), with the local leaf defined when . (7) For an address map , a selector table and a terminal table , the address-selected set is the subset of consisting of those whose bit is . The routed terminal address and its selected set , for , are defined in (8). (8)
A center is selector-stable for when (9) holds for every decision node , nondefault child , natural number with , normalized scale and selector table . (9)✦ For a decision node and a nondefault child , the local selector and terminal test is the Boolean product in (10). (10)✦
The Claim
Theorem 1. Let be an ordered Boolean selector family on paths and states in . For the prefix assertion (11), fix a path , states and a natural number , and put . Suppose that for each the choice is nondefault and that for every . Then (11)✦
Let be a path and . Suppose , the selector values at and agree for every , and . Then (12)✦
Take a terminal predicate and . Assume the hypotheses of (11), put , and assume the hypotheses of (12) at and . If holds, then (13)✦
Let be separated window data, an outcome and a selector-stable center. Suppose is a decision node, the choices at before step are nondefault, and . Let , and satisfy . If , then (14)✦
In the paper, the result reads: for a center in its set and a full center-exposure atom , consisting of outcomes with the same fully exposed data at and with first default node , every outcome , nondefault child , index in the window of and has its actual route at reach and reject all earlier nondefault children there, and implies .
What Is Checked
The route assertions are stated over arbitrary ordered Boolean selector families; the membership assertion uses finite selector and terminal tables with separated window data and a selector-stable center. For every decision node and nondefault child , the local routing depth identity is (15). (15)✦