LinearPMap.isClosable_of_zero
theoremverifiedformalizationimported Lean
A zero LinearPMap (any domain) is closable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true 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 lemma LinearPMap.isClosable_of_zero (h_zero : ⇑U = 0) : U.IsClosable
- Formalizes
- Physlib, `LinearPMap.isClosable_of_zero`
- 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_of_zero← LinearPMap.isClosable_of_zero (Physlib/QuantumMechanics/Operators/Unbounded.lean:247): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- LinearPMap.IsClosable.smulLinearPMap.IsClosable.smul
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 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/-- A zero LinearPMap (any domain) is closable. -/lemma LinearPMap.isClosable_of_zero (h_zero : ⇑U = 0) : U.IsClosable := by use U.graph.topologicalClosure.toLinearPMap refine (toLinearPMap_graph_eq _ fun x hx hx₁ ↦ ?_).symm obtain ⟨b, hb, hb'⟩ := mem_closure_iff_seq_limit.mp hx have hbn : ∀ n, (b n).snd = 0 := fun n ↦ by specialize hb n; simp_all rw [nhds_prod_eq, Filter.tendsto_prod_iff'] at hb' simp_all