LinearPMap.isLowerBound_closure
theoremverifiedformalizationimported Lean
LinearPMap.isLowerBound_closure
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_closure {T : H →ₗ.[ℂ] H} {z : ℂ} {c : ℝ} (h : IsLowerBound T z c) : IsLowerBound T.closure z c
- Formalizes
- Physlib, `LinearPMap.isLowerBound_closure`
- 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_closure← LinearPMap.isLowerBound_closure (Physlib/QuantumMechanics/Operators/SpectralTheory/Basic.lean:132): 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_closure
TandT.closurehave the same regularity domain.
- LinearPMap.regularityDomain_closure
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_closure {T : H →ₗ.[ℂ] H} {z : ℂ} {c : ℝ} (h : IsLowerBound T z c) : IsLowerBound T.closure z c := by by_cases hT : T.IsClosable · intro x obtain ⟨b, hb, hb'⟩ := mem_closure_iff_seq_limit.mp <| hT.graph_closure_eq_closure_graph ▸ T.closure.mem_graph x rw [nhds_prod_eq] at hb' refine le_of_tendsto_of_tendsto' (hb'.fst.norm.const_mul c) ((hb'.snd.sub <| hb'.fst.const_smul z).norm) fun n ↦ ?_ obtain ⟨y, hy₁, hy₂⟩ := (mem_graph_iff _).mp (hb n) exact hy₁ ▸ hy₂ ▸ h y · rwa [closure_def' hT]