Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4, printed 3.1: Golden–Thompson inequality and equality criterion

Open
QAlgorithms.Papers.Independent.Intakethird100.P84.goldenThompsonEquality

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

prove2quantum

For arbitrary self-adjoint matrices A,BA,BA,B on a finite complex Hilbert space,

Tr⁡eA+B≤Tr⁡(eAeB),Tr⁡eA+B=Tr⁡(eAeB)  ⟺  AB=BA.\operatorname{Tr}e^{A+B}\le\operatorname{Tr}(e^Ae^B),\qquad \operatorname{Tr}e^{A+B}=\operatorname{Tr}(e^Ae^B)\iff AB=BA.TreA+B≤Tr(eAeB),TreA+B=Tr(eAeB)⟺AB=BA.

The Lean traces take real parts, which does not change these real quantities. No density or commutativity hypothesis is added.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P84
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P84

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- Pinned accepted definitions, inspected at their recorded source locations.

open QAlgorithms.Papers.Independent.Renew46.P35 (traceAdjoint)

open QAlgorithms.Papers.Independent.Dependency50.P21 (imaginaryPower marginalAB)

/-- Petz, arXiv:quant-ph/0209053v1, PDF p.6, printed subsection 3.1.
Both the Golden--Thompson inequality and its equality iff are retained.
The finite-dimensional self-adjoint matrices need not be densities. -/
theorem goldenThompsonEquality {I : Type*} [Fintype I]
    (A B : Matrix I I ℂ) (hA : A.IsHermitian) (hB : B.IsHermitian) :
    (NormedSpace.exp (A + B)).trace.re ≤
      (NormedSpace.exp A * NormedSpace.exp B).trace.re ∧
    ((NormedSpace.exp (A + B)).trace.re =
      (NormedSpace.exp A * NormedSpace.exp B).trace.re ↔ Commute A B) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P84

end
Source
Monotonicity of quantum relative entropy revisited, arXiv:quant-ph/0209053v1, PDF p. 6, Section 4, printed 3.1: Golden–Thompson inequality and equality criterion
Read-back

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

For any finite set III and any Hermitian complex matrices A,BA,BA,B indexed by III, both

Re⁡tr⁡eA+B≤Re⁡tr⁡(eAeB)\operatorname{Re}\operatorname{tr}e^{A+B} \le \operatorname{Re}\operatorname{tr}(e^Ae^B)RetreA+B≤Retr(eAeB)

and

Re⁡tr⁡eA+B=Re⁡tr⁡(eAeB)⟺AB=BA\operatorname{Re}\operatorname{tr}e^{A+B} =\operatorname{Re}\operatorname{tr}(e^Ae^B) \quad\Longleftrightarrow\quad AB=BARetreA+B=Retr(eAeB)⟺AB=BA

hold. There is no positivity, trace, or normalization assumption on AAA or BBB. The index set may be empty; in that case both traces are 000, and the matrices commute.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me