Section 4: Problem 1 Solution
Working problems is a crucial part of learning mathematics. No one can learn topology merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.
James R. Munkres
Prove the following "laws of algebra" for
, using only axioms (1)-(5):
(a) If
, then
.
(b)
. [Hint: Compute
.]
(c)
.
(d)
.
(e)
.
(f)
.
(g)
.
(h)
;
.
(i) If
and
, then
.
(j)
if
.
(k)
.
(l)
and
.
(m)
if
.
(n)
if
.
(o)
if
.
(p)
.
(q)
if
.
(r)
if
.
(s)
if
.
(t)
if
.
(a)
.
(b) Using (a),
implies
.
(c)
.
(d)
.
(e) Using (b),
. Similarly for
.
(f) This follows from (e).
(g) This follows from the distributive law and (e).
(h) Using the associative and commutative laws, we can omit parentheses and regroup terms in addition:
, and similarly for
.
(i) Similar to (a),
.
(j) By definition,
.
(k) By definition,
as
, hence,
.
(l) From (b) it follows that there is no
such that
. However, if
and
, then
, hence,
.
(m) See the second part of (l) that shows that
for
.
(n) Using associativity and commutativity we can regroup terms and then use (m):
.
(o) Using (j) and (n),
, and similarly
, so that we can use the distributive law.
(p) Again, from (b) it follows that if
for some
and
, then neither
nor
equals
, but we have
.
(q) Using (n) and (j),
.
(r) Using (q) and (n),
.
(s) Using (n) and (k),
.
(t) Using (f), (s) and then (f) again, we immediately get
. Also, using (f) and (d),
, hence,
, and, using (f), (n) and (f) again,
.