Scalar concavity implies concavity of spectral trace
OpenQAlgorithms.Papers.Independent.Intakethird100.P21.trace_concavityLet be positive semidefinite trace-one matrices of the same positive finite dimension, let , and let be concave on . Write for spectral functional calculus and for the real part of the trace. Then
In particular the marginal costs and obey the same concavity inequality. The spectral trace and are invariant under unitary conjugation, and therefore so is . No operator-concavity hypothesis on is needed.
This is the finite spectral-trace fact used to obtain the concave marginal costs for concurrence and tangle.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P21
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , every function concave on , every pair of positive semidefinite complex matrices of trace , and every , put , , using real continuous functional calculus, and . Then
and
For every unitary complex matrix , one also has and . The cases and are included; no differentiability assumption on is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.