Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

5.11

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.conditional_rank_bounds

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 every one of the four conditional entropies in its DPI range, −log min(rankρ_A,rankρ_B)≤Hα(A|B)≤log rankρ_A; additionally Hα≥0 for separable normalized ρ_AB.

−log⁡2min⁡{rank⁡ρA,rank⁡ρB}≤Hα(A∣B)ρ≤log⁡2rank⁡ρA.-\log_2\min\{\operatorname{rank}\rho_A,\operatorname{rank}\rho_B\}\le H_\alpha(A|B)_\rho\le\log_2\operatorname{rank}\rho_A.−log2​min{rankρA​,rankρB​}≤Hα​(A∣B)ρ​≤log2​rankρA​.

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.11
5.11, arXiv:1504.00233v5, PDF p.86. -/
theorem conditional_rank_bounds [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
    (sand up : Bool) (a : ENNReal) (ha : DPIOrder sand a) :
    (-Real.logb 2 (min (traceRight r).rank (traceLeft r).rank):EReal) ≤ paperConditional sand up a r ∧
    paperConditional sand up a r ≤ (Real.logb 2 (traceRight r).rank:EReal) ∧
    (paperSeparable r → 0 ≤ paperConditional sand up 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. 86, 5.11
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, and let r⪰0r\succeq0r⪰0 on A×BA\times BA×B have tr⁡r=1\operatorname{tr}r=1trr=1. Choose Boolean flags ϵ,ν\epsilon,\nuϵ,ν, interpreted as 000 for false and 111 for true, and an extended nonnegative order aaa. Assume a≥12a\ge\tfrac12a≥21​ if ϵ=1\epsilon=1ϵ=1, and a≤2a\le2a≤2 if ϵ=0\epsilon=0ϵ=0. Define X[t]X^{[t]}X[t] by functional calculus using the function that is zero at zero and xtx^txt elsewhere, and define log⁡2X\log_2Xlog2​X by functional calculus using the total real logarithm. Let L(0)=−∞L(0)=-\inftyL(0)=−∞ and L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x otherwise. For positive semidefinite X,YX,YX,Y, write X◃YX\triangleleft YX◃Y for ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and 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, Dtϵ(X,Y)D_t^\epsilon(X,Y)Dtϵ​(X,Y) is 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 at t=1t=1t=1 when X◃YX\triangleleft YX◃Y, and +∞+\infty+∞ at t=1t=1t=1 otherwise; for t≠1t\ne1t=1, it is

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 either t<1t<1t<1 and Qtϵ(X,Y)>0Q_t^\epsilon(X,Y)>0Qtϵ​(X,Y)>0, or X◃YX\triangleleft YX◃Y, and is +∞+\infty+∞ otherwise. Its endpoint definitions are

D0ϵ=inf⁡t>0Dtϵ,D∞0=sup⁡t>0Dt0,D∞1(X,Y)=inf⁡{λ∈R:X⪯2λY}.D_0^\epsilon=\inf_{t>0}D_t^\epsilon,\qquad D_\infty^0=\sup_{t>0}D_t^0,\qquad D_\infty^1(X,Y)=\inf\{\lambda\in\mathbb R:X\preceq2^\lambda Y\}.D0ϵ​=t>0inf​Dtϵ​,D∞0​=t>0sup​Dt0​,D∞1​(X,Y)=inf{λ∈R:X⪯2λY}.

All these quantities are extended real. With (rA)u,v=∑br(u,b),(v,b)(r_A)_{u,v}=\sum_b r_{(u,b),(v,b)}(rA​)u,v​=∑b​r(u,b),(v,b)​ and (rB)b,c=∑ur(u,b),(u,c)(r_B)_{b,c}=\sum_u r_{(u,b),(u,c)}(rB​)b,c​=∑u​r(u,b),(u,c)​, define

Hϵ,0(r;a)=−Daϵ(r,IA⊗rB),Hϵ,1(r;a)=sup⁡σ⪰0Re⁡tr⁡σ≤1[−Daϵ(r,IA⊗σ)].H_{\epsilon,0}(r;a)=-D_a^\epsilon(r,I_A\otimes r_B),\qquad H_{\epsilon,1}(r;a)= \sup_{\substack{\sigma\succeq0\\\operatorname{Re}\operatorname{tr}\sigma\le1}} [-D_a^\epsilon(r,I_A\otimes\sigma)].Hϵ,0​(r;a)=−Daϵ​(r,IA​⊗rB​),Hϵ,1​(r;a)=σ⪰0Retrσ≤1​sup​[−Daϵ​(r,IA​⊗σ)].

Then

−log⁡2 ⁣(min⁡(rank⁡rA,rank⁡rB))≤Hϵ,ν(r;a)≤log⁡2(rank⁡rA).-\log_2\!\bigl(\min(\operatorname{rank}r_A,\operatorname{rank}r_B)\bigr) \le H_{\epsilon,\nu}(r;a) \le \log_2(\operatorname{rank}r_A).−log2​(min(rankrA​,rankrB​))≤Hϵ,ν​(r;a)≤log2​(rankrA​).

Moreover Hϵ,ν(r;a)≥0H_{\epsilon,\nu}(r;a)\ge0Hϵ,ν​(r;a)≥0 whenever there exist a natural number qqq, nonnegative weights wjw_jwj​ summing to one, and positive semidefinite matrices sj,tjs_j,t_jsj​,tj​ on A,BA,BA,B, respectively, each of trace one, such that r=∑j<qwj(sj⊗tj)r=\sum_{j<q}w_j(s_j\otimes t_j)r=∑j<q​wj​(sj​⊗tj​). The optimizing σ\sigmaσ above need only have trace at most one; the order range includes a=0a=0a=0 when ϵ=0\epsilon=0ϵ=0, and a=∞a=\inftya=∞ when ϵ=1\epsilon=1ϵ=1.

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