To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

Closed graph theorem

From Wikipedia, the free encyclopedia

The graph of the cubic function f(x) = x3 − 9x on the interval [−4,4] is closed because the function is continuous. The graph of the Heaviside function on [−2,2] is not closed, because the function is not continuous.

In mathematics, the closed graph theorem is a basic result which characterizes continuous functions in terms of their graphs. In particular, they give conditions when functions with closed graphs are necessarily continuous. In mathematics, there are several results known as the "closed graph theorem".

Graphs and maps with closed graphs

If f : XY is a map between topological spaces then the graph of f is the set Gr f := { (x, f(x)) : xX } or equivalently,

Gr f := { (x, y) ∈ X × Y : y = f(x) }

We say that the graph of f is closed if Gr f is a closed subset of X × Y (with the product topology).

Any continuous function into a Hausdorff space has a closed graph.

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

Examples of continuous maps that are not closed

  • If X is any space then the identity map Id : XX is continuous but its graph, which is the diagonal Gr Id := { (x, x) : xX }, is closed in X × X if and only if X is Hausdorff.[2] In particular, if X is not Hausdorff then Id : XX is continuous but not closed.
  • Let X denote the real numbers with the usual Euclidean topology and let Y denote with the indiscrete topology (where note that Y is not Hausdorff and that every function valued in Y is continuous). Let f : XY be defined by f(0) = 1 and f(x) = 0 for all x ≠ 0. Then f : XY is continuous but its graph is not closed in X × Y.[3]

Closed graph theorem in point-set topology

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

Closed graph theorem[4] — If f : XY is a map from a topological space X into a compact Hausdorff space Y, then the graph of f is closed if and only if f : XY is continuous.

For set-valued functions

Closed graph theorem for set-valued functions[5] — For a Hausdorff compact range space Y, a set-valued function F : X → 2Y has a closed graph if and only if it is upper hemicontinuous and F(x) is a closed set for all xX.

In functional analysis

Definition: If T : XY is a linear operator between topological vector spaces (TVSs) then we say that T is a closed operator if the graph of T is closed in X × Y when X × 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[6][7] — A linear map between two F-spaces (e.g. Banach spaces) is continuous if and only if its graph is closed.

See also


  1. ^ Rudin 1991, p. 51-52.
  2. ^ Rudin 1991, p. 50.
  3. ^ Narici & Beckenstein 2011, pp. 459-483.
  4. ^ Munkres 2000, pp. 163–172.
  5. ^ Aliprantis, Charlambos; Kim C. Border (1999). "Chapter 17". Infinite Dimensional Analysis: A Hitchhiker's Guide (3rd ed.). Springer.
  6. ^ Schaefer & Wolff 1999, p. 78.
  7. ^ Trèves (1995), p. 173



This page was last edited on 20 June 2021, at 22:42
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.