Binomial identity and distortion coefficients
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.binomial_diagonalQecLet be integers, , and use the positive and negative combinations as the logical basis. For the actual compression of , let and denote its identity and Z coefficients in that basis. Define . Then
Polynomial derivatives make the zero above the finite support exact. No claim is made that these two coefficients alone describe the full block for every positive loss count.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.12 (6.4)--(6.5): only c and z are prescribed, in the plus/minus basis;
this does not erase possible other coefficients for positive loss count. -/
theorem binomial_diagonalQec (N S l : ℕ) (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1) :
qecC (binomialParity N S) g l l =
g ^ l / Nat.factorial l *
(((Polynomial.derivative : Polynomial ℝ → Polynomial ℝ)^[l])
(binomialGenerator N S false)).eval (1 - g) ∧
qecZ (binomialParity N S) g l l =
g ^ l / Nat.factorial l *
(((Polynomial.derivative : Polynomial ℝ → Polynomial ℝ)^[l])
(binomialGenerator N S true)).eval (1 - g) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural numbers , including zero, and real with , define sequences
where the vanish elsewhere and . Put
Then the real half-sum and half-difference of the diagonal entries satisfy
For , the zeroth derivative is the polynomial itself; no upper bound on is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.