Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.4 (5.81)–(5.84): further conditional chain rules

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.conditional_chain_variants

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are Q~α=Tr⁡(σ(1−α)/(2α)ρσ(1−α)/(2α))α\widetilde Q_\alpha=\operatorname{Tr}(\sigma^{(1-\alpha)/(2\alpha)}\rho\sigma^{(1-\alpha)/(2\alpha)})^\alphaQ​α​=Tr(σ(1−α)/(2α)ρσ(1−α)/(2α))α and Q‾α=Tr⁡(ρασ1−α)\overline Q_\alpha=\operatorname{Tr}(\rho^\alpha\sigma^{1-\alpha})Q​α​=Tr(ρασ1−α); the divergences include division by Tr⁡ρ\operatorname{Tr}\rhoTrρ inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation ρ≪σ\rho\ll\sigmaρ≪σ means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation H(A∣B)=H(AB)−H(B)H(A|B)=H(AB)-H(B)H(A∣B)=H(AB)−H(B) denotes conditional von Neumann entropy.

For normalized ABC: Hbarα↑(AB|C)≤Hbar0↑(A|BC)+Hbarα↑(B|C); Htildeα↑(AB|C)≥Htildeα↓(A|BC)+Hmin(B|C); replacing the down entropy gives (5.84) with α=2−1/β and admissible positive orders.

H‾α↑(AB∣C)≤H‾0↑(A∣BC)+H‾α↑(B∣C),H~α↑(AB∣C)≥H~α↓(A∣BC)+Hmin⁡(B∣C)≥H~β↑(A∣BC)+Hmin⁡(B∣C),α=2−1/β.\overline H_\alpha^\uparrow(AB|C)\le\overline H_0^\uparrow(A|BC)+\overline H_\alpha^\uparrow(B|C),\quad\widetilde H_\alpha^\uparrow(AB|C)\ge\widetilde H_\alpha^\downarrow(A|BC)+H_{\min}(B|C)\ge\widetilde H_\beta^\uparrow(A|BC)+H_{\min}(B|C),\quad\alpha=2-1/\beta.Hα↑​(AB∣C)≤H0↑​(A∣BC)+Hα↑​(B∣C),Hα↑​(AB∣C)≥Hα↓​(A∣BC)+Hmin​(B∣C)≥Hβ↑​(A∣BC)+Hmin​(B∣C),α=2−1/β.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#5.chainvariants
Equations (5.81), (5.83), (5.84), PDF p.87. Each clause has its own order domain. -/
theorem conditional_chain_variants [Nonempty A] [Nonempty B] [Nonempty C]
    (r : paperMat ((A × B) × C)) (hr : IsDensityMatrix r) :
    (∀ a : ENNReal, a ≤ 2 → conditionalUp false a r ≤ conditionalUp false 0 (paperRegroup r)+conditionalUp false a (paperMarginalBC r)) ∧
    (∀ a : ENNReal, 1/2 ≤ a → conditionalDown true a (paperRegroup r)+conditionalUp true ⊤ (paperMarginalBC r) ≤ conditionalUp true a r) ∧
    (∀ a b : ENNReal, 1/2 ≤ a → 1/2 ≤ b → a = transformedOrder b →
      conditionalUp true b (paperRegroup r)+conditionalUp true ⊤ (paperMarginalBC r) ≤ conditionalUp true a r) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 87, §5.4 (5.81)–(5.84): further conditional chain rules
Read-back

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

Let A,B,CA,B,CA,B,C be finite nonempty index types with decidable equality, and let r⪰0r\succeq0r⪰0 on (A×B)×C(A\times B)\times C(A×B)×C have trace one. Write

R(u,(b,c)),(u′,(b′,c′))=r((u,b),c),((u′,b′),c′),S(b,c),(b′,c′)=∑ur((u,b),c),((u,b′),c′).R_{(u,(b,c)),(u',(b',c'))} =r_{((u,b),c),((u',b'),c')},\qquad S_{(b,c),(b',c')}=\sum_u r_{((u,b),c),((u,b'),c')}.R(u,(b,c)),(u′,(b′,c′))​=r((u,b),c),((u′,b′),c′)​,S(b,c),(b′,c′)​=u∑​r((u,b),c),((u,b′),c′)​.

Define X[p]X^{[p]}X[p] by functional calculus with the function zero at zero and xpx^pxp elsewhere, define log⁡2X=cfc⁡(log⁡2,X)\log_2X=\operatorname{cfc}(\log_2,X)log2​X=cfc(log2​,X), and set L(0)=−∞L(0)=-\inftyL(0)=−∞, L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise. For positive semidefinite X,YX,YX,Y, put

Qt0(X,Y)=Re⁡tr⁡(X[t]Y[1−t]),Qt1(X,Y)=Re⁡tr⁡[(Y[(1−t)/(2t)]XY[(1−t)/(2t)])[t]].Q_t^0(X,Y)=\operatorname{Re}\operatorname{tr}(X^{[t]}Y^{[1-t]}),\qquad Q_t^1(X,Y)=\operatorname{Re}\operatorname{tr} \left[\left(Y^{[(1-t)/(2t)]}XY^{[(1-t)/(2t)]}\right)^{[t]}\right].Qt0​(X,Y)=Retr(X[t]Y[1−t]),Qt1​(X,Y)=Retr[(Y[(1−t)/(2t)]XY[(1−t)/(2t)])[t]].

For real t>0t>0t>0, at t=1t=1t=1 let Dtϵ(X,Y)D_t^\epsilon(X,Y)Dtϵ​(X,Y) equal Re⁡tr⁡[X(log⁡2X−log⁡2Y)]/Re⁡tr⁡X\operatorname{Re}\operatorname{tr}[X(\log_2X-\log_2Y)]/\operatorname{Re}\operatorname{tr}XRetr[X(log2​X−log2​Y)]/RetrX if ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise; at t≠1t\ne1t=1, let it equal

1t−1L ⁣(Qtϵ(X,Y)Re⁡tr⁡X)\frac1{t-1}L\!\left(\frac{Q_t^\epsilon(X,Y)} {\operatorname{Re}\operatorname{tr}X}\right)t−11​L(RetrXQtϵ​(X,Y)​)

when (t<1 and Qtϵ(X,Y)>0)(t<1\text{ and }Q_t^\epsilon(X,Y)>0)(t<1 and Qtϵ​(X,Y)>0) or ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise. Extend by D0ϵ=inf⁡t>0DtϵD_0^\epsilon=\inf_{t>0}D_t^\epsilonD0ϵ​=inft>0​Dtϵ​, D∞0=sup⁡t>0Dt0D_\infty^0=\sup_{t>0}D_t^0D∞0​=supt>0​Dt0​, and D∞1(X,Y)=inf⁡{λ∈R:X⪯2λY}D_\infty^1(X,Y)=\inf\{\lambda\in\mathbb R:X\preceq2^\lambda Y\}D∞1​(X,Y)=inf{λ∈R:X⪯2λY}, with X⪯YX\preceq YX⪯Y meaning Y−X⪰0Y-X\succeq0Y−X⪰0. For XXX on E×FE\times FE×F, define (XF)v,w=∑uX(u,v),(u,w)(X_F)_{v,w}=\sum_uX_{(u,v),(u,w)}(XF​)v,w​=∑u​X(u,v),(u,w)​ and

Hϵ↓(X;t)=−Dtϵ(X,IE⊗XF),Hϵ↑(X;t)=sup⁡σ⪰0Re⁡tr⁡σ≤1[−Dtϵ(X,IE⊗σ)].H_\epsilon^\downarrow(X;t)=-D_t^\epsilon(X,I_E\otimes X_F),\qquad H_\epsilon^\uparrow(X;t)= \sup_{\substack{\sigma\succeq0\\\operatorname{Re}\operatorname{tr}\sigma\le1}} [-D_t^\epsilon(X,I_E\otimes\sigma)].Hϵ↓​(X;t)=−Dtϵ​(X,IE​⊗XF​),Hϵ↑​(X;t)=σ⪰0Retrσ≤1​sup​[−Dtϵ​(X,IE​⊗σ)].

All optimizations and sums here are extended real, and the upward optimization includes zero. Define b′=2b'=2b′=2 for b=∞b=\inftyb=∞, and b′=max⁡(2−1/b,0)b'=\max(2-1/b,0)b′=max(2−1/b,0) otherwise. The assertion consists of the following three universally quantified inequalities:

For every a∈[0,∞] with a≤2,H0↑(r;a)≤H0↑(R;0)+H0↑(S;a);For every a∈[0,∞] with a≥12,H1↓(R;a)+H1↑(S;∞)≤H1↑(r;a);For every a,b∈[0,∞] with a,b≥12 and a=b′,H1↑(R;b)+H1↑(S;∞)≤H1↑(r;a).\begin{aligned} &\text{For every }a\in[0,\infty]\text{ with }a\le2,\quad H_0^\uparrow(r;a)\le H_0^\uparrow(R;0)+H_0^\uparrow(S;a);\\ &\text{For every }a\in[0,\infty]\text{ with }a\ge\tfrac12,\quad H_1^\downarrow(R;a)+H_1^\uparrow(S;\infty)\le H_1^\uparrow(r;a);\\ &\text{For every }a,b\in[0,\infty]\text{ with }a,b\ge\tfrac12 \text{ and }a=b',\quad H_1^\uparrow(R;b)+H_1^\uparrow(S;\infty)\le H_1^\uparrow(r;a). \end{aligned}​For every a∈[0,∞] with a≤2,H0↑​(r;a)≤H0↑​(R;0)+H0↑​(S;a);For every a∈[0,∞] with a≥21​,H1↓​(R;a)+H1↑​(S;∞)≤H1↑​(r;a);For every a,b∈[0,∞] with a,b≥21​ and a=b′,H1↑​(R;b)+H1↑​(S;∞)≤H1↑​(r;a).​

In the last line, b=12b=\tfrac12b=21​ would give a=0a=0a=0 and therefore cannot satisfy the simultaneous hypothesis a≥12a\ge\tfrac12a≥21​.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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