Homepage › Solution manuals › James Munkres › Topology › Exercise 4.1
Exercise 4.1
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 .
Answers
Proof. Clearly if then since the operation is a function.
If then we have
as desired. □
Proof. Clearly if then since the operation is a function.
If then we have
as desired. □
Proof. We have by (2) followed by (4) so that is a reciprocal of . Since this reciprocal is unique, however, it must be that as desired. □
Main Problem.
- (a)
- If ,
then .
Proof. Clearly by (3) we have so that it has to be that by Lemma 1 . □
- (b)
- . [Hint:
Compute .]
Proof. We have
Thus it must be that by part (a). □
- (c)
- .
Proof. By (4) we have so that it has to be that by part (a). □
- (d)
- .
Proof. We have
as desired. □
- (e)
- .
Proof. First we have
We also have
so that the result follows since equality is transitive. □
- (f)
- .
Proof. We have
as desired. □
- (g)
- .
Proof. We have
as desired. □
- (h)
- ;
.
Proof. We have
and
as desired. □
- (i)
- If
and ,
then .
Proof. By (3) we have so that it has to be that by Lemma 2 , noting that this applies since . □
- (j)
- if
.
Proof. By the definition of division we have by (4) since and is defined as the reciprocal (i.e. the multiplicative inverse) of . □
- (k)
- .
Proof. First, we have by (4) that , where is the reciprocal of . We also have that by (2) and (3). Therefore so that is its own reciprocal. Then, by the definition of division, we have by (3). □
- (l)
- and
.
Proof. Suppose that and . Also suppose to the contrary that . Since it follows from (4) that exists. So, we have by part (b). We also have
so that , which is a contradiction since we supposed that . Hence it must be that as desired. □
- (m)
- if
.
Proof. We have
so that is a multiplicative inverse of . Since this inverse is unique by (4), however, it has to be that as desired. □
- (n)
- if
.
Proof. We have
as desired. □
- (o)
- if
.
Proof. We have
as desired. □
- (p)
- .
Proof. Suppose that but . Then we first have that by (2) and part (b). However, we also have by (4). Hence we have , which is a contradiction since we know that and are distinct by (3). So, if we accept that , then it must be that also. □
- (q)
- if
.
Proof. We have
so that by definition is the reciprocal of . Since this is unique by (4) we then have as desired. □
- (r)
- if
.
Proof. We have
as desired. □
- (s)
- if
.
Proof. We have
as desired. □
- (t)
- if
.
Proof. We have
Now, we have by parts (f) and (d) so that is its own reciprocal, since the reciprocal is unique, i.e. . We also have
so that as desired. □