Homework 1
Throughout the course, we take as the set of natural numbers.
Exercise. For each subset of , give its maximum, minimum, supremum and infimum, if they exist:
Proof.
| Set | Maximum | Minimum | Supremum | Infimum |
|---|---|---|---|---|
| 8 | 8 | |||
| – | – | – | 3 | |
| 3/2 | -2 | 3/2 | -2 | |
| – | 1/2 | 1 | 1/2 |
Exercise: Prove that for any real number , there exists an integer such that
Proof (sketch). Let . Use Archimedean property to prove that is not empty and bounded below. Take , the infimum of and prove that satisfies the property.
Exercise: Chapter 1, Ex 1
Proof (sketch). Prove by contradiction.
Exercise: Chapter 1, Ex 2
Proof. Suppose there exist two non-zero rational numbers such that We have By the fundamental theorem of arithmetic, the left-hand side has odd number of factors of 3, while the right-hand side even. Contradiction.
Exercise: Chapter 1, Ex 3
Proof. First, notice that . For (a), the axioms (B) give .
For (b), as . By (a), we have .
For (c), as . By (a), we have .
Subquestion (d) is a little bit tricky. One might start to argue as the following.
Since , by (c) we have .
But to use (c), one need to verify that . Also only makes sense when .
We prove by contradiction. Suppose . Then . Contradiction. This finishes the proof for (d).
Exercise: Chapter 1, Ex 4
Proof (sketch). For is nonempty, pick any element in it and compare it with .
Exercise: Chapter 1, Ex 5
Proof (sketch). Denote . Prove that is an upper bound of and it is the least one.
Exercise: Chapter 1, Ex 8
Proof. Suppose an order can be defined in the complex field to turn it into an ordered field. Then . Contradiction.
Exercise: Chapter 1, Ex 9
Proof (sketch). Verify the lexicographic relation is really an order first. Now consider the y-axis and prove that it is non-empty and bounded above but it does not have the least upper bound. Thus under the dictionary order, the set of complex numbers does not have the least-upper-bound property. (Update: By y-axis, I mean all of the complex numbers whose real part is zero. And under lexicographic order, they are bounded by 1 from the top.)
Exercise: Chapter 1, Ex 13
Proof (sketch). View the complex numbers as the two dimensional Euclidean space. Then let in theorem 1.37(f) to get . Switch and , we have . Finally, combine the two inequalities together.