The Setting
A finite router assigns each real point to a leaf and reads a Boolean label from a cell of the dyadic grid at that leaf. For a set , its density in one period is the quantity in (1), where is Lebesgue measure: (1)
Fix nonnegative integers and . The child set consists of the indices , with the default child.✦ A decision node is a word in of length less than ✦; a terminal path is a word of length .✦ (2) Here counts nondefault children, so the total number of children, denoted in the paper, is .
For a real mesh parameter and a real point , the periodic mesh key is the integer obtained by taking the floor of times the fractional part of .✦ The dyadic key of a real point at a natural-number level is the integer obtained by specializing the periodic mesh key as in (3); its grid cells are half-open and include their left endpoints: (3)✦
A selector level assignment assigns a natural number to each pair with and ; a terminal level assignment assigns a natural number to each . For selector and terminal level assignments , the selector and terminal address sets and are the finite sets in (4): (4) A selector table is a Boolean function on ✦, and a terminal table is a Boolean function on ✦; write their entries as and . For , , and , the queried selector address and terminal address are the tuples in (5): (5) For a selector table on , a finite word in , a child index and a real point , the extended selector value is the Boolean value in (6): (6)✦
The first successful child for a list of bits is the minimum in (7): (7)✦ A child rule assigns a child in to each finite word in and each real point. For a finite word in and a real point , the iterated routing path after steps is the word obtained by the recursion (8), where denotes concatenation: (8)✦
For an address map , an element and a Boolean table on , the address-selected set is the subset of defined in (9): (9)✦
For , the Bernoulli bit law on assigns mass to and to ✦; is the fair bit law.✦ For , the independent fair selector law on selector tables and the independent Bernoulli terminal law on terminal tables are the product probability measures in (10): (10)
The Claim
Theorem 1. Let be level assignments as above, let , and let and be probability measures on selector tables and on , respectively. The joint table law on pairs of tables is the product measure in (11): (11)✦ For a selector table , the selector child choice is the child rule in (12), and the routed leaf is the function from to in (13), with routing starting at the empty word : (12)✦ (13)✦ For a pair of tables and a real point , the routed terminal address and the routed set are given by (14): (14) Every realization gives a Borel, one-periodic routed set satisfying (15) and (16), where is the Borel sigma algebra: (15)✦ (16)✦ With the selector and terminal laws and , the density identity is (17): (17)✦
In the paper, the result reads: each nondefault edge carries independent fair Boolean selector entries indexed by the dyadic cells at level , each leaf carries independent Bernoulli- terminal entries indexed by the cells at the endpoint of its incoming edge, all entries are mutually independent, routing chooses the first successful nondefault child and otherwise the last child, and, writing for the routed leaf, the set is measurable and one-periodic in every realization with .
What Is Checked
The construction is stated for every and every pair of natural-number level assignments , while (17) permits an arbitrary selector probability law and independent terminal bits with a common probability law .