Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

5.10

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.conditional_order_comparisons

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.

All four comparisons (5.66)–(5.67) at transformed order 2−1/α for 1/2≤α≤∞: tilde-up≤bar-up, bar-up≤bar-down, tilde-up≤tilde-down, and tilde-down≤bar-down, with each RHS at transformed order.

H~α↑≤H‾2−1/α↑,H‾α↑≤H‾2−1/α↓,H~α↑≤H~2−1/α↓,H~α↓≤H‾2−1/α↓.\widetilde H_\alpha^\uparrow\le\overline H_{2-1/\alpha}^\uparrow,\quad\overline H_\alpha^\uparrow\le\overline H_{2-1/\alpha}^\downarrow,\quad\widetilde H_\alpha^\uparrow\le\widetilde H_{2-1/\alpha}^\downarrow,\quad\widetilde H_\alpha^\downarrow\le\overline H_{2-1/\alpha}^\downarrow.Hα↑​≤H2−1/α↑​,Hα↑​≤H2−1/α↓​,Hα↑​≤H2−1/α↓​,Hα↓​≤H2−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.10
5.10, arXiv:1504.00233v5, PDF p.85. -/
theorem conditional_order_comparisons [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
    (a : ENNReal) (ha : 1/2 ≤ a) :
    conditionalUp true a r ≤ conditionalUp false (transformedOrder a) r ∧
    conditionalUp false a r ≤ conditionalDown false (transformedOrder a) r ∧
    conditionalUp true a r ≤ conditionalDown true (transformedOrder a) r ∧
    conditionalDown true a r ≤ conditionalDown false (transformedOrder 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. 85, 5.10
Read-back

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

Let A,BA,BA,B be finite nonempty index types with decidable equality, let rrr be a complex matrix on A×BA\times BA×B that is positive semidefinite with tr⁡r=1\operatorname{tr}r=1trr=1, and let a∈[0,∞]a\in[0,\infty]a∈[0,∞] satisfy a≥12a\ge \tfrac12a≥21​. The conditional quantities in the assertion are defined as follows. Write X[t]=cfc⁡(ft,X)X^{[t]}=\operatorname{cfc}(f_t,X)X[t]=cfc(ft​,X), where ft(0)=0f_t(0)=0ft​(0)=0 and ft(x)=xtf_t(x)=x^tft​(x)=xt for x≠0x\ne0x=0, and write log⁡2X=cfc⁡(log⁡2,X)\log_2X=\operatorname{cfc}(\log_2,X)log2​X=cfc(log2​,X). Set L(0)=−∞L(0)=-\inftyL(0)=−∞ and L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise, with values in the extended reals. For positive semidefinite X,YX,YX,Y, put X◃YX\triangleleft YX◃Y when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and define

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}\!\left(X^{[t]}Y^{[1-t]}\right), \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, let

Dtϵ(X,Y)={Re⁡tr⁡[X(log⁡2X−log⁡2Y)]Re⁡tr⁡X,t=1, X◃Y,+∞,t=1, X◃̸Y,1t−1 L ⁣(Qtϵ(X,Y)Re⁡tr⁡X),t≠1, ((t<1 and Qtϵ(X,Y)>0) or X◃Y),+∞,otherwise.D_t^\epsilon(X,Y)= \begin{cases} \dfrac{\operatorname{Re}\operatorname{tr}[X(\log_2X-\log_2Y)]} {\operatorname{Re}\operatorname{tr}X}, &t=1,\ X\triangleleft Y,\\ +\infty,&t=1,\ X\not\triangleleft Y,\\ \dfrac1{t-1}\,L\!\left(\dfrac{Q_t^\epsilon(X,Y)} {\operatorname{Re}\operatorname{tr}X}\right), &t\ne1,\ ((t<1\ \text{and }Q_t^\epsilon(X,Y)>0)\ \text{or }X\triangleleft Y),\\ +\infty,&\text{otherwise}. \end{cases}Dtϵ​(X,Y)=⎩⎨⎧​RetrXRetr[X(log2​X−log2​Y)]​,+∞,t−11​L(RetrXQtϵ​(X,Y)​),+∞,​t=1, X◃Y,t=1, X◃Y,t=1, ((t<1 and Qtϵ​(X,Y)>0) or X◃Y),otherwise.​

The real-valued first branch is embedded in the extended reals. Extend this definition 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},

where X⪯YX\preceq YX⪯Y means Y−XY-XY−X is positive semidefinite and the infimum is taken in the extended reals. For a matrix XXX on E×FE\times FE×F, define its second marginal by (XF)b,b′=∑eX(e,b),(e,b′)(X_F)_{b,b'}=\sum_eX_{(e,b),(e,b')}(XF​)b,b′​=∑e​X(e,b),(e,b′)​, and set

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}} \bigl[-D_t^\epsilon(X,I_E\otimes\sigma)\bigr].Hϵ↓​(X;t)=−Dtϵ​(X,IE​⊗XF​),Hϵ↑​(X;t)=σ⪰0Retrσ≤1​sup​[−Dtϵ​(X,IE​⊗σ)].

Thus the optimizing matrices may have trace less than one, including zero; all these suprema and infima use extended-real arithmetic, and X[0]X^{[0]}X[0] uses the specified zero-at-zero convention. Define a′=2a'=2a′=2 if a=∞a=\inftya=∞, and a′=max⁡(2−1/a,0)a'=\max(2-1/a,0)a′=max(2−1/a,0) otherwise. Then all four inequalities hold:

H1↑(r;a)≤H0↑(r;a′),H0↑(r;a)≤H0↓(r;a′),H1↑(r;a)≤H1↓(r;a′),H1↓(r;a)≤H0↓(r;a′).H_1^\uparrow(r;a)\le H_0^\uparrow(r;a'),\qquad H_0^\uparrow(r;a)\le H_0^\downarrow(r;a'),\qquad H_1^\uparrow(r;a)\le H_1^\downarrow(r;a'),\qquad H_1^\downarrow(r;a)\le H_0^\downarrow(r;a').H1↑​(r;a)≤H0↑​(r;a′),H0↑​(r;a)≤H0↓​(r;a′),H1↑​(r;a)≤H1↓​(r;a′),H1↓​(r;a)≤H0↓​(r;a′).

The allowed orders include a=12a=\tfrac12a=21​, for which a′=0a'=0a′=0, and a=∞a=\inftya=∞, for which a′=2a'=2a′=2.

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