Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(Anti-)commutator table of Hamiltonian and skew-Hamiltonian matrices

Proved
UnQuantumMechanics.hamiltonian_skew_hamiltonian_algebra

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

hamiltonian-mechanicslinear-algebramathematical-physics

Let S1,S2S_1, S_2S1​,S2​ be Hamiltonian and C1,C2C_1, C_2C1​,C2​ skew-Hamiltonian 2n×2n2n\times 2n2n×2n matrices, and let k∈Nk \in \mathbb Nk∈N. Then

  1. S1S2−S2S1S_1S_2 - S_2S_1S1​S2​−S2​S1​,  C1C2−C2C1\ C_1C_2 - C_2C_1 C1​C2​−C2​C1​,  C1S1+S1C1\ C_1S_1 + S_1C_1 C1​S1​+S1​C1​ and S12k+1S_1^{2k+1}S12k+1​ are Hamiltonian;
  2. S1S2+S2S1S_1S_2 + S_2S_1S1​S2​+S2​S1​,  C1C2+C2C1\ C_1C_2 + C_2C_1 C1​C2​+C2​C1​,  C1S1−S1C1\ C_1S_1 - S_1C_1 C1​S1​−S1​C1​, S12kS_1^{2k}S12k​ and C1kC_1^{k}C1k​ are skew-Hamiltonian.

This is the "phase-space algebra" from which the paper later builds Clifford algebras.

Formalization Note In Eq. (57) the exponent letter nnn is a generic natural number, not the number of degrees of freedom; it is written kkk here. The case k=0k = 0k=0 is included, so in particular the identity matrix is skew-Hamiltonian.

Preamble
import Mathlib
import Definitions.Def_UnQM_phase_space

open Matrix
Formal statement
namespace UnQuantumMechanics

theorem hamiltonian_skew_hamiltonian_algebra (n : ℕ) (S₁ S₂ C₁ C₂ : Matrix (PhaseIdx n) (PhaseIdx n) ℝ)
    (hS₁ : IsHamiltonianMatrix n S₁) (hS₂ : IsHamiltonianMatrix n S₂)
    (hC₁ : IsSkewHamiltonianMatrix n C₁) (hC₂ : IsSkewHamiltonianMatrix n C₂) (k : ℕ) :
    (IsHamiltonianMatrix n (S₁ * S₂ - S₂ * S₁) ∧
      IsHamiltonianMatrix n (C₁ * C₂ - C₂ * C₁) ∧
      IsHamiltonianMatrix n (C₁ * S₁ + S₁ * C₁) ∧
      IsHamiltonianMatrix n (S₁ ^ (2 * k + 1))) ∧
    (IsSkewHamiltonianMatrix n (S₁ * S₂ + S₂ * S₁) ∧
      IsSkewHamiltonianMatrix n (C₁ * C₂ + C₂ * C₁) ∧
      IsSkewHamiltonianMatrix n (C₁ * S₁ - S₁ * C₁) ∧
      IsSkewHamiltonianMatrix n (S₁ ^ (2 * k)) ∧
      IsSkewHamiltonianMatrix n (C₁ ^ k)) := 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.B, pp. 17–18, Eq. (57)
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, all real 2n×2n2n\times2n2n×2n matrices S1,S2,C1,C2S_1,S_2,C_1,C_2S1​,S2​,C1​,C2​ such that S1S_1S1​ and S2S_2S2​ are each of the form γ0A\gamma_0Aγ0​A with AAA symmetric and C1C_1C1​ and C2C_2C2​ are each of the form γ0B\gamma_0Bγ0​B with BT=−BB^T=-BBT=−B, and every natural number kkk (including 000), both of the following blocks hold:

  1. each of S1S2−S2S1S_1S_2-S_2S_1S1​S2​−S2​S1​, C1C2−C2C1C_1C_2-C_2C_1C1​C2​−C2​C1​, C1S1+S1C1C_1S_1+S_1C_1C1​S1​+S1​C1​, S12k+1S_1^{2k+1}S12k+1​ is of the form γ0A′\gamma_0A'γ0​A′ with A′A'A′ symmetric;
  2. each of S1S2+S2S1S_1S_2+S_2S_1S1​S2​+S2​S1​, C1C2+C2C1C_1C_2+C_2C_1C1​C2​+C2​C1​, C1S1−S1C1C_1S_1-S_1C_1C1​S1​−S1​C1​, S12kS_1^{2k}S12k​, C1kC_1^{k}C1k​ is of the form γ0B′\gamma_0B'γ0​B′ with B′T=−B′B'^T=-B'B′T=−B′.

Only the mixed products of C1C_1C1​ with S1S_1S1​ (not C2C_2C2​ or S2S_2S2​) and only powers of S1S_1S1​ and C1C_1C1​ appear.

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