Exercise 5.5.3

Exercise statement

Let E be a non-empty subset of \mathbf R, let n \geq 1 be an integer, and let m,m' be integers with the properties that m/n and m'/n are upper bounds for E, but (m-1)/n and (m'-1)/n are not upper bounds for E. Show that m=m'. This shows that the integer m constructed in Exercise 5.5.2 is unique.

Hints

  1. Drawing a picture will be helpful.

How to think about the exercise

This is a simple exercise, so I don’t have much to say.

I want to comment on one part of the proof below, which is where I go from m-1 < m' to m \leq m'. This is valid when m,m' are both integers—you can think of it as a generalization of Proposition 2.2.12(e). How would we prove this? If a < b are integers, we can add -a to both sides to get 0 < b-a. Now both sides are natural numbers, so we can apply Proposition 2.2.12(e) to get 1 \leq b-a, and finally we can add a to both sides to get a+1 \leq b as required. The other direction is similar, but we don’t need it for this exercise so I will omit it.

Model solution

Since (m-1)/n is not an upper bound for E, there exists some x \in E such that (m-1)/n < x. Similarly, since (m'-1)/n is not an upper bound for E, there exists some y \in E such that (m'-1)/n < y. Thus we have (m-1)/n < x \leq m'/n and (m'-1)/n < y \leq m/n using the fact that m/n and m'/n are upper bounds for E. This implies m-1 < m' and m'-1 < m (by multiplying through by n, which we can do since n \geq 1 is positive). Since m,m' are integers, we have m \leq m' and m' \leq m, which means m=m' as required.

3 thoughts on “Exercise 5.5.3”

  1. You can also use Order of Trichotomy on Real Numbers, i.e., m < m’, then 0<m’-m. Therefore, we have a positive integer/natural number. Hence 1 <= m’-m or m <= m’-1, hence m/n <= (m’-1)/n a contradiction. similarly for m'<m. Just posting this as an idea.

    Like

    1. You could also argue using either m < m’ that by transitivity this means x < m’, not accounting for a supremum being part of the set x is part of.

      Like

Leave a comment