AFTD Auto-Formalizing Theoretical Domains

LinearPMap.IsClosed.isClosed_toFun_graph

theoremverifiedformalizationimported Lean

LinearPMap.IsClosed.isClosed_toFun_graph

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.IsClosed.isClosed_toFun_graph (hU : U.IsClosed) :
    _root_.IsClosed (U.toFun.graph : Set (U.domain × H'))
Formalizes
Physlib, `LinearPMap.IsClosed.isClosed_toFun_graph`
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 2
Used by 1

Lean source view module on GitHub

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''} inlemma LinearPMap.IsClosed.isClosed_toFun_graph (hU : U.IsClosed) :    _root_.IsClosed (U.toFun.graph : Set (U.domain × H')) := by  refine isClosed_of_closure_subset fun ⟨x₁, x₂⟩ hx ↦ ?_  simp only [SetLike.mem_coe, LinearMap.mem_graph_iff, toFun_eq_coe]  suffices (↑x₁, x₂) ∈ U.graph.topologicalClosure by    simp_all [hU.isClosable.graph_closure_eq_closure_graph, hU.closure_eq]  obtain ⟨b, hb, hbx⟩ := mem_closure_iff_seq_limit.mp hx  apply mem_closure_iff_seq_limit.mpr  rw [nhds_prod_eq] at *  refine ⟨fun n ↦ (↑(b n).1, (b n).2), by simp_all,    Filter.Tendsto.prodMk (tendsto_subtype_rng.mp hbx.fst) hbx.snd⟩
See it in the graphDiscuss this resultChallenge it