Exercise 2.16

Suppose that X and K are metric spaces, that K is compact, and that the graph of f : X K is a closed subset of X × K . Prove that f is continuous (This is an analogue of Theorem 2.15 but much easier.) Show that compactness of K cannot be omitted from the hypothese, even when X is compact.

Answers

Proof. Choose a sequence x n n whose limit is an arbitrary a . By compactness of K , the graph G of f contains a subsequence ( x ρ ( n ) , f ( x ρ ( n ) ) ) of ( x n , f ( x n ) ) that converges to some ( a , b ) of X × K . G is closed; therefore, ( x ρ ( n ) , f ( x ρ ( n ) ) ) converges in G . So, b = f ( a ) ; which establishes that f is sequentially continuous. Since X is metrizable, f is also continuous; see [A6]. So ends the proof.

To show that compactness cannot be omitted from the hypotheses, we showcase the following counterexample,

f : [ 0 , ) [ 0 , ) (1) x { 1 x ( x > 0 ) 0 ( x = 0 ) .

Clearly, f has a discontinuity at 0 . Nevertheless the graph G of f is closed. To see that, first remark that

G = ( x , 1 x ) x > 0 ( 0 , 0 ) . (2)

Next, let ( x n , 1 x n ) be a sequence in G + = ( x , 1 x ) x > 0 that converges to ( a , b ) . To be more specific: a = 0 contradicts the boundedness of ( x n , 1 x n ) : a is necessarily positive and b = 1 a , since x 1 x is continuous on R + . This establishes that ( a , b ) G + , hence the closedness G + . Finally, we conclude that G is closed, as a finite union of closed sets. □

User profile picture
2023-08-08 15:19
Comments