Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Scalar concavity implies concavity of spectral trace

Open
QAlgorithms.Papers.Independent.Intakethird100.P21.trace_concavity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let R,SR,SR,S be positive semidefinite trace-one matrices of the same positive finite dimension, let p∈[0,1]p\in[0,1]p∈[0,1], and let f:R→Rf:\mathbb R\to\mathbb Rf:R→R be concave on [0,1][0,1][0,1]. Write f(R)f(R)f(R) for spectral functional calculus and Tr⁡R\operatorname{Tr}_{\mathbb R}TrR​ for the real part of the trace. Then

Tr⁡Rf(pR+(1−p)S)≥pTr⁡Rf(R)+(1−p)Tr⁡Rf(S).\operatorname{Tr}_{\mathbb R}f(pR+(1-p)S)\ge p\operatorname{Tr}_{\mathbb R}f(R)+(1-p)\operatorname{Tr}_{\mathbb R}f(S).TrR​f(pR+(1−p)S)≥pTrR​f(R)+(1−p)TrR​f(S).

In particular the marginal costs L(R)=2(1−Tr⁡RR2)L(R)=2(1-\operatorname{Tr}_{\mathbb R}R^2)L(R)=2(1−TrR​R2) and L(R)\sqrt{L(R)}L(R)​ obey the same concavity inequality. The spectral trace and LLL are invariant under unitary conjugation, and therefore so is L\sqrt LL​. No operator-concavity hypothesis on fff is needed.

This is the finite spectral-trace fact used to obtain the concave marginal costs for concurrence and tangle.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P21

open scoped Matrix ComplexConjugate

open Filter

open QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P03
  (PureEnsemble convexRoof pureConcurrence concurrence SchmidtData schmidtVector)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.4--5, (2.3): scalar concavity on [0,1] implies spectral trace
concavity on density matrices; no operator-concavity hypothesis is added. -/
theorem trace_concavity (d : ℕ) (hd : 0 < d) (f : ℝ → ℝ)
    (hf : ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) f)
    (rho sigma : Matrix (Fin d) (Fin d) ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (p : ℝ) (hp : p ∈ Set.Icc (0 : ℝ) 1) :
    p * spectralTrace f rho + (1 - p) * spectralTrace f sigma ≤
      spectralTrace f ((p : ℂ) • rho + ((1 - p : ℝ) : ℂ) • sigma) ∧
    p * marginalTangle rho + (1-p) * marginalTangle sigma ≤
      marginalTangle ((p : ℂ) • rho + ((1-p : ℝ) : ℂ) • sigma) ∧
    p * Real.sqrt (marginalTangle rho) + (1-p) * Real.sqrt (marginalTangle sigma) ≤
      Real.sqrt (marginalTangle ((p : ℂ) • rho + ((1-p : ℝ) : ℂ) • sigma)) ∧
    (∀ U : Matrix.unitaryGroup (Fin d) ℂ,
      spectralTrace f ((U : Matrix (Fin d) (Fin d) ℂ) * rho *
        (U : Matrix (Fin d) (Fin d) ℂ)ᴴ) = spectralTrace f rho ∧
      marginalTangle ((U : Matrix (Fin d) (Fin d) ℂ) * rho *
        (U : Matrix (Fin d) (Fin d) ℂ)ᴴ) = marginalTangle rho) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P21

end
Source
I-concurrence and tangle for isotropic states, arXiv:quant-ph/0208002v1, PDF p. 4, §2, (2.3): trace of a scalar concave spectral function is concave
Read-back

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

For every positive natural number ddd, every function f:R→Rf:\mathbb R\to\mathbb Rf:R→R concave on [0,1][0,1][0,1], every pair of positive semidefinite complex d×dd\times dd×d matrices ρ,σ\rho,\sigmaρ,σ of trace 111, and every p∈[0,1]p\in[0,1]p∈[0,1], put τ=pρ+(1−p)σ\tau=p\rho+(1-p)\sigmaτ=pρ+(1−p)σ, Sf(X)=Re⁡tr⁡(f(X))S_f(X)=\operatorname{Re}\operatorname{tr}(f(X))Sf​(X)=Retr(f(X)), using real continuous functional calculus, and t(X)=2(1−Re⁡tr⁡(X2))t(X)=2(1-\operatorname{Re}\operatorname{tr}(X^2))t(X)=2(1−Retr(X2)). Then

pSf(ρ)+(1−p)Sf(σ)≤Sf(τ),pt(ρ)+(1−p)t(σ)≤t(τ),pS_f(\rho)+(1-p)S_f(\sigma)\le S_f(\tau),\qquad pt(\rho)+(1-p)t(\sigma)\le t(\tau),pSf​(ρ)+(1−p)Sf​(σ)≤Sf​(τ),pt(ρ)+(1−p)t(σ)≤t(τ),

and

pt(ρ)+(1−p)t(σ)≤t(τ).p\sqrt{t(\rho)}+(1-p)\sqrt{t(\sigma)}\le\sqrt{t(\tau)}.pt(ρ)​+(1−p)t(σ)​≤t(τ)​.

For every unitary complex d×dd\times dd×d matrix UUU, one also has Sf(UρU†)=Sf(ρ)S_f(U\rho U^\dagger)=S_f(\rho)Sf​(UρU†)=Sf​(ρ) and t(UρU†)=t(ρ)t(U\rho U^\dagger)=t(\rho)t(UρU†)=t(ρ). The cases d=1d=1d=1 and p=0,1p=0,1p=0,1 are included; no differentiability assumption on fff is imposed.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me