The Setting
A block of symbols occupies an interval of an address, while its contraction determines which spatial scales it reaches. Retention selects blocks by their contraction depths and the bands containing their starting scales. The entropy losses concern conditional suffix laws at the two ends of each selected block.
A weighted affine iterated function system on a finite alphabet is a family of maps and strictly positive probabilities satisfying (1); the slopes are signed and the translations are arbitrary real numbers. (1)✦ The complete affine map of a finite word is its signed slope and translation pair , and its word similarity is given by (2). The recursion composes letters in address order; is the word probability. (2) For a symbol , a finite word , a real function on words and a nonnegative integer , the symbol contraction depth , word contraction depth and Bernoulli word average are the real numbers given in (3). (3)
Finite Conditional Suffix Laws
For a set of tags, a type map assigns a tag to each symbol. For a type map and a symbol , the tag fiber is the set of symbols in with the tag of ; the fiber mass and conditional symbol probability are the probabilities given in (4). (4) Fix a compactly supported probability measure on , meaning that some closed interval , with , has complement of -measure zero.✦ The conditional word probability and conditional tail law for words of length are the product and affine mixture in (5). (5) This conditions only the finitely many types of ; the continuation with law remains unconditioned. For a finite word , write for its first letters and for the remaining suffix. For a real dilation factor , a finite word , a finite word and a prefix length , the scaled tail law and scaled conditional suffix law are the probability measures given in (6), where . (6)
For a measure and a partition map into a label set, the real fiber mass is the real value of the measure of the fiber labelled ; the partition entropy is the real number given by (7), with . (7) For a measure on , a real scale and a real offset , the shifted grid cell index is an integer-valued function on , and the shifted grid entropy and averaged grid entropy are the real numbers given in (8). (8) For a measure on and real scales , the entropy window is the difference of averaged grid entropies in (9). For a finite word , a cut , a real scale and a nonnegative integer , the suffix entropy window is the real number obtained by evaluating the entropy window of the scaled conditional suffix law from to . For a positive integer and integer , is this suffix entropy window with the fine scale and factor specified in (9). These entropies use natural logarithms; division by gives base-two units. (9)
Retained Indices
Let include zero. A depth profile assigns a cumulative depth to every index. Fix finitely many block lengths , counts and integer band endpoints , indexed by , and a real depth bound . Their separation condition is (10). (10) A retained index for block is an index satisfying the condition in (11); is the set of aligned candidate starts. (11)✦ For a finite word , the prefix depth profile is a real-valued function of the prefix length, and the retained window entropy loss is a real number, given by (12), where denotes the indicator of the retention condition. (12)✦
The Claim
Theorem 1. Let be nondecreasing, and let , and satisfy , , and . Then (13) holds. (13)✦ For with , the aligned half-open integer intervals satisfy (14). (14)✦ Let be a finite index set with integer endpoints , and suppose that the intervals are pairwise disjoint. Every nonincreasing satisfies (15). (15)✦ For the separated bands in (10), a nondecreasing profile and a nonincreasing nonnegative function , the retained sum satisfies (16). (16)✦ Suppose also that symbols with equal tags have equal signed slopes. For every word length , the compactly supported probability measure , positive integer and integer scale index , the retained losses satisfy (17). (17)✦
In the paper, the result reads: under its separated-band and candidate-start choices, for every fixed infinite type environment and , where is the upper scale-index bound, all retained half-open windows are pairwise disjoint and their losses satisfy (18). (18)
What Is Checked
The statements concern finite families of half-open integer intervals, nondecreasing depth profiles and nonincreasing nonnegative functions, and finite conditional affine mixtures of a compactly supported probability measure, with equal tags requiring equal signed slopes in the Bernoulli average.