The Setting
Consecutive powers of a binary word can have trace laws with only a small amount of common probability mass. The amplification question concerns the common mass when the repetition counts are enlarged and separated by a prescribed positive number of copies. Write for the requested deletion probability, so each bit survives with probability .
A binary word of length is an assignment of a Boolean bit to each zero-based position .✦ For a finite binary word and a natural number , the repeated word is the concatenation of copies of , as in (1). (1)✦
Complete Trace Laws
A binary trace is a finite list of bits, with its surviving length included in the observation.✦ For a natural number , the complete trace space is the finite set in (2); a bounded trace with bound is an element of the complete trace space . (2)
A finite probability law on a finite set is a real mass function satisfying (3).✦ The point mass at an outcome is the probability law assigning mass one to and zero to every other outcome.✦ (3)
For a finite probability law on and a family of finite probability laws on a finite set , the mixture law is the law on with masses given by (4). (4)✦ The pushforward law of a finite probability law on a finite set under a map to a finite set is the probability law on obtained by mixing the point masses at with weights , as in (5). (5)✦
The set of deletion masks of length consists of Boolean assignments to positions , with true retaining a bit and false deleting it.✦ For a deletion mask of length at deletion probability , the deletion mask probability is the real number given by the product in (6). (6) For , the deletion mask law is the finite probability law on assigning mass to each mask .✦
The retained subsequence of a binary word of length under a deletion mask is the trace of bits at retained positions in increasing position order, as in (7). (7) For a finite source word with , the complete trace law is the probability law on defined by the pushforward in (8). (8)✦
For finite probability laws on the same finite set , the total variation distance is the number in (9), and their probability overlap is the common mass in (10). (9) (10)✦ The complete trace overlap of finite binary words is the probability overlap of their complete trace laws in the common space specified in (11). (11)✦
The Claim
Theorem 1 (Lemma 3.2). Let be a finite binary word, let be positive integers, and let be a nonnegative integer. Let , and . Suppose that , , and . Then (12)✦
In the paper, the result reads: for a nonempty , a positive integer and satisfying , there is an absolute such that whenever , is a sufficiently large positive integer with an absolute lower threshold uniform in the other parameters, and is an integer satisfying , one has .
What Is Checked
The bound (12) is stated over complete trace laws of finite repeated binary words under deletion at , compared in the common bounded trace space of (11).
For real parameters outside , the mask probabilities also satisfy (13). (13)✦ For , every deletion mask probability is nonnegative.✦