The Setting
A periodic blocker is tested against the points , where the center is arbitrary, the normalized scale belongs to , and is a natural number with . Exceptional centers are repaired by an open periodic set.
A unit-periodic set is a set satisfying . The density of a unit-periodic set is its Lebesgue measure in one period, as in (1). (1)
For , and a real sequence , the exceptional set consists of the centers at which some normalized scale misses at every index in .✦ The dyadic notation is specified in (2). (2)✦
For , let be the class of open unit-periodic sets with the hitting and density conditions in (3). (3)
The Random Blocker
For natural numbers , a router of depth has children , with the default child.✦ Thus counts the nondefault children, and the paper’s total number of children is . A decision node of a router of depth is a path with ✦; a terminal path of the router is a path of length .✦ A window edge of a router of depth is a nonempty path of length at most .✦ For a decision node and a nondefault child , the nondefault child edge is the path obtained by appending to .✦
Separated window data with gap and minimum length consist of a length function and natural-number assignments to paths. Write . For every window edge they satisfy (4). (4) With denoting a prefix, denoting child labels, denoting a path, and juxtaposition denoting concatenation, the separation and descendant conditions are (5); all paths appearing as arguments of there are window edges. (5) The selector endpoint at is ✦, and the terminal endpoint at a terminal path is .✦
For a real mesh parameter and a natural number , the periodic mesh key and its dyadic specialization are given by (6), where is the fractional part of . (6) The dyadic cells are half-open and include their left endpoints.
The selector addresses and terminal addresses are the finite sets in (7). (7)
A selector table assigns a bit to each selector address✦; a terminal table assigns a bit to each terminal address.✦ The queried selector address at is .✦ The selector value at for the table is the table entry at the queried selector address when ; the extended selector value at is zero when .✦
The first successful child at a path and a point for a selector table is the least nondefault child whose selector value is one, or the default child if none succeeds. Given a child set , a state space and a rule for finite paths in and states , the iterated routing path from an initial path at after steps is obtained by successively appending to the current path , starting with .✦ Here the rule selects the first successful child for the selector table . Starting from the empty path, steps give the routed leaf .✦ The queried terminal address at is ✦, and the routed address is the queried terminal address with .✦
For any terminal-address map , the address-selected set is the set defined in (8). The raw routed set uses the routed address in that formula. (8)
For , the Bernoulli bit law assigns masses and to one and zero✦; the fair bit law is .✦ The independent fair selector law and independent Bernoulli terminal law have the joint outcome law in (9). (9)✦
The Claim
Theorem 1. Let be unit-periodic, and let be a positive extended real number. There is an open periodic enlargement with (10)✦
Let be a finite probability space, let , and let . Let be unit-periodic subsets of . If every is open and and , then (11)✦
Let be measurable with . If every is open, , and for every , then (12)✦
For arbitrary unit-periodic , assume instead that and for every . Then (13)✦
Let be separated window data as above, let , and let be measurable with . If for every , where is the raw routed set associated with , then (14)✦
In the paper, the result reads: enlarge to an open periodic at added density at most , with and for the exceptional set , select an outcome with , cover by an open periodic satisfying , and set , obtaining density at most and hitting at all centers.
What Is Checked
The enlargement in (10) is stated over arbitrary unit-periodic sets, and the hitting statements (11), (12) and (13) are stated over finite probability spaces, with (14) using the independent table law and the routed set associated with separated window data.