Corollary II.21: For 0≤R≤C(W), with possible exception of the leftmost finite Esp value: E(R)≤Esp(R)=max_P Esp(R,P).
OpenQAlgorithms.Papers.Independent.Renew46.P43.spherePackingReliabilityLet be a finite stationary channel and . Define . Exclude exactly the case where this value is finite and every smaller nonnegative rate has infinite sphere-packing bound. The maximizing input law is attained.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Corollary II.21, PDF p.36: exclude exactly a finite leftmost sphere-packing
value with every smaller nonnegative rate infinite, not all zero or positive rates. -/
theorem spherePackingReliability {a d : ℕ} (ha : 0 < a) (hd : 0 < d)
(W : FiniteChannel a (fullAlgebra d hd)) (R : ℝ) (hR : 0 ≤ R) (hcap : R ≤ W.capacity)
(hnotleftmost : ¬ (sphereBound W R ≠ ⊤ ∧
∀ r : ℝ, 0 ≤ r → r < R → sphereBound W r = ⊤)) :
reliability W R ≤ sphereBound W R ∧
∃ P : PMF (Fin a), sphereBound W R = sphereExponent W R P := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers , every channel with letters and -dimensional density matrix outputs, and every real with
suppose that it is not the case that is finite while for every real satisfying ; then
Here ranges over input probability distributions,
and , with ranging over -dimensional density matrices. Entropy is , ; is when , and otherwise is , using continuous functional calculus and total real logarithms. Empty extended nonnegative infima are . Reliability means
along the product filter, where is the infimum of the nonnegative part of maximum decoding error over length codes with a positive message count , arbitrary input words, and a measurement consisting of positive semidefinite matrices summing to the identity. The maximum error is ; an empty code infimum is . The exponent satisfies , , and otherwise. The extra hypothesis permits ; when , the quantifier over is vacuous, so the hypothesis requires .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.