Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem A.23: H(psi|phi)≤H(psi|phi∘phiPrime), in particular ≤H(psi), for compatible phi,psi and arbitrary CP-unital phiPrime:Xprime→X.

Open
QAlgorithms.Papers.Independent.Renew46.P43.knowledgeDecreasesUncertainty

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

prove2quantum

Fix a normalized state and compatible CP-unital Heisenberg maps ϕ:X→A\phi:X\to Aϕ:X→A, ψ:Y→A\psi:Y\to Aψ:Y→A, together with any CP-unital map ϕ′:X′→X\phi':X'\to Xϕ′:X′→X. Conditional entropy is joint viewed entropy minus conditioning entropy and need not be nonnegative.

H(ψ∣ϕ)≤H(ψ∣ϕ∘ϕ′),H(ψ∣ϕ)≤H(ψ).H(\psi\mid\phi)\le H(\psi\mid\phi\circ\phi'),\qquad H(\psi\mid\phi)\le H(\psi).H(ψ∣ϕ)≤H(ψ∣ϕ∘ϕ′),H(ψ∣ϕ)≤H(ψ).

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.23, PDF p.75: conditioning is weakened by Heisenberg preprocessing,
with the unconditional upper bound retained as a second conclusion. -/
theorem knowledgeDecreasesUncertainty {X Y Xnew A : IntrinsicSystem}
    (E : IntrinsicOperation X A) (F : IntrinsicOperation Y A) (hcompat : CommutingImages E.map F.map)
    (i : IntrinsicOperation Xnew X) (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
    intrinsicConditionalEntropy Y X F.map E.map rho ≤
      intrinsicConditionalEntropy Y Xnew F.map (E.map.comp i.map) rho ∧
    intrinsicConditionalEntropy Y X F.map E.map rho ≤ viewedEntropy Y 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. 75, Theorem A.23
Read-back

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

Let X,Y,Xnew,AX,Y,X_{\mathrm{new}},AX,Y,Xnew​,A be systems, each with 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; call matrices block diagonal when 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), F:MdY(C)→MdA(C)F:M_{d_Y}(\mathbb C)\to M_{d_A}(\mathbb C)F:MdY​​(C)→MdA​​(C), and i:MdXnew(C)→MdX(C)i:M_{d_{X_{\mathrm{new}}}}(\mathbb C)\to M_{d_X}(\mathbb C)i:MdXnew​​​(C)→MdX​​(C) be complex-linear maps that preserve identity matrices and block diagonality. Each must also preserve positive semidefiniteness under every amplification, including amplification size 000: whenever a positive semidefinite block matrix TTT has entries zero between different source-system block labels, applying the map separately to every matrix block of TTT yields a positive semidefinite matrix. 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 block-diagonal TTT for XXX and UUU for YYY. Let ρ∈MdA(C)\rho\in M_{d_A}(\mathbb C)ρ∈MdA​​(C) be positive semidefinite, have trace 111, and be block diagonal for AAA. For a map GGG from the matrices of a system SSS into those of AAA, define its restricted matrix by

(RGS)uv={tr⁡(ρG(evu)),bS(u)=bS(v),0,otherwise.(R_G^S)_{uv}= \begin{cases} \operatorname{tr}(\rho G(e_{vu})),&b_S(u)=b_S(v),\\ 0,&\text{otherwise}. \end{cases}(RGS​)uv​={tr(ρG(evu​)),0,​bS​(u)=bS​(v),otherwise.​

For maps G,HG,HG,H associated with systems S,TS,TS,T, respectively, define

(JG,HS,T)(u,r),(v,s)={tr⁡ ⁣(ρG(evu)H(esr)),bS(u)=bS(v), bT(r)=bT(s),0,otherwise,(J_{G,H}^{S,T})_{(u,r),(v,s)}= \begin{cases} \operatorname{tr}\!\bigl(\rho G(e_{vu})H(e_{sr})\bigr), &b_S(u)=b_S(v),\ b_T(r)=b_T(s),\\ 0,&\text{otherwise}, \end{cases}(JG,HS,T​)(u,r),(v,s)​={tr(ρG(evu​)H(esr​)),0,​bS​(u)=bS​(v), bT​(r)=bT​(s),otherwise,​

where the evue_{vu}evu​ are matrix units in their respective spaces. With H0(M)=−Re⁡tr⁡(f(M))H_0(M)=-\operatorname{Re}\operatorname{tr}(f(M))H0​(M)=−Retr(f(M)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by functional calculus, both inequalities hold:

H0(JF,EY,X)−H0(REX)≤H0(JF,E∘iY,Xnew)−H0(RE∘iXnew),H0(JF,EY,X)−H0(REX)≤H0(RFY).H_0(J_{F,E}^{Y,X})-H_0(R_E^X) \le H_0(J_{F,E\circ i}^{Y,X_{\mathrm{new}}})-H_0(R_{E\circ i}^{X_{\mathrm{new}}}), \qquad H_0(J_{F,E}^{Y,X})-H_0(R_E^X) \le H_0(R_F^Y).H0​(JF,EY,X​)−H0​(REX​)≤H0​(JF,E∘iY,Xnew​​)−H0​(RE∘iXnew​​),H0​(JF,EY,X​)−H0​(REX​)≤H0​(RFY​).

No injectivity, multiplicativity, or conjugate-transpose-preservation assumption is imposed on these maps beyond the stated requirements; dimensions equal to 111 are included.

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