Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem I.16: Schumacher code rate≤H(averageState)+Kd alpha/sqrt(n); Fe≥1−4N e^(−2mu²alpha²).

Proved
QAlgorithms.Papers.Independent.Renew46.P43.schumacherScheme

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.

R≤H(ρˉ)+KVdα/n,Fe≥1−4N(ρˉ)e−2μ(ρˉ)2α2.R\le H(\bar\rho)+K_Vd\alpha/\sqrt n,\qquad F_e\ge1-4N(\bar\rho)e^{-2\mu(\bar\rho)^2\alpha^2}.R≤H(ρˉ​)+KV​dα/n​,Fe​≥1−4N(ρˉ​)e−2μ(ρˉ​)2α2.

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.16, PDF p.16: the actual range compression followed by inclusion.
The code's range is required nonzero: the printed encoder divides by dim K. -/
theorem schumacherScheme {a d : ℕ} (S : PureSource a d) (spectral : FineResolution d)
    (haverage : spectral.state = S.average) (n : ℕ) (hn : 0 < n)
    (alpha : ℝ) (halpha : 0 < alpha) (k : ℕ) (hk : 0 < k)
    (V : Matrix (Fin n → Fin d) (Fin k) ℂ)
    (hisometry : Vᴴ * V = 1) (hrange : V * Vᴴ = varianceProjector spectral n alpha) :
    Real.logb 2 k / n ≤ vnEntropy S.average + varianceConstant * d * alpha / Real.sqrt n ∧
    sourceFe (copies n S.average) (conjSuperop V ∘ projectionEncoder V) ≥
      1 - 2 * varianceTail spectral alpha := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 16, Theorem I.16
Read-back

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

Let SSS be a source 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, a probability mass function pxp_xpx​ allowing zero probabilities, and average ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​. Let a spectral resolution consist of nonnegative weights sjs_jsj​ summing to one and a unitary matrix UUU such that Udiag⁡(sj)U†=ρˉU\operatorname{diag}(s_j)U^\dagger=\bar\rhoUdiag(sj​)U†=ρˉ​; zero weights and repeated weights are allowed. For natural numbers n,kn,kn,k with n>0n>0n>0 and k>0k>0k>0, a real number α>0\alpha>0α>0, and a complex matrix V:Ck→(Cd)⊗nV:\mathbb C^k\to(\mathbb C^d)^{\otimes n}V:Ck→(Cd)⊗n, suppose V†V=IV^\dagger V=IV†V=I and VV†=ΠVV^\dagger=\PiVV†=Π, where, writing uju_juj​ for column jjj of UUU,

Π=∑w∈{0,…,d−1}n∀j, ∣Nj(w)−nsj∣≤αsj(1−sj)n⨂i=0n−1∣uwi⟩⟨uwi∣,\Pi=\sum_{\substack{w\in\{0,\ldots,d-1\}^n\\ \forall j,\ |N_j(w)-ns_j|\le\alpha\sqrt{s_j(1-s_j)}\sqrt n}} \bigotimes_{i=0}^{n-1}|u_{w_i}\rangle\langle u_{w_i}|,Π=w∈{0,…,d−1}n∀j, ∣Nj​(w)−nsj​∣≤αsj​(1−sj​)​n​​∑​i=0⨂n−1​∣uwi​​⟩⟨uwi​​∣,

and Nj(w)N_j(w)Nj​(w) counts occurrences of jjj in www. Thus a zero spectral weight requires its occurrence count to be zero. Define NsN_sNs​ to be the number of indices with sj(1−sj)>0\sqrt{s_j(1-s_j)}>0sj​(1−sj​)​>0, and let μs\mu_sμs​ be the minimum of these positive numbers, or zero if there are none. Set Ts(α)=2Nsexp⁡(−2μs2α2)T_s(\alpha)=2N_s\exp(-2\mu_s^2\alpha^2)Ts​(α)=2Ns​exp(−2μs2​α2), which is zero when Ns=0N_s=0Ns​=0, and Cvar=2log⁡2(e)/eC_{\mathrm{var}}=2\log_2(e)/eCvar​=2log2​(e)/e. Then

log⁡2kn≤H(ρˉ)+Cvar dαn,Fe ⁣(ρˉ⊗n,V∘EV)≥1−2Ts(α),\frac{\log_2k}{n}\le H(\bar\rho)+\frac{C_{\mathrm{var}}\,d\alpha}{\sqrt n}, \qquad F_{\mathrm e}\!\left(\bar\rho^{\otimes n},\mathcal V\circ\mathcal E_V\right) \ge 1-2T_s(\alpha),nlog2​k​≤H(ρˉ​)+n​Cvar​dα​,Fe​(ρˉ​⊗n,V∘EV​)≥1−2Ts​(α),

where V(Y)=VYV†\mathcal V(Y)=VYV^\daggerV(Y)=VYV† and EV(X)=V†XV+(Tr⁡X−Tr⁡(XVV†))Ik/k\mathcal E_V(X)=V^\dagger XV+\bigl(\operatorname{Tr}X-\operatorname{Tr}(XVV^\dagger)\bigr)I_k/kEV​(X)=V†XV+(TrX−Tr(XVV†))Ik​/k. Here H(ρ)=−Re⁡Tr⁡f(ρ)H(\rho)=-\operatorname{Re}\operatorname{Tr}f(\rho)H(ρ)=−ReTrf(ρ) for f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t, defined by continuous functional calculus, and 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ρ​), where Pρ=∣χρ⟩⟨χρ∣P_\rho=|\chi_\rho\rangle\langle\chi_\rho|Pρ​=∣χρ​⟩⟨χρ​∣, χρ(i,j)=(ρ)ji\chi_\rho(i,j)=(\sqrt\rho)_{j i}χρ​(i,j)=(ρ​)ji​, and the amplification applies Φ\PhiΦ to each block on the second factor.

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