Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary A.5

Proved
QAlgorithms.Papers.Independent.Support50.P12.corollary_A_5

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A,BA,BA,B be positive semidefinite operators on a nonzero finite-dimensional complex Hilbert space. Operator powers are zero on kernels; scalar trace powers have their usual real-power convention.

One has

Tr⁡AαB1−α≤(Tr⁡A)α(Tr⁡B)1−α(0≤α≤1).\operatorname{Tr}A^\alpha B^{1-\alpha}\le(\operatorname{Tr}A)^\alpha(\operatorname{Tr}B)^{1-\alpha}\quad(0\le\alpha\le1).TrAαB1−α≤(TrA)α(TrB)1−α(0≤α≤1).

If A0≤B0A^0\le B^0A0≤B0, the inequality is reversed for every α≥1\alpha\ge1α≥1, and

∃α>0, αe1: Tr⁡AαB1−α=(Tr⁡A)α(Tr⁡B)1−α  ⟺  A=cB for some c≥0.\exists\alpha>0,\ \alpha e1:\ \operatorname{Tr}A^\alpha B^{1-\alpha}=(\operatorname{Tr}A)^\alpha(\operatorname{Tr}B)^{1-\alpha}\iff A=cB\text{ for some }c\ge0.∃α>0, αe1: TrAαB1−α=(TrA)α(TrB)1−α⟺A=cB for some c≥0.

Zero operators are included. The endpoint inequalities do not have a proportionality characterization.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P12

open Filter MeasureTheory Set

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)

open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)

open QAlgorithms.Papers.Independent.Next46.P23 (Supports)

open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)

open QAlgorithms (spectralProjector)

open QAlgorithms.Learning (IsDistribution)

open QAlgorithms.Papers.Independent.Information100.P04 (absOp)

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
  [Fintype K] [DecidableEq K]

/-- Corollary A.5, PDF pp.45–46: both full exponent ranges and the 'some positive
order other than one' equality characterization, including zero operators. -/
theorem corollary_A_5 [Nonempty I] (X Y : Mat I) (hX : X.PosSemidef) (hY : Y.PosSemidef) :
    (∀ a ∈ Icc (0 : ℝ) 1, tr (supportPower X a * supportPower Y (1 - a)) ≤
      Real.rpow (tr X) a * Real.rpow (tr Y) (1 - a)) ∧
    (Supports X Y → ∀ a ≥ (1 : ℝ), tr (supportPower X a * supportPower Y (1 - a)) ≥
      Real.rpow (tr X) a * Real.rpow (tr Y) (1 - a)) ∧
    (Supports X Y →
      ((∃ a : ℝ, 0 < a ∧ a ≠ 1 ∧ tr (supportPower X a * supportPower Y (1 - a)) =
        Real.rpow (tr X) a * Real.rpow (tr Y) (1 - a)) ↔
        ∃ c : ℝ, 0 ≤ c ∧ X = (c : ℂ) • Y)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 45, Corollary A.5
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 X,Y∈MI(C)X,Y\in M_I(\mathbb C)X,Y∈MI​(C) be positive semidefinite. Write tr⁡R=Re⁡Tr⁡\operatorname{tr}_{\mathbb R}=\operatorname{Re}\operatorname{Tr}trR​=ReTr and Z[a]Z^{[a]}Z[a] for functional calculus with scalar value xax^axa when x≠0x\ne0x=0 and value 000 at x=0x=0x=0, so that Z[0]Z^{[0]}Z[0] is its support projection. Then, for every real a∈[0,1]a\in[0,1]a∈[0,1],

tr⁡R(X[a]Y[1−a])≤(tr⁡RX)a(tr⁡RY)1−a.\operatorname{tr}_{\mathbb R}(X^{[a]}Y^{[1-a]}) \le(\operatorname{tr}_{\mathbb R}X)^a (\operatorname{tr}_{\mathbb R}Y)^{1-a}.trR​(X[a]Y[1−a])≤(trR​X)a(trR​Y)1−a.

If ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, the reverse inequality holds for every real a≥1a\ge1a≥1, and under that same support hypothesis,

∃a>0, a≠1,tr⁡R(X[a]Y[1−a])=(tr⁡RX)a(tr⁡RY)1−a  ⟺  ∃c≥0,X=cY.\begin{aligned} &\exists a>0,\ a\ne1,\quad \operatorname{tr}_{\mathbb R}(X^{[a]}Y^{[1-a]}) =(\operatorname{tr}_{\mathbb R}X)^a (\operatorname{tr}_{\mathbb R}Y)^{1-a}\\ &\hspace{4em}\iff \exists c\ge0,\quad X=cY. \end{aligned}​∃a>0, a=1,trR​(X[a]Y[1−a])=(trR​X)a(trR​Y)1−a⟺∃c≥0,X=cY.​

No nonzero or trace-normalization assumptions are imposed. The scalar powers on the right are ordinary total real powers, with 00=10^0=100=1 and 0a=00^a=00a=0 for a≠0a\ne0a=0, whereas the matrix powers assign zero to a zero eigenvalue even at exponent 000.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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