LinearPMap.closure_domain_eq_domain_closure_of_continuous
theoremverifiedformalizationimported Lean
A strengthening of closure_domain_le_domain_closure for continuous operators.
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 lemma LinearPMap.closure_domain_eq_domain_closure_of_continuous [CompleteSpace H'] (h : Continuous U) : U.closure.domain = U.domain.closure
- Formalizes
- Physlib, `LinearPMap.closure_domain_eq_domain_closure_of_continuous`
- 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.closure_domain_eq_domain_closure_of_continuous← LinearPMap.closure_domain_eq_domain_closure_of_continuous (Physlib/QuantumMechanics/Operators/Unbounded.lean:433): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- LinearPMap.closure_domain_le_domain_closureLinearPMap.closure_domain_le_domain_closure
- LinearMap.continuous_iff_bounded
f : E →ₗ[𝕜] Fis continuous iff there existsM > 0s.t.‖f x‖ ≤ M * ‖x‖for allx : E. This is a (convenient) immediate… - LinearPMap.isClosable_of_continuousContinuous operators are closable.
- StandardModel.GaugeGroupI.ofU1SubgroupThe inclusion of a U(1) subgroup.
- Used by 1
- LinearPMap.isClosed_iff_isClosed_domain_of_continuousA continuous operator is closed iff its domain is closed.
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/-- A strengthening of `closure_domain_le_domain_closure` for continuous operators. -/lemma LinearPMap.closure_domain_eq_domain_closure_of_continuous [CompleteSpace H'] (h : Continuous U) : U.closure.domain = U.domain.closure := by refine eq_of_le_of_ge U.closure_domain_le_domain_closure fun x hx ↦ ?_ obtain ⟨M, hM, h_bound⟩ := LinearMap.continuous_iff_bounded.mp h obtain ⟨b, hb, hb'⟩ := mem_closure_iff_seq_limit.mp hx simp only [coe_toAddSubmonoid, SetLike.mem_coe] at hb let Ub : ℕ → H' := fun n ↦ U ⟨b n, hb n⟩ have hCS : CauchySeq Ub := by refine Metric.cauchySeq_iff'.mpr fun ε hε ↦ ?_ obtain ⟨N, hN⟩ := Metric.cauchySeq_iff'.mp hb'.cauchySeq (M⁻¹ * ε) (by positivity) refine ⟨N, fun n hn ↦ ?_⟩ refine lt_of_le_of_lt ?_ ((lt_inv_mul_iff₀ hM).mp (hN n hn)) calc _ = ‖Ub n - Ub N‖ := dist_eq_norm _ _ _ = ‖U (⟨b n, hb n⟩ - ⟨b N, hb N⟩)‖ := by simp [Ub, map_sub] _ ≤ M * ‖b n - b N‖ := h_bound _ _ = M * dist (b n) (b N) := by rw [dist_eq_norm] obtain ⟨y, hy⟩ := CompleteSpace.complete hCS apply mem_domain_iff.mpr rw [← (isClosable_of_continuous h).graph_closure_eq_closure_graph] use y refine mem_closure_iff_seq_limit.mpr ⟨fun n ↦ (b n, Ub n), fun n ↦ ?_, ?_⟩ · simp [hb n, Ub] · rw [nhds_prod_eq] exact Filter.Tendsto.prodMk hb' hy