Theorem I.19: dim K≥(1−lambda−4sqrt(N) e^(−mu²alpha²))2^(nH(averageState)−Kd alpha sqrt(n)), for any arbitrary-encoding (n,lambda)Fbar code and
ProvedQAlgorithms.Papers.Independent.Renew46.P43.strongSourceConverseLet a finite pure-state iid source have average on a nonzero finite system of Hilbert dimension . Compression spaces and block lengths are positive, decoders are CPTP and all entropies/rates are in bits. The fixed-error rates are limsups of the actual block minimum of . Quantum encoding requires a CPTP extension; arbitrary encoding is state valued. In finite-block bounds , , and are the support rank and least positive eigenvalue of . The Schumacher code compresses onto the nonzero variance-typical range and decodes by inclusion; the strong converse permits any arbitrary-encoding code of fidelity error at most . For the intrinsic version the source letters and decoder lie in the specified classical, hybrid or full matrix algebra, with its intrinsic trace.
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.19, PDF pp.19-20. sqrt covers N alone; decoder is any CPTP map. -/
theorem strongSourceConverse {a d n : ℕ} (S : PureSource a d) (spectral : FineResolution d)
(haverage : spectral.state = S.average) (c : SourceCode S n)
(lambda alpha : ℝ) (hcode : 1 - c.fidelity ≤ lambda) (halpha : 0 < alpha) :
(c.dim : ℝ) ≥
(1 - lambda - 4 * Real.sqrt (spectralN spectral) *
Real.exp (-(spectralMu spectral)^2 * alpha^2)) *
exp2 (n * vnEntropy S.average - varianceConstant * d * alpha * 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
Let be natural numbers, and let be a source with distinct pure states on , where , , and probabilities summing to ; zero probabilities are allowed. Write . Let a spectral resolution consist of weights summing to and a unitary matrix , with . Set , , , and when , with otherwise. Let be a source code of length , with compressed dimension , an arbitrary assignment of a density matrix on to each word , and a decoder having a finite Kraus representation , . Define its fidelity by . For every real satisfying and every real , the assertion is
where , with applied by continuous functional calculus and the total logarithm taking value at . No additional bound on or positivity of the prefactor is assumed; when is empty, its correction term is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.