Math Problem Statement

can you do it without the archimedean property of reals

Solution

Certainly! We can prove the existence and uniqueness of an integer nn such that nr<n+1n \leq r < n + 1 for a rational number rr without relying on the Archimedean property.

Proof:

Step 1: Existence

Let rr be a rational number, so rr can be written as r=abr = \frac{a}{b}, where aa and bb are integers, and b>0b > 0.

We need to show that there exists an integer nn such that nr<n+1n \leq r < n + 1. To find such an nn, we first multiply the inequality by bb (since b>0b > 0) to eliminate the fraction:

bna<b(n+1)b \cdot n \leq a < b \cdot (n + 1)

This simplifies to:

bna<bn+bbn \leq a < bn + b

Now, let's define nn as:

n=abn = \left\lfloor \frac{a}{b} \right\rfloor

where ab\left\lfloor \frac{a}{b} \right\rfloor is the floor of ab\frac{a}{b}, which is the largest integer less than or equal to ab\frac{a}{b}.

By definition, we have:

nab<n+1n \leq \frac{a}{b} < n + 1

This implies:

nr<n+1n \leq r < n + 1

Thus, we have found an integer nn that satisfies the inequality.

Step 2: Uniqueness

Suppose there exist two different integers n1n_1 and n2n_2 such that both satisfy n1r<n1+1n_1 \leq r < n_1 + 1 and n2r<n2+1n_2 \leq r < n_2 + 1. Without loss of generality, assume n1<n2n_1 < n_2.

Then, we would have:

n1<n2r<n1+1n_1 < n_2 \leq r < n_1 + 1

But this implies:

n1+1>n2n_1 + 1 > n_2

Since n2n_2 is an integer and n2>n1n_2 > n_1, we must have n2=n1+1n_2 = n_1 + 1. However, this leads to a contradiction because rr cannot be both n2\geq n_2 and <n1+1=n2< n_1 + 1 = n_2.

Therefore, n1n_1 must be equal to n2n_2, proving that nn is unique.

Conclusion:

For any rational number r=abr = \frac{a}{b}, there exists a unique integer nn such that nr<n+1n \leq r < n + 1, without relying on the Archimedean property of real numbers.

Would you like any further explanations or have any questions? Here are some related questions you might consider:

  1. How does the proof change if rr is an irrational number?
  2. What is the significance of the floor function in number theory?
  3. How can this concept be applied to solve problems in modular arithmetic?
  4. Is there a similar approach to finding nn for complex numbers?
  5. How does this proof relate to the concept of divisibility?

Tip: When proving mathematical properties, it's often useful to try different approaches, like avoiding reliance on more abstract concepts, to deepen your understanding.

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Rational Numbers
Floor Function

Formulas

-

Theorems

-

Suitable Grade Level

Advanced High School