Professional Documents
Culture Documents
3.26.8. Let f : X → Y be any map, where Y is compact Hausdorff. Show that f is contin-
uous iff the graph of f , Gf = {x × f (x) | x ∈ X}, is closed in X × Y .
Suppose f is continuous; we must show that Gf is closed, or equivalently that X × Y − Gf
is open. For any point x0 × y0 ∈ X × Y − Gf , we have y 6= f (x). Since Y is Hausdorff, we
may choose open sets U, V ⊂ Y such that f (x0 ) ∈ U , y0 ∈ V , and U ∩ V = ∅. Consider
the open set f −1 (U ) × V ⊂ X × Y , which contains x0 × y0 . If x × y were a point in
(f −1 (U ) × V ) ∩ Gf , we would have y = f (x), and therefore x ∈ f −1 (V ), which contradicts
the fact that f −1 (U ) ∩ f −1 (V ) = ∅. Thus, f −1 (U ) × V ⊂ X × Y − Gf . This proves that
X × Y − Gf is open, as required. (For the direction, we did not need the fact that Y is
compact.)
Conversely, suppose Gf is closed. For any closed set C ⊂ Y , the set π2−1 (C) = X × C is
closed since π1 is continuous. Therefore, Gf ∩ (X × C) is also closed. Tracing the definitions,
we have Gf ∩ (X × C) = {x × f (x) | f (x) ∈ C}, so π1 (Gf × (X × C)) = f −1 (C). By the
previous exercise, f −1 (C) is closed. Thus, we have shown that f is continuous, using the
closed sets formulation. (Note that this direction did not need the fact that Y is Hausdorff.)
is a lower bound on d(x, y) for all y ∈ A, so d(x, a) ≤ d(x, A) (which is the greatest lower
bound. But also d(x, A) ≤ d(x, a) by definition, so the two are equal.
(c) Define the -neighborhood of A in X to be the set U (A, ) = {x | d(x, A) < }. Show
that U (A, ) equals the union of the open balls B(a, ) for all a ∈ A.
If x ∈ B(a, ) for some a ∈ A, then d(x, A) ≤ d(x, a) < , so x ∈ U (A, ). Conversely, if
x ∈ U (A, ), then d(x, A) = δ for some number δ < . Then cannot be a lower bound on
the values {d(x, y) | y ∈ A}, since δ is the least upper bound, so there is some a ∈ A with
d(x, a) < , and hence x ∈ B(a, ) as required.
(d) Assume that A is compact; let U be an open set containing A. Show that some -
neighborhood of A is contained in U .
Proof #1: Let B denote the set of all open balls B(a, ) where a ∈ A and for which
B(a, 2) ⊂ U . Every point a ∈ A is contained in such a ball, so these sets form an open
cover of A. Thus, there is a finite subcover, i.e.Spoints a1 , . . . , an ∈ A and values 1 , . . . , n
such that B(ai , 2i ) ⊂ U for each i, and A ⊂ ni=1 B(ai , i ). Let = min{1 , . . . , n }. We
claim that U (A, ) ⊂ U . For any yS∈ U (A, ), part (b) shows there exists some b ∈ A such
that d(y, b) < . And since A ⊂ ni=1 B(ai , i ), we have d(b, ai ) < for some ai . By the
triangle inequality, d(y, ai ) < 2, so y ∈ B(ai , 2) ⊂ B(ai , 2i ) ⊂ U , as required.
Proof #2: Let C = X − U ; this is a closed set. The function f (x) = d(x, C) is continuous
on all of X, and it is never 0 on any point in U (since d(x, C) = 0 implies x ∈ C̄, which implies
x ∈ C since C is closed). Because A is compact, the function f achieves a minimum on A;
there exists some a0 ∈ A such that d(a, C) ≥ d(a0 , C) > 0 for all a ∈ A. Let = d(a0 , C)/2.
For any x ∈ U (A, ), there is some a for which d(x, a) < . Since d(a, C) ≥ 2, it follows
that d(x, C) ≥ , so x ∈ X − C − U . Thus, U (A, ) ⊂ U .
(e) Show that the result in (d) need not hold if A is closed but not compact.
Let X = R2 with its Euclidean metric, and let A = {0} × R. Then for any > 0,
U (A, ) = (−, ) × R. The open set N from Example 7 in Section 26 then contains A but
does not contain U (A, ) for any > 0.