Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Solutions of S˙=[H,S]\dot S = [H,S]S˙=[H,S] are symplectic similarity transforms

Proved
UnQuantumMechanics.heisenberg_solution_symplectic_similarity

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

hamiltonian-mechanicslinear-algebramathematical-physics

Let HHH be a Hamiltonian 2n×2n2n\times 2n2n×2n matrix (constant in time) and let S:R→R2n×2nS:\mathbb R\to\mathbb R^{2n\times2n}S:R→R2n×2n be differentiable at every time and satisfy Heisenberg's equation S˙=HS−SH\dot S = HS - SHS˙=HS−SH. Then for every τ\tauτ

S(τ)=exp⁡(Hτ) S(0) exp⁡(−Hτ).S(\tau) = \exp(H\tau)\,S(0)\,\exp(-H\tau).S(τ)=exp(Hτ)S(0)exp(−Hτ).

Since exp⁡(Hτ)\exp(H\tau)exp(Hτ) is symplectic (Eq. 50), this shows that time evolution acts on SSS by symplectic similarity transformations.

Formalization Note Derivatives are entrywise; exp⁡\expexp is the matrix exponential.

Preamble
import Mathlib
import Definitions.Def_UnQM_phase_space

open Matrix
Formal statement
namespace UnQuantumMechanics

theorem heisenberg_solution_symplectic_similarity (n : ℕ) (H : Matrix (PhaseIdx n) (PhaseIdx n) ℝ)
    (hH : IsHamiltonianMatrix n H) (S : ℝ → Matrix (PhaseIdx n) (PhaseIdx n) ℝ)
    (hS : ∀ τ i j, HasDerivAt (fun t => S t i j) ((H * S τ - S τ * H) i j) τ) (τ : ℝ) :
    S τ = NormedSpace.exp (τ • H) * S 0 * NormedSpace.exp ((-τ) • H) := by sorry

end UnQuantumMechanics
Source
C. Baumgarten, How to (Un-) Quantum Mechanics, arXiv:1810.06981v2 [physics.gen-ph] (v2 dated June 10, 2025), https://arxiv.org/abs/1810.06981, Sec. VI, p. 17, Eq. (51)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent that drafted the statements; non-blind

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement, at the explicit direction of the proposal owner. The author knew the intended meaning and the source text while writing it, so it must not be mistaken for a blind, independent audit. An independent blind read-back is still recommended before submission.

For every natural number nnn, every real 2n×2n2n\times2n2n×2n matrix HHH for which there is a symmetric AAA with H=γ0AH=\gamma_0AH=γ0​A, every function S:R→R2n×2nS:\mathbb R\to\mathbb R^{2n\times2n}S:R→R2n×2n such that for every ttt and all indices i,ji,ji,j the function s↦S(s)ijs\mapsto S(s)_{ij}s↦S(s)ij​ is differentiable at ttt with derivative (HS(t)−S(t)H)ij\big(HS(t)-S(t)H\big)_{ij}(HS(t)−S(t)H)ij​, and every real τ\tauτ: S(τ)=exp⁡(τH) S(0) exp⁡((−τ)H)S(\tau) = \exp(\tau H)\,S(0)\,\exp((-\tau)H)S(τ)=exp(τH)S(0)exp((−τ)H), with exp⁡\expexp the power-series matrix exponential.

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

    Confirmed by the moderator at approval.

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