Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1.1 (3.16): matrix trace Young inequality

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.trace_young

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. Here FFF is squared algebraic fidelity, F∗F_*F∗​ is squared generalized fidelity, P=1−F∗P=\sqrt{1-F_*}P=1−F∗​​ is purified distance, and Δ(ρ,τ)=max⁡0≤M≤I∣Tr⁡((ρ−τ)M)∣\Delta(\rho,\tau)=\max_{0\le M\le I}|\operatorname{Tr}((\rho-\tau)M)|Δ(ρ,τ)=max0≤M≤I​∣Tr((ρ−τ)M)∣.

For positive M,N and conjugate p,q, p>1, Tr MN≤Tr M^p/p+Tr N^q/q, equality iff M^p=N^q; for 0<p<1 and M≪N reverse the inequality.

Tr⁡(MN)≤1pTr⁡Mp+1qTr⁡Nq,equality  ⟺  Mp=Nq.\operatorname{Tr}(MN)\le\frac1p\operatorname{Tr}M^p+\frac1q\operatorname{Tr}N^q,\qquad\text{equality}\iff M^p=N^q.Tr(MN)≤p1​TrMp+q1​TrNq,equality⟺Mp=Nq.

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#3.young
§3.1.1 (3.16): matrix trace Young inequality, arXiv:1504.00233v5, PDF p.41. -/
theorem trace_young [Nonempty I] (M N : paperMat I) (hM : M.PosSemidef) (hN : N.PosSemidef)
    (p q : ℝ) (hp : 0 < p) (hq : q ≠ 0) (hc : 1/p+1/q = 1) :
    (1 < p → (M*N).trace.re ≤ (paperPower M p).trace.re/p+(paperPower N q).trace.re/q) ∧
    (1 < p → ((M*N).trace.re = (paperPower M p).trace.re/p+(paperPower N q).trace.re/q ↔ paperPower M p = paperPower N q)) ∧
    (p < 1 → paperSupported M N → (paperPower M p).trace.re/p+(paperPower N q).trace.re/q ≤ (M*N).trace.re) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 41, §3.1.1 (3.16): matrix trace Young inequality
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 M,NM,NM,N be positive semidefinite complex matrices indexed by III. For a real exponent vvv, define Pv(K)P_v(K)Pv​(K) by continuous functional calculus using the scalar function that is 000 at 000 and xvx^vxv elsewhere; thus zero eigenvalues contribute 000, including for negative exponents. For every pair p,q∈Rp,q\in\mathbb Rp,q∈R satisfying p>0p>0p>0, q≠0q\ne0q=0, and 1/p+1/q=11/p+1/q=11/p+1/q=1, all three assertions hold:

p>1 ⟹ Re⁡tr⁡(MN)≤Re⁡tr⁡Pp(M)p+Re⁡tr⁡Pq(N)q,p>1 ⟹ (Re⁡tr⁡(MN)=Re⁡tr⁡Pp(M)p+Re⁡tr⁡Pq(N)q ⟺ Pp(M)=Pq(N)),p<1 and ker⁡N⊆ker⁡M ⟹ Re⁡tr⁡Pp(M)p+Re⁡tr⁡Pq(N)q≤Re⁡tr⁡(MN).\begin{aligned} p>1&\ \Longrightarrow\ \operatorname{Re}\operatorname{tr}(MN) \le \frac{\operatorname{Re}\operatorname{tr}P_p(M)}p+ \frac{\operatorname{Re}\operatorname{tr}P_q(N)}q,\\ p>1&\ \Longrightarrow\ \left(\operatorname{Re}\operatorname{tr}(MN) =\frac{\operatorname{Re}\operatorname{tr}P_p(M)}p+ \frac{\operatorname{Re}\operatorname{tr}P_q(N)}q \ \Longleftrightarrow\ P_p(M)=P_q(N)\right),\\ p<1\ \text{and}\ \ker N\subseteq\ker M &\ \Longrightarrow\ \frac{\operatorname{Re}\operatorname{tr}P_p(M)}p+ \frac{\operatorname{Re}\operatorname{tr}P_q(N)}q \le \operatorname{Re}\operatorname{tr}(MN). \end{aligned}p>1p>1p<1 and kerN⊆kerM​ ⟹ Retr(MN)≤pRetrPp​(M)​+qRetrPq​(N)​, ⟹ (Retr(MN)=pRetrPp​(M)​+qRetrPq​(N)​ ⟺ Pp​(M)=Pq​(N)), ⟹ pRetrPp​(M)​+qRetrPq​(N)​≤Retr(MN).​

The hypotheses exclude p=1p=1p=1; in the third implication they force q<0q<0q<0. Zero matrices are allowed.

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