Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark A.15: For measurable cq phi*, input P and CPTP psi*, I(P;psi*∘phi*)≤I(P;phi*), with I(P;phi*)=H(Pphi*)−H(phi*|P).

Open
QAlgorithms.Papers.Independent.Renew46.P43.cqProcessing

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

prove2quantum

Let WWW be a measurable map from an arbitrary measurable input space into the normalized states of a finite intrinsic system, let PPP be any input probability measure, and let ψ∗\psi_*ψ∗​ be a CPTP output operation. The average PWPWPW and entropy averages are Bochner integrals of bounded measurable state functions. Define cq information by the mean divergence ∫D(Wx∥PW) dP(x)\int D(W_x\Vert PW)\,dP(x)∫D(Wx​∥PW)dP(x).

I(P;W)=H(PW)−∫H(Wx) dP(x),I(P;ψ∗∘W)≤I(P;W).I(P;W)=H(PW)-\int H(W_x)\,dP(x),\qquad I(P;\psi_*\circ W)\le I(P;W).I(P;W)=H(PW)−∫H(Wx​)dP(x),I(P;ψ∗​∘W)≤I(P;W).

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

/-- Remark A.15, PDF p.73: the entropy-difference identity and genuine channel
processing for arbitrary measurable input laws. Finite-dimensional normalized state
integrands are bounded, so their Bochner integrals are not totalized junk values. -/
theorem cqProcessing {X : Type*} [MeasurableSpace X] {Y Z : IntrinsicSystem}
    (mu : Measure X) [IsProbabilityMeasure mu]
    (W : X → Matrix (Fin Y.dim) (Fin Y.dim) ℂ) (hW : Measurable W)
    (hstates : ∀ x, Y.IsState (W x)) (T : IntrinsicOperation Z Y) :
    cqInformation mu W = ENNReal.ofReal
      (vnEntropy (cqAverage mu W) - ∫ x, vnEntropy (W x) ∂mu) ∧
    cqInformation mu (fun x => intrinsicRestriction Z T.map (W x)) ≤ cqInformation mu W := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 73, Remark A.15
Read-back

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

Let XXX be any measurable space, μ\muμ a probability measure on XXX, and Y,ZY,ZY,Z systems with positive integer dimensions dY,dZd_Y,d_ZdY​,dZ​ and block-label functions bY,bZb_Y,b_ZbY​,bZ​. Let W:X→CdY×dYW:X\to\mathbb C^{d_Y\times d_Y}W:X→CdY​×dY​ be measurable, with every W(x)W(x)W(x) positive semidefinite, of trace 111, and zero between unequal YYY-block labels. Let T:CdZ×dZ→CdY×dYT:\mathbb C^{d_Z\times d_Z}\to\mathbb C^{d_Y\times d_Y}T:CdZ​×dZ​→CdY​×dY​ be complex-linear, send identity to identity, and send matrices supported within ZZZ-blocks to matrices supported within YYY-blocks. Assume also that, for every integer m≥0m\ge0m≥0, its amplification (Q(u,a),(v,b))↦(T((Q(u,a),(v,b))a,b)cd)(u,c),(v,d)(Q_{(u,a),(v,b)})\mapsto(T((Q_{(u,a),(v,b)})_{a,b})_{cd})_{(u,c),(v,d)}(Q(u,a),(v,b)​)↦(T((Q(u,a),(v,b)​)a,b​)cd​)(u,c),(v,d)​ sends positive semidefinite matrices satisfying Q(u,a),(v,b)=0Q_{(u,a),(v,b)}=0Q(u,a),(v,b)​=0 whenever bZ(a)≠bZ(b)b_Z(a)\ne b_Z(b)bZ​(a)=bZ​(b) to positive semidefinite matrices. Define

V(x)ab={tr⁡ ⁣(W(x)T(eba)),bZ(a)=bZ(b),0,otherwise,W‾=∫XW(x) dμ(x),V‾=∫XV(x) dμ(x),V(x)_{ab}= \begin{cases} \operatorname{tr}\!\bigl(W(x)T(e_{ba})\bigr),&b_Z(a)=b_Z(b),\\ 0,&\text{otherwise}, \end{cases} \qquad \overline W=\int_X W(x)\,d\mu(x),\qquad \overline V=\int_X V(x)\,d\mu(x),V(x)ab​={tr(W(x)T(eba​)),0,​bZ​(a)=bZ​(b),otherwise,​W=∫X​W(x)dμ(x),V=∫X​V(x)dμ(x),

where ebae_{ba}eba​ is a matrix unit and the matrix integrals are Bochner integrals. For matrices P,QP,QP,Q, define D2(P∥Q)∈[0,∞]D_2(P\|Q)\in[0,\infty]D2​(P∥Q)∈[0,∞] to be 000 if either matrix is not positive semidefinite of trace 111; if both are such matrices, define it to be +∞+\infty+∞ when ker⁡Q⊈ker⁡P\ker Q\not\subseteq\ker PkerQ⊆kerP, and otherwise

D2(P∥Q)=max⁡ ⁣{Re⁡tr⁡ ⁣(f(P)−P log⁡Q),0}log⁡2,f(t)=tlog⁡t,D_2(P\|Q)= \frac{\max\!\left\{\operatorname{Re}\operatorname{tr}\!\bigl(f(P)-P\,\log Q\bigr),0\right\}}{\log 2}, \qquad f(t)=t\log t,D2​(P∥Q)=log2max{Retr(f(P)−PlogQ),0}​,f(t)=tlogt,

with the scalar functions applied by continuous functional calculus and the total convention log⁡0=0\log0=0log0=0. Write S(P)=−Re⁡tr⁡(g(P))S(P)=-\operatorname{Re}\operatorname{tr}(g(P))S(P)=−Retr(g(P)), where g(t)=tlog⁡2tg(t)=t\log_2tg(t)=tlog2​t. Then both

∫XD2(W(x)∥W‾) dμ(x)=max⁡ ⁣{S(W‾)−∫XS(W(x)) dμ(x),0}\int_X D_2(W(x)\|\overline W)\,d\mu(x) = \max\!\left\{S(\overline W)-\int_X S(W(x))\,d\mu(x),0\right\}∫X​D2​(W(x)∥W)dμ(x)=max{S(W)−∫X​S(W(x))dμ(x),0}

and

∫XD2(V(x)∥V‾) dμ(x)≤∫XD2(W(x)∥W‾) dμ(x)\int_X D_2(V(x)\|\overline V)\,d\mu(x) \le \int_X D_2(W(x)\|\overline W)\,d\mu(x)∫X​D2​(V(x)∥V)dμ(x)≤∫X​D2​(W(x)∥W)dμ(x)

hold, with the nonnegative extended-real integrals understood as lower Lebesgue integrals.

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