If is a reflexive Banach space, its closed unit ball is weakly compact. A bounded linear map is weak-to-weak continuous, so is weakly compact in . Compact subsets of a Hausdorff space are closed, hence is weakly closed and therefore norm closed.
Now suppose the two norms on have the same continuous dual as a set. Each is a Banach space in its dual norm. The identity
has closed graph: if in the first dual norm and in the second, evaluating at each gives . The closed graph theorem makes bounded, and the same argument for makes the dual norms equivalent. Thus there are with
The dual formula
from the Hahn--Banach theorem transfers these inequalities to the original norms. Hence and are equivalent.
The bounded inverse theorem states that a bounded bijective linear map between Banach spaces has a bounded inverse.
The closed graph theorem states that if and are Banach spaces and is linear, then is continuous if and only if its graph
is closed in the Banach space .
If is continuous and , then , so uniqueness of limits gives . Hence the graph is closed.
Conversely, suppose is closed. It is then a Banach space. The coordinate projection
is bounded and bijective. By the bounded inverse theorem, is bounded. Composing it with the bounded second-coordinate projection gives
so is continuous.
Consider the inclusion map
Its graph is closed. Indeed, suppose in and in . By hypothesis, some subsequence of converges almost everywhere to . From its convergence, that subsequence has a further subsequence converging almost everywhere to . Uniqueness of almost-everywhere limits gives as classes.
Both spaces are Banach, so the closed graph theorem makes bounded. Therefore some satisfies
For an everywhere-defined linear map between Banach spaces, its separating space measures the possible limiting defect in continuity at zero. It is a closed linear subspace: linear combinations combine witnessing sequences, and diagonal choices with and handle a convergent sequence of defects. The closed graph theorem gives continuous exactly when , since a limit has .