AFTD Auto-Formalizing Theoretical Domains

LinearPMap.commutator_half_sq_le_mul_norm_sq

theoremverifiedformalizationimported Lean

LinearPMap.commutator_half_sq_le_mul_norm_sq

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.commutator_half_sq_le_mul_norm_sq {u v : H} {c : ℝ}
    (h_comm : ⟪u, v⟫_ℂ - ⟪v, u⟫_ℂ = Complex.I * c) :
    (|c| / 2) ^ 2 ≤ (‖u‖ * ‖v‖) ^ 2
Formalizes
Physlib, `LinearPMap.commutator_half_sq_le_mul_norm_sq`
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.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen LinearPMap inopen InnerProductSpace invariable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] inlemma LinearPMap.commutator_half_sq_le_mul_norm_sq {u v : H} {c : ℝ}    (h_comm : ⟪u, v⟫_ℂ - ⟪v, u⟫_ℂ = Complex.I * c) :    (|c| / 2) ^ 2 ≤ (‖u‖ * ‖v‖) ^ 2 := by  suffices (|c| / 2) ^ 2 ≤ (‖u‖ * ‖v‖) ^ 2 by exact this  have h_sq : |c / 2| ^ 2 ≤ (‖u‖ * ‖v‖) ^ 2 := by    have h_bound : |c / 2| ≤ ‖u‖ * ‖v‖ := by      have h_im : |(⟪u, v⟫_ℂ).im| ≤ ‖u‖ * ‖v‖ :=        le_trans (Complex.abs_im_le_norm ⟪u, v⟫_ℂ) (norm_inner_le_norm u v)      rwa [inner_im_of_commutator_eq h_comm] at h_im    have h_nonneg : 0 ≤ ‖u‖ * ‖v‖ := mul_nonneg (norm_nonneg u) (norm_nonneg v)    nlinarith [abs_nonneg (c / 2), h_bound, h_nonneg]  simpa [abs_div] using h_sq
See it in the graphDiscuss this resultChallenge it