Exercise 16.10

Let I = [0,1]. Compare the product topology on I × I, the dictionary order topology on I × I, and the topology I × I inherits as a subspace of × in the dictionary order topology.

Answers

First, we assume that the product topology on I × I is the product of I with the order topology as this seems to be the standard when no topology is explicitly specified. Denote this product topology by Tp. Let Td denote the dictionary order topology on I × I, and let Ts denote the subspace topology on I × I inherited as a subspace of × in the dictionary order topology. Lastly, let denote the dictionary order on I × I and × . To avoid ambiguity we also use the notation x × y to denote the ordered pair (x,y) and reserve parentheses for open intervals.

First we claim that Tp and Td are incomparable.

Proof. First, consider the point 0 × 1 I × I and Bp = [0,12) × (12,1], which is a basis element of Tp that clearly contains 0 × 1. Note that Bp is a basis element because [0,12) and (12,1] are both basis elements in the order topology on I since 0 and 1 are the smallest and largest elements of I, respectively. Now consider any interval Bd = (a × b,a× b) in the dictionary order on I × I that contains 0 × 1, which is of course a basis element of Td. Then we have that a × b and a× b are in I × I with a × b 0 × 1 a× b. Hence 0 < a or 0 = a and 1 < b. As 1 is the largest element of I, the latter case is not possible so that it must be that 0 < a. Let x = (0 + a)2 = a2 so that clearly 0 < x < a. Then we have that a × b x × 0 a× b so that the point x × 0 is in Bd. However, clearly 0(12,1] so that x × 0Bp. This shows that Bd cannot be a subset of Bp.

Here we note that, in the dictionary order on I × I, the smallest element is 0 × 0 while the largest is 1 × 1. With this in mind, the above argument for an open interval also applies to the half-open intervals [0 × 0,a × b) and (a × b,1 × 1], which are of course also basis elements of Td. This then shows that Td is not finer than Tp by the negation of Lemma 13.3.

Now consider the point 0 × 12 and the interval Bd = (0 × 0,0 × 1) in the dictionary ordering, which is, therefore, a basis element of Td, and clearly also contains 0 × 12. Consider also any basis element Bp = A × B of Tp that contains 0 × 12. Since 0 A and A must be a basis element of the order topology on I, it has to be that A = [0,a) for some 0 < a 1. Then let x = (0 + a)2 = a2 so that 0 < x < a, and thus x A. Then, since 12 B (since 0 × 12 A × B), we have that x × 12 A × B = Bp as well. However, we also clearly have that 0 × 1 x × 12 since 0 < x so that x × 12(0 × 0,0 × 1) = Bd. This shows that Bp cannot be a subset of Bd. As Bp was an arbitrary basis element of Tp, this shows by the negation of Lemma 13.3 that Tp is not finer than Td.

This suffices to show that Td and Tp are incomparable. □

Next, we claim that Ts is strictly finer than Tp.

Proof. Consider any x × y I × I and suppose that Bp = A × B is a basis element of Tp that contains x × y. First suppose that A = (a,b) and B = (c,d) so that of course a,b,c,d I, a < x < b, and c < y < d. It is then trivial to show that the interval Bs = (x × c,x × d) in the dictionary order also contains x × y, is a basis element of Ts (since Bs I × I so that Bs (I × I) = Bs), and is a subset of Bp. A similar argument can be made if A is an interval of the form [0,a) or (a,1]. If B = (c,1] and A is still (a,b), then let X be the interval (x × c,x × 2) in the dictionary order so that we have Bs = X (I × I) = {x} × (c,1] is a basis element of Ts that contains x × y and is a subset of Bp. A similar argument applies if B = [0,d) and/or when the interval A is half-open. This shows that Ts is finer than Tp by Lemma 13.3.

The argument above that shows that Tp is not finer than Td using the negation of Lemma 13.3 applies equally well to show that Tp is not finer than Ts. This of course suffices to show the desired result that Ts is strictly finer than Tp. □

Lastly, we claim that Ts is also strictly finer than Td.

Proof. First, consider any point x × y in I × I and let Bd be a basis element of Td that contains x × y so that it is some kind of interval with endpoints a × b and a× b in I × I. We note here that, since × has no smallest or largest elements, basis elements of the dictionary order topology there can only be open intervals. Now, if Bd is an open interval in I × I then clearly then the same interval B = (a × b,a× b) is a basis element in the dictionary order topology of × , though the two intervals can, in general, be different sets. For example the interval (0 × 0,1 × 1) in × contains the point 0 × 100 whereas the same interval in I × I does not since 0 × 100I × I. It is, however, trivial to show that B (I × I) = Bd so that Bd is basis element of Ts.

If we have that Bd is the half-open interval [0 × 0,a× b) then let B = (0 ×1,a× b), which is clearly a basis element of the dictionary order topology on × . It is then easy to see that B (I × I) = Bd again so that it is a basis element of Ts. If Bd is the half-open interval (a × b,1 × 1], then the open interval (a × b,1 × 2) is a basis element of the dictionary order topology on × and has the same result. Hence in all cases, Bd is also a basis element of Ts, and it trivially is a subset of itself, and it contains x × y. This shows that Ts is finer than Td by Lemma 13.3.

To show that it is strictly finer, consider the point 0 × 1 and the open interval B = (0 × 0,0 × 2), which is clearly a basis element of the dictionary order topology in × . It is then easy to prove that Bs = B (I × I) = {0} × (0,1] = (0 × 0,0 × 1] so that Bs is a basis element of Ts. Now consider any basis element Bd of Td that contains 0 × 1 so that Bd is some type of dictionary-order interval with endpoints a × b and a× b, both in I × I. The only way the interval can be closed above is if a× b = 1 × 1, in which case clearly 1 × 1 Bd but 1 × 1Bs. So assume that it is open above so that 0 × 1 a× b, and hence either 0 < a or 0 = a and 1 < b. The latter case cannot be since 1 is the largest element of I and b I. Therefore it has to be that 0 < a. So let x = (0 + a)2 = a2 so that 0 < x < a and thus 0 × 1 x × 0 a× b. From this, it follows that x × 0 is in Bd. However, clearly x × 0Bs since 0 × 1 x × 0.

Hence, in any case, we have shown that, while they both contain 0 × 1, Bd cannot be a subset of Bs. Since Bd was an arbitrary basis element, this shows that Td is not finer than Ts by the negation of Lemma 13.3. This shows the desired result that Ts is strictly finer than Td. □

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