Basic Analysis – Gently Done Topological Vector Spaces
Basic Analysis – Gently Done Topological Vector Spaces
Basic Analysis – Gently Done Topological Vector Spaces
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
92 <strong>Basic</strong> <strong>Analysis</strong><br />
Proposition 8.10 Suppose that T : X → Y is a bounded linear operator. Then<br />
we have<br />
�T� = sup{�Tx� : �x� ≤ 1}<br />
= sup{�Tx� : �x� = 1}<br />
= sup ��Tx�<br />
�x� : x �= 0� .<br />
Proof One uses the facts that if �x� ≤ 1 (and x �= 0), then �Tx� ≤ �Tx�/�x� =<br />
�Tx/�x��.<br />
Note that if T is bounded, then, by the very definition of �T�, we have �Tx� ≤<br />
�T��x�, for any x ∈ X. Thus, a bounded linear operator maps any bounded set<br />
in X into a bounded set in Y. In particular, the unit ball in X is mapped into the<br />
ball of radius �T� in Y. We have seen in Corollary 6.20 that if T is a continuous<br />
linear operator then it is bounded. Hence<br />
�Tx ′ −Tx� = �T(x ′ −x)� ≤ �T��x ′ −x�<br />
for any x,x ′ ∈ X. This estimate shows that T is uniformly continuous on X, and<br />
that therefore, continuity and uniform continuity are equivalent in this context.<br />
In other words, the notion of uniform continuity can play no special rôle in the<br />
theory of linear operators, as it does, for example, in classical real analysis.<br />
Definition 8.11 The set of bounded linear operators from a normed space X into<br />
a normed space Y is denoted B(X,Y). If X = Y, one simply writes B(X) for<br />
B(X,X).<br />
Proposition 8.12 The space B(X,Y) is a normed space when equipped with its<br />
natural linear structure and the norm �·�.<br />
Proof For S, T ∈ B(X,Y) and any s, t ∈ K, the linear operator sS+tT is defined<br />
by (sS +tT)x = sSx+tTx for x ∈ X. Furthermore, for any x ∈ X,<br />
�Sx+Tx� ≤ �Sx�+�Tx� ≤ (�S�+�T�)�x�<br />
and we see that B(X,Y) is a linear space. To see that �·� is a norm on B(X,Y),<br />
note first that �T� ≥ 0 and �T� = 0 if T = 0. On the other hand, if �T� = 0,<br />
then<br />
0 = �T� = sup ��Tx�<br />
: x �= 0�<br />
�x�<br />
which implies that �Tx� = 0 for every x ∈ X (including, trivially, x = 0). That<br />
is, T = 0.<br />
Department of Mathematics King’s College, London