Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem A.13: Compatible subalgebras and any state satisfy |H(Xalg)−H(Yalg)|≤H(Xalg Yalg).

Proved
QAlgorithms.Papers.Independent.Renew46.P43.entropyTriangle

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

prove2quantum

Fix one normalized ambient state and finite intrinsic C*-algebras. Subsystem inclusions are unital star embeddings and distinct named compatible images commute elementwise, with central overlap allowed. Entropies are those of trace-adjoint restrictions; H(XY)H(XY)H(XY) is entropy on the generated algebra, equivalently the spectrum-preserving pullback by multiplication. Mutual information is I(X;Y)=H(X)+H(Y)−H(XY)I(X;Y)=H(X)+H(Y)-H(XY)I(X;Y)=H(X)+H(Y)−H(XY). In subalgebra processing the larger algebras are compatible. In operation processing the maps ψi\psi_iψi​ are compatible CP-unital maps and ϕi\phi_iϕi​ arbitrary composable CP-unital maps, not necessarily homomorphisms.

∣H(X)−H(Y)∣≤H(XY).|H(X)-H(Y)|\le H(XY).∣H(X)−H(Y)∣≤H(XY).

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 A.13, PDF pp.71-72: the intrinsic-algebra entropy triangle inequality. -/
theorem entropyTriangle {X Y A : IntrinsicSystem} (E : Embedding X A) (F : Embedding Y A)
    (hcompat : CommutingImages E.map F.map) (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ)
    (hrho : A.IsState rho) :
    |viewedEntropy X E.map rho - viewedEntropy Y F.map rho| ≤
      vnEntropy (jointState X Y E.map F.map rho) := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

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

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

Let X,Y,AX,Y,AX,Y,A be systems with positive integer dimensions dZd_ZdZ​ and coordinate block labels βZ\beta_ZβZ​, and call a matrix block-respecting if its entries between unequal labels are zero. Let E:MdX(C)→MdA(C)E:M_{d_X}(\mathbb C)\to M_{d_A}(\mathbb C)E:MdX​​(C)→MdA​​(C) and F:MdY(C)→MdA(C)F:M_{d_Y}(\mathbb C)\to M_{d_A}(\mathbb C)F:MdY​​(C)→MdA​​(C) be unital complex-linear maps that preserve the block algebras, preserve products and adjoints on those algebras, are injective on those algebras, and preserve positive semidefiniteness under every finite amplification on matrices supported within equal source-block labels. Suppose their images commute on these algebras: E(T)F(U)=F(U)E(T)E(T)F(U)=F(U)E(T)E(T)F(U)=F(U)E(T) for every block-respecting T,UT,UT,U. For every positive semidefinite, trace-111, block-respecting matrix ρ\rhoρ on AAA, define

(ρX)ij={tr⁡(ρE(eji)),βX(i)=βX(j),0,otherwise,(ρY)uv={tr⁡(ρF(evu)),βY(u)=βY(v),0,otherwise,(\rho_X)_{ij}= \begin{cases} \operatorname{tr}\bigl(\rho E(e_{ji})\bigr),&\beta_X(i)=\beta_X(j),\\ 0,&\text{otherwise}, \end{cases} \qquad (\rho_Y)_{uv}= \begin{cases} \operatorname{tr}\bigl(\rho F(e_{vu})\bigr),&\beta_Y(u)=\beta_Y(v),\\ 0,&\text{otherwise}, \end{cases}(ρX​)ij​={tr(ρE(eji​)),0,​βX​(i)=βX​(j),otherwise,​(ρY​)uv​={tr(ρF(evu​)),0,​βY​(u)=βY​(v),otherwise,​

and

J(i,u),(j,v)={tr⁡(ρE(eji)F(evu)),βX(i)=βX(j) and βY(u)=βY(v),0,otherwise,J_{(i,u),(j,v)}= \begin{cases} \operatorname{tr}\bigl(\rho E(e_{ji})F(e_{vu})\bigr), &\beta_X(i)=\beta_X(j)\ \text{and}\ \beta_Y(u)=\beta_Y(v),\\ 0,&\text{otherwise}, \end{cases}J(i,u),(j,v)​={tr(ρE(eji​)F(evu​)),0,​βX​(i)=βX​(j) and βY​(u)=βY​(v),otherwise,​

where the eee's are the corresponding matrix units. Then

∣H(ρX)−H(ρY)∣≤H(J),H(M)=−Re⁡tr⁡(cfc⁡[t↦tlog⁡2t](M)).\bigl|H(\rho_X)-H(\rho_Y)\bigr|\le H(J), \qquad H(M)=-\operatorname{Re}\operatorname{tr}\bigl(\operatorname{cfc}[t\mapsto t\log_2t](M)\bigr).​H(ρX​)−H(ρY​)​≤H(J),H(M)=−Retr(cfc[t↦tlog2​t](M)).
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