Theorem 2, trace inequality
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.traceInequalityFor arbitrary positive semidefinite finite-dimensional operators and ,
Equivalently, for the projector onto , the left side is at least . No trace normalization, invertibility, or commutation is assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF pp.12,13,14: Theorem 2, trace inequality. -/
theorem traceInequality (a b : Mat I) (ha : a.PosSemidef) (hb : b.PosSemidef)
(s : ℝ) (hs0 : 0 ≤ s) (hs1 : s ≤ 1) :
(a+b).trace.re/2-traceNorm (a-b)/2 ≤ (positiveMatrixRpow a s * positiveMatrixRpow b (1-s)).trace.re ∧
(positiveProjection (a-b) * b + (1-positiveProjection (a-b))*a).trace.re ≤
(positiveMatrixRpow a s * positiveMatrixRpow b (1-s)).trace.re := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite index type with decidable equality, every positive semidefinite complex matrices indexed by , and every real with , define , and let be the orthogonal projection onto the range of the positive part of , where the positive part applies by continuous functional calculus. Matrix real powers also use continuous functional calculus applied to . Then both inequalities hold:
Neither matrix is required to have trace one or be invertible. The endpoints are included, using ; may be empty, when both inequalities read .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.