Theorem II.17: Uniformly for all W,n and (n,lambda) codes: |M|≤(n+1)^a 2^(nC(W)+K(a,d,lambda)sqrt(n)); if constant composition P, |M|≤2^(nI(P;W)+
OpenQAlgorithms.Papers.Independent.Renew46.P43.finiteChannelConverseLet 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.17 and its explicit constant-composition strengthening, PDF p.33.
Composition is required only in the second clause. One K works for both clauses. -/
theorem finiteChannelConverse (a d : ℕ) (ha : 0 < a) (hd : 0 < d)
(lambda : ℝ) (hlambda : 0 < lambda) (hsmall : lambda < 1) :
∃ K : ℝ, ∀ (W : FiniteChannel a (fullAlgebra d hd)) (n : ℕ) (c : FiniteCode W n),
c.error ≤ lambda →
(c.messages : ℝ) ≤ (n+1 : ℝ)^a * exp2 (n * W.capacity + K * Real.sqrt n) ∧
∀ P : PMF (Fin a), c.Composition P →
(c.messages : ℝ) ≤ exp2 (n * W.information P + 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, such that the following holds for every family of positive semidefinite complex matrices of trace , every natural number , and every finite code of length for this family. Such a code includes proofs that and its message count , an encoding , and positive semidefinite measurement matrices summing to the identity; no injectivity of is required. If its error
is at most , then
and, for every probability mass function on the input letters whose probabilities satisfy
one also has
Here , is its real supremum over all such , and , with interpreted by continuous functional calculus and . The output block label is constant and imposes no additional measurement restriction. The same , chosen before the channel and code, applies to both bounds and every qualifying . Although is quantified over all natural numbers, there is no code of the stipulated type when ; the composition condition can likewise be unsatisfiable for a particular .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.