Misplaced Pages

Closed graph theorem

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Theorem relating continuity to graphs This article is about closed graph theorems in general topology. For the closed graph theorem in functional analysis, see Closed graph theorem (functional analysis). A cubic functionThe Heaviside functionThe graph of the cubic function f ( x ) = x 3 9 x {\displaystyle f(x)=x^{3}-9x} on the interval [ 4 , 4 ] {\displaystyle } is closed because the function is continuous. The graph of the Heaviside function on [ 2 , 2 ] {\displaystyle } is not closed, because the function is not continuous.

In mathematics, the closed graph theorem may refer to one of several basic results characterizing continuous functions in terms of their graphs. Each gives conditions when functions with closed graphs are necessarily continuous.

A blog post by T. Tao lists several closed graph theorems throughout mathematics.

Graphs and maps with closed graphs

Main article: Closed graph

If f : X Y {\displaystyle f:X\to Y} is a map between topological spaces then the graph of f {\displaystyle f} is the set Γ f := { ( x , f ( x ) ) : x X } {\displaystyle \Gamma _{f}:=\{(x,f(x)):x\in X\}} or equivalently, Γ f := { ( x , y ) X × Y : y = f ( x ) } {\displaystyle \Gamma _{f}:=\{(x,y)\in X\times Y:y=f(x)\}} It is said that the graph of f {\displaystyle f} is closed if Γ f {\displaystyle \Gamma _{f}} is a closed subset of X × Y {\displaystyle X\times Y} (with the product topology).

Any continuous function into a Hausdorff space has a closed graph (see § Closed graph theorem in point-set topology)

Any linear map, L : X Y , {\displaystyle L:X\to Y,} between two topological vector spaces whose topologies are (Cauchy) complete with respect to translation invariant metrics, and if in addition (1a) L {\displaystyle L} is sequentially continuous in the sense of the product topology, then the map L {\displaystyle L} is continuous and its graph, Gr L, is necessarily closed. Conversely, if L {\displaystyle L} is such a linear map with, in place of (1a), the graph of L {\displaystyle L} is (1b) known to be closed in the Cartesian product space X × Y {\displaystyle X\times Y} , then L {\displaystyle L} is continuous and therefore necessarily sequentially continuous.

Examples of continuous maps that do not have a closed graph

If X {\displaystyle X} is any space then the identity map Id : X X {\displaystyle \operatorname {Id} :X\to X} is continuous but its graph, which is the diagonal Γ Id := { ( x , x ) : x X } , {\displaystyle \Gamma _{\operatorname {Id} }:=\{(x,x):x\in X\},} , is closed in X × X {\displaystyle X\times X} if and only if X {\displaystyle X} is Hausdorff. In particular, if X {\displaystyle X} is not Hausdorff then Id : X X {\displaystyle \operatorname {Id} :X\to X} is continuous but does not have a closed graph.

Let X {\displaystyle X} denote the real numbers R {\displaystyle \mathbb {R} } with the usual Euclidean topology and let Y {\displaystyle Y} denote R {\displaystyle \mathbb {R} } with the indiscrete topology (where note that Y {\displaystyle Y} is not Hausdorff and that every function valued in Y {\displaystyle Y} is continuous). Let f : X Y {\displaystyle f:X\to Y} be defined by f ( 0 ) = 1 {\displaystyle f(0)=1} and f ( x ) = 0 {\displaystyle f(x)=0} for all x 0 {\displaystyle x\neq 0} . Then f : X Y {\displaystyle f:X\to Y} is continuous but its graph is not closed in X × Y {\displaystyle X\times Y} .

Closed graph theorem in point-set topology

In point-set topology, the closed graph theorem states the following:

Closed graph theorem — If f : X Y {\displaystyle f:X\to Y} is a map from a topological space X {\displaystyle X} into a Hausdorff space Y , {\displaystyle Y,} then the graph of f {\displaystyle f} is closed if f : X Y {\displaystyle f:X\to Y} is continuous. The converse is true when Y {\displaystyle Y} is compact. (Note that compactness and Hausdorffness do not imply each other.)

Proof

First part: just note that the graph of f {\displaystyle f} is the same as the pre-image ( f × id Y ) 1 ( D ) {\displaystyle (f\times \operatorname {id} _{Y})^{-1}(D)} where D = { ( y , y ) y Y } {\displaystyle D=\{(y,y)\mid y\in Y\}} is the diagonal in Y 2 {\displaystyle Y^{2}} .

Second part:

For any open V Y {\displaystyle V\subset Y} , we check f 1 ( V ) {\displaystyle f^{-1}(V)} is open. So take any x f 1 ( V ) {\displaystyle x\in f^{-1}(V)} , we construct some open neighborhood U {\displaystyle U} of x {\displaystyle x} , such that f ( U ) V {\displaystyle f(U)\subset V} .

Since the graph of f {\displaystyle f} is closed, for every point ( x , y ) {\displaystyle (x,y')} on the "vertical line at x", with y f ( x ) {\displaystyle y'\neq f(x)} , draw an open rectangle U y × V y {\displaystyle U_{y'}\times V_{y'}} disjoint from the graph of f {\displaystyle f} . These open rectangles, when projected to the y-axis, cover the y-axis except at f ( x ) {\displaystyle f(x)} , so add one more set V {\displaystyle V} .

Naively attempting to take U := y f ( x ) U y {\displaystyle U:=\bigcap _{y'\neq f(x)}U_{y'}} would construct a set containing x {\displaystyle x} , but it is not guaranteed to be open, so we use compactness here.

Since Y {\displaystyle Y} is compact, we can take a finite open covering of Y {\displaystyle Y} as { V , V y 1 , . . . , V y n } {\displaystyle \{V,V_{y'_{1}},...,V_{y'_{n}}\}} .

Now take U := i = 1 n U y i {\displaystyle U:=\bigcap _{i=1}^{n}U_{y'_{i}}} . It is an open neighborhood of x {\displaystyle x} , since it is merely a finite intersection. We claim this is the open neighborhood of U {\displaystyle U} that we want.

Suppose not, then there is some unruly x U {\displaystyle x'\in U} such that f ( x ) V {\displaystyle f(x')\not \in V} , then that would imply f ( x ) V y i {\displaystyle f(x')\in V_{y'_{i}}} for some i {\displaystyle i} by open covering, but then ( x , f ( x ) ) U × V y i U y i × V y i {\displaystyle (x',f(x'))\in U\times V_{y'_{i}}\subset U_{y'_{i}}\times V_{y'_{i}}} , a contradiction since it is supposed to be disjoint from the graph of f {\displaystyle f} .

If X, Y are compact Hausdorff spaces, then the theorem can also be deduced from the open mapping theorem for such spaces; see § Relation to the open mapping theorem.

Non-Hausdorff spaces are rarely seen, but non-compact spaces are common. An example of non-compact Y {\displaystyle Y} is the real line, which allows the discontinuous function with closed graph f ( x ) = { 1 x  if  x 0 , 0  else {\displaystyle f(x)={\begin{cases}{\frac {1}{x}}{\text{ if }}x\neq 0,\\0{\text{ else}}\end{cases}}} .

Also, closed linear operators in functional analysis (linear operators with closed graphs) are typically not continuous.

For set-valued functions

Closed graph theorem for set-valued functions — For a Hausdorff compact range space Y {\displaystyle Y} , a set-valued function F : X 2 Y {\displaystyle F:X\to 2^{Y}} has a closed graph if and only if it is upper hemicontinuous and F(x) is a closed set for all x X {\displaystyle x\in X} .

In functional analysis

Main article: Closed graph theorem (functional analysis)

If T : X Y {\displaystyle T:X\to Y} is a linear operator between topological vector spaces (TVSs) then we say that T {\displaystyle T} is a closed operator if the graph of T {\displaystyle T} is closed in X × Y {\displaystyle X\times Y} when X × Y {\displaystyle X\times Y} is endowed with the product topology.

The closed graph theorem is an important result in functional analysis that guarantees that a closed linear operator is continuous under certain conditions. The original result has been generalized many times. A well known version of the closed graph theorems is the following.

Theorem — A linear map between two F-spaces (e.g. Banach spaces) is continuous if and only if its graph is closed.

The theorem is a consequence of the open mapping theorem; see § Relation to the open mapping theorem below (conversely, the open mapping theorem in turn can be deduced from the closed graph theorem).

Relation to the open mapping theorem

Often, the closed graph theorems are obtained as corollaries of the open mapping theorems in the following way. Let f : X Y {\displaystyle f:X\to Y} be any map. Then it factors as

f : X i Γ f q Y {\displaystyle f:X{\overset {i}{\to }}\Gamma _{f}{\overset {q}{\to }}Y} .

Now, i {\displaystyle i} is the inverse of the projection p : Γ f X {\displaystyle p:\Gamma _{f}\to X} . So, if the open mapping theorem holds for p {\displaystyle p} ; i.e., p {\displaystyle p} is an open mapping, then i {\displaystyle i} is continuous and then f {\displaystyle f} is continuous (as the composition of continuous maps).

For example, the above argument applies if f {\displaystyle f} is a linear operator between Banach spaces with closed graph, or if f {\displaystyle f} is a map with closed graph between compact Hausdorff spaces.

See also

Notes

References

  1. ^ "The closed graph theorem in various categories". 21 November 2012.
  2. Rudin 1991, p. 51-52.
  3. Rudin 1991, p. 50.
  4. Narici & Beckenstein 2011, pp. 459–483.
  5. Munkres 2000, pp. 163–172.
  6. Aliprantis, Charlambos; Kim C. Border (1999). "Chapter 17". Infinite Dimensional Analysis: A Hitchhiker's Guide (3rd ed.). Springer.
  7. Schaefer & Wolff 1999, p. 78.
  8. Trèves (2006), p. 173
  9. Noll, Dominikus (2024). "Topological spaces satisfying a closed graph theorem". arXiv:2403.03904 .

Bibliography

Functional analysis (topicsglossary)
Spaces
Properties
Theorems
Operators
Algebras
Open problems
Applications
Advanced topics
Topological vector spaces (TVSs)
Basic concepts
Main results
Maps
Types of sets
Set operations
Types of TVSs
Category:
Closed graph theorem Add topic