Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 7.5.4 ( Every ``good approximation'' to $\xi$ is a convergent.)

Exercise 7.5.4 ( Every ``good approximation'' to $\xi$ is a convergent.)

Prove that every “good approximation” to ξ is a convergent.

Answers

Proof. Here ξ is an irrational number.

Let a b be a “good approximation” to ξ . By definition b > 0 and

| ξb a | = min ( x , y ) 2 , 0 < y k n | ξy x | ,

so

x , y ] ] 0 , b ] ] , | ξb a | | ξy x | . (1)

We show first that if y b , then the inequality in (1) is strict.

Assume, for the sake of contradiction, that 0 < y < b and | ξb a | | ξy x | . Then ξb a = 𝜀 ( ξy x ) , where 𝜀 = ± 1 .

  • If 𝜀 = 1 , then ξb a = ξy + x , thus ξ ( b + y ) = a + x , where b + y > 0 , hence ξ = a + x b + y . This contradicts our hypothesis.
  • If 𝜀 = + 1 , then ξb a = ξy x , thus ξ ( b + y ) = a + c , thus ξ ( y b ) = x a , where y < b , hence ξ = x a y b , which is also a contradiction.

This shows that

x , y ] ] 0 , b [ [ , | ξb a | < | ξy x | . (2)

Since the sequence ( k n ) n is strictly increasing and k 0 = 1 , b > 0 , there exists some integer n such that k n b < k n + 1 . We want to show that b = k n and a = h n .

If b k n , then 0 k n < b and by (2),

| ξb a | < | ξ k n h n | .

Then the second part of Theorem 7.13 shows that b k n + 1 , and this contradicts the definition of n . Therefore b = k n .

By (1), | ξb a | | ξ k n h n | . If | ξb a | < | ξ k n h n | , then by the second part of Theorem 7.13 b k n + 1 , which is false, so | ξb a | = | ξ k n h n | , where b = k n , so

| ξ k n a | = | ξ k n h n | .

Therefore ξ k n a = 𝜀 ( ξ k n h n ) , where 𝜀 = ± 1 .

If 𝜀 = 1 , then 2 ξ k n = a + h n , where k n > 0 , thus ξ = ( a + h n ) ( 2 k n ) . This is a contradiction. Therefore 𝜀 = 1 , so ξ k n a = ξ k n h n and a = h n .

This shows that a b = h n k n is a convergent.

Every “good approximation” to ξ is a convergent. □

User profile picture
2025-08-02 08:48
Comments