Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Preliminaries  



1.1  Closable maps and closures  





1.2  Characterizations of closed graphs (general topology)  



1.2.1  Function with a closed graph  







1.3  Basic properties of maps with closed graphs  







2 Examples and counterexamples  



2.1  Continuous but not closed maps  





2.2  Closed but not continuous maps  







3 Closed graph theorems  



3.1  Between Banach spaces  





3.2  Complete metrizable codomain  



3.2.1  Between F-spaces  







3.3  Complete pseudometrizable codomain  





3.4  Codomain not complete or (pseudo) metrizable  







4 Borel graph theorem  





5 Related results  





6 See also  





7 References  





8 Bibliography  














Closed graph theorem (functional analysis)






Español
 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


In mathematics, particularly in functional analysis and topology, the closed graph theorem is a result connecting the continuity of certain kinds of functions to a topological property of their graph. In its most elementary form, the closed graph theorem states that a linear function between two Banach spaces is continuous if and only if the Closed graph property holds.

The closed graph theorem has extensive application throughout functional analysis, because it can control whether a partially-defined linear operator admits continuous extensions. For this reason, it has been generalized to many circumstances beyond the elementary formulation above.

Preliminaries[edit]

The closed graph theorem is a result about linear map between two vector spaces endowed with topologies making them into topological vector spaces (TVSs). We will henceforth assume that and are topological vector spaces, such as Banach spaces for example, and that Cartesian products, such as are endowed with the product topology. The graph of this function is the subset of where denotes the function's domain. The map is said to have a closed graph (in) if its graph is a closed subsetofproduct space (with the usual product topology). Similarly, is said to have a sequentially closed graphif is a sequentially closed subset of

Aclosed linear operator is a linear map whose graph is closed (it need not be continuous or bounded). It is common in functional analysis to call such maps "closed", but this should not be confused the non-equivalent notion of a "closed map" that appears in general topology.

Partial functions

It is common in functional analysis to consider partial functions, which are functions defined on a dense subset of some space A partial function is declared with the notation which indicates that has prototype (that is, its domainis and its codomainis) and that is a dense subset of Since the domain is denoted by it is not always necessary to assign a symbol (such as ) to a partial function's domain, in which case the notation or may be used to indicate that is a partial function with codomain whose domain is a dense subset of [1]Adensely defined linear operator between vector spaces is a partial function whose domain is a dense vector subspace of a TVS such that is a linear map. A prototypical example of a partial function is the derivative operator, which is only defined on the space of once continuously differentiable functions, a dense subset of the space ofcontinuous functions.

Every partial function is, in particular, a function and so all terminology for functions can be applied to them. For instance, the graph of a partial function is (as before) the set However, one exception to this is the definition of "closed graph". A partial function is said to have a closed graph (respectively, a sequentially closed graph) if is a closed (respectively, sequentially closed) subset of in the product topology; importantly, note that the product space is and not as it was defined above for ordinary functions.[note 1]

Closable maps and closures[edit]

A linear operator isclosablein if there exists a vector subspace containing and a function (resp. multifunction) whose graph is equal to the closure of the set in Such an is called a closure of in, is denoted by and necessarily extends

If is a closable linear operator then a core or an essential domainof is a subset such that the closure in of the graph of the restriction ofto is equal to the closure of the graph of in (i.e. the closure of in is equal to the closure of in).

Characterizations of closed graphs (general topology)[edit]

Throughout, let and be topological spaces and is endowed with the product topology.

Function with a closed graph[edit]

If is a function then it is said to have a closed graph if it satisfies any of the following are equivalent conditions:

  1. (Definition): The graph of is a closed subset of
  2. For every and net in such that inif is such that the net in then [2]
    • Compare this to the definition of continuity in terms of nets, which recall is the following: for every and net in such that in in
    • Thus to show that the function has a closed graph, it may be assumed that converges in to some (and then show that ) while to show that is continuous, it may not be assumed that converges in to some and instead, it must be proven that this is true (and moreover, it must more specifically be proven that converges to in).

and if is a Hausdorff compact space then we may add to this list:

  1. is continuous.[3]

and if both and are first-countable spaces then we may add to this list:

  1. has a sequentially closed graph in

Function with a sequentially closed graph

If is a function then the following are equivalent:

  1. has a sequentially closed graph in
  2. Definition: the graph of is a sequentially closed subset of
  3. For every and sequence in such that inif is such that the net in then [2]

Basic properties of maps with closed graphs[edit]

Suppose is a linear operator between Banach spaces.

Examples and counterexamples[edit]

Continuous but not closed maps[edit]

Closed but not continuous maps[edit]

Closed graph theorems[edit]

Between Banach spaces[edit]

Closed Graph Theorem for Banach spaces — If is an everywhere-defined linear operator between Banach spaces, then the following are equivalent:

  1. is continuous.
  2. is closed (that is, the graph of is closed in the product topologyon
  3. Ifin then in
  4. Ifin then in
  5. Ifin and if converges in to some then
  6. Ifin and if converges in to some then

The operator is required to be everywhere-defined, that is, the domain ofis This condition is necessary, as there exist closed linear operators that are unbounded (not continuous); a prototypical example is provided by the derivative operator on whose domain is a strict subset of

The usual proof of the closed graph theorem employs the open mapping theorem. In fact, the closed graph theorem, the open mapping theorem and the bounded inverse theorem are all equivalent. This equivalence also serves to demonstrate the importance of and being Banach; one can construct linear maps that have unbounded inverses in this setting, for example, by using either continuous functions with compact support or by using sequences with finitely many non-zero terms along with the supremum norm.

Complete metrizable codomain[edit]

The closed graph theorem can be generalized from Banach spaces to more abstract topological vector spaces in the following ways.

Theorem — A linear operator from a barrelled space to a Fréchet space iscontinuous if and only if its graph is closed.

Between F-spaces[edit]

There are versions that does not require to be locally convex.

Theorem — A linear map between two F-spaces is continuous if and only if its graph is closed.[7][8]

This theorem is restated and extend it with some conditions that can be used to determine if a graph is closed:

Theorem — If is a linear map between two F-spaces, then the following are equivalent:

  1. is continuous.
  2. has a closed graph.
  3. Ifin and if converges in to some then [9]
  4. Ifin and if converges in to some then

Complete pseudometrizable codomain[edit]

Every metrizable topological spaceispseudometrizable. A pseudometrizable space is metrizable if and only if it is Hausdorff.

Closed Graph Theorem[10] — Also, a closed linear map from a locally convex ultrabarrelled space into a complete pseudometrizable TVS is continuous.

Closed Graph Theorem — A closed and bounded linear map from a locally convex infrabarreled space into a complete pseudometrizable locally convex space is continuous.[10]

Codomain not complete or (pseudo) metrizable[edit]

Theorem[11] — Suppose that is a linear map whose graph is closed. If is an inductive limit of Baire TVSs and is a webbed space then is continuous.

Closed Graph Theorem[10] — A closed surjective linear map from a complete pseudometrizable TVS onto a locally convex ultrabarrelled space is continuous.

An even more general version of the closed graph theorem is

Theorem[12] — Suppose that and are two topological vector spaces (they need not be Hausdorff or locally convex) with the following property:

If is any closed subspace of and is any continuous map of onto then is an open mapping.

Under this condition, if is a linear map whose graph is closed then is continuous.

Borel graph theorem[edit]

The Borel graph theorem, proved by L. Schwartz, shows that the closed graph theorem is valid for linear maps defined on and valued in most spaces encountered in analysis.[13] Recall that a topological space is called a Polish space if it is a separable complete metrizable space and that a Souslin space is the continuous image of a Polish space. The weak dual of a separable Fréchet space and the strong dual of a separable Fréchet-Montel space are Souslin spaces. Also, the space of distributions and all Lp-spaces over open subsets of Euclidean space as well as many other spaces that occur in analysis are Souslin spaces. The Borel graph theorem states:

Borel Graph Theorem — Let be linear map between two locally convex Hausdorff spaces and If is the inductive limit of an arbitrary family of Banach spaces, if is a Souslin space, and if the graph of is a Borel set in then is continuous.[13]

An improvement upon this theorem, proved by A. Martineau, uses K-analytic spaces.

A topological space is called a if it is the countable intersection of countable unions of compact sets.

A Hausdorff topological space is called K-analytic if it is the continuous image of a space (that is, if there is a space and a continuous map of onto ).

Every compact set is K-analytic so that there are non-separable K-analytic spaces. Also, every Polish, Souslin, and reflexive Fréchet space is K-analytic as is the weak dual of a Frechet space. The generalized Borel graph theorem states:

Generalized Borel Graph Theorem[14] — Let be a linear map between two locally convex Hausdorff spaces and If is the inductive limit of an arbitrary family of Banach spaces, if is a K-analytic space, and if the graph of is closed in then is continuous.

Related results[edit]

If is closed linear operator from a Hausdorff locally convex TVS into a Hausdorff finite-dimensional TVS then is continuous.[15]

See also[edit]

References[edit]

Notes

  1. ^ In contrast, when is considered as an ordinary function (rather than as the partial function ), then "having a closed graph" would instead mean that is a closed subset of If is a closed subset of then it is also a closed subset of although the converse is not guaranteed in general.
  1. ^ Dolecki & Mynard 2016, pp. 4–5.
  • ^ a b c d e Narici & Beckenstein 2011, pp. 459–483.
  • ^ Munkres 2000, p. 171.
  • ^ Rudin 1991, p. 50.
  • ^ Narici & Beckenstein 2011, p. 480.
  • ^ Kreyszig, Erwin (1978). Introductory Functional Analysis With Applications. USA: John Wiley & Sons. Inc. p. 294. ISBN 0-471-50731-8.
  • ^ Schaefer & Wolff 1999, p. 78.
  • ^ Trèves (2006), p. 173
  • ^ Rudin 1991, pp. 50–52.
  • ^ a b c Narici & Beckenstein 2011, pp. 474–476.
  • ^ Narici & Beckenstein 2011, p. 479-483.
  • ^ Trèves 2006, p. 169.
  • ^ a b Trèves 2006, p. 549.
  • ^ Trèves 2006, pp. 557–558.
  • ^ Narici & Beckenstein 2011, p. 476.
  • Bibliography[edit]


    Retrieved from "https://en.wikipedia.org/w/index.php?title=Closed_graph_theorem_(functional_analysis)&oldid=1228648759"

    Category: 
    Theorems in functional analysis
    Hidden categories: 
    Articles with short description
    Short description is different from Wikidata
    Pages displaying short descriptions of redirect targets via Module:Annotated link
    CS1 French-language sources (fr)
     



    This page was last edited on 12 June 2024, at 11:38 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki