LinearPMap.isLowerBound_neg
theoremverifiedformalizationimported Lean
LinearPMap.isLowerBound_neg
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap in variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] in open Submodule in open Metric in open InnerProductSpace in open Complex in open ComplexConjugate in open Set in open Pointwise in lemma LinearPMap.isLowerBound_neg {T : H →ₗ.[ℂ] H} {z : ℂ} {c : ℝ} (h : IsLowerBound T z c) : IsLowerBound (-T) (-z) c
- Formalizes
- Physlib, `LinearPMap.isLowerBound_neg`
- Lean proof
- By Gregory J. Loges, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Gregory J. Loges. 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.isLowerBound_neg← LinearPMap.isLowerBound_neg (Physlib/QuantumMechanics/Operators/SpectralTheory/Basic.lean:118): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- LinearPMap.IsLowerBound
IsLowerBound T z cis the property thatc * ‖x‖ ≤ ‖T x - z • x‖for allx : T.domain.
- LinearPMap.IsLowerBound
- Used by 1
- LinearPMap.regularityDomain_negLinearPMap.regularityDomain_neg
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 invariable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] inopen Submodule inopen Metric inopen InnerProductSpace inopen Complex inopen ComplexConjugate inopen Set inopen Pointwise inlemma LinearPMap.isLowerBound_neg {T : H →ₗ.[ℂ] H} {z : ℂ} {c : ℝ} (h : IsLowerBound T z c) : IsLowerBound (-T) (-z) c := fun x ↦ by simpa [neg_apply, norm_neg_add] using h x