Closed graph theorem (functional analysis): Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>Shoe Deceiver
m Fixed a sentence.
 
(No difference)

Latest revision as of 00:53, 20 February 2025

Template:Short description Template:About In mathematics, particularly in functional analysis, the closed graph theorem is a result connecting the continuity of a linear operator to a topological property of their graph. Precisely, the theorem states that a linear operator between two Banach spaces is continuous if and only if the graph of the operator is closed (such an operator is called a closed linear operator; see also closed graph property).

An important question in functional analysis is whether a given linear operator is continuous (or bounded). The closed graph theorem gives one answer to that question.

Explanation

Let T:XY be a linear operator between Banach spaces (or more generally Fréchet spaces). Then the continuity of T means that TxiTx for each convergent sequence xix. On the other hand, the closedness of the graph of T means that for each convergent sequence xix such that Txiy, we have y=Tx. Hence, the closed graph theorem says that in order to check the continuity of T, one can show TxiTx under the additional assumption that Txi is convergent.

In fact, for the graph of T to be closed, it is enough that if xi0,Txiy, then y=0. Indeed, assuming that condition holds, if (xi,Txi)(x,y), then xix0 and T(xix)yTx. Thus, y=Tx; i.e., (x,y) is in the graph of T.

Note, to check the closedness of a graph, it’s not even necessary to use the norm topology: if the graph of T is closed in some topology coarser than the norm topology, then it is closed in the norm topology.[1] In practice, this works like this: T is some operator on some function space. One shows T is continuous with respect to the distribution topology; thus, the graph is closed in that topology, which implies closedness in the norm topology and then T is a bounded by the closed graph theorem (when the theorem applies). See Template:Section link for an explicit example.

Statement

Template:Math theorem

The usual proof of the closed graph theorem employs the open mapping theorem. It simply uses a general recipe of obtaining the closed graph theorem from the open mapping theorem; see Template:Section link (this deduction is formal and does not use linearity; the linearity is needed to appeal to the open mapping theorem which relies on the linearity.)

In fact, the open mapping theorem can in turn be deduced from the closed graph theorem as follows. As noted in Template:Section link, it is enough to prove the open mapping theorem for a continuous linear operator that is bijective (not just surjective). Let T be such an operator. Then by continuity, the graph ΓT of T is closed. Then ΓTΓT1 under (x,y)(y,x). Hence, by the closed graph theorem, T1 is continuous; i.e., T is an open mapping.

Since the closed graph theorem is equivalent to the open mapping theorem, one knows that the theorem fails without the completeness assumption. But more concretely, an operator with closed graph that is not bounded (see unbounded operator) exists and thus serves as a counterexample.

Example

The Hausdorff–Young inequality says that the Fourier transformation ^:Lp(n)Lp(n) is a well-defined bounded operator with operator norm one when 1/p+1/p=1. This result is usually proved using the Riesz–Thorin interpolation theorem and is highly nontrivial. The closed graph theorem can be used to prove a soft version of this result; i.e., the Fourier transformation is a bounded operator with the unknown operator norm.[2]

Here is how the argument would go. Let T denote the Fourier transformation. First we show T:LpZ is a continuous linear operator for Z = the space of tempered distributions on n. Second, we note that T maps the space of Schwarz functions to itself (in short, because smoothness and rapid decay transform to rapid decay and smoothness, respectively). This implies that the graph of T is contained in Lp×Lp and T:LpLp is defined but with unknown bounds.Template:Clarify Since T:LpZ is continuous, the graph of T:LpLp is closed in the distribution topology; thus in the norm topology. Finally, by the closed graph theorem, T:LpLp is a bounded operator.

Generalization

Complete metrizable codomain

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

Template:Math theorem

Between F-spaces

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

Template:Math theorem

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

Template:Math theorem

Complete pseudometrizable codomain

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

Template:Math theorem

Template:Math theorem

Codomain not complete or (pseudo) metrizable

Template:Math theorem

Template:Math theorem

An even more general version of the closed graph theorem is

Template:Math theorem

Borel graph theorem

Template:Main

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.Template:Sfn 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:

Template:Math theorem

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

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

A Hausdorff topological space Y is called K-analytic if it is the continuous image of a Kσδ space (that is, if there is a Kσδ space X and a continuous map of X onto 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:

Template:Math theorem

If F:XY is closed linear operator from a Hausdorff locally convex TVS X into a Hausdorff finite-dimensional TVS Y then F is continuous.Template:Sfn

See also

References

Notes

Template:Reflist

Template:Reflist

Bibliography

Template:Functional Analysis Template:TopologicalVectorSpaces

  1. Theorem 4 of Tao. NB: The Hausdorffness there is put to ensure the graph of a continuous map is closed.
  2. Template:Harvnb