Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem II.3: total correlation equals quantum mutual information (original seed)

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.totalErasure_eq_mutualInformation

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho_{AB}ρAB​ be any density matrix on finite nonzero complex spaces A,BA,BA,B. For n≥1n\ge1n≥1 and ϵ>0\epsilon>0ϵ>0, minimize each noise cost over ensembles of product unitaries whose output on ρ⊗n\rho^{\otimes n}ρ⊗n is within full trace norm ϵ\epsilonϵ of a normalized product state. The allowed ensembles may be coordinated, independent across the parties, restricted to Alice, or restricted to Bob. The three costs are log⁡2N\log_2Nlog2​N, the Shannon entropy H(p)H(p)H(p), and entropy exchange Se(R,ρ⊗n)S_e(R,\rho^{\otimes n})Se​(R,ρ⊗n). All finite minima exist and are bounded below; their normalized sequences are bounded above and below. Define CerM,c,ℓ(ρ)C^{\mathcal M,c,\ell}_{\rm er}(\rho)CerM,c,ℓ​(ρ) by applying ℓ=lim inf⁡\ell=\liminfℓ=liminf or lim sup⁡\limsuplimsup to the normalized minima and then taking the supremum over ϵ>0\epsilon>0ϵ>0. The outer sets are bounded above. For every choice of noise class M\mathcal MM, cost ccc, and block limit ℓ\ellℓ,

CerM,c,ℓ(ρ)=I(A:B)ρ=S(ρA)+S(ρB)−S(ρ).C^{\mathcal M,c,\ell}_{\rm er}(\rho)=I(A:B)_\rho=S(\rho_A)+S(\rho_B)-S(\rho).CerM,c,ℓ​(ρ)=I(A:B)ρ​=S(ρA​)+S(ρB​)−S(ρ).

All entropies are in bits. This gives the operational meaning of total correlation and retains both displayed extreme equalities and the following robustness assertion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P47

open QAlgorithms Filter

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies localProduct)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation first)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon Config)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Advance50.P05 (RectangularInstrument)

open scoped Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.4, Theorem II.3, displayed extremes and robustness paragraph.
The minima and bounds exclude totalized-real infimum/limit artifacts. -/
theorem totalErasure_eq_mutualInformation {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
    (hrho : IsDensityMatrix rho) :
    (∀ eps > (0 : ℝ), ∀ mode cost,
      (∀ n, 0 < n → (totalCosts rho n eps mode cost).Nonempty ∧
        BddBelow (totalCosts rho n eps mode cost) ∧
        sInf (totalCosts rho n eps mode cost) ∈ totalCosts rho n eps mode cost) ∧
      BddBelow (Set.range (totalBlockRate rho eps mode cost)) ∧
      BddAbove (Set.range (totalBlockRate rho eps mode cost))) ∧
    (∀ mode cost pessimistic,
      BddAbove {v | ∃ eps > (0 : ℝ),
        v = rateLimit pessimistic (totalBlockRate rho eps mode cost)} ∧
      totalErasure rho mode cost pessimistic = mutualInformation rho) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P47

end
Source
On the quantum, classical and total amount of correlations in a quantum state, arXiv:quant-ph/0410091v2, PDF p. 4, Theorem II.3: total correlation equals quantum mutual information (original seed)
Read-back

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

For any finite nonempty types A,BA,BA,B and any positive semidefinite matrix ρ\rhoρ on A×BA\times BA×B with trace 111, define ρn\rho_nρn​ on An×BnA^n\times B^nAn×Bn by (ρn)(a,b),(a′,b′)=∏t=0n−1ρ(at,bt),(at′,bt′)(\rho_n)_{(a,b),(a',b')}=\prod_{t=0}^{n-1}\rho_{(a_t,b_t),(a'_t,b'_t)}(ρn​)(a,b),(a′,b′)​=∏t=0n−1​ρ(at​,bt​),(at′​,bt′​)​. A permitted random operation has a positive finite number rrr of terms, nonnegative weights wiw_iwi​ summing to 111, local unitaries Ui,ViU_i,V_iUi​,Vi​, and action R(X)=∑iwi(Ui⊗Vi)X(Ui⊗Vi)†\mathcal R(X)=\sum_iw_i(U_i\otimes V_i)X(U_i\otimes V_i)^\daggerR(X)=∑i​wi​(Ui​⊗Vi​)X(Ui​⊗Vi​)†. There are four choices of restriction: no further restriction; Vi=1V_i=1Vi​=1 for every iii; Ui=1U_i=1Ui​=1 for every iii; or an indexing of the terms by pairs of local choices such that both the weights and the unitaries factor into independent local choices. There are three choices of cost: log⁡2r\log_2 rlog2​r; −∑iwilog⁡2wi-\sum_iw_i\log_2w_i−∑i​wi​log2​wi​; or the entropy exchange H((id⊗R)(∣ρn⟩⟨ρn∣))H((\mathrm{id}\otimes\mathcal R)(|\sqrt{\rho_n}\rangle\langle\sqrt{\rho_n}|))H((id⊗R)(∣ρn​​⟩⟨ρn​​∣)), where the canonical purification has coefficients ⟨i,j∣X⟩=(X)ji\langle i,j|\sqrt X\rangle=(\sqrt X)_{j i}⟨i,j∣X​⟩=(X​)ji​ and H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X). Let Cn,εmode,costC_{n,\varepsilon}^{\mathrm{mode},\mathrm{cost}}Cn,εmode,cost​ be the set of these costs for operations satisfying ∥R(ρn)−a⊗b∥1≤ε\|\mathcal R(\rho_n)-a\otimes b\|_1\le\varepsilon∥R(ρn​)−a⊗b∥1​≤ε for some density matrices a,ba,ba,b, where ∥M∥1=Re⁡Tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{M^\dagger M}∥M∥1​=ReTrM†M​. Put bε(k)=inf⁡Ck+1,εmode,cost/(k+1)b_\varepsilon(k)=\inf C_{k+1,\varepsilon}^{\mathrm{mode},\mathrm{cost}}/(k+1)bε​(k)=infCk+1,εmode,cost​/(k+1). The declaration asserts that, for every ε>0\varepsilon>0ε>0, every restriction and every cost, each set Cn,εmode,costC_{n,\varepsilon}^{\mathrm{mode},\mathrm{cost}}Cn,εmode,cost​ with n>0n>0n>0 is nonempty, bounded below, and contains its infimum, and the entire sequence bε(k)b_\varepsilon(k)bε​(k), k≥0k\ge0k≥0, is bounded both below and above. Furthermore, for every restriction, cost, and choice L=lim sup⁡L=\limsupL=limsup or L=lim inf⁡L=\liminfL=liminf, the set {Lk→∞bε(k):ε>0}\{L_{k\to\infty}b_\varepsilon(k):\varepsilon>0\}{Lk→∞​bε​(k):ε>0} is bounded above and

sup⁡ε>0Lk→∞bε(k)=H(Tr⁡Bρ)+H(Tr⁡Aρ)−H(ρ).\sup_{\varepsilon>0}L_{k\to\infty}b_\varepsilon(k) =H(\operatorname{Tr}_B\rho)+H(\operatorname{Tr}_A\rho)-H(\rho).ε>0sup​Lk→∞​bε​(k)=H(TrB​ρ)+H(TrA​ρ)−H(ρ).

Here the partial traces sum over the discarded index. The supremum ranges over all positive tolerances; the finite-block assertions exclude n=0n=0n=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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