Theorem I.22: For pure-state source on any finite intrinsic C*-algebra and 0<lambda<1: Rq,Fbar(lambda)=Ra,Fbar(lambda)=H(averageState).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.intrinsicSourceCodingLet 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
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Theorem I.22, PDF p.20: classical, hybrid and fully quantum intrinsic sources.
No entanglement-fidelity assertion is made outside the full matrix setting. -/
theorem intrinsicSourceCoding {a : ℕ} (A : IntrinsicSystem) (S : PureSource a A.dim)
(hletters : ∀ x, InBlocks A.block (S.letter x))
(lambda : ℝ) (hlambda : 0 < lambda) (hsmall : lambda < 1) :
intrinsicSourceRate A S true lambda = ENNReal.ofReal (vnEntropy S.average) ∧
intrinsicSourceRate A S false 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 a natural number, let have positive dimension and block labels , and let be a source with , probability mass function , and distinct pure density matrices , . Assume every source letter satisfies whenever , including letters of probability zero, and let . Write and
For each positive length , consider codes with positive compressed dimension , an encoded density matrix for every alphabet word , and a decoder with a finite Kraus representation , . Require that, for every positive semidefinite , if some coordinate has unequal block labels, and require
Define one rate by taking the extended-nonnegative-real infimum of over these codes and then its limit superior as ; define the other rate in the same way with the additional requirement that a channel with a finite, identity-normalized Kraus representation satisfy for every word. The theorem asserts that both rates equal , regarded as an element of . Empty code families have infimum ; lengths zero are not used, and the source probabilities need not all be positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.