Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2 (5.20)–(5.27): ordering and special cases

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.conditional_ordering_and_endpoints

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.

Retain up≥down for both families, tilde≥bar for each conditioning convention, and monotonicity in order; trivial conditioning recovers eigenvalue Rényi entropy, order one von Neumann, optimized tilde∞ min-entropy, optimized tilde1/2 max-entropy, tilde2 fixed-reference collision entropy and bar0 optimized Hartley entropy.

H‾α↓≤H‾α↑≤H~α↑,H‾α↓≤H~α↓≤H~α↑,H~∞↑=Hmin⁡,H~1/2↑=Hmax⁡.\overline H_\alpha^\downarrow\le\overline H_\alpha^\uparrow\le\widetilde H_\alpha^\uparrow,\quad\overline H_\alpha^\downarrow\le\widetilde H_\alpha^\downarrow\le\widetilde H_\alpha^\uparrow,\quad\widetilde H_\infty^\uparrow=H_{\min},\quad\widetilde H_{1/2}^\uparrow=H_{\max}.Hα↓​≤Hα↑​≤Hα↑​,Hα↓​≤Hα↓​≤Hα↑​,H∞↑​=Hmin​,H1/2↑​=Hmax​.

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.ordering
§5.2 (5.20)–(5.27): ordering and special cases, arXiv:1504.00233v5, PDF p.77,78. -/
theorem conditional_ordering_and_endpoints [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r) :
    (∀ a : ENNReal, conditionalDown false a r ≤ conditionalUp false a r ∧
      conditionalDown true a r ≤ conditionalUp true a r ∧ conditionalUp false a r ≤ conditionalUp true a r ∧
      conditionalDown false a r ≤ conditionalDown true a r) ∧
    (∀ sand up : Bool, Antitone (fun a : ENNReal => paperConditional sand up a r)) ∧
    (∀ sand up : Bool, paperConditional sand up 1 r = (conditionalVN r:EReal)) ∧
    conditionalUp true ⊤ r = paperHmin r ∧
    conditionalDown true ⊤ r = sSup {h : EReal | ∃ l : ℝ, h = (l:EReal) ∧
      paperBelow r (((2:ℝ)^(-l):ℂ) • Matrix.kronecker (1:paperMat A) (traceLeft r))} ∧
    conditionalUp true (1/2) r = hmax r ∧
    conditionalDown true 2 r = -paperLogE ((r*Matrix.kronecker (1:paperMat A) (paperPower (traceLeft r) (-1/2))*
      r*Matrix.kronecker (1:paperMat A) (paperPower (traceLeft r) (-1/2))).trace.re) ∧
    conditionalUp false 0 r = hartleyConditional r ∧
    (∀ s : paperMat A, IsDensityMatrix s → ∀ sand up : Bool, ∀ a : ℝ, 0 < a → a ≠ 1 →
      paperConditional sand up (ENNReal.ofReal a) (fun x y : A × Unit => s x.1 y.1) = 
        ((a/(1-a)*Real.logb 2 (paperSchatten s a):ℝ):EReal)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 77, §5.2 (5.20)–(5.27): ordering and special cases
Read-back

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

Let A,BA,BA,B be nonempty finite types with decidable equality, and let rrr be a positive semidefinite matrix of complex trace 111 on A×BA\times BA×B, with rB=Tr⁡Arr_B=\operatorname{Tr}_A rrB​=TrA​r. The following notation specifies all quantities in the assertion. Write X⪯YX\preceq YX⪯Y when Y−X⪰0Y-X\succeq0Y−X⪰0; call sss subnormalized when s⪰0s\succeq0s⪰0 and Re⁡tr⁡s≤1\operatorname{Re}\operatorname{tr}s\le1Retrs≤1; let X[t]X^{[t]}X[t] be functional calculus with value 000 at eigenvalue 000 and xtx^txt at nonzero eigenvalues; let L(X)=(x↦log⁡2x)(X)L(X)=(x\mapsto\log_2x)(X)L(X)=(x↦log2​x)(X), using the real logarithm with log⁡20=0\log_2 0=0log2​0=0; and put L(0)=−∞\mathcal L(0)=-\inftyL(0)=−∞, L(z)=log⁡2z\mathcal L(z)=\log_2zL(z)=log2​z for z≠0z\ne0z=0. Define

D(X∥Y)={Re⁡tr⁡(X(L(X)−L(Y)))Re⁡tr⁡Xker⁡Y⊆ker⁡X,+∞otherwise,Dmax⁡(X∥Y)=inf⁡{ℓ∈R:X⪯2ℓY},D(X\|Y)= \begin{cases} \displaystyle \frac{\operatorname{Re}\operatorname{tr}(X(L(X)-L(Y)))} {\operatorname{Re}\operatorname{tr}X}&\ker Y\subseteq\ker X,\\ +\infty&\text{otherwise}, \end{cases} \qquad D_{\max}(X\|Y)=\inf\{\ell\in\mathbb R:X\preceq2^\ell Y\},D(X∥Y)=⎩⎨⎧​RetrXRetr(X(L(X)−L(Y)))​+∞​kerY⊆kerX,otherwise,​Dmax​(X∥Y)=inf{ℓ∈R:X⪯2ℓY},

where real values and real candidates are embedded into the extended reals. For b∈{false,true}b\in\{\mathrm{false},\mathrm{true}\}b∈{false,true}, define

Qtfalse(X,Y)=Re⁡tr⁡(X[t]Y[1−t]),Qttrue(X,Y)=Re⁡tr⁡[(Y[(1−t)/(2t)]XY[(1−t)/(2t)])[t]].Q_t^{\mathrm{false}}(X,Y)=\operatorname{Re}\operatorname{tr}(X^{[t]}Y^{[1-t]}),\qquad Q_t^{\mathrm{true}}(X,Y)= \operatorname{Re}\operatorname{tr} \left[\left(Y^{[(1-t)/(2t)]}XY^{[(1-t)/(2t)]}\right)^{[t]}\right].Qtfalse​(X,Y)=Retr(X[t]Y[1−t]),Qttrue​(X,Y)=Retr[(Y[(1−t)/(2t)]XY[(1−t)/(2t)])[t]].

For real t>0t>0t>0, let R1b=DR_1^b=DR1b​=D; when t≠1t\ne1t=1, let RtbR_t^bRtb​ equal

1t−1L ⁣(Qtb(X,Y)Re⁡tr⁡X)\frac1{t-1}\mathcal L\!\left( \frac{Q_t^b(X,Y)}{\operatorname{Re}\operatorname{tr}X}\right)t−11​L(RetrXQtb​(X,Y)​)

if (t<1 and Qtb(X,Y)>0)(t<1\ \text{and }Q_t^b(X,Y)>0)(t<1 and Qtb​(X,Y)>0) or ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and let it equal +∞+\infty+∞ otherwise. Extend this to orders a∈[0,∞]a\in[0,\infty]a∈[0,∞] by R0b=inf⁡t>0RtbR_0^b=\inf_{t>0}R_t^bR0b​=inft>0​Rtb​, R∞true=Dmax⁡R_\infty^{\mathrm{true}}=D_{\max}R∞true​=Dmax​, and R∞false=sup⁡t>0RtfalseR_\infty^{\mathrm{false}}=\sup_{t>0}R_t^{\mathrm{false}}R∞false​=supt>0​Rtfalse​, using RabR_a^bRab​ at the real value of every positive finite order. Define

Hab,↓(r)=−Rab(r∥1A⊗rB),Hab,↑(r)=sup⁡s⪰0tr⁡s=1[−Rab(r∥1A⊗s)].H_a^{b,\downarrow}(r)=-R_a^b(r\|1_A\otimes r_B),\qquad H_a^{b,\uparrow}(r)= \sup_{\substack{s\succeq0\\\operatorname{tr}s=1}} \bigl[-R_a^b(r\|1_A\otimes s)\bigr].Hab,↓​(r)=−Rab​(r∥1A​⊗rB​),Hab,↑​(r)=s⪰0trs=1​sup​[−Rab​(r∥1A​⊗s)].

For every order a∈[0,∞]a\in[0,\infty]a∈[0,∞],

Hafalse,↓≤Hafalse,↑,Hatrue,↓≤Hatrue,↑,Hafalse,↑≤Hatrue,↑,Hafalse,↓≤Hatrue,↓,H_a^{\mathrm{false},\downarrow}\le H_a^{\mathrm{false},\uparrow},\quad H_a^{\mathrm{true},\downarrow}\le H_a^{\mathrm{true},\uparrow},\quad H_a^{\mathrm{false},\uparrow}\le H_a^{\mathrm{true},\uparrow},\quad H_a^{\mathrm{false},\downarrow}\le H_a^{\mathrm{true},\downarrow},Hafalse,↓​≤Hafalse,↑​,Hatrue,↓​≤Hatrue,↑​,Hafalse,↑​≤Hatrue,↑​,Hafalse,↓​≤Hatrue,↓​,

all evaluated at rrr. Each of the four functions of aaa is antitone: increasing the order cannot increase its value. If

S(X)=−Re⁡tr⁡(XL(X)),HVN(r)=S(r)−S(rB),S(X)=-\operatorname{Re}\operatorname{tr}(X L(X)),\qquad H_{\mathrm{VN}}(r)=S(r)-S(r_B),S(X)=−Retr(XL(X)),HVN​(r)=S(r)−S(rB​),

then all four values at order 111 equal the extended-real embedding of HVN(r)H_{\mathrm{VN}}(r)HVN​(r). Further, define

Hmin⁡(r)=sup⁡{ℓ∈R:∃s subnormalized, r⪯2−ℓ(1A⊗s)},H_{\min}(r)=\sup\{\ell\in\mathbb R:\exists s\text{ subnormalized},\ r\preceq2^{-\ell}(1_A\otimes s)\},Hmin​(r)=sup{ℓ∈R:∃s subnormalized, r⪯2−ℓ(1A​⊗s)}, Hmax⁡(r)=sup⁡s subnormalizedL ⁣((Re⁡tr⁡r(1A⊗s)r)2),H0(r)=sup⁡s subnormalizedL ⁣(Re⁡tr⁡(r[0](1A⊗s))).H_{\max}(r)=\sup_{s\text{ subnormalized}} \mathcal L\!\left(\left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt r(1_A\otimes s)\sqrt r}\right)^2\right), \quad H_0(r)=\sup_{s\text{ subnormalized}} \mathcal L\!\left(\operatorname{Re}\operatorname{tr}(r^{[0]}(1_A\otimes s))\right).Hmax​(r)=s subnormalizedsup​L((Retrr​(1A​⊗s)r​​)2),H0​(r)=s subnormalizedsup​L(Retr(r[0](1A​⊗s))).

The endpoint assertions are

H∞true,↑(r)=Hmin⁡(r),H∞true,↓(r)=sup⁡{ℓ∈R:r⪯2−ℓ(1A⊗rB)},H_\infty^{\mathrm{true},\uparrow}(r)=H_{\min}(r),\qquad H_\infty^{\mathrm{true},\downarrow}(r)= \sup\{\ell\in\mathbb R:r\preceq2^{-\ell}(1_A\otimes r_B)\},H∞true,↑​(r)=Hmin​(r),H∞true,↓​(r)=sup{ℓ∈R:r⪯2−ℓ(1A​⊗rB​)}, H1/2true,↑(r)=Hmax⁡(r),H2true,↓(r)=−L ⁣(Re⁡tr⁡(r(1A⊗rB[−1/2])r(1A⊗rB[−1/2]))),H0false,↑(r)=H0(r).H_{1/2}^{\mathrm{true},\uparrow}(r)=H_{\max}(r),\qquad H_2^{\mathrm{true},\downarrow}(r)= -\mathcal L\!\left( \operatorname{Re}\operatorname{tr} \bigl(r(1_A\otimes r_B^{[-1/2]})r(1_A\otimes r_B^{[-1/2]})\bigr)\right), \qquad H_0^{\mathrm{false},\uparrow}(r)=H_0(r).H1/2true,↑​(r)=Hmax​(r),H2true,↓​(r)=−L(Retr(r(1A​⊗rB[−1/2]​)r(1A​⊗rB[−1/2]​))),H0false,↑​(r)=H0​(r).

Finally, for every density matrix sss on AAA, every choice of the two Boolean parameters bbb and ↑/↓\uparrow/\downarrow↑/↓, and every real a>0a>0a>0 with a≠1a\ne1a=1, the matrix s♭s^\flats♭ on A×{∗}A\times\{\ast\}A×{∗}, given by s(i,∗),(j,∗)♭=sijs^\flat_{(i,\ast),(j,\ast)}=s_{ij}s(i,∗),(j,∗)♭​=sij​, satisfies

Hab,↑/↓(s♭)=a1−alog⁡2 ⁣[(Re⁡tr⁡((s†s)[a]))1/a],H_a^{b,\uparrow/\downarrow}(s^\flat)= \frac{a}{1-a}\log_2\!\left[ \left(\operatorname{Re}\operatorname{tr} \left((\sqrt{s^\dagger s})^{[a]}\right)\right)^{1/a} \right],Hab,↑/↓​(s♭)=1−aa​log2​[(Retr((s†s​)[a]))1/a],

with this real right side embedded into the extended reals. Zero eigenvalues remain subject to the zero-at-zero power convention, including at exponent 000 and at negative exponents.

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