Exercise 18.8

Let Y be an ordered set in the order topology. Let f,g : X Y be continuous.

(a)
Show that the set {xf(x) g(x)} is closed in X.
(b)
Let h : X Y be the function h(x) = min {f(x),g(x)}.

Show that h is continuous. [Hint: Use the pasting lemma.]

Answers

(a) First let C = {x Xf(x) g(x)} so that we must show that C is closed in X.

Proof. We prove this by showing that the complement X C is open in X. So first let S be the set of all y Y where y has an immediate successor, and denote that successor by y + 1. Then clearly y + 1 is well defined for all y S. Now define

A>y = {z Y z > y} A<y = {z Y z < y + 1}

for y S. As these are both rays in the order topology Y , they are both basis elements and therefore open. It then follows that f1(A>y) and g1(A<y) are both open in X since f and g are continuous. Hence their intersection Uy = f1(A>y) g1(A<y) is also open in X.

Similarly the rays

B>y = {z Y z > y} B<y = {z Y z < y}

for y Y are also open so that the intersection V y = f1(B>y) g1(B<y) is open in X. Then clearly the union of unions

D = ySUy yY V y

is also open in X. We claim that X C = D so that the complement is open in X and hence C is closed as desired.

(⊂) First consider any x X C so that clearly f(x) > g(x). If g(x) has an immediate successor g(x) + 1 then g(x) S and we have f(x) A>g(x) so that x f1(A>g(x)). We also have that g(x) A<g(x) since g(x) < g(x) + 1, and hence x g1(A<g(x)). It then follows that x Ug(x) and hence ySUy and x D since g(x) S. If g(x) does not have an immediate successor then there must be a y Y where g(x) < y < f(x). We then have that clearly f(x) B>y and g(x) B<y so that x f1(B>y) and x g1(B<y). Thus x V y so that x yY V y and x D. This shows that X C D since either way x D and x was arbitrary.

(⊃) Now suppose that x D. If x ySUy when there is a y S where x Uy. Hence x f1(A>y) and x g1(A<y) so that f(x) A>y and g(x) A<y. From this, it follows that f(x) > y and g(x) < y + 1. Then it has to be that g(x) y so that f(x) > y g(x). If x yY V y then there is a y Y where x V y. Hence x f1(B>y) and x g1(B<y) so that f(x) B>y and g(x) B<y. It then clearly follows that f(x) > y and g(x) < y so that f(x) > y > g(x). Therefore in either case we have f(x) > g(x) so that x X C. This of course shows that X C D since x was arbitrary. □

(b)

Proof. Let A = {x Xf(x) g(x)} and B = {x Xg(x) f(x)}, which are clearly both closed by part (a). It is easy to see that X = A B. First, clearly, X A B since both A X and B X. Then, for any x X, it has to be that either f(x) g(x) or f(x) > g(x) since < is a total order on Y . In the former case, of course, x A, and in the latter x B so either way x A B. Hence X A B. It is also easy to see that f(x) = g(x) for every x A B. For any such x, we have that x A so that f(x) g(x), and x B so that g(x) f(x). From this, it clearly must be that f(x) = g(x).

Since f and g are continuous, it then follows from the pasting lemma that the function

h(x) = { f(x)x A g(x) x B

for x X is continuous as well. Based on the definitions of A and B it is then easy to see and trivial to show that h(x) = min {f(x),g(x)} for all x X, which of course shows the desired result. □

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