Theorem I.18: liminf_(lambda→0+) Ra,Fbar(lambda)=liminf_(lambda→0+) Ra,Dbar(lambda)≥H(averageState).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.weakSourceConverseFor a finite pure-state iid source with average , let and be the fixed-error limsups of the minimum arbitrary-encoding block rates under average overlap or half-trace-distance error, respectively. The error limit below is from positive values.
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
/-- Theorem I.18, PDF pp.18-19: one-sided error-to-zero liminf, not the value at zero. -/
theorem weakSourceConverse {a d : ℕ} (S : PureSource a d) :
Filter.liminf (sourceRate S .arbitraryFidelity) (nhdsWithin 0 (Set.Ioi 0)) =
Filter.liminf (sourceRate S .arbitraryDistortion) (nhdsWithin 0 (Set.Ioi 0)) ∧
ENNReal.ofReal (vnEntropy S.average) ≤
Filter.liminf (sourceRate S .arbitraryDistortion) (nhdsWithin 0 (Set.Ioi 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
Let consist of distinct pure density matrices on , with , , and a probability mass function that may have zero weights, and write . For every positive length , a code has a positive compressed dimension , an arbitrary assignment of density matrices on to all words , and a decoder channel into ; no channel extension of the encoder is required. A density matrix is positive semidefinite with trace one, and a channel has a finite Kraus representation with . With and , put
For each real , define by taking, at each length , the infimum in of over codes with , and then taking the limit superior along ; define in the same way using . Empty infima are . The limit inferiors of these two rate functions as approaches zero through strictly positive real values satisfy
where with defined by continuous functional calculus, and both limit inferiors and the inequalities are interpreted in .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.