Homepage › Solution manuals › Terence Tao › Analysis I › Exercise 4.4.1 (Integer part)

Exercise 4.4.1 (Integer part)

Prove Proposition 4.4.1. (Hint: use Proposition 2.3.9.)

Answers

Proposition 4.4.1. (Interspersing of integers by rationals). Let x be a rational number. Then there exists an integer n such that n ≤ x < n + 1 . In fact, this integer is unique (i.e., for each x there is only one n for which n ≤ x < n + 1 ). In particular, there exists a natural number N such that N > x (i.e., there is no such thing as a rational number which is larger that all the natural numbers).

Proof. Existence. Let x ∈ ℚ . then x = p q , where p ∈ ℤ , q ∈ ℕ ∗ . By Proposition 2.3.9. (Euclidean division) there exist a quotient n and a remainder r such that

p = qn + r , 0 ≤ r < q .

Then x = p q = n + r q , where 0 ≤ r q < 1 . Therefore n ≤ x < n + 1 . This proves the part “existence" of the Proposition.

Unicity. Assume that n ≤ x < n + 1 , and m ≤ x < m + 1 , where m , n ∈ ℕ .

By transitivity, n ≤ x < m + 1 , thus n < m + 1 . Since n , m are integers, n ≤ m . Similarly, m ≤ x < n + 1 , therefore m < n + 1 and m ≤ n . This shows that m = n .

If N = n + 1 , then N > x , and N ∈ ℕ : this is the Archimedean property in ℚ .

The unique n ∈ ℕ such that n ≤ x < n + 1 is denoted n = ⌊ x ⌋ .

Note : If p = qn + r , 0 ≤ r < q , then n = ⌊ p q ⌋ . This prove the unicity of Euclidean division, not exposed in Proposition 2.3.9., which can also be proved directly, without rational numbers. □

User profile picture
2024-06-14 11:45
Comments