Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.14-subalgebra-monotonicity: If Xalg⊆Xprime,Yalg⊆Yprime and larger algebras compatible, I(Xalg:Yalg)≤I(Xprime:Yprime).

Open
QAlgorithms.Papers.Independent.Renew46.P43.subalgebraInformation

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.

X⊆X′, Y⊆Y′⟹I(X;Y)≤I(X′;Y′).\mathcal X\subseteq\mathcal X',\ \mathcal Y\subseteq\mathcal Y'\Longrightarrow I(\mathcal X;\mathcal Y)\le I(\mathcal X';\mathcal Y').X⊆X′, Y⊆Y′⟹I(X;Y)≤I(X′;Y′).

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

/-- Subalgebra monotonicity following Theorem A.14, PDF p.72. The larger
subalgebras commute; the smaller ones are their actual included subalgebras. -/
theorem subalgebraInformation {X Y Xbig Ybig A : IntrinsicSystem}
    (E : Embedding Xbig A) (F : Embedding Ybig A) (hcompat : CommutingImages E.map F.map)
    (i : Embedding X Xbig) (j : Embedding Y Ybig)
    (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
    intrinsicMutualInformation X Y (E.map.comp i.map) (F.map.comp j.map) rho ≤
      intrinsicMutualInformation Xbig Ybig 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. 72, A.14-subalgebra-monotonicity
Read-back

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

Let X,Y,Xbig,Ybig,AX,Y,X_{\mathrm{big}},Y_{\mathrm{big}},AX,Y,Xbig​,Ybig​,A be systems, each consisting of a positive integer dimension dSd_SdS​ and a block-label function bS:{0,…,dS−1}→Nb_S:\{0,\ldots,d_S-1\}\to\mathbb NbS​:{0,…,dS​−1}→N; write BS\mathcal B_SBS​ for the matrices MMM satisfying Mab=0M_{ab}=0Mab​=0 whenever bS(a)≠bS(b)b_S(a)\ne b_S(b)bS​(a)=bS​(b). Let E:Xbig→AE:X_{\mathrm{big}}\to AE:Xbig​→A, F:Ybig→AF:Y_{\mathrm{big}}\to AF:Ybig​→A, i:X→Xbigi:X\to X_{\mathrm{big}}i:X→Xbig​, and j:Y→Ybigj:Y\to Y_{\mathrm{big}}j:Y→Ybig​ be embeddings in the following precise sense: each is a complex-linear map on the full matrix spaces, sends identity to identity, sends the source block algebra into the target block algebra, preserves adjoints and products on the source block algebra, and is injective on that algebra. Each also has the following positivity property for every integer m≥0m\ge0m≥0: if a positive semidefinite matrix TTT, indexed by pairs (u,a)(u,a)(u,a) with u<mu<mu<m and a<dSa<d_Sa<dS​, vanishes whenever bS(a)≠bS(b)b_S(a)\ne b_S(b)bS​(a)=bS​(b), then the matrix whose ((u,c),(v,d))((u,c),(v,d))((u,c),(v,d))-entry is G((T(u,a),(v,b))a,b)cdG((T_{(u,a),(v,b)})_{a,b})_{cd}G((T(u,a),(v,b)​)a,b​)cd​ is positive semidefinite, where GGG denotes the map in question. Assume 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 T∈BXbigT\in\mathcal B_{X_{\mathrm{big}}}T∈BXbig​​ and U∈BYbigU\in\mathcal B_{Y_{\mathrm{big}}}U∈BYbig​​. Let ρ∈BA\rho\in\mathcal B_Aρ∈BA​ be positive semidefinite with trace 111. For a map G:S→AG:S\to AG:S→A, define its restricted matrix by (RG)ab=tr⁡(ρG(eba))(R_G)_{ab}=\operatorname{tr}(\rho G(e_{ba}))(RG​)ab​=tr(ρG(eba​)) when bS(a)=bS(b)b_S(a)=b_S(b)bS​(a)=bS​(b), and 000 otherwise, where ebae_{ba}eba​ is the matrix unit. For maps G:S→AG:S\to AG:S→A and H:T→AH:T\to AH:T→A, define JG,HJ_{G,H}JG,H​ by

(JG,H)(a,c),(b,d)={tr⁡ ⁣(ρ G(eba)H(edc)),bS(a)=bS(b) and bT(c)=bT(d),0,otherwise.(J_{G,H})_{(a,c),(b,d)} = \begin{cases} \operatorname{tr}\!\bigl(\rho\,G(e_{ba})H(e_{dc})\bigr), &b_S(a)=b_S(b)\ \text{and}\ b_T(c)=b_T(d),\\ 0,&\text{otherwise}. \end{cases}(JG,H​)(a,c),(b,d)​={tr(ρG(eba​)H(edc​)),0,​bS​(a)=bS​(b) and bT​(c)=bT​(d),otherwise.​

Writing S(M)=−Re⁡tr⁡(f(M))S(M)=-\operatorname{Re}\operatorname{tr}(f(M))S(M)=−Retr(f(M)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus, the assertion is

S(RE∘i)+S(RF∘j)−S(JE∘i,F∘j)≤S(RE)+S(RF)−S(JE,F).S(R_{E\circ i})+S(R_{F\circ j})-S(J_{E\circ i,F\circ j}) \le S(R_E)+S(R_F)-S(J_{E,F}).S(RE∘i​)+S(RF∘j​)−S(JE∘i,F∘j​)≤S(RE​)+S(RF​)−S(JE,F​).
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