Exercise 18.4

Given x0 X and y0 Y , show that the maps f : X X × Y and g : Y X × Y defined by

f(x) = x × y0 and g(y) = x0 × y

are imbeddings.

Answers

We only show that f is an embedding of X in X × Y as the argument for g is entirely analogous.

Proof. First, it is easy to see and trivial to formally show that f is injective. The function f can be of course defined as f(x) = f1(x) × f2(x) where f1 : X X is the identity function and f2 : X Y is the constant function that maps every element of X to y0. Since these have both been proven to be continuous in the text, it follows that f is continuous by Theorem 18.4.

Now let f be the function obtained by restricting the range of f to f(X) = {x × y0x X }. Since f is injective, it follows that f is a bijection. It follows from Theorem 18.2 part (e) that f is continuous. Clearly the inverse function f1 is equal to the projection function π1 so that f1(x,y) = x. This was shown to be continuous in the proof of Theorem 18.4. This suffices to show that f is a homeomorphism, which shows that f is an imbedding of X in X × Y . □

User profile picture
2019-12-01 00:00
Comments