Inverse Function is a Borel Set Under Continuous Mapping

Theorems connecting continuity to closure of graphs

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, it states that the closed graph theorem states that a linear function between two Banach spaces is continuous if and only if the graph of that function is closed.

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 ${\displaystyle f:X\to Y}$ between two vector spaces endowed with topologies making them into topological vector spaces (TVSs). We will henceforth assume that ${\displaystyle X}$ and ${\displaystyle Y}$ are topological vector spaces, such as Banach spaces for example, and that Cartesian products, such as ${\displaystyle X\times Y,}$ are endowed with the product topology. The graph of this function is the subset

$${\displaystyle \operatorname {graph} {\!(f)}=\{(x,f(x)):x\in \operatorname {dom} f\},}$$

of ${\displaystyle \operatorname {dom} (f)\times Y=X\times Y,}$ where ${\displaystyle \operatorname {dom} f=X}$ denotes the function's domain. The map ${\displaystyle f:X\to Y}$ is said to have a closed graph (in ${\displaystyle X\times Y}$ ) if its graph ${\displaystyle \operatorname {graph} f}$ is a closed subset of product space ${\displaystyle X\times Y}$ (with the usual product topology). Similarly, ${\displaystyle f}$ is said to have a sequentially closed graph if ${\displaystyle \operatorname {graph} f}$ is a sequentially closed subset of ${\displaystyle X\times Y.}$

A closed 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 ${\displaystyle X.}$ A partial function ${\displaystyle f}$ is declared with the notation ${\displaystyle f:D\subseteq X\to Y,}$ which indicates that ${\displaystyle f}$ has prototype ${\displaystyle f:D\to Y}$ (that is, its domain is ${\displaystyle D}$ and its codomain is ${\displaystyle Y}$ ) and that ${\displaystyle \operatorname {dom} f=D}$ is a dense subset of ${\displaystyle X.}$ Since the domain is denoted by ${\displaystyle \operatorname {dom} f,}$ it is not always necessary to assign a symbol (such as ${\displaystyle D}$ ) to a partial function's domain, in which case the notation ${\displaystyle f:X\rightarrowtail Y}$ or ${\displaystyle f:X\rightharpoonup Y}$ may be used to indicate that ${\displaystyle f}$ is a partial function with codomain ${\displaystyle Y}$ whose domain ${\displaystyle \operatorname {dom} f}$ is a dense subset of ${\displaystyle X.}$ ^[1] A densely defined linear operator between vector spaces is a partial function ${\displaystyle f:D\subseteq X\to Y}$ whose domain ${\displaystyle D}$ is a dense vector subspace of a TVS ${\displaystyle X}$ such that ${\displaystyle f:D\to Y}$ is a linear map. A prototypical example of a partial function is the derivative operator, which is only defined on the space ${\displaystyle D:=C^{1}([0,1])}$ of once continuously differentiable functions, a dense subset of the space ${\displaystyle X:=C([0,1])}$ of continuous 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 ${\displaystyle f}$ is (as before) the set ${\textstyle \operatorname {graph} {\!(f)}=\{(x,f(x)):x\in \operatorname {dom} f\}.}$ However, one exception to this is the definition of "closed graph". A partial function ${\displaystyle f:D\subseteq X\to Y}$ is said to have a closed graph (respectively, a sequentially closed graph) if ${\displaystyle \operatorname {graph} f}$ is a closed (respectively, sequentially closed) subset of ${\displaystyle X\times Y}$ in the product topology; importantly, note that the product space is ${\displaystyle X\times Y}$ and not ${\displaystyle D\times Y=\operatorname {dom} f\times Y}$ as it was defined above for ordinary functions.^{[note 1]}

Closable maps and closures [edit]

A linear operator ${\displaystyle f:D\subseteq X\to Y}$ is closable in ${\displaystyle X\times Y}$ if there exists a vector subspace ${\displaystyle E\subseteq X}$ containing ${\displaystyle D}$ and a function (resp. multifunction) ${\displaystyle F:E\to Y}$ whose graph is equal to the closure of the set ${\displaystyle \operatorname {graph} f}$ in ${\displaystyle X\times Y.}$ Such an ${\displaystyle F}$ is called a closure of ${\displaystyle f}$ in ${\displaystyle X\times Y}$ , is denoted by ${\displaystyle {\overline {f}},}$ and necessarily extends ${\displaystyle f.}$

If ${\displaystyle f:D\subseteq X\to Y}$ is a closable linear operator then a core or an essential domain of ${\displaystyle f}$ is a subset ${\displaystyle C\subseteq D}$ such that the closure in ${\displaystyle X\times Y}$ of the graph of the restriction ${\displaystyle f{\big \vert }_{C}:C\to Y}$ of ${\displaystyle f}$ to ${\displaystyle C}$ is equal to the closure of the graph of ${\displaystyle f}$ in ${\displaystyle X\times Y}$ (i.e. the closure of ${\displaystyle \operatorname {graph} f}$ in ${\displaystyle X\times Y}$ is equal to the closure of ${\displaystyle \operatorname {graph} f{\big \vert }_{C}}$ in ${\displaystyle X\times Y}$ ).

Characterizations of closed graphs (general topology) [edit]

Throughout, let ${\displaystyle X}$ and ${\displaystyle Y}$ be topological spaces and ${\displaystyle X\times Y}$ is endowed with the product topology.

Function with a closed graph [edit]

If ${\displaystyle f:X\to Y}$ 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 ${\displaystyle \operatorname {graph} f}$ of ${\displaystyle f}$ is a closed subset of ${\displaystyle X\times Y.}$
2. For every ${\displaystyle x\in X}$ and net ${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}$ in ${\displaystyle X}$ such that ${\displaystyle x_{\bullet }\to x}$ in ${\displaystyle X,}$ if ${\displaystyle y\in Y}$ is such that the net ${\displaystyle f\left(x_{\bullet }\right)=\left(f\left(x_{i}\right)\right)_{i\in I}\to y}$ in ${\displaystyle Y}$ then ${\displaystyle y=f(x).}$ ^[2]

and if ${\displaystyle Y}$ is a Hausdorff compact space then we may add to this list:

3. ${\displaystyle f}$ is continuous.^[3]

and if both ${\displaystyle X}$ and ${\displaystyle Y}$ are first-countable spaces then we may add to this list:

4. ${\displaystyle f}$ has a sequentially closed graph in ${\displaystyle X\times Y.}$

Function with a sequentially closed graph

If ${\displaystyle f:X\to Y}$ is a function then the following are equivalent:

1. ${\displaystyle f}$ has a sequentially closed graph in ${\displaystyle X\times Y.}$
2. Definition: the graph of ${\displaystyle f}$ is a sequentially closed subset of ${\displaystyle X\times Y.}$
3. For every ${\displaystyle x\in X}$ and sequence ${\displaystyle x_{\bullet }=\left(x_{i}\right)_{i=1}^{\infty }}$ in ${\displaystyle X}$ such that ${\displaystyle x_{\bullet }\to x}$ in ${\displaystyle X,}$ if ${\displaystyle y\in Y}$ is such that the net ${\displaystyle f\left(x_{\bullet }\right):=\left(f\left(x_{i}\right)\right)_{i=1}^{\infty }\to y}$ in ${\displaystyle Y}$ then ${\displaystyle y=f(x).}$ ^[2]

Basic properties of maps with closed graphs [edit]

Suppose ${\displaystyle f:D(f)\subseteq X\to Y}$ is a linear operator between Banach spaces.

Examples and counterexamples [edit]

Continuous but not closed maps [edit]

Closed but not continuous maps [edit]

• If ${\displaystyle (X,\tau )}$ is a Hausdorff TVS and ${\displaystyle \nu }$ is a vector topology on ${\displaystyle X}$ that is strictly finer than ${\displaystyle \tau ,}$ then the identity map ${\displaystyle \operatorname {Id} :(X,\tau )\to (X,\nu )}$ a closed discontinuous linear operator.^[5]
• Consider the derivative operator ${\displaystyle A={\frac {d}{dx}}}$ where ${\displaystyle X=Y=C([a,b]).}$ is the Banach space of all continuous functions on an interval ${\displaystyle [a,b].}$ If one takes its domain ${\displaystyle D(f)}$ to be ${\displaystyle C^{1}([a,b]),}$ then ${\displaystyle f}$ is a closed operator, which is not bounded.^[6] On the other hand, if ${\displaystyle D(f)}$ is the space ${\displaystyle C^{\infty }([a,b])}$ of smooth functions scalar valued functions then ${\displaystyle f}$ will no longer be closed, but it will be closable, with the closure being its extension defined on ${\displaystyle C^{1}([a,b]).}$
• Let ${\displaystyle X}$ and ${\displaystyle Y}$ both denote the real numbers ${\displaystyle \mathbb {R} }$ with the usual Euclidean topology. Let ${\displaystyle f:X\to Y}$ be defined by ${\displaystyle f(0)=0}$ and ${\displaystyle f(x)={\frac {1}{x}}}$ for all ${\displaystyle x\neq 0.}$ Then ${\displaystyle f:X\to Y}$ has a closed graph (and a sequentially closed graph) in ${\displaystyle X\times Y=\mathbb {R} ^{2}}$ but it is not continuous (since it has a discontinuity at ${\displaystyle x=0}$ ).^[2]
• Let ${\displaystyle X}$ denote the real numbers ${\displaystyle \mathbb {R} }$ with the usual Euclidean topology, let ${\displaystyle Y}$ denote ${\displaystyle \mathbb {R} }$ with the discrete topology, and let ${\displaystyle \operatorname {Id} :X\to Y}$ be the identity map (i.e. ${\displaystyle \operatorname {Id} (x):=x}$ for every ${\displaystyle x\in X}$ ). Then ${\displaystyle \operatorname {Id} :X\to Y}$ is a linear map whose graph is closed in ${\displaystyle X\times Y}$ but it is clearly not continuous (since singleton sets are open in ${\displaystyle Y}$ but not in ${\displaystyle X}$ ).^[2]

Closed graph theorems [edit]

Between Banach spaces [edit]

The operator is required to be everywhere-defined, that is, the domain ${\displaystyle D(T)}$ of ${\displaystyle T}$ is ${\displaystyle X.}$ 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 ${\displaystyle C([0,1]),}$ whose domain is a strict subset of ${\displaystyle C([0,1]).}$

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 ${\displaystyle X}$ and ${\displaystyle Y}$ 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 ${\displaystyle X}$ to a Fréchet space ${\displaystyle Y}$ is continuous if and only if its graph is closed.

Between F-spaces [edit]

There are versions that does not require ${\displaystyle Y}$ 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:

Complete pseudometrizable codomain [edit]

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

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 ${\displaystyle T:X\to Y}$ is a linear map whose graph is closed. If ${\displaystyle X}$ is an inductive limit of Baire TVSs and ${\displaystyle Y}$ is a webbed space then ${\displaystyle T}$ is continuous.

An even more general version of the closed graph theorem is

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 ${\displaystyle u:X\to Y}$ be linear map between two locally convex Hausdorff spaces ${\displaystyle X}$ and ${\displaystyle Y.}$ If ${\displaystyle X}$ is the inductive limit of an arbitrary family of Banach spaces, if ${\displaystyle Y}$ is a Souslin space, and if the graph of ${\displaystyle u}$ is a Borel set in ${\displaystyle X\times Y,}$ then ${\displaystyle u}$ is continuous.^[13]

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

A topological space ${\displaystyle X}$ is called a ${\displaystyle K_{\sigma \delta }}$ if it is the countable intersection of countable unions of compact sets.

A Hausdorff topological space ${\displaystyle Y}$ is called K-analytic if it is the continuous image of a ${\displaystyle K_{\sigma \delta }}$ space (that is, if there is a ${\displaystyle K_{\sigma \delta }}$ space ${\displaystyle X}$ and a continuous map of ${\displaystyle X}$ onto ${\displaystyle Y}$ ).

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 ${\displaystyle u:X\to Y}$ be a linear map between two locally convex Hausdorff spaces ${\displaystyle X}$ and ${\displaystyle Y.}$ If ${\displaystyle X}$ is the inductive limit of an arbitrary family of Banach spaces, if ${\displaystyle Y}$ is a K-analytic space, and if the graph of ${\displaystyle u}$ is closed in ${\displaystyle X\times Y,}$ then ${\displaystyle u}$ is continuous.

[edit]

If ${\displaystyle F:X\to Y}$ is closed linear operator from a Hausdorff locally convex TVS ${\displaystyle X}$ into a Hausdorff finite-dimensional TVS ${\displaystyle Y}$ then ${\displaystyle F}$ is continuous.^[15]

See also [edit]

• Almost open linear map
• Barrelled space – Type of topological vector space
• Closed graph
• Closed linear operator
• Densely defined operator – Function that is defined almost everywhere (mathematics)
• Discontinuous linear map
• Kakutani fixed-point theorem – On when a function f: S→Pow(S) on a compact nonempty convex subset S⊂ℝⁿ has a fixed point
• Open mapping theorem (functional analysis) – Condition for a linear operator to be open
• Ursescu theorem – Generalization of closed graph, open mapping, and uniform boundedness theorem
• Webbed space – Space where open mapping and closed graph theorems hold

References [edit]

Notes

1. ^ Dolecki & Mynard 2016, pp. 4–5.
2. ^ ^{a b c d e} Narici & Beckenstein 2011, pp. 459–483.
3. ^ Munkres 2000, p. 171.
4. ^ Rudin 1991, p. 50.
5. ^ Narici & Beckenstein 2011, p. 480.
6. ^ Kreyszig, Erwin (1978). Introductory Functional Analysis With Applications. USA: John Wiley & Sons. Inc. p. 294. ISBN0-471-50731-8.
7. ^ Schaefer & Wolff 1999, p. 78.
8. ^ Trèves (2006), p. 173
9. ^ Rudin 1991, pp. 50–52.
10. ^ ^{a b c} Narici & Beckenstein 2011, pp. 474–476.
11. ^ Narici & Beckenstein 2011, p. 479-483.
12. ^ Trèves 2006, p. 169.
13. ^ ^{a b} Trèves 2006, p. 549.
14. ^ Trèves 2006, pp. 557–558.
15. ^ Narici & Beckenstein 2011, p. 476.

Bibliography [edit]

• Adasch, Norbert; Ernst, Bruno; Keim, Dieter (1978). Topological Vector Spaces: The Theory Without Convexity Conditions. Lecture Notes in Mathematics. Vol. 639. Berlin New York: Springer-Verlag. ISBN978-3-540-08662-8. OCLC 297140003.
• Banach, Stefan (1932). Théorie des Opérations Linéaires [Theory of Linear Operations] (PDF). Monografie Matematyczne (in French). Vol. 1. Warszawa: Subwencji Funduszu Kultury Narodowej. Zbl 0005.20901. Archived from the original (PDF) on 2014-01-11. Retrieved 2020-07-11 .
• Berberian, Sterling K. (1974). Lectures in Functional Analysis and Operator Theory. Graduate Texts in Mathematics. Vol. 15. New York: Springer. ISBN978-0-387-90081-0. OCLC 878109401.
• Bourbaki, Nicolas (1987) [1981]. Topological Vector Spaces: Chapters 1–5. Éléments de mathématique. Translated by Eggleston, H.G.; Madan, S. Berlin New York: Springer-Verlag. ISBN3-540-13627-4. OCLC 17499190.
• Conway, John (1990). A course in functional analysis. Graduate Texts in Mathematics. Vol. 96 (2nd ed.). New York: Springer-Verlag. ISBN978-0-387-97245-9. OCLC 21195908.
• Edwards, Robert E. (1995). Functional Analysis: Theory and Applications. New York: Dover Publications. ISBN978-0-486-68143-6. OCLC 30593138.
• Dolecki, Szymon; Mynard, Frederic (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. ISBN978-981-4571-52-4. OCLC 945169917.
• Dubinsky, Ed (1979). The Structure of Nuclear Fréchet Spaces. Lecture Notes in Mathematics. Vol. 720. Berlin New York: Springer-Verlag. ISBN978-3-540-09504-0. OCLC 5126156.
• Grothendieck, Alexander (1973). Topological Vector Spaces . Translated by Chaljub, Orlando. New York: Gordon and Breach Science Publishers. ISBN978-0-677-30020-7. OCLC 886098.
• Husain, Taqdir; Khaleelulla, S. M. (1978). Barrelledness in Topological and Ordered Vector Spaces. Lecture Notes in Mathematics. Vol. 692. Berlin, New York, Heidelberg: Springer-Verlag. ISBN978-3-540-09096-0. OCLC 4493665.
• Jarchow, Hans (1981). Locally convex spaces. Stuttgart: B.G. Teubner. ISBN978-3-519-02224-4. OCLC 8210342.
• Köthe, Gottfried (1983) [1969]. Topological Vector Spaces I. Grundlehren der mathematischen Wissenschaften. Vol. 159. Translated by Garling, D.J.H. New York: Springer Science & Business Media. ISBN978-3-642-64988-2. MR 0248498. OCLC 840293704.
• Kriegl, Andreas; Michor, Peter W. (1997). The Convenient Setting of Global Analysis (PDF). Mathematical Surveys and Monographs. Vol. 53. Providence, R.I: American Mathematical Society. ISBN978-0-8218-0780-4. OCLC 37141279.
• Munkres, James R. (2000). Topology (Second ed.). Upper Saddle River, NJ: Prentice Hall, Inc. ISBN978-0-13-181629-9. OCLC 42683260.
• Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN978-1584888666. OCLC 144216834.
• Robertson, Alex P.; Robertson, Wendy J. (1980). Topological Vector Spaces. Cambridge Tracts in Mathematics. Vol. 53. Cambridge England: Cambridge University Press. ISBN978-0-521-29882-7. OCLC 589250.
• Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN978-0-07-054236-5. OCLC 21163277.
• Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces. GTM. Vol. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. ISBN978-1-4612-7155-0. OCLC 840278135.
• Swartz, Charles (1992). An introduction to Functional Analysis. New York: M. Dekker. ISBN978-0-8247-8643-4. OCLC 24909067.
• Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN978-0-486-45352-1. OCLC 853623322.
• Wilansky, Albert (2013). Modern Methods in Topological Vector Spaces. Mineola, New York: Dover Publications, Inc. ISBN978-0-486-49353-4. OCLC 849801114.
• "Proof of closed graph theorem". PlanetMath.

dashermoutica.blogspot.com

Source: https://en.wikipedia.org/wiki/Closed_graph_theorem_(functional_analysis)

Share this post