Section 4, printed 3.1: Golden–Thompson inequality and equality criterion
OpenQAlgorithms.Papers.Independent.Intakethird100.P84.goldenThompsonEqualityprove2quantum
For arbitrary self-adjoint matrices on a finite complex Hilbert space,
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 and any Hermitian complex matrices indexed by , both
and
hold. There is no positivity, trace, or normalization assumption on or . The index set may be empty; in that case both traces are , and the matrices commute.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.