This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
1, and has the value 0 when x = 0. Thus the triangle inequality fails. We can, however, describe convergence in LP, 0
1; hence x e K by convexity. [Write x = (1/s)(sx) + [1 - (1/s)]0.] Now if p(x) < I and y e L, then p(x + Ay) < p(x) + )p(y) < I for A sufficiently small and nonnegative; hence K is radial at x. Conversely, if K is radial at x, then x + Ax e K for some A > 0; hence p(x + Ax) < 1 by definition of p. Thus p(x) < (I + A)-1 < 1. The last statement follows from the definition of p. (c) if x/r e K and a e C, a 96 0, then ax/ I a I r e K since K is circled ; consequently p(ax) < I a I r. Take the inf over r to obtain p(ax) < I a Ip(x). Replace x by x/a to obtainp(x) < j a f p(x/a) or, with b = 1 la, p(bx) f b I p(x). Now p(0) = 0 since 0 e K, and the result follows. (d) Since 0 e K° there is a neighborhood U of 0 such that U e K. If
A > 0 and y e AU, that is, y = Ax for some x e U, then p(y) = Ap(x) < A.
3.5
SOME PROPERTIES OF TOPOLOGICAL VECTOR SPACES
155
[Note x e K implies p(x) < 1, by (b).] Thus p is continuous at the origin, and therefore continuous everywhere by subadditivity. Since p is continuous, {x: p(x) < 1} is closed, so by (b), K c {x: &) :5 1}. But if 0 < A < 1 and p(x) < 1, then p(Ax) < 1; hence AX E K. If A -* 1, then x; therefore p(x) < 1 implies x e K. Ax Again, by continuity of p, {x: p(x) < 1} is open, and hence is a subset of K°. But if p(x) >_ 1, then by considering {x with A > I we see that x is a limit of a sequence of points not in K, hence x 0 K°. I
Before characterizing locally convex spaces, we need the following result.
3.5.6 Lemma. If U is a neighborhood of 0 in the topological vector space L, there is a circled neighborhood V of 0 with V c U, and a closed circled overneighborhood W of 0 with W c U. If L is locally convex, V and W can be taken as convex. PROOF. Choose T e 'W and S > 0 such that aT (-- U for I a l < 6, and take V = U{aT: I a 1< b}. Now if A c L, we claim that
A= n{A+N: Ne.'},
(1)
where .K is the family of all neighborhoods of 0. [This may be written as
A = n{A - N: N e X); note that N e .' if - N e .N' since the map y - -y is a homeomorphism.] For if x e A and N e X, then x + N is a neighbor-
hood of x; hence (x+N)nA 00. Ifye(x+N)nA, then xey-N. If x0A,then (x+N)r A=0forsomeNe.,V;hencexoA-N. Now if U is a neighborhood of 0, let V, be a circled neighborhood of 0 with V, + V, c U. By (1), V, e V, + V,, and since V, is circled, so is V,. Thus we may take W = V, V.
In the locally convex case, we may as well assume U convex [the interior
of a convex set is convex, by 3.5.5(d) and the fact that a translation of a convex set is convex]. If V2 is a circled neighborhood included in U, the convex hull r
n
.I,>0,
YA,=1, n=1,2,...
111+=1
the smallest convex overset of V2, is also included in U. Since V2 is circled so is V2 , and therefore so is (V2)°. (If x + N c P2, N e X, and I a l < 1, then ax + aN c V2 .) Thus we may take V = (V2)°. Finally, if V3 is a circled convex neighborhood of 0 with V3 + V3 e U, then W = V3 is closed, circled, and convex, and by (1), W c V3 + V3 c U.
156
3
INTRODUCTION TO FUNCTIONAL ANALYSIS
3.5.7 Theorem. If L is a locally convex topological vector space, the topology of L is generated, in the sense of 3.5.2, by a family of seminorms. Specifically, if 3?1 is the collection of all circled convex neighborhoods of 0, the Minkowski functionals pu of the sets U e W are the desired seminorms.
PROOF. By 3.5.5(c), the Pu are seminorms, and 3.5.6, iW is a base at 0 for the topology of L. By 3.5.5(d), for each U e ?l we have U = {x: pu(x) < 1}, and
it follows that the topology of L is the same as the topology induced by the
Pu I The fact that the Minkowski functional is sublinear suggests that the Hahn-Banach theorem may provide useful information. The next result illustrates this idea. Theorem. Let K be a convex subset of the real vector space L; assume K is radial at 0 and has Minkowski functional p. 3.5.8
(a) If f is a linear functional on L, then f < 1 on K iff f < p on L. (b) If g is a linear functional on the subspace M, and g< 1 on K n M,
then g may be extended to a linear functional f on L such that f < 1 on K. (c) If in addition K is circled and L is a complex vector space, and g is a linear functional on the subspace M with I g I < 1 on K n M, then g may be extended to a linear functional f on L such that I f I < 1 on K. (d) A continuous linear functional g on a subspace M of a locally convex topological vector space L may be extended to a continuous linear functional on L. PROOF. (a)
If f < p on L, then f < 1 on K by 3.5.5(b). Conversely, assume
f < 1 on K. If x/r a K, then f(x/r) < 1, so f(x) <- r. Take the inf over r to obtain f (x) < p(x). (b) By (a), g < p on M, so by the Hahn-Banach theorem, g extends to a linear functional f with f < p on L. By (a), f <- 1 on K. (c) Let L' be L regarded as a real vector space; by (b), g, = Re g may be extended to a linear function f, on L' with f, :5 1 on K. If fix) = f,(x) - if,(ix), then (as in 3.4.3) f is a linear functional on L, and on M we havef(x) = g,(x) - ig, (ix) = g(x). Finally, if f (x) = re19, r >- 0, then I f (x) I = r = f (e-!9x) _ f,(e-19x) since risreal. IfxeK,thene-1Axe KsinceKiscircled,so I f(x)1 <- 1. (d) By continuity, g must be bounded on some neighborhood of 0 in M, so that by 3.5.6 there is a convex circled neighborhood K of 0 in L such that gI is bounded on K n M. By (c), g has an extension to a linear functional f on L with I f I bounded on K. But if If 1 <- r on K, then, given S > 0, we have If I < 6 on the neighborhood (b/r)K, proving continuity.
3.5
SOME PROPERTIES OF TOPOLOGICAL VECTOR SPACES
157
In 3.4.14 we promised a general version of the open mapping theorem, and we now consider this question. The following technical lemma is the key step. 3.5.9 Lemma. Let A be a continuous linear operator from L to M, where L is a complete, metrizable topological vector space and M is a Hausdorff topological vector space. Assume that for every neighborhood W of 0 in L, A(W) is an overneighborhood of 0 in M. Then in fact A(W) is an overneighborhood of 0 in M. PROOF. Denote by °?l the collection of overneighborhoods of 0 in L, and by 'V the corresponding collection in M. It suffices to show that if U and V are neighborhoods of 0 in L, then A(U) c A(U + V). For then given the neighborhood W we may find a closed circled neighborhood U with U + U + U e
W; then [see 3.5.6, Eq. (1)] U + U c U + U + U c W. Now A(U), which belongs to Y," by hypothesis, is a subset of A(U + U) by the result to be estab-
lished, and this in turn is a subset of A(W), as desired. Thus let U and V be neighborhoods of 0 in L. Since L is metrizable it has a countable base of neighborhoods at 0, say U1, U2,.... It may be assumed that Un+1 + Un+, c Un for all n [3.5.1(c)], and that U1 = U, U2 + U2 c U r) V. Let y e A(U); we try to find elements xn e Un such that if yn = Axn, then,
for all n= 1,2,..., Yl + ... +y,, - Y e A(Un+1)
(1)
Since y e A(U1) (=A(U)) and y + A(U2) is an overneighborhood of y, there is an element y1 e A(U1) n (y + A(U2)). Thus y1 = Ax, for some x, e U1, and y1 - y e A(U2). If x1, ... , xn have been found such that y1 + + yn - y e A(Un+1), then since y - (y1 + + yn) + A(Un+2) is an overneighborhood of y - (y, + ' + yn), there is an element yn+, e A(Un+1) n (y - (y1 + + yn) + A(Un+2)), so that we have Xn+1 a Un+,, Y.+]= Axn+1, and y1 + + yn+, - y e A(U,,+2), completing the induction. then Let z , = '+ +** ' Un+k C U. (Note Un+k-1 + Un+k C Un+k-1 + Un+k-1 C Un+k-2, and proceed backward.) Since the Un form a base at 0, (zn) is a Cauchy sequence in L; hence z,, converges to some x e L by completeness. [By the appendix on general
topology, Theorem A 10.9, the metric d of L may be assumed invariant, that is, d(x, y) = d(x + z, y + z) for all z. We know that zn,-z,, -,, 0 as n,m-+co;
158
3
INTRODUCTION TO FUNCTIONAL ANALYSIS
hence by invariance, d(zm , zn) = d(zm - z., 0) -* 0, so that {zn} is Cauchy.] Since
it follows that x e U + V. If we can show that y = Ax, then y e A(U + V) and we have finished. If y 0 Ax, the Hausdorff hypothesis for M yields a closed circled W' E 'fi' such that Ax + W' and y + W' are disjoint; let W be a closed set in 11 such that W + W c W'. By continuity of A there is a set W, E 0l such that A(W,)
c W. Since the Un form a base at 0, Un c W, for large n; hence A(U,,) c-A(WI) c W; since W is closed, we have
A(U,,) c W
for sufficiently large n.
(2)
Ifn<m, m
n
m
Aj=1 Exj -y= j-1 Eyj-y+ j=n+l y- yj E A(Un+1) + A(Un+l + ... + Um)
by (1).
By (2), A(Y; ,x) Let m -- oo ; by continuity of A we find Ax - y E W + W C W' = W' C W' + W', contradicting the disjointness of Ax + W' and y + W'. Under the hypothesis of 3.5.9, if W e K, then by continuity of A there is a set U,, in the countable base at 0 in L such that A(U,) c V. By 3.5.9, A(U,)e Yl^ for all n; hence M also has a countable base at 0. It is shown in the appendix
on general topology (Theorem A10.8) that the existence of a countable base at 0 in a topological vector space is equivalent to pseudo-metrizability. Thus under the hypothesis of 3.5.9, M, being Hausdorff, is metrizable. One more preliminary result is needed. 3.5.10 Lemma. Let A be a linear operator from the topological vector space L to the topological vector space M. Assume A(L) is of the second category in M; that is, A(L) cannot be expressed as a countable union of nowhere dense sets. If U is an overneighborhood of 0 in L, then A(U) is an overneighborhood of 0 in M. PROOF. Let 'W and 'V be the overneighborhoods of 0 in L and M, respectively.
If U e O?1, choose a circled V e /1 with V+ V c U. By 3.5.1(b) applied to V
3.5
159
SOME PROPERTIES OF TOPOLOGICAL VECTOR SPACES
we have L = Un i nV, hence A(L) = Un=, nA(V). Since A(L) is of the second category, nA(V) [= nA(V)] has a nonempty interior for some n, hence A(V) has a nonempty interior. If B is a nonempty open subset of A(V), then
OeB-BcA(V)-A(V)cA(V)-A(V) = A(V) + A(V)
since
V,
hence
A(V),
is circled
c A(U). But B - B = U{x - B: x e B}, an open set; hence A(U) e 3.5.11
Open Mapping Theorem. Let Land M be metrizable topological vector
spaces, with L complete. If A is a continuous linear operator from L to M and A(L) is of the second category in M, then A(L) = M and A is an open map. PROOF. Take 0ll and Y'' as in 3.5.9 and 3.5.10. Let U be any set in ?l ; by 3.5.9
and 3.5.10, A(U) a 'Y'. If y c M, then y e nA(U) for some n by 3.5.1(b); hence y = A(nx) for some x e U, proving that A(L) = M. If G is open in L and x0 a G, choose V e °l1 such that xo + V c G. Then A(V) e 1 and Ax. + A(V) e A(G), proving that A(G) is open. 3.5.12
Corollary. If A is a continuous linear operator from L onto M, where
L and M are complete metrizable topological vector spaces, then A is an open map.
PROOF. By completeness of M, A(L) (=M) is of category 2 in M, and the result follows from 3.5.11. 1 We conclude this section with a discussion of separation theorems and their applications. If K, and K2 are disjoint convex subsets of R3, there is a plane P such that K, is on one side of P and K2 is on the other side. Now P can be described as {x e R3 : f (X) = c} for some linear functional f and real number c; hence we have f(x) < c for all x in one of the two convex sets, and f(x) >- c for all x in the other set. We are going to consider generalizations of this idea. The following theorem is the fundamental result of this type. 3.5.13
Basic Separation Theorem. Let K, and K2 be disjoint, nonempty
convex subsets of the real vector space L, and assume that K, has at least one
160
3
INTRODUCTION TO FUNCTIONAL ANALYSIS
internal point. There is a linear functional f on L separating K, and K2, that is, f 0 0 and f(x) < f(y) for all x e K, and y e K2 [for short, f(K,) < f(K2)]. PROOF. First assume that 0 is an internal point of K,. Pick an element z e K2;
then -z is an internal point of -z + K, c K, - K2 ; hence 0 is an internal point of the convex set K = z + K, - K2. If z e K, then K, n K2 Qf , contradicting the hypothesis; therefore z 0 K; so if p is the Minkowski functional of K, we have p(z) > I by 3.5.5(b). Define a linear functional g on the subspace M = (),z: A e R} by g(Az) _ A. If a > 0, then g(az) = a = a(l) < ap(z) = p(az), and if a < 0, then g(az) = a < 0 <- p(az). By the Hahn-Banach theorem, g extends to a (nontrivial) linear functional f with f < p on L. By 3.5.8(a), f S I on K. Since f(z) = g(z) = 1, f(K,) < f(K2). If x is an internal point of K,, then 0 is an internal point of -x + K,, and
-x + K, is disjoint from -x + K2. If f(-x + Kl) < f(-x + K2), then f(KI) -
is a nontrivial linear functional f on L such that Ref(x) < Re f(y) for all x e K y e K2 ; this is what we shall mean by "f separates K, and K2 " in the complex case. 3.5.14 Corollaries. Assume the hypothesis of 3.5.13. (a) If L is a topological vector space and K, has nonempty interior, the
linear functional f constructed in 3.5.13 is continuous. (b) If L is locally convex, and K, and K2 disjoint convex subsets of L, with K, closed and K2 compact, there is a continuous linear functional f on L
strongly separating K, and K2, that is,.f(x) < c, < c2 < f(y) for some real numbers c, and c2 and all x e K1, y e K2. In particular if L is Hausdorll' and x, y e L, x y, there is a continuous linear functional f on L with f (x) 96f(y). (c) If L is locally convex, Ma closed subspace of L, and x0 e M, there is a continuous linear functional f on L such that f = 0 on M and f(x°) 96 0. Since K,° 96 0, the interior and internal points of K, coincide, by 3.5.5(b) and (d). Thus in the proof of 3.5.13, 0 is an interior point of K, so that K° = {x: p(x) < l} by 3.5.5(d). Since f < p on Lit follows that f < 1 on some neighborhood U of 0 (for example, U = K°); since U may be assumed PROOF. (a)
circled, f(-x) < 1 for all x e U; hence I f 1 < 1 on U. But then If < 6 on the neighborhood 5U, proving continuity. (b) Let K = K2 - K,; K is convex, and is also closed since the sum of a compact set A and a closed set B in a topological vector space is closed. (If
3.5
SOME PROPERTIES OF TOPOLOGICAL VECTOR SPACES
161
then y,,,-+z- x, hence z - x e B since B is closed.) Now 0 0 K by disjointness of K, and K2 ; so by local convexity, there is a convex circled neighborhood V of 0 such that V n K = 0. By 3.5.13 and part (a) above there is an f e L* separating V and K, say f( V) < c < f(K). Now f cannot be identically 0 on V, for if so f- 0 on L by 3.5.1(b). Thus there is an x e V with f(x) # 0, and since V is circled,
we may assume f (x) > 0. Thus c must be greater than 0; hence f(K2) f(K1) + c, c > 0, as desired. (c) Let K, = M, K2 = {x0}, and apply (b) to obtain fe L* with f(M) < C' < c2 < f(xo). Since f is bounded above on the subspace M, f must be identically 0 on M. [If f(x) 96 0, consider f(Ax) for arbitrarily large A.] But then .f (x0) >- c2 > 0. 1
If we adopt the above definition of separation in complex vector spaces, all parts of 3.5.14 extend immediately to the complex case.
Separation theorems may be applied effectively in the study of weak topologies. In 3.4.10 we defined the weak topology on a normed linear space; the definition is identical for an arbitrary topological vector space L. Specifically, for each f e L*, p1(x) = f (x) I defines a seminorm on L. The locally
convex topology induced by the seminorms pr, f e L*, is called the weak topology on L. By 3.5.1 and 3.5.2, a base at x0 for the weak topology consists of finite intersections of sets of the form {x: p f(x - x0) < s}, so in the case of a normed linear space we obtain the topology defined in 3.4.10.
There is a dual topology defined on L*; if x e L, then px(f) = I f(x) I defines a seminorm on V. The locally convex topology induced by the seminorms px is called the weak* topology on V. By 3.5.2, the weak topology is the weakest topology on L making each f e L* continuous, so the weak topology is weaker than the original topology
of L. Convergence of x to x in the weak topology means f (x,,) -+f(x) for each f e V. The weak* topology on L* is the weakest topology making all evaluation maps f-+f(x) continuous. Convergence of f to fin the weak* topology means f (x) -+f(x) for all x e L; thus weak* convergence is simply pointwise convergence, so if L is a normed linear space, the weak* topology is weaker than the norm topology on V. We have observed in 3.4.10 that the weak topology is an example of a product topology. Since weak* convergence is pointwise convergence, the weak* topology is the product topology on the set C` of all complex-valued functions on L, relativized to L*. In distinguishing between the weak topology and the original topology on L, it will be convenient to call the original topology the strong topology. By the above discussion, a weakly closed subset of L is closed in the original
topology. Under certain conditions there is a converse statement:
162
3
INTRODUCTION TO FUNCTIONAL ANALYSIS
3.5.15 Theorem. Let L be a locally convex topological vector space. If K is a convex subset of L, then K is strongly closed in L iff it is weakly closed.
PROOF. Assume K strongly closed. If y 0 K, then by 3.5.14(b) there are real
numbers c, and c2 and an f e L* with Re f(x) < c, < c2 < Re f(y) for all x e K. But then W = {x e L: I f (x) - f (y) I < c2 - c, j is a weak neighborhood
of y, and if xeK, we have If(x - y)I > - IRe f(y) - Re f(x)I
c2-c1;
therefore W n K = 0, proving K` weakly open. For the remainder of this section we consider normed linear spaces. The closed unit ball f f: If II <- 1} of L* is never compact (in the strong topology) unless L (hence L*) is finite-dimensional; see Problem 9, Section 3.3. However, it is always compact in the weak* topology, as we now prove:
3.5.16
Banach-Alaoglu Theorem. If L is a normed linear space and B =
{ f e L*: if II < 11, then B is compact in the weak* topology. PROOF. If f e B, then f(x) I < if II Ilxll _< Ilxjj for all x e L. If I(x) is the set (z e C: I zI <_ Ilxlj), then B c fl{1(x): x e L), the set of all functions defined on L such that f(x) e 1(x) for each x e L. By the Tychonoff theorem (see the appendix on general topology, Theorem A5.4), fl{I(x): x e L) is compact in the product topology (the topology of pointwise convergence). be a net in B; by the above discussion there is a subnet converging Let pointwise to a complex-valued function f on L, and since the f, are linear so and it is f. Now I f(x)I I
f
is
L
the weak topology
topology on the to the is weakly compact. Conversely, weak compactness of the closed unit ball implies reflexivity. To prove this we need the following auxiliary
on
results:
3.5.17 Lemma. Let L be a topological vector space. (a) If f is a linear functional on L, f is continuous relative to the weak topology iff f is continuous relative to the strong topology, that is, iff f e V. (b) If g is a linear functional on L*, g is continuous relative to the weak* topology iff there is an x e L such that g(f) =f(x) for all f e L*.
3.5
SOME PROPERTIES OF TOPOLOGICAL VECTOR SPACES
PROOF. (a)
163
If f e L* and x converges weakly to x, then f(x)
definition of the weak topology, so f is weakly continuous. Conversely, if f is continuous relative to the weak topology and x converges strongly to x, then x,, converges weakly to x, hence f(x) Thus f e V. (b) The "if" part follows from the definition of the weak* topology, so assume g weak* continuous. A basic neighborhood of 0 in the weak* topology
is of the form U=ni=1{feL*: If(x;)I 0, n = 1, 2, ... ; thus there is a U of this type such that g(f) I < I forallfe U. By linearity, I f(x;)I
Al is arbitrary, g(f) = 0. But this implies, by a standard algebraic result (see Problem 15) that g(f) = Yl=1 c;f(x;) for some complex numbers c1, ..., c,,.
Setx=Y;_,clxi.
3.5.18 Lemma. Let L be a normed linear space, and let h be the isometric isomorphism of L into L** (see 3.4.6). Let B be the closed unit ball in L, B** the closed unit ball in L**. Then h(B) is dense in B** relative to the weak* topology. Furthermore, h(L) is dense in L**.
PROOF. Let M be the weak* closure of h(B), and let x** E B**, x** 0 M. By 3.5.16, B** is weak* compact (and convex); so by 3.5.14(b), there is a linear functional g on L** such that g is continuous relative to the weak* topology
and Re g(Al) 5 c, < c2 < Re g(x**). Since M is a subspace (in particular is circled), g(y**) I < cl for all y** e M. [If y** e M and g(y**) = rei°, then I g(y**) = g(e-Fey**) = r = Re g(e-rOy**) < c,.] By 3.5.17(b), g is of the form g(y**) = y**(f) for some f e V. If y E B, and y** = h(y) is the corresponding element of h(B) c M, then If(y)I = Iy**(f)I c,; hence
-
IlfII s c, < c2 < Reg(x**) < Ix**(f)1 < Ilx**II 11f 11 :g 1181,
a contradiction. Consequently M = B**. Finally, if y** e L**, y** 96 0, then y**/Ily**II e B**, which we have just seen is the weak* closure of h(B). Thus y**/Ily**II belongs to the weak* closure of h(L), which is a subspace. The result follows. I We now characterize reflexive normed linear spaces.
Theorem. A normed linear space L is reflexive if its closed unit ball B is weakly compact. 3.5.19
164
3
INTRODUCTION TO FUNCTIONAL ANALYSIS
PROOF. The "only if" part has been pointed out after 3.5.16, so assume B weakly compact. The isometric isomorphism h of L into L** is a homeomorphism of the weak topology of L and the weak* topology of h(L) [note that x"- + x iff f (x,,) --+f(x) for all f E L*; in other words, if h(x")-"' . h(x)J. Thus h(B) is a weak* compact (hence closed) subset of B**, and is dense in B** by 3.5.18. It follows that h(B) = B**, so as in 3.5.18, h(L) = L**, proving reflexivity.
3.5.20 Corollaries. (a) If M is a closed subspace of the reflexive normed linear space L, then M is reflexive. (b) If L is a Banach space, L is reflexive if L* is reflexive.
If B is the closed unit ball in L, then B n M is the closed unit ball in M. By hypothesis, B n M is strongly closed, hence weakly closed by 3.5.15. But B is weakly compact by 3.5.19, so B n M is weakly compact. Again by 3.5.19, M is reflexive. (b) Assume L reflexive. The weak* topology on L* then coincides with its weak topology, hence by 3.5.16, the closed unit ball of L* is weakly coinpact, and consequently L* is reflexive by 3.5.19. (Completeness of L is not used in this part.) PROOF. (a)
If L* is reflexive, so is L** by the first part of the proof. Since L is complete,
so is h(L); thus h(L) is a closed subspace of L**, and the result follows from
(a). I Problems 1.
2.
3.
Let W be the family of overneighborhoods of 0 in a topological vector space L. Show that L is Hausdorff iff (}{U: U E °ll} = {0}. If f is a linear functional on the topological vector space L, with f not identically 0, show that the four conditions of Problem 1, Section 3.3, are still equivalent. If L is a finite-dimensional Hausdorff topological vector space, show that L is topologically isomorphic to C" for some n. Show also that a finitedimensional subspace of an arbitrary Hausdorff topological vector space
is always closed. [It can be shown that for a Hausdorff topological vector space, finite-dimensionality is equivalent to local compactness; see Kelley and Namioka (1963, Theorem 7.8).] 4. (a) Let K be a convex set, radial at 0, in the vector space L. If g is any nonnegative sublinear functional on L such that {x c- L: g(x) < 1} c K c {x e L: g(x) < 1}, show that g is the Minkowski functional of K. [Thus by 3.5.5(d), if 0 e K°, then the Minkowski functionals of K°, K, and K coincide.)
3.5
SOME PROPERTIES OF TOPOLOGICAL VECTOR SPACES
(b)
165
Use part (a) to find the Minkowski functionals of each of the following subsets of R2: (i) {(x, y): IxI + I Y1 (ii) (iii)
(c)
<_ 1}.
{(X, Y): -1<x<1, -1
If K, and K2 are convex and radial at 0, with Minkowski functionals
and p2, show that the Minkowski functional of K, n K2 is 5.
6.
max(p1, P2) Let L be the set of all complex-valued functions on [0, 1], with the topol-
ogy of pointwise convergence. Then L is a locally convex topological vector space, with topology induced by the seminorms p,,(f) = I f(x)I, f e L, where x ranges over [0, 1]; see 3.5.3(a). Show that L is not metrizable. (The same result holds even if we restrict L to the continuous complex-valued functions on [0, 1].) Let L be a locally convex topological vector space. Show (without using the theory of uniform spaces given in the appendix on general topology, Section A10) that the following conditions are equivalent:
(a) L is pseudometrizable, that is, there is a pseudometric inducing the topology of L. (b) L has a countable base at 0 (hence at every point of L). (c) The topology of L is generated by a countable family of seminorms. 7.
Let L be the collection of analytic functions on the unit disk D = {z: IzI < 1}, with the topology of uniform convergence on compact subsets [see 3.5.3(a)]. Show that L is metrizable but not normable.
8.
Let L = LP[0, 1) where 0 < p < 1; with the pseudometric d(x, y) _ x(t) - y(t) I P dt (see 2.4.12), L is a topological vector space. [Apply 3.5.1, using the sets U = {x: f o x(t) I P dt < e}, e > 0.] ,t o I
Let f be a continuous linear functional on L. If fix) = 1, show that x can be written as y + z where d(y, 0) = d(z, 0) = # d(x, 0). (b) With f as in part (a), show that there are functions x,, X2, ... e L 0) -- 0 as n - oo, but I f (x.) I > I for all n. Conclude such that (a)
that the only continuous linear functional on L is the zero functional.
[In part (a), either I f(Y) I ? I or I f(z) I > 1; if, say, I f(Y) I #, take x, = 2y and proceed inductively.] 9. Let L be a topological vector space. Show that there is a nontrivial continuous linear functional on L iff there is a proper convex subset of L with nonempty interior. 10. Let B1 and B2 be (not necessarily convex) nonempty subsets of the topological vector space L, with B1° 96 0. If f is a linear functional on
166
11.
3
INTRODUCTION TO FUNCTIONAL ANALYSIS
L that separates B, and B2, show that f is continuous. [This gives another proof of 3.5.14(a).] Let K be a convex subset of a locally convex topological vector space L.
Show that the closure of K in the weak topology coincides with the 12.
13.
closure in the strong topology. Let K be a convex set, radial at 0, in the real vector space L. Let x be a point of L and M a subspace of L such that x + M does not contain any internal points of K. Show that there is a hyperplane H (that is, H is the null space of a nontrivial linear functional on L) such that M c H and x + H contains no internal points of K. [Define g on L(M u {x}) by g(y + ax) = a, and extend using the Hahn-Banach theorem.] (a) If L is a topological vector space and 91, 2 are topologies on L such that ,% , c 9 2 and L is complete and metrizable under both
, and 9-,2, show that J, (b) If L is a Banach space under two norms 11 11, and II 112, and, for
some k > 0, llxll S klfxll2 for all x e L, show that for some r > 0,
14.
IIx112 < rllxll, for all x e L; in other words (Problem 6, Section 3.3) the norms induce the same topology. (a) (Closed graph theorem) Let A be a linear map from L to M, where L and M are complete metrizable topological vector spaces.
Assume A is closed; in other words, the graph of A is a closed subset of L x M, with the product topology. Show that A is continuous. (b) If A is a continuous linear operator from L to M where L and M
are topological vector spaces and M is Hausdorff, show that A 15.
16.
is closed. Let g, f1, ... , f" be linear functionals on the vector space L. If N denotes null space and n;= I N(f;) e N(g), show that g is a linear combination of the f, . Let L be a normed linear space. If the weak and strong topologies coincide on L, show that L is finite-dimensional, as follows: (a) The unit ball B = {x: IIxli < 1) is strongly open, hence weakly e L* and b1, ..., open by hypothesis. Thus we can find .
S" > 0 such that {x: l f;(# < S,, i = 1, ..., n} c B. Show that (with N(f) denoting the null space off) (),!=I N(f;) = (0). (b)
Define T(x) = (f, (x), ... , f"(x)) ; by (a), T is a one-to-one map of L
onto a subspace M of C". If {y...... yk) is a basis for M and x; =
T - ' (y;), j = 1, ... , k, show that {x,, ... , xk} is a basis for L, 17.
hence L is finite-dimensional. Let L be a separable normed linear space. If B is the closed unit ball in L*, show that B is metrizable in the weak* topology. Thus since B is compact by 3.5.16, every sequence in B (hence every norm-bounded
3.6
REFERENCES
167
sequence in L*) has a weak* convergent subsequence. Similarly, if L is reflexive, the closed unit ball of L is metrizable in the weak topology. (Let {x,, X21 ...} be a countable dense subset of and set w {{
1
If(xn) - g(Xn)1
d(f, g) - =1 2" 1 + ((((x.) g(xn)I ,,JJ
18.
19.
f, g E L*. f,
Show that weak* convergence implies d-convergence.) Show that a reflexive Banach space is weakly complete; in other words every weak Cauchy sequence [{ f (x )} is Cauchy for each f e L*] converges weakly. A subset B of a topological vector space L is said to be absorbed by a
subset A if B c aA for sufficiently large I a I ; B is said to be bounded if it is absorbed by every neighborhood of 0. (a) Show that B is bounded if for each sequence of points x e B and each sequence of complex numbers .1 -+ 0, we have A. x -+ 0. (b) A bornivore in a topological vector space L is a convex circled set that absorbs every bounded set; L is bornological if L is locally convex and every bornivore is an overneighborhood of 0. Show that every metrizable locally convex space is bornological. (c) Let T be a linear operator from L to M, where L is bornological and M is locally convex. If T maps bounded sets into bounded sets, show that T is continuous. (The converse is true for arbitrary L and M.) (d) If L is a Hausdorff topological vector space, show that there is no bounded subspace of L except {0}.
3.6
References
There is a vast literature on functional analysis, and we only give a few representative titles. Readable introductory treatments are given in Liusternik and Sobolev (1961), Taylor (1958), Bachman and Narici (1966), and Halmos (1951); the last deals exclusively with Hilbert spaces. Among the more ad-
vanced treatments, Dunford and Schwartz (1958, 1963, 1970) emphasize normed spaces, Kelley and Namioka (1963) and Schaefer (1966) emphasize topological vector spaces. Yosida (1968) gives a broad survey of applications to differential equations, semigroup theory, and other areas of analysis.
4 The Interplay between Measure Theory and Topology
4.1
Introduction
A connection between measure theory and topology is established when a a-field .F is defined in terms of topological properties. In the most common situation, we have a topological space fl, and F is taken as the smallest a-field
containing all open sets of Q. If this is done, there is a natural connection between measure-theoretic and topological questions. For example, if µ is a measure on , and A e .F, we may ask whether A can be approximated by a compact subset. In other words, we wish to know if u(A) = sup{µ(K): K a compact subset of A}. As another example, we may ask whether a function in L°(S2, .07, p) can be approximated by a continuous function. One formulation of this is to ask whether the continuous functions are dense in
P. In this chapter we investigate questions of this type. The results in the first two sections are not topological, but they serve as basic tools in the later development. We first consider a result that is a companion to the monotone class theorem: Definition. Let -9 be a class of subsets of a set 0. Then -9 is said to be a Dynkin system (D-system for short) if the following conditions hold.
4.1.1
168
4.1
INTRODUCTION
169
(a) QE -'. (b) If A, B e 2, B c A, then A - B e 9. Thus -9 is closed under proper differences. (c)
If A1,A2,...e9andA,, TA, then AeO.
Note that by (a) and (b), -9 is closed under complementation; hence by (c), -9 is a monotone class. If -9 is closed under finite union (or closed under finite intersection), then g is a field, and hence a a-field (see 1.2.1). 4.1.2
Dynkin System Theorem. Let .9' be a class of subsets of 0, and assume 9' closed under finite intersection. If -9 is a Dynkin system and -9 .9', then -9 includes the minimal a-field F = a(9'). PROOF. Let -9o be the smallest D-system including 9. We show that -9Q = F,
in other words the smallest D-system and the smallest a-field over a class closed under finite intersection coincide. Since -9o c -9, the result will follow.
Now -9o (-- .;t since F is a D-system. To show that .F c .9o , let ' = {A e -9o : A r B e -90 for alI B e .9'}. Then 91' c ' since .9' is closed under finite intersection, and since -9o is a D-system, so is W. Thus .90 a' , hence -9o=W. Now let " _ {C ego : C n D c-90 for all D e 3o). The result .90 = W implies that 51 T, and since 'e' is a D-system we have .9o c W', hence 0o = V. It follows that -90 is closed under finite intersection; by 4.1.1, -90 is
a a-field, so that F c go. 1 If Y is a field and .,# is the smallest monotone class including So, then Af = a(.9') (see 1.3.9). In the Dynkin system theorem, we have a weaker hypothesis on .9' (it is closed under finite intersection but need not be a field)
but a stronger hypothesis on the class of sets including . 9' (9 is a Dynkin system, not merely a monotone class). Corollary. Let 9 be a class of subsets of 0, and let µl and P2 be finite measures on a(.9'). Assume 0 E . 9' and . 9' is closed under finite intersection. If µ, = µ2 on So, then µl = µ2 on a(.9'). 4.1.3
PRoor. Let g be the collection of sets A e a(.9') such that µ,(A) = 102(A). Then
2 is a D-system and 59' c .9, hence g = a(.9') by 4.1.2. 1 4.1.4 Corollary. Let .9' be a class of subsets of 0; assume that S2 e .9' and . 9'
is closed under finite intersection. Let H be a vector space of real-valued functions on fl, such that IA E H for each A E .9'.
4
170
THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
Suppose that whenever f f2 , ... are nonnegative functions in H, I f 1 < M < co for all n, and f, T f, the limit function f belongs to H. Then IA e H for all A c a(.9'). PROOF. Let _q = {A c fl: IA a H}; then ,9'c -9 and 2 is a D-system. For if
A,Bc ,BcA,then IA_B=IA-JBeH,sothat A-Be -9. If A. e-9 and A T A, then IA T IA, hence I. e H by hypothesis; thus A e -9. The result now follows from 4.1.2. 1 4.2
The Daniell Integral
One of the basic properties of the integral is linearity; if f and g are pintegrable functions and a and b are real or complex numbers, then
fn (af+bg)dp=a$n fdp+b fn g dp. Thus the integral may be regarded as a linear functional on the vector space of integrable functions. This idea may be used as the basis for a different approach to integration theory. Instead of beginning with a measure and constructing the corresponding integral, we start with a given linear functional E on a vector space. Under appropriate hypotheses, we extend E to a larger space, and finally we show that there is a measure u such that E is in fact the integral with respect to p. We first fix the notation to be used.
Notation. In this section, L will denote a vector space of real-valued functions on a set f ; L is assumed closed under the lattice operations, in other words if f, g e L and f vg = max(f, g), f A g= min(f, g), then f v g, f A g e L. 4.2.1
There are several familiar examples of such spaces; L can be the class of continuous real-valued functions on a given topological space, or equally well, the bounded continuous real-valued functions. Another possibility is to take L as the collection of all real-valued functions on a given set. The letter E will denote a positive linear functional on L, that is, a linear map E from L to R such that f'>_ 0 implies E(f) >- 0. This implies that E is monotone, that is, f < g implies E(f) <- E(g).
If H is any class of functions from 0 to R (or R), H+ will denote f f e H : f > 0). The collection of functions f: S2 -+ R of the form lim f where the f form an increasing sequence of functions in L+, will be denoted by L';
if the f are allowed to form an increasing net in L+, the resulting class is denoted by L. (See the appendix on general topology, Section Al, for a discussion of nets.)
4.2 THE DANIELL INTEGRAL
171
If H is as above, a(H) is defined as the smallest a-field of subsets of 12 making every function in H Bore] measurable, that is, the minimal a-field containing all sets f -'(B), where f ranges over H and B over the Borel sets. If 9 is a class of subsets of K2, a(f) as usual denotes the minimal or-field over T.
The following will be assumed throughout: Hypothesis A: If the functions fn form a sequence in L decreasing to 0, then E(fn) decreases to 0. Equivalently, if the fn belong to L and increase to f e L, then E(fn) increases to E(f).
We are also going to carry through a parallel development under the following assumption: Hypothesis B: If the functions fn form a net in L decreasing to 0, then E(fn) decreases to 0 (with the equivalent statement just as in hypothesis A).
Hypothesis A is always assumed in the statements of theorems. Corresponding results under hypothesis B will be added in brackets. 4.2.2 Lemma. Let {fm} and { fn'} be sequences in L increasing to f and f',
respectively, with f < f' (f and f need not belong to L). Then Iim E(fm)
n
Hence E may be extended to L' by defining E(limn fn) = limn E(fn). [Under
hypothesis B (and with "sequence" replaced by "net" in the above statement), E may be extended to L" in the same fashion.] PROOF. As n --> 00,Jm A./n' I Jm Af' =Jme hence limn E(fn')
limn E(fm Afn') =
E(fm). Let m -), oo to finish the proof. [Under hypothesis B, the proof is the same, with sequences replaced by nets.] I We now study the extension of E. 4.2.3 Lemma. The extension of E to L' has the following properties:
(a) 0< E(f)
(b) Iff,geL',f
E(f i g)=E(fvg)+E(fng)=E(f)+E(g).
172 (e)
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
increases
If If,,) is a sequence in L' increasing to f, then f e L' and
to E(f). [Under hypothesis B, the extension of E to L" has exactly the same properties; " sequence " is replaced by " net " in (e).] PROOF. Properties (a)-(c) follow from 4.2.2. To prove (d), let fn T f g,, ? g. Then
g a L+, with
E(fn v gn) + E(fn A g,,) = E[(f,, v gn) + (fn A g,,)]
by linearity = E(f,, + gn) (the sum of two numbers is the larger plus the smaller)
= E(fn) + E(gn) by linearity.
Let n --> co to obtain (d). To prove (e), let J,,m e L, f,,, If. as in -,, oo. If g,,, = f,m v .. vfmm, the gm form an increasing sequence in L+, and f.. :5: gm:! fm
for n<m;
(1)
hence E(fnm) < E(gm) < E(fm),
n < in.
(2)
In (l) let in - oo to obtain fn < limm gm < limmfm =f; then let n -+ oo to obtain gm If, hence E(gm) I E(f). Now let in oo in (2) to find that E(fn) S E(f) < limm E(fm); then let n --> oo to establish that limn E(f) [Under hypothesis B, (a)-(d) are proved as above, but (e) is more complicated. Let {fn} be a net in L" with f I f; for each n there is a net If..) in V with f,m T fn , so that f = sup,,, mfnm Let D consist of all finite sets of pairs (n, m) a M}, ME D. (n, m). Direct D by inclusion, and define gm = The g,K form a monotone net in e and gm If-, therefore f e L" and, by 4.2.2, E(gm) I E(f ). Now for each M, E(gM) < sup,,,,. E(f,, m), and sincef,,m < f, for
all in, it follows that E(gm) < sup,, E(.) = lim,, E(fn). But M is arbitrary, The reverse inclusion holds because f', t f, and the hence E(f) < lim,, proof is complete.] We now begin the construction of a measure derived from the linear functional E. Fron now on we assume that all constant functions belong to L and, as a normalization, E(l) = 1 (hence E(c) = c for all c).
173
4.2 THE DANIELL INTEGRAL
4.2.4 Lemma. Let 9 = {G c 0: IG cL'} and define µ(G) = E(IG), G E mar. Then 9 satisfies the four conditions of 1.3.2, namely: (a) 0, n e QF, u(o) = 0, µ(0) = 1, 0 < µ(A) < 1 for all A e 99. (b) If G G2 e W, then G, u G2, G, n G2 c 9r, and
µ(G, u G2) +µ(G, n G2) = µ(GI) + µ(G2). (c) If G,, G2 e 91 and G, c G2, then µ(G,) < µ(G2). (d) If G a g, n = 1, 2,... and G I G, then G E T and p(Ga) j p(G).
Thus by 1.3.3 and 1.3.5, u*(A) = inf{µ(G): G e 9, G e A} is a probability measure on the a-field W = {H c 0: µ*(H) + p*(H`) = 1), and p* = p on 9. [Under hypothesis B, we take 9 = {G a !Q: Ic e L"} and replace sequences by nets in 4.2.4(d). The classIi then has exactly the same properties.] PROOF. Part (a) follows since L contains the constant functions and E(c) = c. Part (b) follows from 4.2.3(d) with f = IG, , g = IG2 . Part (c) follows from 4.2.3(b), and part (d) from 4.2.3(e). [The proof under hypothesis B is identi-
cal.] I We now investigate Borel measurability relative to the a-field a(T).
4.2.5 Lemma. 1f f E L' and a e R, then {w: f (c)) > a} e g. Hence
f (A, aM) --> (R, 9(R)). [The same result holds for f e L" under hypothesis B.] Let f,, L+, f, If Then (fn - a)+ = (f - a) v 0 e L+ c L', and (f, - a)+ j (f - a)+ By 4.2.3(e) (or the definition of L'), (f - a)+ E L'; hence k(f - a)+ e L' for each positive integer k, by 4.2.3(c). But as k -+ oo, PROOF.
1A
k(f-a)+
I I(f>);
so by 4.2.3(e), I{ f>a) e L', and therefore {f > a) e 9. [Under hypothesis B, the proof is the same, with { fa} a net instead of a sequence.] I
4.2.6 Lemma. The a-fields a(L), a(L'), and a(ir) are identical. [Under hypothesis B we only have a(V) = a(f) and a(L) c a(L").] PROOF. By 4.2.5, a(gr) makes every function in L' measurable; hence a(E) c a(gr). If G E 9r, then IG e L'; hence G = (IG = 1) a a(L'); therefore a(sr) e a(L'). [Under hypothesis B, a(L") = a(W) by the same argument.]
174
4
THE INTERIsLAY BETWEEN MEASURE THEORY AND TOPOLOGY
If f e L, then f = f + -f-, where f +, f - e L' c :L'. Since f + and f- are a(L')-measurable, so is f. In other words, u(L') makes every function in L Bore] measurable, so that a(L) c a(L'). [Under hypothesis B, a(L) c a(L") by the same argument.] Now if f e L', then f is the limit of a sequencef a L, and since the f are a(L)-measurable, so is f. [This fails under hypothesis B because
the limit of a net of measurable functions need not be measurable; see Problem 1.] Thus a(L') e a(L). I Now by definition of the set function p* (see 4.2.4) we have, for all A c Sl, p*(A) = inf{E(IG): G e QV,
G
A)
=inf{E(f):f=IGE L', f>IA} > inf{E(f): fe L', f> IA}. In fact equality holds.
4.2.7 Lemma. For any A c 0, p*(A) = inf{E(f): f e L', f > IA). [The result is the same under hypothesis B, with L' replaced by L".) PROOF. Let f e L', f >- IA. If 0 < a < 1, then A e (f > a), which belongs to 9 by 4.2.5. Thus p*(A) < p{ f > a) = E(I f>a)). But since f >- 0 we have f Z aI(f>Q); hence E(I(f>Q)) <E(f)la. Let a-+ 1 to conclude that p*(A) S E(f). [The proof is the same under hypothesis B.]
We may now prove that p* is a measure on a(l):
4.2.8 Lemma. If .e = {H c fl: p*(H) + p*(H`) = 1), then 9r c f e, hence a(19) c 0. [The result is the same under hypothesis B.] PROOF. Let G e T; since 1c e L', there are functions f, e e with f, T 1G. Then
y*(G) = p(G) = E(IG) = lim E(f)
by 4.2.3(e).
n
By 4.2.7, p*(G`) = inf{E(f ): f e L', f
But if fn < IC', then 1 - fn >- Ian ;
since I - fn > 0, we have I - fn e L' c L'; hence p*(G`) < inf E(1 n
I - lim E(f) = 1 - E(IG). n
Thus p*(G) + p*(G`) < 1; since p*(G) + p*(G`) is always at least I by 1.3.3(b), we have G E .-Y. [Under hypothesis B, the proof is the same, with { fn} a net
instead of a sequence.] I
4.2
175
THE DANIELL INTEGRAL
We now prove the main theorem; for clarity we state the results under hypotheses A and B separately (in 4.2.9 and 4.2.10). Daniel! Representation Theorem. Let L be a vector space of real-valued functions on the set 92; assume that L contains the constant functions and is closed under the lattice operations. Let E be a Daniell integral on L, that is, 4.2.9
a positive linear functional on L such that E(fa) J. 0 for each sequence of functions f, e L with f 10; assume that E(1) = 1. Then there is a unique probability measure P on a(L) (=a(L') = a(T) by 4.2.6) such that each f e L is P-integrable and E(f) = In f dP. PROOF. Let P he the restriction of p* to a(L). By 4.2.6 and 4.2.8, P is a probability measure. If G e 19, then
E(I0) = p(G) = p*(G) = P(G) = f IG 0. n
Now if f e L', we define
k-1 l{(k-I)/2^
hn = k=1
n
2
Since I(a< f:5 b) = I(f>a) - I{ f>b} for a < b, and {f > a}, {f > b} e W by 4.2.5, it
follows that
In h dP. But the h form a sequence of nonnegative
simple functions increasing to f [see 1.5.5(a)], so by the monotone convergence
theorem, E(f) = In f dP.
Now let feL; f = f + -f-, where f +, f - c -L' c L'. Then E(f) _ E ( f ') - E(f -) _ ,$n f + d P - fn f d P = f n f dP. (Since f +, f - e L, the integrals are finite.)
This establishes the existence of the desired probability measure P. If P' is another such measure, then So fdP = 5 n f dP' for all f a L,and hence for all f e L', by the monotone convergence theorem. Set f = Ia, G e W1, to show that P = P on W. Now Ir is closed under finite intersection by 4.2.4(b); hence by 4.1.3, P = P' on a(lr), proving uniqueness. I 4.2.10
Theorem. Let L be a vector space of real-valued functions on the set
i2; assume that L contains the constant functions and is closed under the
lattice operations. Let E be a positive linear functional on L such that E(,,) 10 for each net of functions f e L with f 10; assume that E(1) = I. Then there is a unique probability measure P on o(L") (=a(W) by 4.2.6) such that: (a) Each f e L is P-integrable and E(f) = In f dP. (b) If is a net of sets in g and Ga TG, then G e
and P(G) T P(G).
176
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
PROOF. Let P be the restriction of M* to a(L'). The proof that P satisfies (a) is done exactly as in 4.2.9, with L' replaced by L'; P satisfies (b) by 4.2.4(d).
The uniqueness part cannot be done exactly as in 4.2.9 because the monotone convergence theorem fails in general for nets (see Problem 2). Let P' be a probability measure satisfying (a) and (b). If f e L', there is a net of functions fa e L+ with fa If. We define 1
n2"
n = 1, 2, ... .
hna = 2n,I1 I{Ia>
If (k - 1)/2" < fa(w) < k/2n, k = 1, 2, ..., n2", then hna(w) =(k - 1)/2", and if fa(co) > n, then hna(w) = n. Thus the hna, n = 1, 2, ..., are in fact the standard
sequence of nonnegative simple functions increasing to fa [see 1.5.5(a)]. Similarly, if 1
nr22"
2nj=1 L I{j> j2-")
h"
the h" are nonnegative simple functions increasing to f. Now
f h" dP' a
n2"
1
y P'{f > j2-"}
2nj=I o2"
1
E lim P'{ fa > j2-"} ' 2n j=1 a
by (b)
n2"
1
=lim- Y P'{fa>j2r"} a
2" j=1
since the sum on j is finite
= lim f hna dP'; a
n
but
f f dP' = lim f ha dP' n
n
n
by the monotone convergence theorem
= lim lim f hna dP' n
a
n
= lim lim f hna dP' a
n
a
since hna is monotone in each variable,
so that "lim" may be replaced by "sup"
=lim f fadP' a
a
by the monotone convergence theorem
4.2
THE DANIELL INTEGRAL
177
Equation continues
= lim a
fa dP
Ja
by (a)
= fnf dP by the above argument with P' replaced by P.
Set f = Ic, G e 9r, to show that P = P' on 9; hence, as in 4.2.9, on a(w). The following approximation theorem will be helpful in the next section. Theorem. Assume the hypothesis of 4.2.9, and in addition assume that L is closed under limits of uniformly convergent sequences. Let 4.2.11
9'={G-=0:G={f>0) for some feL}. Then : (a)
9' = 9r.
(b) If A e 6(L), then P(A) = inf{P(G): G e,r', G :DA}. (c)
If G e W, then P(G) = sup{E(f): fe L, f < Ic}.
PROOF. (a) We have 5r' c Ir by 4.2.5. Conversely, suppose G e 1, and let f E L+ with f, T Ic (e L'). Set f = 2:1 1 2-nf . Since 0
{f>0)= U
1}=G.
n=1
Consequently, G e 9'. (b) This is immediate from (a) and the fact that P = u* on Q(L). (c)
If f e L+, f < Ic, then E(f) < E(IG) = P(G). Conversely, let G E 1,
with f e L, f T 1G. Then P(G) = E(!) = limn
sup
hence
P(G) < sup{E(f): fe e, f < IG}. Problems
Give an example to show that the limit of a net of measurable functions need not be measurable. 2. Give an example of a net of nonnegative Borel measurable functions fa increasing to a Bore] measurable function f, with lima f fa du -0 f f du. 3. Let L be the class of real-valued continuous functions on [0, 1], and let E(f) be the Riemann integral off. Show that E is a Daniel] integral on L, and show that o(L) _ -4[0, 1] and P is Lebesgue measure. 1.
178
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
4.3 Measures on Topological Spaces
We are now in a position to obtain precise results on the interplay between measure theory and topology.
Definitions and Comments. Let fI be a normal topological space (0 is Hausdorff, and if A and B are disjoint closed subsets of Q, there are disjoint 4.3.1
open sets U and V with A c U and B c V). The basic property of normal spaces that we need is Urysohn's lemma: If A and B are disjoint closed subsets
of 0, there is a continuous function f: r2 -> [0, 11 such that f = 0 on A and f = 1 on B. Other standard results are that every compact Hausdorrf space is normal, and every metric space is normal. The class of Borel sets of 0, denoted by R(fl) or simply by.4, is defined as the smallest a-field of subsets of r2 containing the open (or equally well the closed) sets. The class of Baire sets of 0, denoted by V(fl) or simply by sad, is defined as the smallest a-field of subsets of S1 making all continuous realvalued functions (Borel) measurable, that is, sat is the minimal Q-field contain-
ing all sets f -'(B) where B ranges over R(R) and f ranges over the class C(f2) of continuous maps from f to R. Note that sd is the smallest a-field making all bounded continuous functions measurable. For let .F be a a-field that makes all bounded continuous functions measurable. If f e C(r2), then f + An is a bounded continuous function and f + An If + as n -+ oo. Thus
f + (and similarly f -) is .F-measurable, hence f =f' -f - is .F-measurable. Thus d c F, as desired. The class of bounded continuous real-valued functions on 0 will be denoted by Cb(Q).
If V is an open subset of R and f e C(Q), then f -'(V) is open in 11, hence
f -(V) e 2(c2). But the sets f -'(V) generate si(Q), since any a-field containing the sets f -'(V) for all open sets V must contain the sets f -'(B) for all Borel sets B. (Problem 6 of Section 1.2 may be used to give a formal proof, with ' taken as the class of open sets.) It follows that W(r) a R(r2). An F, set in rZ is a countable union of closed sets, and a G. set is a countable intersection of open sets. Theorem. Let r2 be a normal topological space. Then sl(r2) is the minimal a-field containing the open F, sets (or equally well, the minimal a-field containing the closed G6 sets). 4.3.2
PROOF. Let f e C(Q); then If > a) = Un , If >- a + (1/n)) is an open F,, set. As above, the sets {f> a}, a e R, f e C(O), generate V; hence .4 is included
4.3
179
MEASURES ON TOPOLOGICAL SPACES
in the minimal o-field ,Y over the F, sets. Conversely, let H = Un , F,,, F. closed, be an open F. set. By Urysohn's lemma, there are functions f" e C(f)) onF,,.Iff=Y', 2-"f", then feC(Q), with
0
4.3.3 Corollary. If fl is a normal topological space, the open F, sets are precisely the sets (f > 0) where f e Cb(fl), f >_ 0.
PROOF. By the argument of 4.3.2. 1 4.3.4
Corollary. If Cl is a metric space, then .sd(Cl) = R(i2).
PROOF. If F is a closed subset of Cl, then F is a G. 1
F = n00{c o: dist(w, F) < "=i
;
n
hence every open subset of Cl is an F, . The result now follows from 4.3.2. 1 Corollary 4.3.4 has a direct proof that avoids use of 4.3.2; see Problem 1. We may obtain some additional information about the open F, sets of a normal space. 4.3.5 Lemma. Let A be an open F. set in the normal space S2, so that by 4.3.3,
A = (f > 0) where f C- Cb(fZ), f > 0. Then IA is the limit of an increasing sequence of continuous functions. PROOF. We have (f > 01 = Un , {f> 1/n), and by Urysohn's lemma there are functions f" e C(C) with 0< .fn :g 1, f" = 0 on (f = 0),f. = 1 on {f > I /n}. If 9" = max(f , ... ,./"), then 9" T Itt> o) .
The Daniell theory now gives us a basic approximation theorem. 4.3.6 Theorem. Let P be any probability measure on .W(f2), where Cl is a
normal topological space. If A e d, then (a) P(A) = inf{P(V): V n A, Van open F. set}, (b) P(A) = sup{P(C): C c A, C a closed Ga set}.
180
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
PROOF. Let L = Cb(f) and define E(f) = In f dP, f e L. [Note that a(L) = ,V,
so each f e L is d-measurable; furthermore, since f is bounded, In f dP is finite. Thus E is well-defined.] Now E is a positive linear functional on L, and by the dominated convergence theorem, E is a Daniell integral. By 4.2.11(b), P(A) = inf{P(G): G e 9r',
G z A},
where
9'={Gc0:G={f>0} forsomefeL}. By 4.3.3, T' is the class of open F, sets, proving (a). Part (b) follows upon applying (a) to the complement of A. I Corollary. If f2 is a metric space, and P is a probability measure on R(f ), then for each A e R(f2), 4.3.7
(a) P(A) = inf{P(V): V A, V open}, (b) P(A) = sup{P(C): C c A, C closed}.
PROOF. In a metric space, every closed set is a Gs and every open set is an F, (see 4.3.4); the result follows from 4.3.6. 1
Under additional hypotheses on f2, we obtain approximations by compact subsets.
4.3.8 Theorem. Let ) be a complete separable metric space (sometimes
called a "Polish space"). If P is a probability measure on R(fl), then for each A e R(f2),
P(A) = sup{P(K): K compact subset of A}.
PROOF. By 4.3.7, the approximation property holds with "compact" replaced by "closed." We are going to show that if e > 0, there is a compact set K. such that P(Ke) > 1 - s. This implies the theorem, for if C is closed, then C n K, is
compact, and P(C) - P(C n K,) = P(C - K,) < P(c2 - K,) < e. Since fl is separable, there is a countable dense set {w1, w2, ...}. Let B(cv,,, r} (respectively, B(w,,, r)) be the open (respectively, closed) ball with
center at w and radius r. Then for every r > 0, Q = Un 1 B(w,,, r) so that Uk=, B(Wk, 1/n) T f2 as m.-oo (n fixed). Thus given e > 0 and a positive integer n, there is a positive integer m(n) such that P(Uk 1 B(wk, 1/n)) z 1 - e2` for all m Z m(n).
4.3 MEASURES ON TOPOLOGICAL SPACES
181
Let K, = nni Uk("1 B(uwk, 1/n). Then K, is closed, and !m() _
X00
L
P(K,`)
'PI
n=1
k=1
1
B [Cok'
c
n _J)
m
< n=1 Y
s2-" = s.
Therefore P(K,) >- I - s. It remains to show that K, is compact. Let {x1ix2, ...} be a sequence in K,. Then xP E no Uk "i R04, 1/n) for all p; hence x,, e Uk`=11 B(wk, 1) for all p. We conclude that for some k,, xP E B(wk,, 1) for infinitely many p, say, for p c- T,, an infinite subset of the positive integers. But xP E B(wk, #) for 1
all p, in particular for all p e T1; hence for some k2 , XP E B(cok,, 1) r B((vk2, #)
for infinitely many p e TI, say, for p e T2 e T1. Continue inductively to obtain integers k,, k2, ... and infinite sets TI T2 such that I
x1,Ej=1 f BLwk',J 1
for all peT,.
LL
Pick pi e Ti, i = 1, 2, ..., with PI < P2 < -. Then if j < i, we have xP,, x,,, E B(cokj , 1 /j), so d(xp, , XP) < 2/j - 0 as j - oo. Thus {xp,) is a Cauchy sequence, hence converges (to a point of K, since K, is closed). Therefore {xp} has a subsequence converging to a point of K,, so K, is compact. I
We now apply the Daniell theory to obtain theorems on representation of positive linear functionals in a topological context. Theorem. Let n be a compact Hausdorff space, and let E be a positive linear functional on C(Q), with E(l) = 1. There is a unique probability measure P on sd(Q) such that E(f) = In f dP for all f e C(CZ). 4.3.9
PROOF. Let L = C(Q). If fn e L, fn 10, then f -+0 uniformly (this is Dini's theorem). For given b > 0, we have fl! = Un I {f,, < S}; hence by compactness, N
0 = U {f, < S}
for some N
n=1
= { fN < S}
by montonicity of {fj.
Thus n >_ N implies 0 < f"(w) < fN(co) < b for all co, proving uniform convergence.
Thus if S > 0 is given, eventually 0 < f" < S, so 0 < E(f") < E(S) = S. Therefore E(fn) 10, hence E is a Daniell integral. The result follows from 4.2.9. 1
182
4
THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
A somewhat different result is obtained if we use the Daniell theory with hypothesis B.
Theorem. Let S2 be a compact Hausdorff space, and let E be a positive linear functional on C(Q), with E(l) = 1. There is a unique probability measure P on R(S2) such that 4.3.10
(a) E(f) = fa f dP for all f e C(O), and (b) for all A e R(S2),
P(A) = inf{P(V): V z) A,
V open)
or equivalently,
P(A) = sup{P(K) : K (-_ A, K compact). (" Compact" may be replaced by " closed " since n is compact Hausdorff.) PROOF. Let L = C(c2). If {f, n e D} is a net in L and f 10, then, as in 4.3.9, for any 6 > 0 we have fl = U j E F { f j < S} for some finite set F c D. If N e D and N z j for all j e F, then n = { fN < S) by monotonicity of the net. Thus n >_ N implies 0 < f < fN, < S, and it follows as in 4.3.9 that 10.
By 4.2.10 there is a probability measure P on a(L") = a(lr) such that E(f) = fn f dP for all f e L. But in fact ## is the class of open sets, so that a(lr) = R(Q). For if f e L", there is a net of nonnegative continuous functions
f T f; hence for each real a, {f > a) = U f f, > a) is an open set. Thus if G e 9, then IG e L", so that G = (Ia > 0) is open. Conversely if G is open and co e G, there is a continuous function f.: Q -+ [0, 11 such that fjw) = 1 and f,,, = 0 on G`. Thus Ic = supw.fu so that if for each finite set F c G we define gF = max{ fu, : w e F}, and direct the sets F by inclusion, we obtain a mono-
tone net of nonnegative continuous functions increasing to I.. Therefore IGeL", so that Ge4. Thus we have established the existence of a probability measure P on 9(0) satisfying part (a) of 4.3.10; part (b) follows since P = µ* on a(W), and V is the class of open sets. To prove uniqueness, let P' be another probability measure satisfying (a) and (b) of 4.3. 10. If we can show that P' satisfies 4.2.10(b), it will follow from be a net of open sets the uniqueness part of 4.2.10 that P' = P. Thus let with G T G; since G is the union of the G,,, G is open. By hypothesis, given
S > 0, there is a compact K e G such that P'(G) s P'(K) + S. Now G. U K` T G U K` = fl; hence by compactness and the monotonicity of Gm U K` = SZ for some m, so that K e G.. Consequently,
P'(G) T P'(G).
4.3 MEASURES ON TOPOLOGICAL SPACES
183
Property (b) of 4.3.10 is often referred to as the "regularity" of P. Since the word "regular" is used in so many different ways in the literature, let us state exactly what it will mean for us. Definitions. If p is a measure on .(S)), where S2 is a normal topological space, p is said to be regular if for each A E R(S2), 4.3.11
p(A) = inf{p(V): V
A,
V open)
and
p(A) = sup{p(C): C c A,
C closed).
Either one of these conditions implies the other if p is finite, and if in addition, .0 is a compact Hausdorff space, we obtain property (b) of 4.3.10. If p = p+ - jr is a finite signed measure on N(Q), S2 normal, we say that p is regular iff p+ and p- are regular (equivalently, if the total variation (p I is regular). The following result connects 4.3.9 and 4.3.10. 4.3.12
Theorem. If P is a probability measure on sa1(S2), fl compact Haus-
dorff, then P has a unique extension to a regular probability measure on eJ(1). PROOF. Let E(f) = In f dP, f E C(i2). Then E is a positive linear functional on L = C(S2), and thus (see the proof of 4.3.10) if f f.) is a net in L decreasing to 0, then j 0. By 4.3.10 there is a unique regular probability measure P' on
'(t2) such that In f dP = fn f dP' for all f e L. But each f in L is measurable: (S), d) - (R, V(R)), hence by 1.5.5, In f dP' is determined by the values of P'
on Baire sets. Thus the condition that f a f dP = In f dP' for all f e L is equivalent to P = P' on W(Q), by the uniqueness part of 4.3.9. 1 In 4.3.9 and 4.3.10, the assumption E(l) = 1 is just a normalization, and if it is dropped, the results are the same, except that "unique probability measure" is replaced by "unique finite measure." Similarly, 4.3.12 applies equally well to finite measures.
Now let fl be a compact Hausdorff space, and consider L = C(fl) as a vector space over the reals; L is a Banach space with the sup norm. If E is a positive linear functional on L, we can show that E is continuous, and this will allow us to generalize 4.3.9 and 4.3.10 by giving representation theorems for continuous linear functionals on C(O). To prove continuity of E, note that if f e L and If 11 _< 1, then -1 < f(co) < 1 for all co; hence -E(l) :5 E(f)
184
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
E(l), that is, I E(f) I < E(1). Therefore IIEII < E(l); in fact IIEII = E(l), as may be seen by considering the function that is identically 1. The representation theorem we are about to prove will involve integration with respect to a finite signed measure y = p+ - u-; the integral is defined in the obvious way, namely,
f of dp = f .f dµ+
- f of d9
,
assuming the right side is well-defined. 4.3.13 Theorem. Let E be a continuous linear functional on C(SI), SI compact Hausdorff. (a)
There is a unique finite signed measure p on d(Q) such that E(f) _
In fdpfor all feCO). (b) There is a unique regular finite signed measure A on R(Q) such that E(f) = In f dA for all f c- C(SI).
Furthermore, any finite signed measure on .01(SI) has a unique extension to a regular finite signed measure on .(SI); in particular A is the unique extension of p. PROOF. The existence of the desired signed measures y and A will follow from
4.3.9 and 4.3.10 if we show that E is the difference of two positive linear functionals E+ and E-. If f Z 0, f e C(SI), define
E+(f) = sup(E(g): 0
g e C(S))}.
If f < M, then E+(f) 5 MIIEII < oo by continuity of E; hence E+ is finite. If 0:!g g ; < f;, i = 1, 2, with all functions in C(Q), then E(9i) + E(g2) = E(g, + 92) <- E+(.f, +f2).
Take the sup over g, and g2 to obtain E+(f,) + E+(f2) < E+(f, +f2). Now if O :g g<.f, +.f2 ,.fi,.f2 >: 0, define g, = 9 A f,, 92 = 0V(9 -f1)
Then 0 < g, <-.fi, 0 <- 92:5f2, and 9=9,+92. Thus E(g) = E(g,) + E(92) :!g E+(fl) + E+(f2); hence E+(f, +f2) < E+(f,) + E+(f2), and consequently
E+(f, +f2) _ E+(fi) + E+(f2)
(1)
Clearly E+(af) = aE+(f) if a 0. Thus E+ extends to a positive linear functional on C(SI). Specifically, if f =f + -f -, take E+(f) = E+(f+) E+(f-). If f can also be represented as g - h, where g and h are nonnegative
4.3
185
MEASURES ON TOPOLOGICAL SPACES
functions in C(c2), then E+(f +) - E''(f -) = E+(g) - E+(h) by (1), so the extension is well-defined. If f >- 0, f c C(Q), define
E-(f) = -inf{E(g): 0
E-(f) _ -inf{E(f) - E(f -g): 0
g e C((2)}
-E(f) + sup(E(h): 0 < h < f, h e C(Q)}
_ -E(f) +
E+(f).
Thus E=E+-E-. To prove that p is unique, assume that t is a finite signed measure on .W(S2) such that In f dr = 0 for all f e C(Q). Then So f dT+ = In f dT- for all
f e C(Q), hence T+ = t- (so t = 0) by 4.3.9. Uniqueness of A is proved similarly, using 4.3.10.
Now if p is any finite signed measure on .4(Q), E(f) = fn f dp defines a continuous linear functional on C(Q), so by what we have just proved there is a unique regular finite signed measure A on 94(Q) such that Sa f du = In f dl for all f e C(Q). But as in 4.3.12, this condition is equivalent to p = A on .W(Q), so p has a unique extension to a regular finite signed measure A on 94(Q). 1 Theorems 4.3.9, 4.3.10, and 4.3.13 are referred to as versions of the Riesz representation theorem. [This name is also given to the somewhat different result 3.3.4(a).] A result of this type for complex-valued functions and complex measures is given in Problem 6. We are going to show that II E 11 = I µ (i2)
A 1 (Q) in 4.3.13. To do this
we need a result on the approximation of Borel measurable functions by continuous functions. Theorem. Consider the measure space (S2, F, p), where Q is a normal topological space, 51-' = 94(Q), and p is a regular measure on F. If 0 < p < oo, 4.3.14
s > 0, and f e L"(Q, F, p), there is a continuous complex-valued function g e L°(S2, .°r, p) such that Ilf - gllp < e; furthermore, g can be chosen so that sup I g I <_ sup I f 1. Thus the continuous functions are dense in L". PROOF. This is done exactly as in 2.4.14, except that the application of Prob-
lem 12, Section 1.4, is now replaced by the hypothesis that p is regular. I
4
186
4.3.15
THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
Theorem. In the Riesz representation theorem 4.3.13, IIEII = I N I (Q)
_
I21(L)).
PROOF. If f e C(S2), E(f) = fa f d2 = Jn f d l+ - fa f d2 -; hence
IE(f)I < fnIll where II
II
d2+
+fnIJI
d2 = fn IfI dI21
is the sup norm. Thus IIEII < IAI(Q)
Now let A,, ... , A,, be disjoint measurable subsets of S2, and define f = L;=, MA,, where x; = 1 if 2(A) > 0, and x; = -1 if 2(A) < 0. By 4.3.14, if s > 0, there is a continuous function g such that Ilgll <- 1 and Jn If - g J dI 2I < e; hence E(g) = Ja g d2 > f a f dl - s. But fn
f d2 =
I2(A) I 1
hence
IIEII >- E(g) >- Y I2(A;)l - c.
But Y;_, 12(A;) J may be taken arbitrarily close to 12I (b2) (see Problem 4, Section 2.1); hence IIEII >- J 2I (S2) Since 12I (f) = I p I (fl), the result follows. I
If S2 is compact Hausdorff and M(0) is the collection of finite signed measures on d(L) (or equally well the regular finite signed measures on 2(f2)), Theorems 4.3.13 and 4.3.15 show that the map E -+,u (or E -+ A) is an isometric isomorphism of the conjugate space of C(S2) and M(il), where the norm of an element u e M(fl) is taken as I u I (0).
We close this section with some further results on approximation by continuous functions.
Theorem. Let u be a regular finite measure on normal. If f is a complex-valued Borel measurable function on S2 and 6 > 0, there is a continuous complex-valued function g on S2 such that 4.3.16
u{w:f(w) # g(o)} < 6. Furthermore, it is possible to choose g so that sup I g 1 < sup I f I .
PROOF. First assume f is real-valued and 0 5f < 1. If h"(w) = (k - 1)2-" when (k - 1)2-" < f(w) < k2-", k = 1, 2, ... , n2", h"(w) = n when f(w) >- n, the h" are nonnegative simple functions increasing to f. Let f" = h" - h"_,,
4.3
MEASURES ON TOPOLOGICAL SPACES
187
n = 1, 2, ... (with ho = 0), so that f = Y , f". Note that f" has only two possible values, 0 and 2-". If A" _ {f" # 01, let C. be a closed subset of A,, and V,, an open overset of A. such that µ(V" - C") < 62-". Since S2 is normal, there is a continuous g": S2 -+ [0, 1] such that g" = I on C. and g" = 0 off V". If g = Yn , 2-"g", then by the Weierstrass M-test, g is a continuous map of n into [0, 1]. We claim that if w 0 U' , (V" - C"), a set of measure less than 6, then f(w) = g(w). To see this, observe that for each n, w e C. or co 0 V.. If co e C,, c A,,, then 2-"g"(co) = 2-" = f"(co), and if co 0 V", then 2-"g"(co) = 0 = "(w) since co 0 A,,. This proves the existence of g when 0 < f < I ; the extension to a complex-
valued bounded f is immediate. If f is unbounded, write f = fI{ifI<"} + .f I { I f 1 >_ "} =11 + f2, where f, is bounded and µ{ f2
0} = µ{ I f I > n}, which
can be made less than 612 for sufficiently large n. If g is continuous aid µ{ f, # g} < 6/2, then µ{ f g} < 6, as desired. Finally, if If I < M < oo, and g approximates f as above, define gl(w) _ g((9) if I g(w) l < M, g1(w) = Mg(w)I I g(co) I if I g(w) I > M. Then g, is continuous, I g, I < M, and f(w) = g(w) implies I g(w) I < M; hence gl(w) _ g(w) = f (w). Therefore µ{ f 96 g1} < p{f # g} < 3, completing the proof.
4.3.17
Corollaries. Assume the hypothesis of 4.3.16.
(a) There is a sequence of continuous complex-valued functions f" on 0 converging to f a.e. [µ], with If. I < sup If I for all n. (b) Given e > 0, there is a closed set C c S2 and a continuous complexvalued function g on S2 such that µ(C) ? µ(S2) - e and f = g on C, hence the restriction off to C is continuous. If p has the additional property that µ(A) = sup{p(K): K e A, K compact) for each A e 64(Q), then C may be taken as compact. PROOF. (a) By 4.3.16, there is a continuous function f" such that If. I < M = sup If I and µ{ f" 96 f } < 2 -". If A,, = {f, f) and A = lim sup" A" , then
p(A) = 0 by the Bore[-Cantelli lemma. But if co 0 A, then f(w) =f(w) for sufficiently large n. (b) By 4.3.16, there is a continuous g such that µ{ f # g} < e/2. By regu-
larity of µ, there is a closed set C e f f = g} with µ(C) >- µ{ f = g} - e/2. The set C has the desired properties. The proof under the assumption of approximation by compact subsets is the same, with C compact rather than closed. Corollary 4.3.17(b) is called Lusin's theorem.
4
188
THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
Problems I.
2.
Let F be a closed subset of the metric space Q. Define f (w) = e-'(°" F) where d(w, F) = inf{d(w, y): y e F}. Show that the f are continuous and f 1 IF. Use this to give a direct proof (avoiding 4.3.2) that in a metric space, the Baire and Bore] sets coincide. Give an example of a measure space (0, #;, µ), where 12 is a metric space and .F = R(S2), such that for some A e .F, u(A) 96 sup{p(K): K c A, K compact}.
3.
In 4.3.14, assume in addition that S2 is locally compact, and that µ(A) _ sup{p(K): K compact subset of A} for all Borel sets A. Show that the
continuous functions with compact support (that is, the continuous functions that vanish outside a compact subset) are dense in L°(S2, W, g), 0 < p < co. Also, as in 4.3.14, if f e LP is approximated by the continuous
function g with compact support, g may be chosen so that supIgI 5 supifI. 4.
Let fl be a normal topological space, and let H be the smallest class of real-valued functions on a that contains the continuous functions and is closed under pointwise limits of monotone sequences. Show that H is the class of Baire measurable functions, that is, H consists of all f: (0, sd) - (R, R(R)) (use 4.1.4). (b) If H is as in part (a) and a(H) is the smallest a-field 5 of subsets of n (a)
making all functions in H measurable (relative to 5 and R(R)), show that a(H) = s?(f); hence a(H) is the same as a(C(a)). 5.
Let S2 be a normal topological space, and let Ko be the class of all continuous real-valued functions on Q. Having defined K. for all ordinals jf less than the ordinal a, define
K,, =U{K,,:/3
Baire measurable functions. 6.
Let E be a continuous linear functional on the space C(Q) of all continuous complex-valued functions on the compact Hausdorff space Q. Show that there is a unique complex measure p on d(S2) such that E(f) = !Q f du for all f e C(a), and a unique regular complex measure A on R(Q) such that E(f) = fn f dA. for all f e C(fl). Furthermore, IIEII =
4.4
MEASURES ON UNCOUNTABLY INFINITE PRODUCT SPACES
189
p I (Q) = 12I (S2), so that C(S2)* is isometrically isomorphic to the space of complex measures on .4(S2), or equally well to the space of regular complex
measures on R (Q). (If p = p, + iµ2 is a complex measure, in f dp is defined as J0 f dµ, + '10 f 4142 provided f is integrable with respect to p1 1
and p2. Also, p is said to be regular if p, and p2 are regular; since I P1 1, I P2 I < I p 1 <- 191 I + I P2 1, this is equivalent to regularity of I P See Section 2.2, Problem 6, and Section 2.4, Problems 10 and 11 for the basic properties of complex measures.) 7. Let M(S), 9) be the collection of finite signed measures on a a-field .9 of subsets of 0. Show that if we take JIM 11 = l y I (fl), it e M(S), JF), M(f), f) becomes a Banach space. (A similar result holds for the collection of complex measures.)
4.4 Measures on Uncountably Infinite Product Spaces
In Section 2.7 we considered probability measures on countably infinite product spaces. The result may be extended to uncountable products if certain topological assumptions are made about the individual factor spaces.
The product of uncountably many a-fields is formed in essentially the same way as in the countable case.
Definitions and Comments. For t in the arbitrary index set T, let (Q, Jr,) be a measurable space. Let Fit E T Q, be the set of all functions 4.4.1
w = (w(t), t e T) on T such that w(t) e !Q, for each t e T. If t1, ..., t" e T and B" e fl_ , fl,, , we define the set B"(t,, ... , t") as {w a f , E TO,: (w(tl), .... w(t")) e B"}. We call B"(t,, ... , t") the cylinder with base B" at (t,, ... , t"); the cylinder is said to be measurable if B" e fi=, If B" = B, x x B,,, the cylinder is called a rectangle, a measurable rectangle if B; a i = 1, ... , n. Note that if all Q, = Q, then Fit E T 0, = S T, the set of all functions from T
too.
For example, let T = [0, 1], Q, = R for all t e T, B2 = ((u, v): u > 3, 1
B2(4, j)_(xaRT:x(f)>3, 1 <x(j)<2} [see Fig. 4.1, where x, a B2(f, *) and x2 0 B2(-, i)]. Exactly as in 2.7.1, the measurable cylinders form a field, as do the finite
disjoint unions of measurable rectangles. The minimal a-field over the measurable cylinders is denoted by lit c T F,, and called the product of the o-fields .F,. If Q, = S and 9, = So for all t, fl, c T 9, is denoted by ,9T Again as in 2.7.1, fl, E,. 9, is also the minimal a-field over the measurable rectangles.
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
190
3
2
x,
3
0
2
4
Figure 4.1.
We now consider the problem of constructing probability measures on be a finite , The approach will be as follows: Let v = {t1, ..., < t . (If T is not a subset of R, some fixed subset of T, where t, < t2 < total ordering is put on T.) Assume that for each such v we are given a probability measure P on J];_, . ',,; is to represent P{w e f, e T ill: (w(t1), ... , w(tn)) e B}. We shall require that the P be "consistent"; to see what kind of consistency is needed, consider an example. Suppose T is the set of positive integers and 0, = R, F, = R(R) for all t. Suppose we know P1 2345(B5) = P{w: (w,, w2, w3, w4i ws) E B5) for all B5 a R(R5). Then P{w: (w2, cu3) e B2) = P{uw (w1, (02, (03, w4, (05) e R x B2 x R2} = P12345(R x B2 x R2), B2 a R(R2). Thus once probabilities of sets involving the first five coordinates are specified, probabilities of sets inH, E r
.
volving (C02, w3) [as well as (Co,, (03 , w4), and so on], are determined. Thus the original specification of P23 must agree with the measure induced from
P12345 We are going to show that under appropriate topological assumptions, a consistent family of probability measures P determines a unique probability measure on fl, E T ."T, .
Now to formalize: If v = {t,, ..., to}, t, < .. < t , the space (fir
52,,,
If u = (ti,, ..., tik) is a nonempty subset of v and y = (y(t1), ... , y(tn)) a fl,,, the k-tuple (y(til),... , y(tik)) is denoted by yn . H1=1 .F,) is denoted by
Similarly if w = (w(t), t e T) belongs to fit E T S2 the notation to, will be used for (w(t1), ..., w(tn)). the projection of P on F. is the If PE is a probability measure on probability measure [n,,(P,,)](B) =
n
defined by e a,,: yn e B),
B e .F..
4.4
191
MEASURES ON UNCOUNTABLY INFINITE PRODUCT SPACES
Similarly, if Q is a probability measure on fl E T F , the projection of Q on SS is defined by r
-7
l
[7ru(Q)](B) = Q(w c- 11 Sgt: w e B} = Q(B(v)), tET I
B E F,,.
1111
We need one preliminary result.
Theorem. For each n = 1, 2, ..., suppose that .y" is the class of Borel sets of a separable metric space fl.. Let n = H. fl., with the product topology, 4.4.2
and let F = a(Q). [Note that S2 is metrizable, so that the Baire and Borel sets of S2 coincide; we may take
-
d(x, y) _
n
d"(x", y.) 2" 1 + d"(x", y")
where d" is the metric of fl,,. Also, if each fl. is complete, so is S2.]
Then F is the product a-field f" F. PROOF. The sets {w E S2: w, e A,, ... , (0" E A"}, n = 1, 2, ... , where the A;
range over the countable base for S2i (recall that separability and second countability are equivalent in metric spaces), form a countable base for 0. Since the sets are measurable rectangles, it follows that every open subset of 0
belongs to f" F"; hence .F c [" F.. On the other hand, for a fixed positive integer i let' = (Be R(S2;): {co e n: w; E B} E F}. Then ct° is a u-field containing the open sets of 0;, hence ' = R(f). In other words, every measurable rectangle with one-dimensional base belongs to F. Since an arbitrary measurable rectangle is a finite intersection of such sets, it follows that
We are now ready for the main result. 4.4.3
Kolmogorov Extension Theorem. For each t in the arbitrary index set T,
let 0, be a complete, separable metric space, and F, the Borel sets of Sgt . Assume that for each finite nonempty subset v of T, we are given a probability measure P,, on Assume the P are consistent, that is, P. for each nonempty u t= v. Then there is a unique probability measure P on .F = fit
cT
F, such that
7ct,(P) = P,, for all v.
PROOF. We define the hoped-for measure on measurable cylinders by P(B"(v)) =
B" a F,, .
192
4
THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
We must show that this definition makes sense since a given measurable cylinder can be represented in several ways. For example, if all S2, = R and B2 = (- oo, 3) x (4, 5), then B2(tl, 12) = {w: (0(t,) < 3,
4 < w(12) < 5) _ {w: w(t,) < 3, 4 < w(t2) < 5, = B3(t,, t2 i 1, )
w(13) a R}
where B3 = (- oo, 3) x (4, 5) x R.
It is sufficient to consider dual representation of the same measurable cylinder in the form B"(v) = B"(u) where k < n and u e v. But then
by the consistency hypothesis P"(B") = by definition of projection. = PJy e 52,,: y,, e Bk)
But the assumption B"(v) = B'(u) implies that if y e Q,,, then y e B" if y a Bk, hence P"(B") = P is well-defined on measurable cylinders; the class .moo of measurable cylinders forms a field, and a(.Fo) = ,F. Now if A,, ..., A. are disjoint sets in moo, we may write (by introducing
extra factors as in the above example) A; = B;"(v), i = 1, ..., m, where v = {t,, ..., r"} is fixed and the B;", i = 1, ..., m, are disjoint sets in SF, Thus
P(`U A;) = PI `U1B;"(v)) m
UB, n
Pv +
by definition of P
=1
P is a measure m
_
P(A;)
again by definition of P.
Therefore P is finitely additive on fo . To show that P is countably additive on .tea , we must verify that P is continuous from above at 0 and invoke 1.2.8(b). The Caratheodory extension theorem (I.3.10) then extends P to F. Let Ak, k = 1, 2, ... be a sequence of measurable cylinders decreasing to 0. If P(Ak) does not approach 0, we have, for some e > 0, P(A,,) >_ e > 0 for all k. Suppose Ak = B"k(vk); by tacking on extra factors, we may assume that the numbers nk and the sets vk increase with k. By 4.4.2, each S2"k is a complete, separable metric space and `Fvk =
*010.
It follows from 4.3.8 that we can find a compact set C"k c B"k such that Pvk(B"k - C"k) < Define Ak' = C"k(vk) e Ak. Then P(Ak - Ak') e/2k+1.
4.4 MEASURES ON UNCOUNTABLY INFINITE PRODUCT SPACES
193
P,,,, (B "k - C-) < e/2k+'. In this way we approximate the given cylinders by cylinders with compact bases. Now take nA2n...n,gk=Ak.
Dk=A1'nA2'n...nAk'cA,
Then P(Ak - Dk) = Pi Ak
U Aj) < > P(Ak (-i A;`) 1=1
1=1
k
k
Y P(A, - A;) < 1=1
e/21+1 < e/2. 1=1
Since Dk c: Ak' c Ak, P(Ak - Dk) = P(A,,) - P(Dk), consequently P(Dk) > P(Ak) - e/2. In particular, Dk is not empty.
Now pick xkeDk,k=1,2,....SayA1'=t") =C"'(v1)(note
all Dk c A 1'). Consider the sequence
(L xt,, ... , xt",), 1
(X2, (x,,, ... , X2,), xr",),
3 (4,, ... , x ),
that is, x/'/,, x2,,
Since the x', belong to C"', a compact subset of 1 0,,, we have a convergent subsequence x,,;" approaching some x,,, e C"'. If A2' = C"2(v2) (so Dk c A2' for k z 2), consider the sequence X11 1, e,", ... e C"2 (eventually), and extract a convergent subsequence xv2" -+ e C"2. Note that (x'2"), , = x12"; as n -+ oo, the left side approaches and since {r2n} is a subsequence of {r1 }, the right side approaches x,,,. Hence (xU2)V, = x,,,.
Continue in this fashion; at step i we have a subsequence x';" -- x,,, e C"',
and
for j < i. x,, for all j = 1, 2, ... (such a
(x,,)f =
Pick any co e fl: E T 0, such that j < i). Then co,,, e C"' for each j; hence
choice is possible since (x,,,)vj =
we nA,'c nA,=Qf,
j=t a contradiction. Thus P extends to a measure on F, and by construction, P for all v. j=1
Finally, if P and Q are two probability measures on .` such that for all finite v c T, then for any B" e P(B"(v)) = [ir,,(P)](B") =
Q(B"(v)).
Thus P and Q agree on measurable cylinders, and hence on Sr by the uniqueness part of the Caratheodory extension theorem.
4
194
THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
Problems
In Problems 1-7, (S) .F,) is a measurable space for each t e T, and 1.
Let p, be the projection map of () onto SZ that is, p,(w) = w(t). If (S, 9o) is a measurable space and P. S -+ S2, show that f is measurable iff p, o f is measurable for all t.
2.
If all n, = R, all F, = R(R), and T is a (nonempty) subset of R, how many sets are there in F? Show that if B e y , then membership in B is determined by a countable
3.
number of coordinates, that is, there is a countable set Tae T and a set B0 E FT, = j 1, E T. 'F, such that co e B if CT,, E B0 , where OT0 = (w(t), t E To). 4.
If T is an open interval of reals and fl, = R (or R), F, = .1(R) (or R(R)) for all t, use Problem 3 to show that the following sets do not belong to ,F: (a) {co: co is continuous at to}, where to is a fixed element of T. (b) {w: SUP. t;b w(t) < c}, where cc R and [a, b] c T
5.
Assume each Q, is a compact metric space, with .F, the Baire (= Borel)
subsets of 0, . Then by the Tychonoff theorem, f2 is compact in the topology of pointwise convergence. Show that F is the class of Baire sets of fl, in other words, .<J, E T ,it) = [: E T d411), as follows: (a)
If A = {co e n: w(t) E F}, F a closed subset of Q,, show that A = {w a ): f(co) = 0) for some f c- C(S)). Conclude that F a .ra1(S2).
(b)
6.
Use the Stone-Weierstrass theorem to show that the functions
f e C(Q) depending on only one coordinate [that is, f(w) = g,(co(t)) for some t, where g, e C(S2,)] generate an algebra that is dense in C(S2). Conclude that 4(S2) c ,F. Assume T is an open interval of reals, and (f2 F,) = (R, R(R)) for all t; thus n = RT, .f = A(R)T. Let A = {co e 92: co is continuous at t0), where to is a fixed point of T. (a) Show that A is an F,a (a countable intersection of F, sets); hence A e R(f2). (b)
7.
Show that A 0 d(fl), so that we have an example of a compact
Hausdorff space in which the Baire and Borel sets do not coincide. (Alternative proof of the Kolmogorov extension theoremt) Assume the hypothesis of 4.4.3, with the stronger condition that each fl, is a compact metric space. Put the topology of pointwise convergence on Q. (a) Let A be the set of functions in C(S2) that depend on only a finite number of coordinates; that is, there is a finite set v c T and a cont Nelson. E., Ann. of Math. 69, 630 (1959).
4.4 MEASURES ON UNCOUNTABLY INFINITE PRODUCT SPACES
195
tinuous g: 12 -+ R such that f(w) =
w e 12. Use the StoneWeierstrass theorem to show that A is dense in C(12). (b) If f e A, define E(f) = fag dP,,. Show that E is well-defined and extends uniquely to a positive linear functional on C(Q). Since E(l) = 1, the Riesz representation theorem 4.3.9 yields a unique probability
measure P on An) (= f I, E T .F, by Problem 5) such that E(f) _ (c)
fn f dP for all f e C(Q). Let v be a fixed finite subset of T, and let H be the collection of all functions g: (fl, F.,) --+ (R, E(R)) such that if f(w) = co e 12,
then J, f dP = in g
8.
Show that IA e H for each open set
A e 12,,, and then show that H contains all bounded Borel measurable functions on (Q., ,F.). Conclude that P,,. (Uniqueness of P is proved as in 4.4.3.) The metric space Q is said to be Borel equivalent to a subset of the metric space Q' i1T there is a one-to-one map f: Q -+ Q' such that E = f (Q) e R(12)
and f and f -' are Bore] measurable. [Measurability of f -' means that f -' : (E, R(E)) -+ (0, R(Q)).] (a) Let Q he a complete separable metric space with metric d. (It may be assumed without loss of generality that d(x, y) < 1 for all x, y, since the metric d' = d1(1 + d) induces the same topology as d and is also complete.] Denote by [0, 1]°° the space of all sequences of real numbers with components in [0, 1], with the topology of pointwise convergence. (This space is metrizable; explicitly, we may take the metric as °° I I xn do(X, y) = nE 2n 1 + Ix,,
yn I
If D = {w,, (02 , ...) is a countable dense subset of 12, define ... ). Show that f is continuous and one-to-one, with a continuous inverse.
f: 12 --+ [0, 11' by f (w) = {d(w, wn), n = 1, 2,
(b) Show thatf(1)) is a Borel subset of [0, 1]°°; thus n is Borel equivalent
to a subset of [0, 1]'. (c)
Let S = {0, 1}, and let 6" consist of all subsets of S. Show that there is a map g: ([0, 1), 4[0, 1)) --+ (S°°, .9"°) such that g is one-to-one,
g[0, 1) e Y', and both g and g`' are measurable. (d) Show that ([0, 1], R[0, 1]) and (S°°, S'°) are equivalent, that is,
there is a map h: [0, 1] -+ S°° such that h is one-to-one onto, and h and h-' are measurable. (e)
If (fl, Pn) is equivalent to (Se, 9n), with associated map hn, n = 1, 2, ..., show that (ln 12n, H. ,F.) is equivalent to (fln Sn, r l. .9'n). Thus by (d), ([0, 1]°°, (-4[0, 11)°°) is equivalent to (S'°, Y').
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
196
Now by 4.4.2, (9[0, 1 ])°° is the minimal a-field over the open sets of [0, 1]Z, that is, (-4[0, 1])°° is the class of Borel sets _4([0, 1]°°). It follows from these results that if 0 is a complete, separable metric space, S1 is Borel equivalent to a (Bore]) subset of [0, 1].
4.5 Weak Convergence of Measures
By the Riesz representation theorem, a continuous linear functional on C(S2), where S2 is compact Hausdorff, may be identified with a regular finite signed measure on R(f2). Thus if {p,,} is a sequence of such measures, weak*
convergence of the sequence to the measure p means that In f dµ - In f dp for all f e C(O). In this section we investigate this type of convergence in a somewhat different context; 91 will be a metric space, not necessarily compact, and all measures will be nonnegative. The results form the starting point for
the study of the central limit theorem of probability.
Theorem. Let p, Pi, 102, ... be finite measures on the Borel sets of a metric space Q. The following conditions are equivalent:
4.5.1
(a) $ n f dun -> Jn f dp for all bounded continuous f: 51- R. (b) lim inf, In f dun >_ fa f dp for all bounded lower semicontinuous
f.n->R.
(b') urn sups . oo in f dun < Jn f du for all bounded upper semicontinuous f: S2 - R. (c) 5 n f dun -f n f du for all bounded f: (s2, (fz)) - (R, R(R)) such that f is continuous a.e. [p]. (d) lim inf, pn(A) >_ p(A) for every open set A (-_ S2, and un(Q) -' u(n) (d') lim sup, u (A) 5 u(A) for every closed set A c f , and
inn0 -.41).
(e) u,,(A) - u(A) for every A e.4(Q) such that p(aA) = 0 (aA denotes the boundary of A).
PROOF. (a) implies (b):
If g < f and g is bounded continuous,
liminf f fdp,,_liminf f n-oo
12
n
by (a).
But since f is lower semicontinuous (LSC), it is the limit of a sequence of con-
tinuous functions, and if If < M, all functions in the sequence can also be
taken less than or equal to M in absolute value. (See the appendix on general topology, Section A6, for the basic properties of semicontinuous
4.5
WEAK CONVERGENCE OF MEASURES
197
functions.) Thus if we take the sup over g in the above equation, we obtain (b). (b) is equivalent to (b'): Note that f is LSC if -f is upper semicontinuous (USC). (b) implies (c): Let f be the lower envelope off (the sup of all LSC
functions g such that g < f) and f the upper envelope (the inf of all USC functions g such that g >: f). Since f(x) = lim infy.x f(y) and f (x) = lim sup.,-.,f (y), continuity off at x implies f (x) =f(x) =J(x). Furthermore, f is LSC and f is USC. Thus if f is bounded and continuous a.e. [µ],
f f dµ = f f dµ 5 Jim inf f f dµn n
n-oo
s1
n
Slim inf f f dµn n
by (b)
since f 5 f
S lim sup f f dµn a n- 00
Slim sup f f dµn n-c
n
since f < f
S fn fdi
by (b')
= f f dp,
proving (c).
(c) implies (d): Clearly (c) implies (a), which in turn implies (b). If A is open, then IA is LSC, so by (b), lim inf,,-. pn(A) >- µ(A). Now In - 1, so pn(Q) -+ fi(Q) by (c)-
(d) is equivalent to (d'): Take complements. (d) implies (e): Let A° be the interior of A, A the closure of A. Then iim sup pn(A) S lim sup pn(A) S µ(A) n- oo
by (d')
n- 00
= µ(A)
by hypothesis.
Also, using (d), lim inf pn(A) >_ lim inf pn(A°) > p(A°) = p(A). n- ao
n- cc
Let f be a bounded continuous function on Q. If If < M, let A = {c a R: p(f -1{c)) # 0}; A is countable since the f -'{c} are disjoint and p is finite. Construct a partition of [- M, MI, say - M = to < t, < < tj = M, with t; 0 A, i = 0, 1, ..., j (M may be increased if necessary). If B, = {x: t; 5 f(x) < ti.,.1}, i = 0, 1, ..., j - 1, it follows from (e) that J-1 i-^1 /_ ti pn(Bi) - Y- ti y(Bi) i=0 (e) implies (a) :
i=0
4 THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
198
[Since f -'(ti, 1.+i) is open, of -' [ti, ti, I) c.f -'{ti, ti+i}, and {if -'{ti, ti+i} = 0 since ti, ti+, 0 A.] Now
fafdp -fnfdp
S
ti pn(Bi) J J dju. - Li=0 S2 2
+
I'Y-
+
[tiIt(Bi) - Jn f d4
t=0
ti p,,(B.) - y_ ti p(B.)I i=0
The first term on the right may be written as j_1
E
1
i=0
J Bt
(f(x) - ti)
-
and this is bounded by maxi(ti+i which can be made arbitrarily small by choice of the partition since p (S1) -+ p(fl) < oo by (e). The third term on the right is bounded by max.(ti+i - ti)p(S2), which can also be made arbitrarily small. The second term approaches 0 as n -+ co, proving (a). I 4.5.2
Comments.
Another condition equivalent to those of 4.5.1 is that
In f dp - fn f du for all bounded uniformly continuous f: it -* R (see Problem 1).
The proof of 4.5.1 works equally well if the sequence is replaced by a net. The convergence described in 4.5.1 is sometimes called weak or vague convergence of measures. We shall write
p
p are defined on e(R), there are corresponding
distribution functions F and F on R. We may relate convergence of measures to convergence of distribution functions.
Definition. A continuity point of a distribution function F on R is a point x e R such that F is continuous at x, or ± oo (thus by convention, oo and - oo are continuity points). 4.5.3
Theorem. Let p, Al, P2' ... be finite measures on £(R), with corresponding distribution functions F, F,, F2, .... The following are equivalent:
4.5.4
(a) p w' p.
(b) F (a, b] - F(a, b] at all continuity points a, b of F, where F(a, b] = F(b) - F(a), F(co) = lim, . F(x), F(-oo) = limx.._,,, F(x).
4.5
199
WEAK CONVERGENCE OF MEASURES
If all distribution functions are 0 at - oo, condition (b) is equivalent to the statement that F,,(x) -+ F(x) at all points x E R at which F is continuous, and F (oo) --, F(oo).
(a) implies (b): If a and b are continuity points of F in R, then (a, b] is a Borel set whose boundary has p-measure 0. By 4.5.1(e), µn(a, b] -+ µ(a, b], that is, F,,(a, b] -+ F(a, b]. If a = - oo, the argument is the same, and if b = oo, then (a, oo) is a Borel set whose boundary has µ-measure 0, and the proof proceeds as before. (b) implies (a): Let A be an open subset of R; write A as the disjoint PROOF.
union of open intervals I1, 12, .... Then lim inf µn(A) = lim inf Z .U.(") n- '0
k
Y lim inf Pn(Ik)
by Fatou's lemma.
n-co
k
Let E > 0 be given. For each k, let Ik' be a right-semiclosed subinterval of Ik such that the endpoints of Ik' are continuity points of F, and u(Ik') >- µ(Ik) - c2-k; the Ik' can be chosen since F has only countably many discontinuities. Then by (b). lim inf µn(Ik) >- lim inf µn(Ik) = P(IO') n-oo
n- 00
Thus
liminfµn(A) n- oo
- Y_ p(Ik) - Y_µ(Ik)-e=µ(A)-e. k
k
Since a is arbitrary, we have µn '-+,u by 4.5.1(d). I
Condition (b) of 4.5.4 is sometimes called weak convergence of the sequence {Fn} to F, written Fn - F. Problems 1.
(a)
If F is a closed subset of the metric space Q, show that IF is the limit
of a decreasing sequence of uniformly continuous functions fn, with O!gf.
uniformly continuous P. S2 - R. Show that in 4.5.1, µn-" µ if µn(A) - µ(A) for all open sets A such that µ(OA) = 0.
3.
Let f be a locally compact metric space. If A c Q, A is said to be bounded
if A c K for some compact set K.
200
4
THE INTERPLAY BETWEEN MEASURE THEORY AND TOPOLOGY
If p, pi, P2' ... are measures on R(fl) that are finite on bounded Borel sets, we say that p,, p if in f dp -+ f a f dp for all continuous functions f: 0 -+ R with compact support. (The support off is defined by supp f = {x: f(x) 0 0); note that f has compact support if f vanishes outside a compact set.) Show that the following conditions are equivalent: (a)
pn w* p.
(b) p (A) -> p(A) for all bounded Borel sets A with µ(8A) = 0. (c) 5- f dµ, -> f n f dp for all bounded f:.0 -. R such that f has compact support and is continuous a.e. [p]. 4.6
References
The approach to the Daniell integral and the Riesz representation theorem given in Sections 4.2 and 4.3 is based on Neveu (1965). If the hypothesis that L contains the constant functions is dropped in the development of the Daniell integral, the situation becomes more complicated. However, a representation theorem somewhat similar to 4.2.9 may be proved under the assumption that f e L implies I A f c- L. For a detailed proof of this result (known as Stone's theorem), see Royden (1968, Chapter 13). There are other versions of the Riesz representation theorem appropriate in a locally compact Hausdorff space Q. If E is a positive linear functional
on the set CjS2) of continuous real-valued functions on f2 with compact support, there is a unique regular measure p on the Borel sets such that E(f) = fn f dp for each fin QS2). Here, regularity means that p is finite on compact sets, y(A) = i-if{p(V): V A, V open) for all Borel sets A, and p(A) = sup(p(K): K e A, K compact) for all Borel sets A which are either open or of finite measure. Also, if E is a continuous linear functional on the Banach space C0(Q) of continuous real-valued functions on 12 that vanish at oo (f vanishes at oo if, given e > 0, there is a compact set K such that If I < s off K), there is a unique regular finite signed measure on the Bore] sets such that E(f) = in f dp for all f e C0(Q); furthermore, 1(E11 = I P1 ((2).
As in the compact case, the result may be extended to complex-valued functions and complex measures, as in Problem 6, Section 4.3. Proofs are given in Rudin (1966).
In probability theory, there is usually no reason to replace compact by locally compact spaces in order to take advantage of a more general version of the Riesz representation theorem. For if we have a random experiment whose outcomes are represented by points in a locally compact space, we simply compactify the space.
For an account of the theory of weak convergence of measures, with applications to probability, see Billingsley (1968) and Parthasarathy (1967).
Appendix on General Topology
Al
Introduction
The reader is assumed to be familiar with elementary set theory, including basic properties of ordinal and cardinal numbers [see, for example, Halmos (1960)]. Also, an undergraduate course in point-set topology is assumed; Simmons (1963) is a suitable text for such a course. In this appendix, we shall
concentrate on aspects of general topology that are useful in functional analysis and probability. A good reference for collateral reading is Dugundji (1966).
Before proceeding, we mention one result, which, although usually covered in a first course in topology, deserves to be stated explicitly because of its fundamental role in the construction of topological vector spaces (see 3.5.1). Throughout the appendix, a neighborhood of a point x is an open set containing x, an overneighborhood of x is an overset of a neighborhood of x.
Al.l Theorem. Let S2 be a set, and suppose that for each x e n, we are given a nonempty collection V(x) of subsets of f) satisfying the following: (a) x e each U e 'K(x). (b) If U1, U2 E'Y''(x), then U1 n U2 E 7''(x). (c) If U e y''(x) and U c V, then V e '4''(x). 201
202
APPENDIX ON GENERAL TOPOLOGY
(d) If U e 'V (x), there is a set V e 'Y'-(x) such that V c U and U E 'K(y) for each y e V.
Then there is a unique topology on fl such that for each x, Y'(x) is the system of overneighborhoods of x. PROOF. If such a topology exists, a set U will be open if U is an overneighborhood of each of its points, that is, U e 1"(x) for each x e U. Thus it suffices to show that .f = { U (-_ Q: U e 71(x) for each x e U} is a topology, and for each
x, the overneighborhood system . V (x) coincides with 'V(x). If U, V e .l, then by (b), U n V E 1'(x) for each x e U n V, so U n V e J. If U, e .f for each i e I, then (c) implies that U{U;: i e I} E ; (c) yields S2 e 9' as well. Since 0 e 9- trivially, .fT is a topology. If U E .K(x), there is a set V e with x e V c U. But then U e 'V (x) by (c). Conversely, if U e *(x), let W = {x' e U: U e Y''(x)}. If x' a W, then by (d), there is a set V E *(X') with V c U and U e 11(y) for each y e V. But then V c W, so by (c), W e Y' (x'); consequently, W e by definition of I, and furthermore x e W by (a). Thus if U e Y''(x), there is a set W e .T with x e W c U; hence U e .K(x). For the remainder of the appendix, V(x) will always stand for the collection of neighborhoods of x.
A2 Convergence
If Q is a metric space, the topology of f) can be described entirely in terms of convergence of sequences. For example, a subset A of S2 is closed n = 1, 2, ...} is a sequence of points in A and x - x, we have iff whenever x e A. Also, x e.4, the closure of A, if there is a sequence of points in A converging to x. This result does not generalize to arbitrary topological spaces. A2.1
Example. Let a be the first uncountable ordinal, and let S2 be the set of
all ordinals less than or equal to a (recall that for ordinals, a < b means a e b). Put the order topology on 0; this topology has as a base the sets S2 n (a, b) = {x e 92: a < x < b} where a and b are arbitrary ordinals.
We show that a belongs to the closure of f2 - {a}, but no sequence in S2 - {a} converges to a. If U is a neighborhood of a, then for some a, b, we have a r: S2 n (a, b) a U. Now a < a < b; hence a is countable, and therefore so is a + 1 . Thus a + 1 E U n (S2 - {a}), proving that U E 0 - {a}. But if x,, n 0 - {a}, n = 1, 2, ..., then each x is countable; hence so is c = sup x,,.
A2 CONVERGENCE
203
Since c < a, V = (c, a] is a neighborhood of a and x is never in V, so that the sequence cannot possibly converge to or. In order to describe an arbitrary topology in terms of convergence, we must consider objects more general than sequences. A sequence is a function on the positive integers; the desired generalization, called a "net" or " generalized sequence," is a function on a directed set.
Definitions. A directed set is a set D on which there is defined a preordering (a reflexive and transitive relation), denoted by <-, with the property that whenever a, b c- D, there is a c e D with a < c and A2.2
b < c. A net in a topological space f is a function from a directed set D into Q. A net will be denoted by {x, n e D} or simply by The net is said to converge to the point x if for every neighborhood U of x, the net is eventually in U, that is, there is an no e D such that x e U for all n e D such that
n>-n0. The basic relations between convergence and topology in metric spaces can now be generalized to arbitrary topological spaces. A2.3
Theorem. Let A be a subset of the topological space fi.
(a) A point xe S2 belongs to A if there is a net in A such that x - x. (b) A is closed if for every net in A such that x,, -+ x, we have x c- A. (c) A point x e r) is a cluster point of A (that is, every neighborhood of x contains a point of A other than x) if there is a net in A - {x} converging to X.
If x e A and x - x, let U E IW(x). Then x is eventually in U, in particular U n A 0, and thus x e A. Conversely, if x e A, then for each U e *(x), choose xv e U n A. Then {xv} becomes a net in A (with U:!5; V if PROOF. (a)
U=> V) and xv -x. (b) Suppose that A is closed. If x e A, x - x, then by (a), x e A; thus by hypothesis, x e A. Conversely, if A is not closed, let x e A - A. By (a) we can find x a A, x,, x. Since x 0 A, the result follows. (c) If x e A - {x}, x -> x, then if U E W(x), x is eventually in U, hence U n (A - {x}) 96 0, and thus x is a cluster point of A. Conversely, if x is a cluster point of A, then for each U e Qe'(x), choose xv c- U n (A - {x}); the xv form a net in A - {x} converging to x. Comments. The reason that sequences are not adequate in A2.3 is that in choosing a point xv in each neighborhood U of x, we are in general forced to make uncountably many choices. This would not be necessary if S2 were A2.4
APPENDIX ON GENERAL TOPOLOGY
204
first countable. (A first countable space is one with a countable base of neighborhoods at each point; that, is, if x e S2, there are countably many neighborhoods V1, VZ , ... of x such that for each neighborhood U of x, we have V. c U for some n; by replacing V. by fl : i V;, we may assume without loss of generality that Vn+1 (-- V. for all n.) In A2.3, the proof will go through if we
simply choose x e V for n = 1, 2, .... Thus in a first countable space, sequences are adequate to describe the topology; in other words, A2.3 holds
with "net" replaced by "sequence." A criterion for openness in terms of nets may also be given: The set V in 92 such that x --> x e V, we have x e V evenis open if for every net tually. [The " only if " part follows from the definition of convergence; for the
"if" part, apply A2.3(b) to V`.] A2.5 Definitions. Let {x,,, n e D} be a net, and suppose that we are given a directed set E and a map k -* nk of E into D. Then {x,,,,, k e E } is called a subnet of {x,,, n e D}, provided that " as k becomes large, so does nk" ; that is, given no a D, there is a ko e E such that k >_ ko implies nk >_ no. If E = D = the positive integers, we obtain the usual notion of a subsequence. If {xn , n e D} is a net in the topological space .0, the point x e Q is called
an accumulation point of the net if for each neighborhood U of x, x is frequently in U; in other words, given n e D, there is an m e D with m z n
and xa U. A2.6 Theorem. Let {xn , n e D} be a net in the topological space Q. If x e S2, x is an accumulation point of (xn) if there is a subnet {xnk , k e E) converging to X.
PROOF. If xnk - x, U c- °I1(x) and n c- D, then for some ko a E, we have xnk E U for k >_ ko. But by definition of subnet, there is a k1 E E such that k _ k1 implies k n. Thus jfk _ koand k _ k1,we have nk>:nand x an accumulation point of {xn, n e D). Let E be the x
collection of pairs (n, U), where n e D, U is a neighborhood of x, and x E U. Direct E by setting (n, U) < (m, V) if n < m and U V. If k = (m, V) e E let nk = m. Given n and U, then if k = (m, V) >_ (n, U), we have nk = m >_ n, so that {xnk , k c- E} is a subnet of {xn , n c- D). Now if U isa neigh-
borhood of x, then x e U for some n e D. If k = (m, V) z (n, U), then xnk = x, e V c U; therefore
x. I
For some purposes, it is more convenient to specify convergence in a topological space by means of filters rather than nets. If {xn, n e D) is a net
A2 CONVERGENCE
205
in fl, and a e D, let Ta = {n a D: n >_ a}, and let x(T,) be the set of all x,,, n > a. The x(T0), a e D, are called the tails of the net. The collection sd of tails is an example of a filterbase, which we now define. Definitions and Comments. Let sd be a nonempty family of subsets of a set r). Then sd is called a filterbase in fl if
A2.7
(a) each U e sd is nonempty; (b) if U, V e sd, there is a W e sd with W e U n V.
If F is a nonempty family of subsets of 0 such that (c) each U E .°F is nonempty, (d) if U, V e F, then U n V e P, and (e) if U c.F and U c V, then V e Pr,
then .F is called a filter in n. If sd is a filterbase, then F = {U c S2: U e V for some V e d) is a filter, called the filter generated by sd. If sd is the collection of neighborhoods of a given point x in a topological space, sd is a filterbase, and the filter generated by sd is the system of overneighborhoods of x. A filterbase sd in a topological space fl is said to converge to the point x (notation sd x) if for each U E 611(x) there is a set A e sd such that A C U. A filter .F in ) is said to converge to x if each U e 611(x) belongs to F. Thus a filterbase sd converges to x if the filter generated by sd converges to X. If {xa , ii a D} is a net, then x -- x if for each U c-611(x) we have x(Ta) c U
for some a e D, that is, x -+ x if the associated filterbase converges to x. Convergence in a topological space may be described using filterbases instead of nets. The analog of Theorem A2.3 is the following: A2.8 Theorem. Let B be a subset of the topological space Q.
(a) A point x E S2 belongs to B if there is a filterbase din B such that -+ X.
(b)
B is closed if for every filterbase sd in B such that .4 ---, x, we have
xaB. (c) A point x E n is a cluster point of B if there is a filterbase in B - (x) converging to x. PROOF. (a)
If sd -+ x and U E 011(x), then A c U for some A E sd, in partic-
ular, U n B 0 0; thus x e B. Conversely, if x e B, then U n B 96 Q for each U e 611(x). Let sd be the collection of sets U n B, U e 611(x). Then sd is a filter-
base in Band sd -- x.
206
APPENDIX ON GENERAL TOPOLOGY
(b) If B is closed, W is a filterbase in B, and sl --+ x, then x e B by (a), hence x e B by hypothesis. Conversely, if B is not closed and x e B - B, by
(a) there is a filterbase sad in B with sad -+ x. Since x 0 B, the result follows. (c)
If there is such a filterbase a and U e °h(x), then U A for some
A e .W; in particular, U n (B - {x}) 96 0, so x is a cluster point of B. Conver-
sely, if x is a cluster point of B, let a consist of all sets U n (B - {x}), U e 1&(x). Then d is a filterbase in B - {x} and d -+ x. I
If fl is first countable, the filterbases in A2.8 may be formed using a countable system of neighborhoods of x, so that in a first countable space, the topology may be described by filterbases containing countably many sets. A2.9
Definitions. The filterbase 9 is said to be subordinate to the filterbase sad
if for each A e d there is a B e.4 with B c A; this means that the filter generated by d is included in the filter generated by B. If k e E} is a subnet of {x, n e D}, the filterbase determined by the subnet is subordinate to the filterbase determined by the original net. For if no e D, there is a ko e E such that k - ko implies nk >_ no. Therefore
k>-ko} c{x,,:neD, nzno}. If sat' is a filterbase in the topological space 0, the point x e r) is called an accumulation point of sat if U n A # 0 for all U e &Ii(x) and all A e W, in other words, x e A for all A e sad. We may now prove the analog of Theorem A2.6. A2.10 Theorem. Let sat be a filterbase in the topological space 0. If x e 0,
x is an accumulation point of d if there is a filterbase -4 subordinate to d with x; in other words, some overfilter of d converges to x.
a
PROOF. If -4 is subordinate to d and 1--+ x, let U e 61l(x), A e sat. Then U => B and A B, for some B, B, a a; hence U n A B n B,, which is nonempty since .4 is a filterbase. Therefore x e A. Conversely, if x is an accumulation point of sad, let .4 consist of all sets U n A, Ue °le(x), A e sad. Then
sat c 9 (take U = 91), hence 9 is subordinate to a; since a -+ x, the result follows. I A2.11
Definition. An ultrafilter is a maximal filter, that is, a filter included in
no properly larger filter. (By Zorn's lemma, every filter is included in an ultrafilter.)
A2 CONVERGENCE
A2.12
207
Theorem. Let .F be a filter in the set Sl.
(a) .F is an ultrafilter if for each A c Sl we have A E .F or A` a F. (b) If .F is an ultrafilter and p: Sl - Sl', the filter T generated by the
filterbase p(F) = {p(F): F e .F} is an ultrafilter in il'. (c) If S is a topological space and .F is an ultrafilter in 0, F converges to each of its accumulation points. If ,F is an ultrafilter and A 0 F, necessarily A n B = 0 for some B e F. For if not, let .4 consist of all sets A n B, B e .F; then sad is a filterbase PROOF. (a)
generating a filter larger than .F. But A n B = 0 implies B c A°; hence A` e .F. Conversely, if the condition is satisfied, let F be included in the filter W. If A e W and A 0 F, then A` a .F c T, a contradiction since
AnA`=0. (b)
Let A c SY; by (a), eitherp-1(A) e IF orp-1(A`) e .F. Ifp^1(A) a .F,
then A
pp-1(A) e p(.F); hence A e T. Similarly, if p-1(A°) a .F, then A` e T. By (a), 9 is an ultrafilter. (c) Let x be an accumulation point of .F . If U e R1(x) and U # .F, then U° e F by (a). But U n U° = 0, contradicting the fact that x is an accumulation point of .F. We have associated with each net {x,,, n e D} the filterbase {x(T4): a e D} of tails of the net, and have seen that convergence of the net is equivalent to convergence of the filterbase. We now prove a converse result.
Theorem. If sad is a filterbase in the set fl, there is a net in a such that the collection of tails of the net coincides with sad. A2.13
PROOF. Let D be all ordered pairs (a, A) where a e A and A e sad; define (a, A) S (b, B) iff B e A. If (a, A) and (b, B) belong to D, choose C e and with C e A n B; for any c e C we have (c, C) >: (a, A) and (c, C) Z (b, B), hence D is directed. If we set X(., A) = a we obtain a net in Sl with x(T(a, A)) = A. I
We conclude this section with a characterization of continuity. A2.14 Theorem. Let f: it -+ Q', where 0 and fl' are topological spaces. The
following are equivalent: (a) The function f is continuous on Sl; that is, f -1(V) is open in Sl whenever V is open in Sl'.
208
APPENDIX ON GENERAL TOPOLOGY
(b)
For every net
f(x).
in Q converging to the point x e S2, the net {
(c) For every filterbase d in fZ converging to the point x c- ), the filterbase f (sad) converges to f (x). PROOF. Let
be a net and 4 a filterbase such that the tails of the net
coincide with the elements of the filterbase. If, say, x(TQ) = A E s4, then n e D, n >_ a}. Thus the tails of the net { f coincide with f (A) _ { f the elements off (.a?). It follows that (b) and (c) are equivalent. If f is continuous and x -+ x, let V be a neighborhood of fl x). Then
f -'(V) is a neighborhood of x; hence x,, is eventually in f -'(V), so that f (x.) is eventually in V. Thus (a) implies (b). Conversely, if (b) holds and C is
closed in if, let
be a net in f -'(C) converging to x. Then f(x)
(b), and since C is closed we have f (x) e C by A2.3(b). Thus x e f -'(C), hence
f -'(C) is closed, proving continuity off. I A3 Product and Quotient Topologies
In the Euclidean plane R2, a base for the topology may be formed from sets U x V, where U and V are open subsets of R; in fact U and V can be taken to be open intervals, so that U x V is an open rectangle. If {(xn , y.),
n=1,2,...)
is a sequence in R2, then (x., (x, y) if x -> x and y -+ y, that is, convergence in R2 is "pointwise" or "coordinatewise" convergence. In general, given an arbitrary collection of topological spaces S2i, i E 1, let
Q be the cartesian product fi'EI f ,, which is the collection of all families (x;, i e I) ; that is, all functions on I such that x, a 0, for each i. We shall place a topology on S2 such that convergence in the topology coincides with pointwise convergence.
A3.l Definition. The product topology (also called the topology of point wise convergence) on S2 = fl; E r f2, has as a base all sets of the form
{xE):x1keUIk, k=1,...,n) where the Uik are open in S
and n is an arbitrary positive integer. (Since the
intersection of two sets of this type is a set of this type, the sets do in fact form a base.)
209
A3 PRODUCT AND QUOTIENT TOPOLOGIES
If pi is the projection of f2 onto f2i, the product topology is the weakest topology making each pi continuous; in other words, the product topology is included in any topology that makes each pi continuous. The product topology has the following properties: A3.2
Theorem. Let 0 =F11 E 1 fl,, with the product topology.
(a) If {x("), n c D} is a net in 0 and x e f2, then x(") -+ x iff x;") -+ xi for each i. (b) A map f from a topological space L20 into n is continuous if pi of is continuous for each i. (c) If fi: f2o --+ 1i , i e I, and we define f: 1o -> 0 by f (x) = (fi(x), i e I ), then f is continuous iff each fi is continuous. (d) The projections pi are open maps of f2 onto L2,.
If x(") --+ x, then x;") = pi(xl)) --+ pi(x) = xi by continuity of the pi. Conversely, assume x;"> - xi for each i. Let PROOF. (a)
V= {ye0:yikE Uik, k = 1,...,r}, be a basic neighborhood of x. Since xik E Uik , there is an nk e D with x(,k) E Uik for n >_ nk. Therefore, if n e D and n >_ nk for all k = 1, ..., r, we have x e V, so that xt"i -+ X. (b) The "only if" part follows by continuity of the pi. Conversely, assume each pi of continuous. If x(") -+ x, then pi(f (x("))) -+ pi(f (x)) by hypo-
thesis; hence f(P)) -f(x) by (a). (c) We have fi = pi o f, so (b) applies. (d) The result follows from the observation that pi{x a S2: xik E Uik ,
k = 1, ... ,
n}
{1i Uik
if i # any ik, if i = ik for some k.
Note that if 0 is the collection of all functions from a topological space S to a topological space T, then 0 = fii E 1 Qi, where I = S and 1i = T for all i. If {f,,) is a net of functions from S to T, and f: S --+ T, then f" -+f in the product topology iff f"(s) --+f(s) for all s E S. We now consider quotient spaces.
Definition. Let 0o be a topological space, and p a map of 0, onto a set f2. The identification topology on 0 is the strongest topology making p continuous, that is, the open subsets of S2 are the sets U such that p-1(U) is A3.3
210
APPENDIX ON GENERAL TOPOLOGY
open in no. When n has the identification topology, it is called an identification space, and p is called an identification map.
A quotient topology may be regarded as a particular identification topology. Let R be an equivalence relation on the topological space no, S2o/R the set of equivalence classes, and p: 0..0 - S2o/R the canonical projection: p(x) = [x], the equivalence class containing x. The quotient space of S2o by R is S2o/R with the identification topology determined by p. In fact, any identification space may be regarded as a quotient space. To see this, we need two preliminary results.
A3.4 Lemma. If n has the identification topology determined by p: 0o - S2, then g: S2 -> Q, is continuous iff g o p: 12o -- Q, is continuous. PROOF. The "only if" part follows from the continuity of p. If g e p is continuous and V is open in n1, then (g o p)-1(V) = p-1(g-1(V)) is open in no. By definition of the identification topology, g-1(V) is open in 0. 1
A3.5 Lemma. Let p: CIO -+ 0 be an identification, and let h: no -1, S21 be
continuous. Assume that h -p-' is single-valued, in other words, p(x) _ p(y) implies h(x) = h(y). Then h c p'1 is continuous.
PROOF. Since h = (h o p-1) o p, the result follows from A3.4. (Note that P_' is defined on all of 0 since p is onto.) Theorem. Let f: no - fi be an identification. Define an equivalence relation R on no by calling x and y equivalent iff f(x) = fly). Let p be the A3.6
canonical projection of no onto S2o/R. Then S2o/R, with the quotient topology,
is homeomorphic to n. PROOF. We have f(x) = f(y) if p(x) = p(y), so by A3.5, fop-1 and p of -1 are both continuous. Since these functions are inverses of each other, they define a homeomorphism of n and S2o/R. I The following result gives conditions under which a given topology arises from an identification.
Theorem. Let p be a map of 00 onto 0. If p is continuous and either open or closed, it is an identification, that is, the identification topology on r) determined by p coincides with the original topology on U. A3.7
A4 SEPARATION PROPERTIES
211
PROOF. Since p is continuous and the identification topology is the largest one
making p continuous, the original topology is included in the identification topology. If p is an open map and U is an open subset of 0 in the identifica-
tion topology, p-'(U) is open in fl,, hence p(p-'(U)) = U is open in the original topology. If p is a closed map, the same argument applies, with "open" replaced by "closed." A4 Separation Properties and Other Ways of Classifying Topological Spaces
Topological spaces may be classified as to how well disjoint sets may be separated, as follows. (The results of this section are generally discussed in a first course in topology, and will not be proved.)
Definitions. A topological space S2 is said to be a To space if given any two distinct points x and y, at least one point has a neighborhood not containing the other; f2 is a T, space if each point has a neighborhood not containing the other; .0 is a T2 (or Hausdorff) space if x and y have disjoint neighborhoods. This is equivalent to uniqueness of limits of nets (or filterbases). Also, C is said to be a T3 (or regular) space if i2 is T2 and for each closed set C and point x 0 C, there are disjoint open sets U and V with x e U and C c V; it is said to be a T4 (or normal) space if i2 is T2 and for each pair of disjoint closed sets A and B there are disjoint open sets U and V with A4.1
AcUand BcV.
It follows from the definitions that Ti implies T;_1i i = 4, 3, 2, 1. Also, the T1 property is equivalent to the statement that {x} is closed for each x. The
space f) is regular if it is Hausdorff and for each open set U and point x e U, there is a V c- 0&(x) with V c U. The space S is normal if it is Haus-
dorff and for each closed set A and open set U
with AcVc VcU.
A, there is an open set V
A metric space is T4, for if A and B are disjoint closed sets, we may take U = {x: d(x, A) - d(x, B) < 0}, V = {x: d(x, A) - d(x, B) > 0}, where d(x, A) = inf{d(x, y) : y e A}.
Urysohn's Lemma. Let S) be a Hausdorff space. Then 0 is normal if for each pair of disjoint closed sets A and B, there is a continuous function f: 0 -+ [0, 1] with f = 0 on A and f = 1 on B. A4.2
Tietze Extension Theorem. Let t) be a Hausdorff space. Then S2 is normal iff for every closed set A c C1 and every continuous real-valued A4.3
APPENDIX ON GENERAL TOPOLOGY
212
function f defined on A, f has an extension to a continuous real-valued function F on n. Furthermore, if if I < c (respectively, If 1 < c) on A, then 1FI can be taken less than c (respectively, less than or equal to c) on Q. Theorem. Let A be a closed subset of the normal space n. There is a continuous f: t -> [0, 1] such that A =f -1{O} if A is a Gd , that is, a countable intersection of open sets. A4.4
A4.5
Definitions and Comments. A topological space n is second countable
if there is a countable base for the topology, first countable if there is a countable base at each point (see A2.4). Second countability implies first countability but not conversely. Any metric space is first countable.
If 0 is second countable, it is necessarily separable, that is, there is a countable dense subset of Q. Furthermore, if n is second countable, it is Lindelof, that is, for every family of open sets V1, i e I, such that Ut V1 = S2, there is a countable subfamily whose union is Q (for short, every open covering of 0 has a countable subcovering). In a metric space, the separable, second countable, and Lindelof properties are equivalent as follows. Second countability always implies separability and Lindelof. If n is separable with a countable dense set {x1, x2 , ...), then the balls B(x;, r) = {y a f : d(y, xi) < r}, i = 1, 2,..., r rational, form acountable base. If n is Lindelof, the cover by balls B(x, 1/n), x e S2, has a countable
subcover {B(x,,;, 1/n), i = 1, 2, ...}, and the sets B(x,,;, 1/n), i, n = 1, 2, ..., form a countable base. This result implies that any space that is separable but not second countable (or not Lindelof), or Lindelof but not second countable (or not separable)
cannot be metrizable, that is, there is no metric whose topology coincides with the original one. A4.6
Definitions and Comments. A topological space .0 is said to be com-
pletely regular if Q is Hausdorff and for each x e n and closed set C 0 with x 0 C, there is a continuous f: fZ
[0, 1] such that f (x) = 1 and f = 0 on
C.
If A is a subset of the normal space n, then A, with the relative topology, is
completely regular (this follows quickly from Urysohn's lemma). Also, complete regularity implies regularity. Thus complete regularity is in between regularity and normality; for this reason, completely regular spaces are sometimes called T34 spaces. Now if CIO is a Hausdorff space and F is the family of continuous maps f: no -' [0, 1 ], let n = fl (If : f e , r) where each If = [0, 11. Let e:.00 -+ f be the evaluation map, that is, e(x) = (f (x), f e ,F).
A5 COMPACTNESS
213
With the product topology on fl, e is continuous, and e is one-to-one if F distinguishes points, in other words, given x, y e ao, x :A y, there is an f e F such that f (x) 56f (y). Finally, if .F distinguishes points from closed sets, that is, if 1Q, is completely regular, then e is an open map of !no onto e(flo) c Q. [If is a net and e(x) x ++ x, there is a neighborhood U of x such that x is not eventually in U; that is, given m, there is an n >_ m with
x 0 U. Choose f e °F with f (x) = 1 and f = 0 on flo - U. Then for each m, we have f (x,,) = 0 for some n z m, so that f (x.) ++f (x). But then a contradiction.] e(x) It follows that if f2o is completely regular, it is homeomorphic to a subset of a normal space. [Since 0 is a product of Hausdorff spaces, it is Hausdorff;
the Tychonoff theorem, to be proved later, shows that f2 is compact, and hence normal (see A5.3(d) and A5.4).] Since e(Q0) is determined completely by F, we may say that the continuous functions are adequate to describe the topology of flo.
A5 Compactness
The notion of compactness appears in virtually all areas of mathematics. The original compactness result was the Heine-Borel theorem: If [0, 1] c U; Vi, where the Vi are open subsets of R, then in fact [0, 1) is covered by finitely many V, , that is, [0, 1 ] c Uk= 1 V.,, for some V;. , ... , V;.. In general, we have the following definition: Definition. The topological space f2 is compact if every open covering of fl has a finite subcovering. A5.1
There are several ways of expressing this idea.
Theorem. If fl is a topological space, the following are equivalent: (a) f2 is compact. (b) Each family of closed sets C, c f2 with the finite intersection property (all finite intersections of the Ci are nonempty) has nonempty intersection. Equivalently, for every family of closed subsets of 0 with empty intersection, there is a finite subfamily with empty intersection. A5.2
(c)
Every net in f2 has an accumulation point in 0; in other words
(by A2.6), every net in f2 has a subnet converging to a point of fl. (d) Every filterbase in fl has an accumulation point in f2, that is (by A2.10), every filterbase in fl has a convergent filterbase subordinate to it, or equally well, every filter in f2 has an overfilter converging to a point of 0. (e) Every ultrafilter in 0 converges to a point of Q.
214
APPENDIX ON GENERAL TOPOLOGY
PROOF. Parts (a) and (b) are equivalent by the duality between open and closed sets. If is a net and sad is a filterbase whose elements coincide with the tails of the net, then the accumulation points of the net and of the filterbase coincide, so that (c) and (d) are equivalent. Now (d) implies (e) by A2.12(c), and (e) implies (d) since every filter is included in an ultrafilter. To prove that (b) implies (d), observe that if sd is a filterbase, the sets A e s:1, hence the sets A, A c sad, have the finite intersection property, so by (b), there
is a point x E n{A: A c-.4}. Finally, we prove that (d) implies (b). If the closed sets C; have the finite intersection property, the finite intersections of the C; form a filterbase, which by (d) has an accumulation point x. But then x
belongs to all C,. I It is important to note that if A c Q, the statement that every covering of A by sets open in f has a finite subcovering is equivalent to the statement that every covering of A by sets open in A (in the relative topology inherited from S2) has a finite subcovering. Thus when we talk about a compact subset of a topological space, there is no ambiguity. The following results follow quickly from the definition of compactness. Theorem. (a) If S2 is compact and f is continuous on 11, then f (Q) is compact. A5.3
(b) A closed subset C of a compact space ) is compact. (c) If A and B are disjoint compact subsets of the Hausdorff space Q, there are disjoint open sets U and V such that A c U and B e V. In particular (take A = {x}), a compact subset of a Hausdorff space is closed. (d) A compact Hausdorff space is normal. (e) If A is a compact subset of the regular space 0, and A is a subset of the open set U, there is an open set V with A c V e V e U. PROOF. (a) This is immediate from the definition of compactness. (b) If C is covered by sets U open in Q, the sets U together with a -- C
cover 0. By compactness there is a finite subcover. (c) If x 0 B and y e B, there are disjoint neighborhoods U,(x) and V(y) of x and y. The V(y) cover B; hence there is a finite subcover V(y), i = 1, ... , and V' = U'=1 V(y;) are disjoint open sets with n. Then U' =n7 I x e U' and B c V'. If we repeat the process for each x e A, we obtain disjoint open sets U(x) and V(x) as above. The U(x) cover A; hence there is a finite subcover U(X), i = 1, ... , m. Take U = U"' I U(x,), v = n,,"= 1 V(x,). (d) If A and B are disjoint closed sets, they are compact by (b); the result then follows from (c).
215
A5 COMPACTNESS
(e)
If x e A, regularity yields an open set V(x) with x e V(x) and
V(x) c U. The V(x) cover A; so for some x...... xn, we have n
n
n
A c U V(xi) c U V(xi) = U V(xi) C U. i=1
i=1
i=1
The following is possibly the most important compactness result. If S2i is compact for each i e 1, then ill _ fl , iii is compact in the product topology. A5.4 Tychonoff Theorem.
PROOF. Let 97 be an ultrafilter in 0. If pi is the projection of i2 onto Ui, then by A2.12(b), pi(.F) is a filterbase that generates an ultrafilter in fli. By hypothesis, pi(F) converges to some xi a Di, and it follows that ." -+ x = (xi, i e 1). [To see this, observe that if sal is a filterbase in i2 and {x"} is a net whose tails are the elements of a, then the tails of {pi(x")} are the elements of
pi(d). Since x" -+ x if pi(x") -+ pi(x) for all i, by A3.2(a), it follows that sd - x iff pi(d) -' pi(x) for all i.] The Tychonoff theorem now follows from A5.2(e).
The following result is often used to infer that the inverse of a particular one-to-one continuous map is continuous. A5.5 Theorem. Let f: i2 - i2, where i2 is compact, 01 is Hausdorff, and f is continuous. Then f is a closed map; consequently iff is one-to-one onto, it is a homeomorphism.
PROOF. By A5.3(a), (b) and (c). I A5.6
Corollary. Let p: i2o - 0 be an identification, and let h: ffo - ill be
continuous; assume hop-' is single valued, and hence continuous by A3.5. Assume also that f)o is compact (hence so is i2 because p is onto) and f2, is Hausdorff. If h op-1 is one-to-one onto, it is a homeomorphism. PROOF. Apply A5.5 with f = h o
`. I
Corollary A5.6 is frequently applied in constructing quotient spaces. For example, if one pair of opposite edges of a rectangle are identified, we obtain a cylinder. Formally, let 12 = {(x, y): 0 < x < 1, 0:5 y < 1). Define an
216
APPENDIX ON GENERAL TOPOLOGY
equivalence relation R on I2 by specifying that (0, y) be equivalent to (1, y), 0 < y < 1, with the other equivalence classes consisting of single points. Let h(x, y) = (ei2Rx, y), (x, y) ,E I2 ; h maps I2 onto a cylinder C. If p is the
canonical projection of I2 onto I2/R, then A5.6 implies that h o p-1 is a homeomorphism of I2/R and C. In some situations, for example in metric spaces, there are alternative ways of expressing the idea of compactness. Definition. A topological space 12 is said to be countably compact if every countable open covering of 0 has a finite subcover. A5.7
A5.8 Theorem. For any topological space S2, the following properties (a)(d) are equivalent, and each implies (e). If S2 is T1, then all five properties are
equivalent.
(a) Q is countably compact. Each sequence of closed subsets of 92 with the finite intersection property has nonempty intersection. (c) Every sequence in fl has an accumulation point. (d) Every countable filterbase in f) has an accumulation point. (e) Every infinite subset of fl has a cluster point. (b)
PROOF. The equivalence of (a), (b), and (d) is proved exactly as in A5.2, and (d) implies (c) because the tails of a sequence form a countable filterbase. To prove that (c) implies (d), let sad = {A1, A2, ...} be a countable filterbase,
and choose x e n"=1 A; , n = 1, 2. .... If x is an accumulation point of and U e °IE(x), then for each n there is an m >- n such that
a U, hence
U n nm 1 A i 0 0. It follows that U n A # 0 for all n, and consequently x is an accumulation point of W. To prove that (c) implies (e), pick a sequence
of distinct points from the infinite set A and observe that if x is an accumulation point of the sequence, then x is a cluster point of A. Finally, we show that (e) implies (a) if S2 is T1. Say U1, U2, ... form a countable open covering of S2 with no finite subcover. Choose x1 0 Ul ; having chosen distinct x1, ... , xk with x; 0 U/= I Ui , j = 1, ..., k, then xl,... , xk all belong to
some finite union Ui=1 Ui, n
k + 1; choose Xk+10 Ui=I U1 (hence xk+I 11 U1 U. and x1, ..., xk+I are distinct). In this way we form an infinite set A = {x1, X2, ...} with no cluster point. For if x is such a point, x belongs to U for some n. Since n is T1, there is a set U e V(x) such that U c U and xi 0 U, i = 1, 2, ..., n - 1 (unless xi = x). Since Xk 0 U. for k >- n, U contains no point of A distinct from x. I
A5 COMPACTNESS
A5.9
217
Definitions and Comments. The topological space Q is said to be
sequentially compact iff every sequence in ) has a convergent subsequence. By A5.8(c), sequential compactness implies countable compactness. In a first countable space, countable and sequential compactness are equivalent. For if x is an accumulation point of the sequence and V1, V2, ... (with
V,,.., = V. for all n) form a countable base at x, then for each k we may find nk >_ k such that
e Vk. Thus we have a subsequence converging to x.
A5.10 Theorem. In a second countable space or a metric space, compactness,
countable compactness, and sequential compactness are equivalent. PROOF. A second countable space is Lindelof (see A4.5), so compactness and
countable compactness are equivalent. It is first countable, so countable compactness and sequential compactness are equivalent; this result holds in a metric space also, because a metric space is first countable. Now a sequentially compact metric space fl is totally bounded, that is, for each e > 0, 0 can be covered by finitely many balls of radius e. (If not, inductively pick x1, x2, ... with xi+1 0 U;=, B(xi, s); then can have no convergent subsequence.) Thus for each positive integer n, ) can be covered l 1n), i = 1, 2, ..., k,,. If { U; , j e J} is an arbitrary by finitely many balls open covering of SZ, for each ball I/n) we choose, if possible, a set URi of the covering such that B(x,,i, 1/n). If x e fl, then x belongs to a ball B(x, a) included in some U;; hence x e B(x,,i, 1/n) a B(x, e) c U. for some n and i; therefore x e Thus the U,i form a countable subcover, and 1), which is countably compact, must in fact be compact. I Note that a compact metric space is Lindelof, hence (see A4.5) is second countable and separable.
Definition. A Hausdorff space is said to be locally compact if each x E !Q has a relatively compact neighborhood, that is, a neighborhood whose A5.11
closure is compact. (Its follows that a compact Hausdorff space is locally compact.) A5.12
Theorem. The following are equivalent, for a Hausdorff space i2:
(a) D is locally compact. (b)
For each x e S2 and U e all(x), there is a relatively compact open set V
with x e V c V c U. (Thus a locally compact space is regular; furthermore, the relatively compact open sets form a base for the topology.)
218
APPENDIX ON GENERAL TOPOLOGY
(c) If K is compact, U is open, and K c U, there is a relatively compact open set V with K c V c V c U.
PROOF. It is immediate that (c) implies (a), and (b) implies (c) is proved by applying (b) to each point of K and using compactness. To prove that (a) implies (b), let x belong to the open set U. By (a), there is a neighborhood V1 of x such that K = V1 is compact. Now K is compact Hausdorff, and hence
regular, and x e U n V1, which is open in f2, and hence open in K. Thus (see A4. 1) there is a set W open in C1 such that x e W n K and the closure of W n K in K, namely, W n K, is a subset of U n V1.
Now xe Wn V1 and Wn V1 c WnKcU, so V=Wn V1 is the desired relatively compact neighborhood.
The following properties of locally compact spaces are often useful: Theorem. (a) Let S2 be a locally compact Hausdorff space. If K c U c 52, with K compact and U open, there is a continuous f:.0 -+ [0, 1] A5.13
such that f = 0 on K and f = 1 on 0 - U. In particular, a locally compact Hausdorff space is completely regular. (b) Let S2 be locally compact Hausdorff, or, more generally, completely regular. If A and B are disjoint subsets of i2 with A compact and B
closed, there is a continuous f: 11 -+ [0, 1] such that f = 0 on A and f = 1 on B. (c) Let S2 be locally compact Hausdorff, and let A c U c 0, with A compact and U open. Then there are sets B and V with A c V c B e U,
where V is open and a-compact (a countable union of compact sets) and B is compact and is also a G6 (a countable intersection of open sets). Consequently (take A = {x}) the a-compact open sets form a base for the topology. PROOF. (a)
Let K c V c V c U, with V open, V compact [see A5.12(c)).
P is normal, so there is a continuous g: V-+ [0, 11 with g = 0 on K, g = 1 on
T7- V. Define! = g on V. f = 1 on Q- V. (On V- V, g = 1 so! is welldefined.) Now f is continuous on 0 (look at preimages of closed sets), so f is the desired function. (b)
By complete regularity, for each x e A, there is a continuous
f,,: 0 -+ [0, 1] with f,(x) = 0, fx = 1 on B. By compactness, n
A C U {x: fx,(x) < H i=1
for some x1,...,xn.Let
;then g=1onBand0
so f = max(2g - 1, 0) is the desired function.
219
A5 COMPACTNESS
(c) By A.5.12(c), we may assume without loss of generality that U is included in a compact set K. By (b) there is a continuous f: Q -+ [0, 11 with f = 0 on A, f = I off U. Let V = {x: f(x) < ];), B = {x: f(x) < 1}. Then V is open, B is closed, a.id A c V c B c U c K; hence B is compact. Now B is a
Ga because
B=
n{x:f(x)<1+and 2 n
V=
n=1
U{x:f(x)
n=1
so V is a-compact. (In fact V is a countable union of compact Ga's.) I Corollary. Let C be completely regular, A a compact Ga subset of Q. There is a continuous f: cZ - [0, 11 such that f -1{0} = A. A5.14
PROOF. If A = n', Un , the U" open, by A5.13(b) there are continuous n : S2 - [0, 1 ] wi th fn = 0 on A and fn = 1 off Un . Let f =Yn 1 f, 2-n. I
f
A5.15
Theorem. If 0 is Hausdorff, the following are equivalent:
(a) 0 is locally compact Lindelof. (b) KI can be expressed as UOO 1 Un where U. is a compact subset of Un+1 for each n. (c) rl is locally compact and a-compact.
PROOF. (a) implies (b): The relatively compact open sets form a base by A5.12(b), in particular they cover Q. Extract a countable subcover { V1, V2 , ...}
using Lindelof, and let U1 = V1, and for n > 1, U. = Vn u W,, where W. is a relatively compact open set and Wn =) U"-' Vj. (h) implies (c): We have g = Un U", proving a-compactness. If x e 0, then x e U. for some n, with U. compact, proving local compactness. (c) implies (a): If 0 = Un 1 Kn, K. compact, and {U;} is an open covering of Q, extract a finite subcovering of each Kn, and put the sets together to form a countable subcovering of 0. 1 1
The Urysohn metrization theorem, which we shall not prove, states that for a second countable space Q, metrizability and regularity are equivalent. This result yields the following corollary to A5.15. A5.16 Theorem. If n is locally compact Hausdorff, then S2 is second count-
able if f) is metrizable and a-compact.
220
APPENDIX ON GENERAL TOPOLOGY
Proof. If n is second countable, it is metrizable by A5.12(b) and the Urysohn metrization theorem. Also, f) is Lindelof (see A4.5), hence is a-compact by A5.15. Conversely, if f) is metrizable and a-compact, then f) is Lindelof by A5.15, hence second countable (see A4.5). Finally, we consider the important one point compactjcation. A5.17 Theorem. Let 0 be locally compact Hausdorff, and let fl* = 0 U {oo},
where oo stands for any element not belonging to II. Put the following topology on fl*: U is open in n* if U is open in .0 or U is the complement (in Q*) of a compact subset of .0. Then: (a) If U c 0, U is open in it if U is open in S2*; thus S2* induces the original topology on 0. (b) fl* is compact Hausdorff.
PROOF. Part (a) follows from the definition of the topology. To prove (b), let { U3 be an open covering of fl*. Then oo belongs to some U, and the remaining Uj cover the compact set a* - U;, so the cover reduces to a finite subcover. Since f is Hausdorff, distinct points of it have disjoint neighborhoods. If
x e 0, let V be an open subset of it with x e V and V c Q, where V, the closure of V in d2, is compact [see A 5.12(b)]. Then V and Q* - V are disjoint neighborhoods of x and co. A6 Semicontinuous Functions
If f,, f2, ... are continuous maps from the topological space .0 to the extended reals R, and f (x) increases to a limit f (x) for each x, f need not be continuous; however, f is lower semicontinuous. Functions of this type play an important role in many aspects of analysis and probability. Definition. Let .0 be a topological space. The function f: ) -+A is said to be lower semicontinuous (LSC) on Q if {x a S2: f(x) > a} is open in f for each a e R, upper semicontinuous (USC) on 1Z iff {x a fl f (x) < a} is open in n for each a e R. Thus f is LSC if -f is USC. Note that f is continuous if it is both LSC and USC. We have the following criterion for semicontinuity. A6.1
A6.2
Theorem. The function f is LSC on S2 if, for each net
to a point x e n, we have lim inf f
f (x), where lim inf f
converging means
221
A6 SEMICONTINUOUS FUNCTIONS
f(x) whenever x.-x. (In
sup,, infk, f (xk). Hence f is USC iff lim sup f
a first countable space, "net" may be replaced by "sequence.") (b, oo], an open PROOF. Let f be LSC. If x - x and b < f (x), then x e f `(b, b eventually. subset of S2, hence eventually x,, e.f -'(b, oo], that is, f (x). Conversely if x --+ x implies Thus Jim inf f
_f(x), we show that V = {x: f(x) > a} is open. Let x,, --> x, where f(x) > a. Then lim inf,,f(x,,) > a, hence f (x,,) > a eventually, that is, x e V eventually. Thus (see A2.4) V is open. I We now prove a few properties of semicontinuous functions. A6.3
Theorem. Let f be LSC on the compa