LinearPMap.IsClosable.smul
theoremverifiedformalizationimported Lean
LinearPMap.IsClosable.smul
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap in open Submodule in open InnerProductSpace in open Complex ComplexConjugate in variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {H' : Type*} [NormedAddCommGroup H'] [InnerProductSpace ℂ H'] {H'' : Type*} [NormedAddCommGroup H''] [InnerProductSpace ℂ H''] {α : Type*} [Fintype α] {T T₁ T₂ : H →ₗ.[ℂ] H} {S : α → H →ₗ.[ℂ] H} {U U₁ U₂ : H →ₗ.[ℂ] H'} {W : α → H →ₗ.[ℂ] H'} {V V₁ V₂ : H' →ₗ.[ℂ] H''} in @[aesop safe apply] lemma LinearPMap.IsClosable.smul (h : U.IsClosable) (c : ℂ) : (c • U).IsClosable
- Formalizes
- Physlib, `LinearPMap.IsClosable.smul`
- Lean proof
- By Adam Bornemann, 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.IsClosable.smul← LinearPMap.IsClosable.smul (Physlib/QuantumMechanics/Operators/Unbounded.lean:256): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- LinearPMap.closure_domain_le_domain_closureLinearPMap.closure_domain_le_domain_closure
- LinearPMap.isClosable_of_zeroA zero LinearPMap (any domain) is closable.
- StandardModel.GaugeGroupI.ofU1SubgroupThe inclusion of a U(1) subgroup.
- catch_up_value_eq_draw_iff_not_lossThe outcome of Catch-Up on a nonempty set S is a draw if and only if Player 1 does not lose from the initial position and Player 2 does…
- Used by 3
- LinearPMap.closure_smulLinearPMap.closure_smul
- LinearPMap.IsClosable.negLinearPMap.IsClosable.neg
- LinearPMap.IsClosable.smul_iffLinearPMap.IsClosable.smul_iff
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 Submodule inopen InnerProductSpace inopen Complex ComplexConjugate invariable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {H' : Type*} [NormedAddCommGroup H'] [InnerProductSpace ℂ H'] {H'' : Type*} [NormedAddCommGroup H''] [InnerProductSpace ℂ H''] {α : Type*} [Fintype α] {T T₁ T₂ : H →ₗ.[ℂ] H} {S : α → H →ₗ.[ℂ] H} {U U₁ U₂ : H →ₗ.[ℂ] H'} {W : α → H →ₗ.[ℂ] H'} {V V₁ V₂ : H' →ₗ.[ℂ] H''} in@[aesop safe apply]lemma LinearPMap.IsClosable.smul (h : U.IsClosable) (c : ℂ) : (c • U).IsClosable := by rcases eq_zero_or_neZero c with (rfl | hc) · exact isClosable_of_zero (by simp) · use (c • U).graph.topologicalClosure.toLinearPMap refine (toLinearPMap_graph_eq _ fun x hx hx₁ ↦ ?_).symm rw [← smul_zero c, ← inv_smul_eq_iff₀ hc.ne] refine graph_fst_eq_zero_snd U.closure ?_ rfl rw [← h.graph_closure_eq_closure_graph] apply mem_closure_iff_seq_limit.mpr obtain ⟨b, hb, hb'⟩ := mem_closure_iff_seq_limit.mp hx use fun n ↦ ((b n).fst, c⁻¹ • (b n).snd) rw [nhds_prod_eq, Filter.tendsto_prod_iff'] at * refine ⟨fun n ↦ ?_, hx₁ ▸ hb'.1, hb'.2.const_smul c⁻¹⟩ obtain ⟨u, hu, hu'⟩ := hb n simp only [coe_toAddSubmonoid, SetLike.mem_coe, mem_graph_iff, Subtype.exists, ← hu'] exact ⟨u.1, u.1.2, rfl, ((inv_smul_eq_iff₀ hc.ne).mpr hu).symm⟩