Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

4.10

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.sandwiched_order

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.

For normalized rho << sigma, Qtilde_α is increasing under replacement of rho by any larger positive operator, without a support restriction on that larger operator, for α>0; it decreases in its second argument for α>1 and increases there for 1/2≤α<1.

ρ≤ρ′⟹Q~α(ρ∥σ)≤Q~α(ρ′∥σ).\rho\le\rho^\prime\Longrightarrow\widetilde Q_\alpha(\rho\|\sigma)\le\widetilde Q_\alpha(\rho^\prime\|\sigma).ρ≤ρ′⟹Q​α​(ρ∥σ)≤Q​α​(ρ′∥σ).

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#4.10
4.10, arXiv:1504.00233v5, PDF p.62. -/
theorem sandwiched_order [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
    (hc : paperSupported r s) (a : ℝ) (ha : 0 < a) :
    (∀ t : paperMat I, t.PosSemidef → paperBelow r t → paperRenyiQ true r s a ≤ paperRenyiQ true t s a) ∧
    (∀ t : paperMat I, t.PosSemidef → paperBelow s t →
      (1 < a → paperRenyiQ true r t a ≤ paperRenyiQ true r s a) ∧
      (1/2 ≤ a → a < 1 → paperRenyiQ true r s a ≤ paperRenyiQ true r t a)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 62, 4.10
Read-back

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

Let III be a finite, nonempty type with decidable equality, and let r,sr,sr,s be complex matrices indexed by III, both positive semidefinite and both having trace one. Assume ker⁡s⊆ker⁡r\ker s\subseteq\ker rkers⊆kerr. For any real exponent ppp, define Pp(M)P_p(M)Pp​(M) by continuous functional calculus using the scalar function that is zero at zero and equals xpx^pxp at every nonzero real xxx; in particular, P0(M)P_0(M)P0​(M) uses zero, rather than one, on the zero eigenspace. For a real a>0a>0a>0, write

Qa(x,y)=Re⁡Tr⁡Pa ⁣(P1−a2a(y) x P1−a2a(y)).Q_a(x,y)= \operatorname{Re}\operatorname{Tr} P_a\!\left( P_{\frac{1-a}{2a}}(y)\,x\, P_{\frac{1-a}{2a}}(y) \right).Qa​(x,y)=ReTrPa​(P2a1−a​​(y)xP2a1−a​​(y)).

Then both of the following statements hold: for every positive semidefinite matrix ttt such that t−r≥0t-r\ge0t−r≥0,

Qa(r,s)≤Qa(t,s);Q_a(r,s)\le Q_a(t,s);Qa​(r,s)≤Qa​(t,s);

and for every positive semidefinite matrix ttt such that t−s≥0t-s\ge0t−s≥0,

1<a ⟹ Qa(r,t)≤Qa(r,s),12≤a<1 ⟹ Qa(r,s)≤Qa(r,t).1<a\ \Longrightarrow\ Q_a(r,t)\le Q_a(r,s), \qquad \frac12\le a<1\ \Longrightarrow\ Q_a(r,s)\le Q_a(r,t).1<a ⟹ Qa​(r,t)≤Qa​(r,s),21​≤a<1 ⟹ Qa​(r,s)≤Qa​(r,t).

There is no trace restriction on either quantified ttt, and singular matrices are included under the stated power convention. The first inequality applies to every a>0a>0a>0; the second pair imposes no inequality when 0<a<120<a<\tfrac120<a<21​ or when a=1a=1a=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