LinearPMap.raw_commutator_eq_of_symmetric
theoremverifiedformalizationimported Lean
LinearPMap.raw_commutator_eq_of_symmetric
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap in open InnerProductSpace in variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] in lemma LinearPMap.raw_commutator_eq_of_symmetric (A B : H →ₗ.[ℂ] H) (hA : A.IsSymmetric) (hB : B.IsSymmetric) (ψ : A.domain) (hψB : (ψ : H) ∈ B.domain) (hBA : A ψ ∈ B.domain) (hAB : B ⟨ψ, hψB⟩ ∈ A.domain) {c : ℝ} (h_raw : ⟪(ψ : H), A ⟨B ⟨ψ, hψB⟩, hAB⟩ - B ⟨A ψ, hBA⟩⟫_ℂ = Complex.I * c) : ⟪A ψ, B ⟨ψ, hψB⟩⟫_ℂ - ⟪B ⟨ψ, hψB⟩, A ψ⟫_ℂ = Complex.I * c
- Formalizes
- Physlib, `LinearPMap.raw_commutator_eq_of_symmetric`
- Lean proof
- By Matteo Cipollina, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Axiomatic-AI. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.LinearPMap.raw_commutator_eq_of_symmetric← LinearPMap.raw_commutator_eq_of_symmetric (Physlib/QuantumMechanics/Operators/Uncertainty.lean:109): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- LinearPMap.IsSymmetricA LinearPMap
Tis symmetric iff⟪T x, y⟫_ℂ = ⟪x, T y⟫_ℂfor allx y : T.domain.
- LinearPMap.IsSymmetricA LinearPMap
- Used by 1
- LinearPMap.inner_centered_commutator_of_raw_commutatorA raw commutator expectation determines the centered commutator expectation.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen LinearPMap inopen InnerProductSpace invariable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] inlemma LinearPMap.raw_commutator_eq_of_symmetric (A B : H →ₗ.[ℂ] H) (hA : A.IsSymmetric) (hB : B.IsSymmetric) (ψ : A.domain) (hψB : (ψ : H) ∈ B.domain) (hBA : A ψ ∈ B.domain) (hAB : B ⟨ψ, hψB⟩ ∈ A.domain) {c : ℝ} (h_raw : ⟪(ψ : H), A ⟨B ⟨ψ, hψB⟩, hAB⟩ - B ⟨A ψ, hBA⟩⟫_ℂ = Complex.I * c) : ⟪A ψ, B ⟨ψ, hψB⟩⟫_ℂ - ⟪B ⟨ψ, hψB⟩, A ψ⟫_ℂ = Complex.I * c := by have ha_pairing : ⟪A ψ, B ⟨ψ, hψB⟩⟫_ℂ = ⟪(ψ : H), A ⟨B ⟨ψ, hψB⟩, hAB⟩⟫_ℂ := by exact hA ψ ⟨B ⟨ψ, hψB⟩, hAB⟩ have hb_pairing : ⟪B ⟨ψ, hψB⟩, A ψ⟫_ℂ = ⟪(ψ : H), B ⟨A ψ, hBA⟩⟫_ℂ := by exact hB ⟨ψ, hψB⟩ ⟨A ψ, hBA⟩ calc ⟪A ψ, B ⟨ψ, hψB⟩⟫_ℂ - ⟪B ⟨ψ, hψB⟩, A ψ⟫_ℂ = ⟪(ψ : H), A ⟨B ⟨ψ, hψB⟩, hAB⟩⟫_ℂ - ⟪(ψ : H), B ⟨A ψ, hBA⟩⟫_ℂ := by rw [ha_pairing, hb_pairing] _ = ⟪(ψ : H), A ⟨B ⟨ψ, hψB⟩, hAB⟩ - B ⟨A ψ, hBA⟩⟫_ℂ := by rw [inner_sub_right] _ = Complex.I * c := h_raw