## You are here

Homeproof of closed graph theorem

## Primary tabs

# proof of closed graph theorem

Let $T\colon X\to Y$ be a linear mapping. Denote its graph by $G(T)$, and let $p_{1}\colon X\times Y\to X$ and $p_{2}\colon X\times Y\to Y$ be the projections onto $X$ and $Y$, respectively. We remark that these projections are continuous, by definition of the product of Banach spaces.

If $T$ is bounded, then given a sequence $\{(x_{i},Tx_{i})\}$ in $G(T)$ which converges to $(x,y)\in X\times Y$, we have that

$x_{i}=p_{1}(x_{i},Tx_{i})\xrightarrow[i\to\infty]{}p_{1}(x,y)=x$ |

and

$Tx_{i}=p_{2}(x_{i},Tx_{i})\xrightarrow[i\to\infty]{}p_{2}(x,y)=y,$ |

by continuity of the projections. But then, since $T$ is continuous,

$Tx=\lim_{{i\to\infty}}Tx_{i}=y.$ |

Thus $(x,y)=(x,Tx)\in G(T)$, proving that $G(T)$ is closed.

Now suppose $G(T)$ is closed. We remark that $G(T)$ is a vector subspace of $X\times Y$, and being closed, it is a Banach space. Consider the operator $\tilde{T}:X\to G(T)$ defined by $\tilde{T}x=(x,Tx)$. It is clear that $\tilde{T}$ is a bijection, its inverse being $p_{1}|_{{G(T)}}$, the restriction of $p_{1}$ to $G(T)$. Since $p_{1}$ is continuous on $X\times Y$, the restriction is continuous as well; and since it is also surjective, the open mapping theorem implies that $p_{1}|_{{G(T)}}$ is an open mapping, so its inverse must be continuous. That is, $\tilde{T}$ is continuous, and consequently $T=p_{2}\circ\tilde{T}$ is continuous.

## Mathematics Subject Classification

46A30*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier