The Setting
A periodic source has periods of slots, with one tagged defect in each period. For a fixed retained count, the observed ranks of tagged defects give rank kernels; summing over choices of distinct periods gives the kernel in Lemma 4.2. For a requested deletion probability , each bit survives with probability , and the working deletion rate is ; the construction theorems call this working rate .
Write for the zero-based index set of source slots. Period indices and observed ranks also start at zero. An increasing rank tuple is a strictly increasing map from to : (1)✦ The tuples in (1) specify the distinct ranks of a monomial, or the periods supplying its tagged slots.
Retained Subsets and Rank Kernels
A finite probability law on a finite outcome set is a mass function with .✦ A fixed-size subset is a subset of with cardinality .✦ For , the uniform fixed-size subset law assigns the masses (2)✦ For retained source slots, take in (2).
For a retained subset and an observed rank , the slot is the source slot at rank in the increasing enumeration of .✦ For tagged slots and requested ranks , the tagged rank event is the set of retained subsets whose requested ranks contain their corresponding tagged slots.✦ The conditional rank kernel for tagged slots and requested ranks is the probability of the tagged rank event under the uniform retained subset law : (3)
A period defect offset for periods of slots is a map . For a period defect offset , the period defect slot map is the map that places the defect in each period at (4) For , the summed periodic rank kernel is the function on obtained from (3) and (4) by (5)
The rank Schur constant is the absolute constant (6)✦
The Claim
Theorem 1. Let and be integers, let , and let be a nonnegative integer. Suppose and there is a real such that and . Let be a period defect offset such that for every period and for every pair of periods . For the summed kernel in (5) and the constant in (6), (7)✦
In the paper, the result reads: for periods of arbitrary deterministic types , an admissible return count, and every , the summed periodic rank kernel has counting-measure squared norm on increasing rank tuples at most , with absolute and uniform in the types and count.
What Is Checked
The estimate (7) is stated over uniform retained subsets and their tagged rank events, using periodic defect slots subject to the stated offset conditions. For , the binomial coefficient in (2) is positive.