Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem I.1: Dbar²≤1−Fbar≤Dbar; for quantum encoders also 1−Fbar≤1−Fe.

Proved
QAlgorithms.Papers.Independent.Renew46.P43.sourceQualityComparison

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

prove2quantum

Let a finite pure-state ensemble on a nonzero finite-dimensional Hilbert space generate iid words, and let a positive-length compression code have arbitrary state-valued encoding and a CPTP decoder. Write bar F for mean word overlap and bar D for mean half trace norm. For a quantum encoder, F_e is the purification overlap of its CPTP extension.

Dˉ2≤1−Fˉ≤Dˉ,1−Fˉ≤1−Fefor quantum encoders.\bar D^2\le 1-\bar F\le\bar D,\qquad 1-\bar F\le 1-F_e\quad\text{for quantum encoders}.Dˉ2≤1−Fˉ≤Dˉ,1−Fˉ≤1−Fe​for quantum encoders.

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.1, PDF p.8. The first chain holds for every arbitrary encoder;
the entanglement-fidelity clause uses each actual quantum extension separately. -/
theorem sourceQualityComparison {a d n : ℕ} {S : PureSource a d} (c : SourceCode S n) :
    c.distortion^2 ≤ 1 - c.fidelity ∧ 1 - c.fidelity ≤ c.distortion ∧
    ∀ E, EncoderExtension c E →
      1 - c.fidelity ≤ 1 - sourceFe (copies n S.average) (c.decode ∘ E) := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

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

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

Let a,d,na,d,na,d,n be natural numbers, and let SSS be a source with a>0a>0a>0 distinct pure states ρx=∣vx⟩⟨vx∣\rho_x=|v_x\rangle\langle v_x|ρx​=∣vx​⟩⟨vx​∣ on Cd\mathbb C^dCd, where ∥vx∥=1\|v_x\|=1∥vx​∥=1, together with a probability mass function pxp_xpx​ on its aaa labels; probabilities may be zero. Let ccc be a code of length n>0n>0n>0, with a compressed dimension k>0k>0k>0, an arbitrary assignment w↦σww\mapsto\sigma_ww↦σw​ of density matrices on Ck\mathbb C^kCk to all words w∈{0,…,a−1}nw\in\{0,\ldots,a-1\}^nw∈{0,…,a−1}n, and a decoder channel D\mathcal DD into (Cd)⊗n(\mathbb C^d)^{\otimes n}(Cd)⊗n. Here a density matrix is positive semidefinite with trace one, and a channel has a finite Kraus representation Φ(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 pw=∏i=0n−1pwip_w=\prod_{i=0}^{n-1}p_{w_i}pw​=∏i=0n−1​pwi​​, ρw=⨂i=0n−1ρwi\rho_w=\bigotimes_{i=0}^{n-1}\rho_{w_i}ρw​=⨂i=0n−1​ρwi​​, and ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​. Define the code’s average overlap and average trace distance by

Fc=∑wpw Re⁡Tr⁡ ⁣(D(σw)ρw),Dc=∑wpw 12∥D(σw)−ρw∥1,F_c=\sum_wp_w\,\operatorname{Re}\operatorname{Tr}\!\bigl(\mathcal D(\sigma_w)\rho_w\bigr), \qquad D_c=\sum_wp_w\,\frac12\bigl\|\mathcal D(\sigma_w)-\rho_w\bigr\|_1,Fc​=w∑​pw​ReTr(D(σw​)ρw​),Dc​=w∑​pw​21​​D(σw​)−ρw​​1​,

where ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. Then Dc2≤1−Fc≤DcD_c^2\le 1-F_c\le D_cDc2​≤1−Fc​≤Dc​. Moreover, for every channel E\mathcal EE from the word space to Ck\mathbb C^kCk satisfying E(ρw)=σw\mathcal E(\rho_w)=\sigma_wE(ρw​)=σw​ for every word, including words of zero probability,

1−Fc≤1−Fe ⁣(ρˉ⊗n,D∘E).1-F_c\le 1-F_{\mathrm e}\!\left(\bar\rho^{\otimes n},\mathcal D\circ\mathcal E\right).1−Fc​≤1−Fe​(ρˉ​⊗n,D∘E).

For a matrix ρ\rhoρ and a map Φ\PhiΦ, the quantity used here is Fe(ρ,Φ)=Re⁡Tr⁡((id⊗Φ)(∣χρ⟩⟨χρ∣) ∣χρ⟩⟨χρ∣)F_{\mathrm e}(\rho,\Phi)=\operatorname{Re}\operatorname{Tr}\bigl((\mathrm{id}\otimes\Phi)(|\chi_\rho\rangle\langle\chi_\rho|)\,|\chi_\rho\rangle\langle\chi_\rho|\bigr)Fe​(ρ,Φ)=ReTr((id⊗Φ)(∣χρ​⟩⟨χρ​∣)∣χρ​⟩⟨χρ​∣), where χρ(i,j)=(ρ)ji\chi_\rho(i,j)=(\sqrt\rho)_{j i}χρ​(i,j)=(ρ​)ji​, the square root is defined by continuous functional calculus, and id⊗Φ\mathrm{id}\otimes\Phiid⊗Φ applies Φ\PhiΦ to each matrix block indexed by the first 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