The Setting
In a self-similar construction on the line, differences between cylinder translations are grouped by their dyadic sizes. The setting concerns finite collections of bands of these sizes and windows selected by contraction depth and a target dyadic scale.
A weighted affine iterated function system on a finite alphabet consists of maps and weights satisfying (1), with signed slopes and arbitrary real translations : (1)✦ The affine composition of a word is the map in (2); the empty word has slope and translation , and a prefixed letter acts outermost.✦ The word probability and contraction depth of a word are the real numbers in (2); the depth uses base-two logarithms. (2)
A finite probability law on the line consists of a finite support and strictly positive masses , , whose sum is one.✦ For a finite source set , real weights and an observable , the fiber mass at is the sum in (3).✦ When and the weights are positive and normalized, these fiber masses define the observable distribution of .✦ (3)
The tag fiber of a point under a map is the subset in (4)✦; its fiber mass is the total weight of that subset.✦ (4) For strictly positive weights and a real observable on , the conditional observable distribution is the observable law of on with weights .✦ For a tag map , the word tag sequence of a word is the sequence .✦ The type-conditioned translation law associated with a word is the conditional observable distribution of on , with weights , given .✦
The pairs at band of a finite probability law form the set in (5).✦ The incident pair mass at of weights on is the half-sum in (5).✦ (5) A pair weighting on is feasible when for every pair and for every .✦ The fair-pair capacity is the supremum of total feasible pair weights in (6).✦ (6)
For a real rate and length , the first dyadic band is the integer in (7).✦ For a real depth bound and integer band endpoints , the averaged band capacity budget is the weighted sum in that display, restricted to words of depth at most .✦ (7)
Retained Windows
Definition 1. Let be a depth profile, let and , and let . A retained window index for at target is an index satisfying (8): (8)✦
The Claim
Theorem 1. Let be a weighted affine iterated function system with a tag map on its alphabet. Let , and . Suppose there is such that, for every , some integer satisfies . For every integer there are lengths and integer endpoints satisfying (9): (9)✦ For any finite family of positive integer lengths and integer cutoffs , there is a common horizon satisfying (10): (10)✦
In the paper, the result reads: for any positive integer , choose sufficiently large , with upper band endpoints , for which Proposition 4.2 holds, , and whenever ; choose an even with ; with the paper’s block-depth bound, set ; at a target , retain , , exactly when and .
What Is Checked
The selection statement (9) is stated over a finite weighted affine system, an arbitrary tag map and an eventual band budget; the horizon statement (10) concerns arbitrary finite families of positive integer lengths and integer cutoffs. Retention in (8) is defined for any real depth profile on the nonnegative integers and integer band and target indices.
Every word probability is strictly positive.✦ For any finite source with strictly positive weights, the conditional weights on sum to one.✦