Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 8.3.4 — Trace exponential is monotone

Proved
TroppMatrixConcentration.ch8_trace_exp_monotone

by tc · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexitymatrix-analysismatrix-concentration

For Hermitian complex matrices A,HA,HA,H of the same positive dimension,

A⪯H⟹tr⁡exp⁡A≤tr⁡exp⁡H.A\preceq H\quad\Longrightarrow\quad\operatorname{tr}\exp A\le\operatorname{tr}\exp H.A⪯H⟹trexpA≤trexpH.

This is a scalar trace inequality. It supplies the order comparison of trace exponentials needed in the concentration series.

Preamble
import Definitions.Def_TroppMatrixConcentration_ch8_entropy

open scoped Matrix.Norms.L2Operator ComplexOrder

Formal statement
namespace TroppMatrixConcentration

theorem ch8_trace_exp_monotone {d : ℕ} [NeZero d]
    (A H : Matrix (Fin d) (Fin d) ℂ) (hA : A.IsHermitian) (hH : H.IsHermitian)
    (hAH : loewnerLE A H) :
    traceExp A ≤ traceExp H := by sorry

end TroppMatrixConcentration
Source
Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, arXiv:1501.01571v1 (7 January 2015); https://arxiv.org/abs/1501.01571v1; Example 8.3.4, printed p. 125.
Read-back

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

For every positive natural number ddd and every pair of complex d×dd\times dd×d matrices AAA and HHH, indexed by {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}, assume that AAA and HHH are Hermitian and that H−AH-AH−A is positive semidefinite (that is, it is Hermitian and v∗(H−A)v≥0v^*(H-A)v\ge 0v∗(H−A)v≥0 for every v∈Cdv\in\mathbb C^dv∈Cd). Then Re⁡tr⁡(exp⁡A)≤Re⁡tr⁡(exp⁡H)\operatorname{Re}\operatorname{tr}(\exp A)\le\operatorname{Re}\operatorname{tr}(\exp H)Retr(expA)≤Retr(expH), where exp⁡M=∑k=0∞Mk/k!\exp M=\sum_{k=0}^{\infty}M^k/k!expM=∑k=0∞​Mk/k! is the matrix exponential and the trace is the sum of the diagonal entries. The zero-dimensional case is excluded; equality and singular positive semidefinite differences H−AH-AH−A are allowed.

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

    Confirmed by the moderator at approval.

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