Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.14-operation-processing: For compatible CP-unital psi_i:A_i→A and CP-unital phi_i:A_i_prime→A_i, I(psi1∘phi1:psi2∘phi2)≤I(psi1:psi2).

Open
QAlgorithms.Papers.Independent.Renew46.P43.operationInformation

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.

I(ψ1∘ϕ1;ψ2∘ϕ2)≤I(ψ1;ψ2).I(\psi_1\circ\phi_1;\psi_2\circ\phi_2)\le I(\psi_1;\psi_2).I(ψ1​∘ϕ1​;ψ2​∘ϕ2​)≤I(ψ1​;ψ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

open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)

attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace

/-- General operation processing following Theorem A.14, PDF p.72: the local
operations are CP-unital maps, not assumed multiplicative. -/
theorem operationInformation {X Y Xnew Ynew A : IntrinsicSystem}
    (E : IntrinsicOperation X A) (F : IntrinsicOperation Y A) (hcompat : CommutingImages E.map F.map)
    (i : IntrinsicOperation Xnew X) (j : IntrinsicOperation Ynew Y)
    (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
    intrinsicMutualInformation Xnew Ynew (E.map.comp i.map) (F.map.comp j.map) rho ≤
      intrinsicMutualInformation 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. 72, A.14-operation-processing
Read-back

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

Let X,Y,Xnew,Ynew,AX,Y,X_{\mathrm{new}},Y_{\mathrm{new}},AX,Y,Xnew​,Ynew​,A be systems with positive integer dimensions dSd_SdS​ and block-label functions bS:{0,…,dS−1}→Nb_S:\{0,\ldots,d_S-1\}\to\mathbb NbS​:{0,…,dS​−1}→N, and let BS\mathcal B_SBS​ consist of matrices whose entries between unequal block labels are zero. Let E:X→AE:X\to AE:X→A, F:Y→AF:Y\to AF:Y→A, i:Xnew→Xi:X_{\mathrm{new}}\to Xi:Xnew​→X, and j:Ynew→Yj:Y_{\mathrm{new}}\to Yj:Ynew​→Y be complex-linear maps on the full matrix spaces. Each map sends identity to identity, sends the source block algebra into the target block algebra, and satisfies the following positivity condition for every integer m≥0m\ge0m≥0: whenever T≥0T\ge0T≥0 is indexed by (u,a)(u,a)(u,a), with u<mu<mu<m and aaa a source index, and T(u,a),(v,b)=0T_{(u,a),(v,b)}=0T(u,a),(v,b)​=0 for unequal source block labels, the amplified matrix with entries 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. 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 all T∈BXT\in\mathcal B_XT∈BX​ and U∈BYU\in\mathcal B_YU∈BY​, and let ρ∈BA\rho\in\mathcal B_Aρ∈BA​ be positive semidefinite with trace 111. For G:S→AG:S\to AG:S→A, set (RG)ab=tr⁡(ρG(eba))(R_G)_{ab}=\operatorname{tr}(\rho G(e_{ba}))(RG​)ab​=tr(ρG(eba​)) when the block labels of a,ba,ba,b agree, and 000 otherwise; here ebae_{ba}eba​ is a matrix unit. For G:S→AG:S\to AG:S→A and H:T→AH:T\to AH:T→A, set

(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.​

With 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 conclusion 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