Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem A.20: Compatible quantum operations phi:X→A,psi:Y→A with X OR Y commutative satisfy H(phi|psi)≥0.

Open
QAlgorithms.Papers.Independent.Renew46.P43.classicalConditionalEntropy

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

prove2quantum

Fix a normalized state on a finite ambient algebra and compatible CP-unital operations ϕ:X→A\phi:\mathcal X\to Aϕ:X→A and ψ:Y→A\psi:\mathcal Y\to Aψ:Y→A. Commutativity is a disjunction on the entire domain algebras, not on one pair of operators.

X or Y commutative⟹H(ϕ∣ψ)≥0.\mathcal X\text{ or }\mathcal Y\text{ commutative}\Longrightarrow H(\phi\mid\psi)\ge0.X or Y commutative⟹H(ϕ∣ψ)≥0.

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.20, PDF p.74: at least one entire domain algebra is commutative;
no nonnegativity hypothesis is imposed on the desired conditional entropy. -/
theorem classicalConditionalEntropy {X Y A : IntrinsicSystem} (E : IntrinsicOperation X A) (F : IntrinsicOperation Y A)
    (hcompat : CommutingImages E.map F.map)
    (hclassical : (Function.Injective X.block) ∨ (Function.Injective Y.block))
    (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
    0 ≤ intrinsicConditionalEntropy 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. 74, Theorem A.20
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 dSd_SdS​ and block-label functions bS:{0,…,dS−1}→Nb_S:\{0,\ldots,d_S-1\}\to\mathbb NbS​:{0,…,dS​−1}→N; a matrix is block diagonal for SSS if its entries between different block labels vanish. 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 complex-linear, identity-preserving maps that preserve block diagonality and satisfy this positivity condition: for every integer m≥0m\ge0m≥0 and every positive semidefinite matrix TTT indexed by pairs (u,a)(u,a)(u,a), with u∈{0,…,m−1}u\in\{0,\ldots,m-1\}u∈{0,…,m−1} and aaa a source-system index, if T(u,a),(v,b)=0T_{(u,a),(v,b)}=0T(u,a),(v,b)​=0 whenever the source block labels of a,ba,ba,b differ, then the matrix with (u,v)(u,v)(u,v)-block equal to the image of TuvT_{uv}Tuv​ is positive semidefinite. Assume their images commute on block-diagonal inputs: 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 such T,UT,UT,U. Assume also that bXb_XbX​ is injective or bYb_YbY​ is injective, allowing both to be injective. Let ρ∈MdA(C)\rho\in M_{d_A}(\mathbb C)ρ∈MdA​​(C) be positive semidefinite, of trace 111, and block diagonal for AAA. Define

(ρY)rs={tr⁡(ρF(esr)),bY(r)=bY(s),0,otherwise,(ρXY)(u,r),(v,s)={tr⁡ ⁣(ρE(evu)F(esr)),bX(u)=bX(v), bY(r)=bY(s),0,otherwise,(\rho_Y)_{rs}= \begin{cases} \operatorname{tr}(\rho F(e_{sr})),&b_Y(r)=b_Y(s),\\ 0,&\text{otherwise}, \end{cases} \qquad (\rho_{XY})_{(u,r),(v,s)}= \begin{cases} \operatorname{tr}\!\bigl(\rho E(e_{vu})F(e_{sr})\bigr), &b_X(u)=b_X(v),\ b_Y(r)=b_Y(s),\\ 0,&\text{otherwise}, \end{cases}(ρY​)rs​={tr(ρF(esr​)),0,​bY​(r)=bY​(s),otherwise,​(ρXY​)(u,r),(v,s)​={tr(ρE(evu​)F(esr​)),0,​bX​(u)=bX​(v), bY​(r)=bY​(s),otherwise,​

where evue_{vu}evu​ denotes the appropriate matrix unit. For H(M)=−Re⁡tr⁡(f(M))H(M)=-\operatorname{Re}\operatorname{tr}(f(M))H(M)=−Retr(f(M)), with f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t applied by functional calculus, the conclusion is

0≤H(ρXY)−H(ρY).0\le H(\rho_{XY})-H(\rho_Y).0≤H(ρXY​)−H(ρY​).

Dimensions equal to 111 are included; in particular, injectivity of a block-label function on a one-element index set is automatic.

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