LinearPMap.regularityDomain_smul
theoremverifiedformalizationimported Lean
LinearPMap.regularityDomain_smul
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 @[simp] lemma LinearPMap.regularityDomain_smul (T : H →ₗ.[ℂ] H) {w : ℂ} (hw : w ≠ 0) : (w • T).regularityDomain = w • T.regularityDomain
- Formalizes
- Physlib, `LinearPMap.regularityDomain_smul`
- 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.regularityDomain_smul← LinearPMap.regularityDomain_smul (Physlib/QuantumMechanics/Operators/SpectralTheory/Basic.lean:159): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- LinearPMap.IsLowerBound
IsLowerBound T z cis the property thatc * ‖x‖ ≤ ‖T x - z • x‖for allx : T.domain. - LinearPMap.regularityDomainThe regular points for
T.z : ℂis a regular point forTiff there exists a constantc > 0such thatc * ‖x‖ ≤ ‖(T - z • 1) x‖…
- LinearPMap.IsLowerBound
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 in@[simp]lemma LinearPMap.regularityDomain_smul (T : H →ₗ.[ℂ] H) {w : ℂ} (hw : w ≠ 0) : (w • T).regularityDomain = w • T.regularityDomain := by ext z constructor · intro ⟨c, hc, h_bound⟩ refine ⟨w⁻¹ * z, ?_, ?_⟩ · refine ⟨‖w‖⁻¹ * c, by positivity, fun x ↦ ?_⟩ rw [mul_assoc] apply (inv_mul_le_iff₀ <| norm_pos_iff.mpr hw).mpr rw [← norm_smul, smul_sub, smul_smul, mul_inv_cancel_left₀ hw] exact h_bound x · simp [hw] · intro ⟨u, ⟨c, hc, h_bound⟩, huz⟩ refine ⟨‖w‖ * c, by positivity, fun x ↦ ?_⟩ rw [mul_assoc] apply (le_inv_mul_iff₀ <| norm_pos_iff.mpr hw).mp refine le_of_le_of_eq (h_bound x) ?_ simp [← norm_inv, ← norm_smul, smul_sub, smul_smul, ← huz, hw]