Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

4.21

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.petz_order_parameter

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 every normalized pair of states, the extended logarithm of the Petz trace functional is convex in the positive order, the Petz divergence is nondecreasing, and its order-one value is Umegaki divergence. Orthogonal pairs are included.

α↦log⁡2Q‾α(ρ∥σ) is convex,α↦D‾α(ρ∥σ) is nondecreasing,D‾1=D.\alpha\mapsto\log_2\overline Q_\alpha(\rho\|\sigma)\text{ is convex},\quad\alpha\mapsto\overline D_\alpha(\rho\|\sigma)\text{ is nondecreasing},\quad\overline D_1=D.α↦log2​Q​α​(ρ∥σ) is convex,α↦Dα​(ρ∥σ) is nondecreasing,D1​=D.

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.21
Corollary 4.21, PDF pp.70-71. Extended log Q retains orthogonal pairs;
no support premise is added. The value at order one is the Umegaki divergence. -/
theorem petz_order_parameter [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s) :
    (∀ a b : ℝ, 0 < a → 0 < b → ∀ l : ℝ, l ∈ Set.Icc 0 1 →
      paperLogE (paperRenyiQ false r s (l*a+(1-l)*b)) ≤ (l:EReal)*paperLogE (paperRenyiQ false r s a)+((1-l:ℝ):EReal)*paperLogE (paperRenyiQ false r s b)) ∧
    Monotone (paperRenyi false r s) ∧ paperRenyi false r s 1 = paperRelativeD r s := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

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

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

Let III be a finite, nonempty index type with decidable equality, and let r,sr,sr,s be positive semidefinite complex matrices indexed by III, each with complex trace 111. Write M[t]M^{[t]}M[t] for functional calculus with the scalar function xtx^txt away from zero and value zero at zero, even for zero or negative exponents, put Qt(r,s)=Re⁡tr⁡(r[t]s[1−t])Q_t(r,s)=\operatorname{Re}\operatorname{tr}(r^{[t]}s^{[1-t]})Qt​(r,s)=Retr(r[t]s[1−t]), and let L(x)\mathcal L(x)L(x) be −∞-\infty−∞ at x=0x=0x=0 and the real number log⁡2x\log_2 xlog2​x, embedded in the extended reals, otherwise. Define D(r∥s)D(r\|s)D(r∥s) as Re⁡tr⁡(r(L(r)−L(s)))/Re⁡tr⁡r\operatorname{Re}\operatorname{tr}(r(L(r)-L(s)))/\operatorname{Re}\operatorname{tr}rRetr(r(L(r)−L(s)))/Retrr if ker⁡s⊆ker⁡r\ker s\subseteq\ker rkers⊆kerr, and as +∞+\infty+∞ otherwise, where LLL is functional calculus of the total real logarithm log⁡2\log_2log2​, whose value at zero is zero. For real ttt, define Rt=D(r∥s)R_t=D(r\|s)Rt​=D(r∥s) at t=1t=1t=1; otherwise set Rt=(t−1)−1L(Qt(r,s)/Re⁡tr⁡r)R_t=(t-1)^{-1}\mathcal L(Q_t(r,s)/\operatorname{Re}\operatorname{tr}r)Rt​=(t−1)−1L(Qt​(r,s)/Retrr) when (t<1 and Qt(r,s)>0)(t<1\ \text{and}\ Q_t(r,s)>0)(t<1 and Qt​(r,s)>0) or ker⁡s⊆ker⁡r\ker s\subseteq\ker rkers⊆kerr, and set Rt=+∞R_t=+\inftyRt​=+∞ in the remaining case. Define Dα\mathcal D_\alphaDα​, for α∈[0,+∞]\alpha\in[0,+\infty]α∈[0,+∞], by D0=inf⁡t>0Rt\mathcal D_0=\inf_{t>0}R_tD0​=inft>0​Rt​, D+∞=sup⁡t>0Rt\mathcal D_{+\infty}=\sup_{t>0}R_tD+∞​=supt>0​Rt​, and Dα=Rα\mathcal D_\alpha=R_\alphaDα​=Rα​ for finite positive α\alphaα. The assertion is that, for every pair of positive real numbers a,ba,ba,b and every λ∈[0,1]\lambda\in[0,1]λ∈[0,1],

L(Qλa+(1−λ)b(r,s))≤λ L(Qa(r,s))+(1−λ) L(Qb(r,s)),\mathcal L(Q_{\lambda a+(1-\lambda)b}(r,s)) \le \lambda\,\mathcal L(Q_a(r,s))+ (1-\lambda)\,\mathcal L(Q_b(r,s)),L(Qλa+(1−λ)b​(r,s))≤λL(Qa​(r,s))+(1−λ)L(Qb​(r,s)),

that Dα≤Dβ\mathcal D_\alpha\le\mathcal D_\betaDα​≤Dβ​ whenever 0≤α≤β≤+∞0\le\alpha\le\beta\le+\infty0≤α≤β≤+∞, and that D1=D(r∥s)\mathcal D_1=D(r\|s)D1​=D(r∥s). The displayed inequality and monotonicity use extended-real arithmetic, include endpoint mixture weights and the orders 0,+∞0,+\infty0,+∞, and do not require ker⁡s⊆ker⁡r\ker s\subseteq\ker rkers⊆kerr.

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