Corollary I.20: If En=o(n) and lambda_n≤1−e^(−En), any sequence of arbitrary-encoding (n,lambda_n)Fbar codes has liminf rate≥H(averageState).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.subexponentialSourceConverseLet a finite pure-state iid source have average . For every positive length , take an arbitrary-encoding code with fidelity error at most and rate . Let satisfy .
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
/-- Corollary I.20, PDF p.20. The error slack uses e^{-E_n}, and E_n=o(n).
All codes have positive lengths; the ENNReal liminf retains arbitrarily large rates. -/
theorem subexponentialSourceConverse {a d : ℕ} (S : PureSource a d)
(E lambda : ℕ → ℝ) (hsublinear : Tendsto (fun n : ℕ => E n / (n+1 : ℝ)) atTop (nhds 0))
(c : ∀ n, SourceCode S (n+1))
(hcode : ∀ n, 1 - (c n).fidelity ≤ lambda n)
(herror : ∀ n, lambda n ≤ 1 - Real.exp (-E n)) :
Filter.liminf (fun n => ENNReal.ofReal (c n).rate) atTop ≥
ENNReal.ofReal (vnEntropy S.average) := 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 be a source on , with positive natural alphabet size , positive natural dimension , distinct pure density matrices with , and probabilities summing to , allowing zero probabilities; write . Let satisfy . For every , suppose is a code of length , with positive compressed dimension , an arbitrary encoded density matrix for each source word, and a decoder with finitely many Kraus matrices satisfying . Define
If for every , then
Here the lower limit is taken in , and , with applied by continuous functional calculus and the total logarithm taking value at . The code sequence includes length at , and all its block lengths are positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.