In mathematics, particularly in functional analysis and topology, closed graph is a property of functions.[1] [2] A function between topological spaces has a closed graph if its graph is a closed subset of the product space . A related property is open graph.[3]
This property is studied because there are many theorems, known as closed graph theorems, giving conditions under which a function with a closed graph is necessarily continuous. One particularly well-known class of closed graph theorems are the closed graph theorems in functional analysis.
Definition and notation: The graph of a function is the set
.
Notation: If is a set then the power set of, which is the set of all subsets of, is denoted by or .
Definition: If and are sets, a set-valued function in on (also called a -valued multifunction on) is a function with domain that is valued in . That is, is a function on such that for every, is a subset of .
Definition and notation: If is a set-valued function in a set then the graph of is the set
.
Definition: A function can be canonically identified with the set-valued function defined by for every, where is called the canonical set-valued function induced by (or associated with) .
We give the more general definition of when a -valued function or set-valued function defined on a subset of has a closed graph since this generality is needed in the study of closed linear operators that are defined on a dense subspace of a topological vector space (and not necessarily defined on all of). This particular case is one of the main reasons why functions with closed graphs are studied in functional analysis.
Assumptions: Throughout, and are topological spaces,, and is a -valued function or set-valued function on (i.e. or). will always be endowed with the product topology.
Definition: We say that   has a closed graph (resp. open graph, sequentially closed graph, sequentially open graph) in if the graph of,, is a closed (resp. open, sequentially closed, sequentially open) subset of when is endowed with the product topology. If or if is clear from context then we may omit writing "in "
Observation: If is a function and is the canonical set-valued function induced by   (i.e. is defined by for every) then since, has a closed (resp. sequentially closed, open, sequentially open) graph in if and only if the same is true of .
Definition: We say that the function (resp. set-valued function) is closable in if there exists a subset containing and a function (resp. set-valued function) 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 .
Definition: If is closable on then a core or essential domain of is a subset such that the closure in of the graph of the restriction of to is equal to the closure of the graph of in (i.e. the closure of in is equal to the closure of in).
Definition and notation: When we write then we mean that is a -valued function with domain where . If we say that is closed (resp. sequentially closed) or has a closed graph (resp. has a sequentially closed graph) then we mean that the graph of is closed (resp. sequentially closed) in (rather than in).
When reading literature in functional analysis, if is a linear map between topological vector spaces (TVSs) (e.g. Banach spaces) then " is closed" will almost always means the following:
Definition: A map is called closed if its graph is closed in . In particular, the term "closed linear operator" will almost certainly refer to a linear map whose graph is closed.
Otherwise, especially in literature about point-set topology, " is closed" may instead mean the following:
Definition: A map between topological spaces is called a closed map if the image of a closed subset of is a closed subset of .
These two definitions of "closed map" are not equivalent. If it is unclear, then it is recommended that a reader check how "closed map" is defined by the literature they are reading.
Throughout, let and be topological spaces.
If is a function then the following are equivalent:
and if is a Hausdorff compact space then we may add to this list:
and if both and are first-countable spaces then we may add to this list:
If is a function then the following are equivalent:
If is a set-valued function between topological spaces and then the following are equivalent:
and if is compact and Hausdorff then we may add to this list:
and if both and are metrizable spaces then we may add to this list:
Throughout, let
X
Y
X x Y
If
f:X\toY
\operatorname{graph}f
f
X x Y.
x\inX
x\bull=\left(xi\right)i
X
x\bull\tox
X,
y\inY
f\left(x\bull\right)=\left(f\left(xi\right)\right)i\toy
Y
y=f(x).
x\inX
x\bull=\left(xi\right)i
X
x\bull\tox
X,
f\left(x\bull\right)\tof(x)
Y.
f
f\left(x\bull\right)
Y
y\inY
y=f(x)
f
f\left(x\bull\right)
Y
y\inY
f\left(x\bull\right)
f(x)
Y
and if
Y
f
and if both
X
Y
f
X x Y.
Function with a sequentially closed graph
If
f:X\toY
f
X x Y.
f
X x Y.
x\inX
x\bull=\left(xi\right)
infty | |
i=1 |
X
x\bull\tox
X,
y\inY
f\left(x\bull\right):=\left(f\left(xi\right)\right)
infty | |
i=1 |
\toy
Y
y=f(x).
See main article: Closed graph theorem.
Conditions that guarantee that a function with a closed graph is necessarily continuous are called closed graph theorems. Closed graph theorems are of particular interest in functional analysis where there are many theorems giving conditions under which a linear map with a closed graph is necessarily continuous.
For examples in functional analysis, see continuous linear operator.