above-capacity-reliability: For fixed finite stationary W and R>C(W), E(R)=0.
OpenQAlgorithms.Papers.Independent.Renew46.P43.aboveCapacityReliabilityLet be a finite stationary classical-input quantum channel. Its capacity optimizes normalized input laws. The reliability is the joint liminf of the optimal maximum-error exponent at length and rate as , , with exponent for zero error.
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
/-- Unnumbered assertion, PDF p.34: reliability is zero above capacity. -/
theorem aboveCapacityReliability {a d : ℕ} (ha : 0 < a) (hd : 0 < d)
(W : FiniteChannel a (fullAlgebra d hd)) (R : ℝ) (hR : W.capacity < R) :
reliability W R = 0 := 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 input letters and -dimensional positive semidefinite output matrices of trace , and every real strictly greater than
the reliability is . Here ranges over all input probability distributions, and , , through continuous functional calculus. Explicitly, the asserted equality is
along the product filter. For positive , is the infimum of the nonnegative part of maximum decoding error over codes with a positive message count , arbitrary length words , and positive semidefinite measurement matrices summing to the identity; their maximum error is
An empty code infimum is . Finally, , , and for finite positive . The only stated restriction on is the strict inequality .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.