Proving that the Archimedean axiom is true

  • Thread starter Thread starter major_maths
  • Start date Start date
  • Tags Tags
    Axiom
Click For Summary
SUMMARY

The discussion focuses on proving the Archimedean axiom (O5) using the Least Upper Bound Property (O6) and other axioms of real numbers. The proof by contradiction approach is employed, starting with the assumption that O5 is false, leading to the conclusion that a natural number exists that contradicts the boundedness of the set N. The key steps involve defining the supremum S of the set N and demonstrating that if n is chosen close to S, then n+1 exceeds S, resulting in a contradiction. This establishes the validity of the Archimedean axiom.

PREREQUISITES
  • Understanding of the Archimedean axiom (O5)
  • Familiarity with the Least Upper Bound Property (O6)
  • Knowledge of proof by contradiction techniques
  • Basic concepts of real analysis and supremum
NEXT STEPS
  • Study the implications of the Archimedean axiom in real analysis
  • Explore the properties of supremum and infimum in bounded sets
  • Learn more about proof techniques in mathematics, particularly proof by contradiction
  • Investigate the relationship between the Archimedean axiom and other axioms of real numbers
USEFUL FOR

Mathematics students, educators, and anyone interested in real analysis and foundational proofs in mathematics.

major_maths
Messages
30
Reaction score
0

Homework Statement


Show that the Archimedean axiom O5 follows from the Least Upper Bound Property O6, together with the other axioms for the reals.

Homework Equations


O5 = [if a,b > 0, then there is a positive integer n such that b<a+a+a+...+a (n summands)] or [if a,b > 0, then b < na or b/a < n]

O6 = if A is any nonempty subset of R that is bounded above, then there is a least upper bound for A.

The Attempt at a Solution


My teacher told us to do this as a proof by contradiction so that's the format I'll be doing.

Suppose the Archimedean axiom is false towards a proof by contradiction. Therefore, there exists some a,b > 0 such that b \geq na, or b/a \geq n.
Then the set, say N, is bounded above by b/a and so sup(N) exists. Write sup(N) = S.

And then I can't figure out how to finish this proof.
 
Last edited:
Physics news on Phys.org
That S=\sup(\mathbb{N}) means that there is a natural number n that is close to S. But then n+1>S...

Try to formalize this.
 
If n+1>S, then there exists a natural number not bounded above by S.
This is a contradiction as the set N is the set of whole positive integers and adding 1 would not exclude any n previously in the set N.

Is that right?
 
major_maths said:
If n+1>S, then there exists a natural number not bounded above by S.
This is a contradiction as the set N is the set of whole positive integers and adding 1 would not exclude any n previously in the set N.

Is that right?

Yes, that is correct. How would you choose n though?
 
I would choose n to be close to S, or S-1<n<S.

So for any n bounded above by S but greater than S-1, if n+1>S, then there exists a natural number not bounded above by S.

And so on, and so on. Is that specific enough?
 
major_maths said:
I would choose n to be close to S, or S-1<n<S.

So for any n bounded above by S but greater than S-1, if n+1>S, then there exists a natural number not bounded above by S.

And so on, and so on. Is that specific enough?

Yes, but you need to state why such an n exists. You probably know it, but I want to make sure.
 
Oh. Um, it exists because S is the supremum of the set?
 
major_maths said:
Oh. Um, it exists because S is the supremum of the set?

Yes, do you understand why?
 
S is the supremum of the set because the set is bounded above by b/a, which is what sup(N[/]) is defined as at the beginning of the proof (b/a ≥ n).
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
4K
Replies
12
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
Replies
7
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K