Let x>0 be real. Let n_0 be the largest integer such that n_0 le x (Note that the existance of n_0 depends on the archimedian property of R).

Liam Keller

Liam Keller

Answered question

2022-09-05

Let x > 0 be real. Let n 0 be the largest integer such that n 0 x (Note that the existance of n 0 depends on the archimedian property of R).
1) Why he write about natural number but he did not defines them?
2) How he uses archimedian property in existance of n 0 ?

Answer & Explanation

ivice7u

ivice7u

Beginner2022-09-06Added 18 answers

Step 1
1) Isn't really answerable by anyone other than Rudin unless you can clarify what you want to know exactly (or what kind of answer you'd expect).
For 2) can you write down the Archimedian property and then first try to prove that for all x > 0 there is some n N such that n > x ?
This proves that the set { m Z m x } is bounded above and thus has a maximal element. This element is the n0 from your text. (It's also called the floor of x, denoted by x )
Gauge Odom

Gauge Odom

Beginner2022-09-07Added 4 answers

Step 1
For me, it is acceptable to take as an axiom the following statement:
Well-ordering principle: Every non-empty subset of N has a minimum element.
You are correct that Rudin never stated this property explicitly. To be fair to Mr. Rudin though, page 1 states:
"We shall not, however, enter into any discussion of the axioms that govern the arithmetic of the integers, but assume familiarity with the rational numbers...."
Using the axiom above, we can return to the decimal representation issue. For x R + we have the set S := { z Z x < z } . This set is non-empty by the archimedean property* therefore it has a minimum element m0 by the well-ordering principle. Then m 0 1 = n 0 .
*The archimedean property furnishes a natural number n such that 1 n > x . Thus n S and S .

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?