AFTD Auto-Formalizing Theoretical Domains

LinearPMap.isClosable_of_continuous

theoremverifiedformalizationimported Lean

Continuous operators are 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_continuous (h : Continuous U) : U.IsClosable
Formalizes
Physlib, `LinearPMap.isClosable_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.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • LinearMap.continuous_iff_boundedf : E →ₗ[𝕜] F is continuous iff there exists M > 0 s.t. ‖f x‖ ≤ M * ‖x‖ for all x : E. This is a (convenient) immediate…
Used by 2

Lean source view module on GitHub

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/-- Continuous operators are closable. -/lemma LinearPMap.isClosable_of_continuous (h : Continuous U) : U.IsClosable := by  use U.graph.topologicalClosure.toLinearPMap  refine (toLinearPMap_graph_eq _ fun x hx hx₁ ↦ ?_).symm  obtain ⟨b, hb, hbx⟩ := mem_closure_iff_seq_limit.mp hx  rw [nhds_prod_eq] at hbx  refine norm_eq_zero.mp (tendsto_nhds_unique hbx.snd.norm ?_)  obtain ⟨M, hM, h_bound⟩ := LinearMap.continuous_iff_bounded.mp h  refine squeeze_zero (g := fun n ↦ M * ‖(b n).1‖) (fun _ ↦ norm_nonneg _) (fun n ↦ ?_) ?_  · obtain ⟨y, hy₁, hy₂⟩ := (mem_graph_iff _).mp (hb n)    simp only [← hy₁, ← hy₂]    exact h_bound y  · exact mul_zero M ▸ (norm_eq_zero.mpr hx₁) ▸ hbx.fst.norm.const_mul M
See it in the graphDiscuss this resultChallenge it