Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem I.7: For every 0<lambda<1, Rq,Fe(lambda)=Rq,Fbar(lambda)=Ra,Fbar(lambda)=H(averageState).

Proved
QAlgorithms.Papers.Independent.Renew46.P43.sourceCoding

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,Fe(λ)=Rq,Fˉ(λ)=Ra,Fˉ(λ)=H(ρˉ),0<λ<1.R_{q,F_e}(\lambda)=R_{q,\bar F}(\lambda)=R_{a,\bar F}(\lambda)=H(\bar\rho),\qquad 0<\lambda<1.Rq,Fe​​(λ)=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

/-- 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
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 11, Theorem I.7
Read-back

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

Let a,da,da,d be natural numbers, and let SSS consist of a>0a>0a>0 distinct pure density matrices ρx=∣vx⟩⟨vx∣\rho_x=|v_x\rangle\langle v_x|ρx​=∣vx​⟩⟨vx​∣ on Cd\mathbb C^dCd, with d>0d>0d>0, ∥vx∥=1\|v_x\|=1∥vx​∥=1, and a probability mass function pxp_xpx​, allowing zero probabilities. Write ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​, and let 0<λ<10<\lambda<10<λ<1. For each positive length ℓ\ellℓ, a code consists of a positive compressed dimension kkk, an arbitrary assignment of a density matrix σw\sigma_wσw​ on Ck\mathbb C^kCk to every word www, and a decoder channel D\mathcal DD into (Cd)⊗ℓ(\mathbb C^d)^{\otimes\ell}(Cd)⊗ℓ. Density matrices are positive semidefinite with trace one; channels are maps admitting finite Kraus representations Φ(X)=∑jKjXKj†\Phi(X)=\sum_jK_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Put ρw=⨂iρwi\rho_w=\bigotimes_i\rho_{w_i}ρw​=⨂i​ρwi​​ and Fc=∑w(∏ipwi)Re⁡Tr⁡(D(σw)ρw)F_c=\sum_w(\prod_ip_{w_i})\operatorname{Re}\operatorname{Tr}(\mathcal D(\sigma_w)\rho_w)Fc​=∑w​(∏i​pwi​​)ReTr(D(σw​)ρw​). Consider three requirements on such a code: an arbitrary encoder with 1−Fc≤λ1-F_c\le\lambda1−Fc​≤λ; a channel encoder E\mathcal EE satisfying E(ρw)=σw\mathcal E(\rho_w)=\sigma_wE(ρw​)=σw​ for every word and 1−Fc≤λ1-F_c\le\lambda1−Fc​≤λ; and a channel encoder satisfying those same word equalities and 1−Fe(ρˉ⊗ℓ,D∘E)≤λ1-F_{\mathrm e}(\bar\rho^{\otimes\ell},\mathcal D\circ\mathcal E)\le\lambda1−Fe​(ρˉ​⊗ℓ,D∘E)≤λ. Here Fe(ρ,Φ)=Re⁡Tr⁡((id⊗Φ)(Pρ)Pρ)F_{\mathrm e}(\rho,\Phi)=\operatorname{Re}\operatorname{Tr}((\mathrm{id}\otimes\Phi)(P_\rho)P_\rho)Fe​(ρ,Φ)=ReTr((id⊗Φ)(Pρ​)Pρ​), with Pρ=∣χρ⟩⟨χρ∣P_\rho=|\chi_\rho\rangle\langle\chi_\rho|Pρ​=∣χρ​⟩⟨χρ​∣ and χρ(i,j)=(ρ)ji\chi_\rho(i,j)=(\sqrt\rho)_{j i}χρ​(i,j)=(ρ​)ji​; the identity amplification applies Φ\PhiΦ to each block on the second factor. For each requirement, take the infimum in [0,∞][0,\infty][0,∞] of max⁡{log⁡2k/ℓ,0}\max\{\log_2k/\ell,0\}max{log2​k/ℓ,0} over all codes satisfying it, with an empty infimum equal to +∞+\infty+∞, and then take the limit superior of these infima along ℓ=n+1\ell=n+1ℓ=n+1 as n→∞n\to\inftyn→∞. All three resulting quantities equal

max⁡{H(ρˉ),0},H(ρ)=−Re⁡Tr⁡f(ρ),f(t)=tlog⁡2t,\max\{H(\bar\rho),0\}, \qquad H(\rho)=-\operatorname{Re}\operatorname{Tr}f(\rho), \quad f(t)=t\log_2t,max{H(ρˉ​),0},H(ρ)=−ReTrf(ρ),f(t)=tlog2​t,

where f(ρ)f(\rho)f(ρ) is defined by continuous functional calculus and the equality is in [0,∞][0,\infty][0,∞].

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