Theorem II.16: Uniformly for finite W and positive n: N(n,lambda)≥2^(nC(W)−K(a,d,lambda)sqrt(n)), 0<lambda<1.
OpenQAlgorithms.Papers.Independent.Renew46.P43.finiteChannelCodingLet and . There is one real constant before the normalized finite channel and positive block length . Codes have collective POVMs with optional failure and maximum message error at most ; is their actual optimal message count. A fixed composition is required only for the explicitly strengthened clause.
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
/-- Theorem II.16, PDF pp.32-33: finite-block square-root correction, uniformly
over all channels and positive lengths at fixed alphabet and output dimensions. -/
theorem finiteChannelCoding (a d : ℕ) (ha : 0 < a) (hd : 0 < d)
(lambda : ℝ) (hlambda : 0 < lambda) (hsmall : lambda < 1) :
∃ K : ℝ, ∀ W : FiniteChannel a (fullAlgebra d hd), ∀ n : ℕ, 0 < n →
(finiteN W n lambda : ℝ) ≥ exp2 (n * W.capacity - K * Real.sqrt n) := 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 every pair of positive integers and every real , there exists a real constant , with no stated sign restriction, that works simultaneously for all families of positive semidefinite complex matrices of trace , and all positive integers , such that
Here is the real supremum, over all probability mass functions on the input letters, of
where , , using continuous functional calculus and the total convention . The quantity is the supremum in the natural numbers of the positive message counts for which there exist an encoding and a measurement , each matrix positive semidefinite and their sum the identity, satisfying
The outcome is an additional measurement outcome. The encoding need not be injective. The specified block label for the output algebra is constant, so its block restrictions impose no additional constraints. A natural-number supremum is for an empty or unbounded set; thus the definition of uses that convention rather than an extended-real supremum. The constant may depend on , but is chosen before and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.