The Setting
A binary word of length is a function from to .✦ A binary trace is a finite list of bits, including its surviving length.✦ The complete trace space is the set of all binary traces of length at most ✦, and a bounded trace of bound is an element of .✦
A deletion mask of length is a function from to , with indicating retention.✦ The retained subsequence consists of the bits with , listed in increasing order of .✦
A finite probability law on a finite set assigns real masses satisfying (1). (1)✦ For an element of a finite set , the point mass on is the probability law that assigns mass one to and zero to every other element. For a family of finite probability laws on a finite set , the mixture law on has the masses in (2). (2)✦ The pushforward under a function is the mixture with point masses .✦
Let be the requested deletion probability, so each bit survives with probability . The deletion mask law assigns to a mask the probability in (3). (3)✦ For a binary list of length , regarded as a word on its positions, the complete trace law on is the pushforward in (4). (4)✦
For real rates and , the additional deletion rate is the scalar in (5). (5)✦
The Claim
The construction theorems call their working deletion rate ; here denotes the requested deletion probability.
Definition 1 (Distances and working deletion rate). Let be finite probability laws on the same finite set , and write for their total variation distance. For finite probability laws on the same finite set , the probability overlap is the real number in (6). The squared Hellinger distance between finite probability laws on the same finite set is the real number in (7). (6)✦ (7)✦ For a requested deletion probability , the working deletion rate is defined by (8). (8)✦
Theorem 1 (Working scale and further deletion). Let and let be real. The working scale satisfies (9). (9)✦ Let and , and let be a binary list of length at most . The deletion channels satisfy the mixture identity (10). (10)✦
In the paper, the result reads: overlap is , the maximal common subprobability mass, and is the sum or integral of ; the construction uses , , and ; further deletion at rate restores the requested channel.
What Is Checked
The distance definitions concern laws on finite sets, and the channel identity concerns binary lists and complete traces with a common finite length bound. The mask weights in (3) sum to one for every real ✦ and are nonnegative for .✦ The additional rate in (5) belongs to whenever and .✦ The working scale bound concerns requested deletion probabilities and nonnegative real scales .