Theorem I.7: For every 0<lambda<1, Rq,Fe(lambda)=Rq,Fbar(lambda)=Ra,Fbar(lambda)=H(averageState).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.sourceCodingLet 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.7, PDF p.11: all three fixed-error limsup rates, not just the
vanishing-error capacity, equal the ensemble's entropy. -/
theorem sourceCoding {a d : ℕ} (S : PureSource a d) (lambda : ℝ)
(hlambda : 0 < lambda) (hsmall : lambda < 1) :
sourceRate S .quantumEntanglement lambda = ENNReal.ofReal (vnEntropy S.average) ∧
sourceRate S .quantumFidelity lambda = ENNReal.ofReal (vnEntropy S.average) ∧
sourceRate S .arbitraryFidelity lambda = 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 natural numbers, and let consist of distinct pure density matrices on , with , , and a probability mass function , allowing zero probabilities. Write , and let . For each positive length , a code consists of a positive compressed dimension , an arbitrary assignment of a density matrix on to every word , and a decoder channel into . Density matrices are positive semidefinite with trace one; channels are maps admitting finite Kraus representations with . Put and . Consider three requirements on such a code: an arbitrary encoder with ; a channel encoder satisfying for every word and ; and a channel encoder satisfying those same word equalities and . Here , with and ; the identity amplification applies to each block on the second factor. For each requirement, take the infimum in of over all codes satisfying it, with an empty infimum equal to , and then take the limit superior of these infima along as . All three resulting quantities equal
where is defined by continuous functional calculus and the equality is in .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.