The Setting
In one amplification block, the smoothing quantity is the convolution of a signed Prouhet motif with a fair binomial mass. Partial observations introduce a posterior smoothing cost determined by the number of bits that remain hidden.
Let be the requested deletion probability, so each bit survives with probability . Write for the working deletion rate and ; the construction theorems call their working rate .
A real Laurent polynomial is a finite sum with real coefficients, with multiplication determined by .✦ Multiplication convolves coefficient sequences. The coefficient norms and the integer translation , for , are defined by (1) The squared norm in (1) uses counting measure.
The fair binomial polynomial with trials and the Prouhet polynomial of order , for nonnegative integers , are (2) The coefficients of form the fair binomial mass function, and the signed Prouhet motif is the coefficient sequence ; the product index starts at zero. The binomial peak bound is the sequence (3)✦
For paired trials, a partial observation is a sequence with entries in , where denotes a hidden bit. For a symbol and a partial observation of paired trials, the hidden trial indicator and the hidden count are the nonnegative integers given by (4). The observation index starts at zero. For a partial observation of paired trials, a nonnegative integer , and a real weight , the posterior smoothing cost and the hidden smoothing bound are the nonnegative real quantities given by (5). (5)
The Claim
Theorem 1. Let be nonnegative integers, and put . For the polynomials in (2) and the peak bound in (3), signed binomial smoothing gives (6): (6)✦ For every integer , the translated squared norm satisfies (7): (7)✦ Let be a partial observation of paired trials and let satisfy . The hidden smoothing estimate is (8): (8)✦
In the paper, the result reads: for the stated Prouhet motif and an integer translate or reflection of a fair binomial mass with trials, where is absolute, , , and as tends to infinity in the construction, with counting measure and constants allowed to depend on .
What Is Checked
The claims are stated over finite real Laurent polynomials with the norms and translations of (1), and over partial observations with the hidden indicators of (4) and the costs of (5), subject to the stated lower bound on the hidden count for the posterior estimate.