Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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).

Proved
QAlgorithms.Papers.Independent.Renew46.P43.intrinsicSourceCoding

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let a finite pure-state iid source have average ρˉ\bar\rhoρˉ​ on a nonzero finite system of Hilbert dimension ddd. 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 log⁡2dim⁡K/n\log_2\dim\mathcal K/nlog2​dimK/n. Quantum encoding requires a CPTP extension; arbitrary encoding is state valued. In finite-block bounds α>0\alpha>0α>0, KV=2log⁡2(e)/eK_V=2\log_2(e)/eKV​=2log2​(e)/e, and N,μN,\muN,μ are the support rank and least positive eigenvalue of ρˉ(1−ρˉ)\sqrt{\bar\rho(1-\bar\rho)}ρˉ​(1−ρˉ​)​. 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 λ\lambdaλ. For the intrinsic version the source letters and decoder lie in the specified classical, hybrid or full matrix algebra, with its intrinsic trace.

Rq,Fˉ(λ)=Ra,Fˉ(λ)=H(ρˉ),0<λ<1.R_{q,\bar F}(\lambda)=R_{a,\bar F}(\lambda)=H(\bar\rho),\qquad0<\lambda<1.Rq,Fˉ​(λ)=Ra,Fˉ​(λ)=H(ρˉ​),0<λ<1.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
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
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 20, Theorem I.22
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let aaa be a natural number, let AAA have positive dimension ddd and block labels β:{0,…,d−1}→N\beta:\{0,\ldots,d-1\}\to\mathbb Nβ:{0,…,d−1}→N, and let SSS be a source with a>0a>0a>0, probability mass function ppp, and distinct pure density matrices ρx=vxvx†\rho_x=v_xv_x^\daggerρx​=vx​vx†​, ∥vx∥=1\|v_x\|=1∥vx​∥=1. Assume every source letter satisfies (ρx)i,j=0(\rho_x)_{i,j}=0(ρx​)i,j​=0 whenever β(i)≠β(j)\beta(i)\ne\beta(j)β(i)=β(j), including letters of probability zero, and let 0<λ<10<\lambda<10<λ<1. Write ρˉ=∑xp(x)ρx\bar\rho=\sum_xp(x)\rho_xρˉ​=∑x​p(x)ρx​ and

H(X)=−Re⁡Tr⁡(cfc⁡(t↦tlog⁡2t,X)).H(X)=-\operatorname{Re}\operatorname{Tr} \bigl(\operatorname{cfc}(t\mapsto t\log_2t,X)\bigr).H(X)=−ReTr(cfc(t↦tlog2​t,X)).

For each positive length NNN, consider codes with positive compressed dimension kkk, an encoded density matrix E(w)E(w)E(w) for every alphabet word www, and a decoder D\mathcal DD with a finite Kraus representation D(T)=∑jKjTKj†\mathcal D(T)=\sum_jK_jTK_j^\daggerD(T)=∑j​Kj​TKj†​, ∑jKj†Kj=Ik\sum_jK_j^\dagger K_j=I_k∑j​Kj†​Kj​=Ik​. Require that, for every positive semidefinite TTT, D(T)u,v=0\mathcal D(T)_{u,v}=0D(T)u,v​=0 if some coordinate has unequal block labels, and require

1−∑w(∏t=0N−1p(wt))Re⁡Tr⁡(D(E(w))⨂t=0N−1ρwt)≤λ.1-\sum_w\left(\prod_{t=0}^{N-1}p(w_t)\right) \operatorname{Re}\operatorname{Tr} \left(\mathcal D(E(w))\bigotimes_{t=0}^{N-1}\rho_{w_t}\right) \le\lambda.1−w∑​(t=0∏N−1​p(wt​))ReTr(D(E(w))t=0⨂N−1​ρwt​​)≤λ.

Define one rate by taking the extended-nonnegative-real infimum of max⁡{log⁡2k/N,0}\max\{\log_2k/N,0\}max{log2​k/N,0} over these codes and then its limit superior as N=n+1→∞N=n+1\to\inftyN=n+1→∞; define the other rate in the same way with the additional requirement that a channel E\mathcal EE with a finite, identity-normalized Kraus representation satisfy E(⨂tρwt)=E(w)\mathcal E(\bigotimes_t\rho_{w_t})=E(w)E(⨂t​ρwt​​)=E(w) for every word. The theorem asserts that both rates equal max⁡{H(ρˉ),0}\max\{H(\bar\rho),0\}max{H(ρˉ​),0}, regarded as an element of [0,∞][0,\infty][0,∞]. Empty code families have infimum +∞+\infty+∞; lengths zero are not used, and the source probabilities need not all be positive.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me