Proof of Well Ordering Property

  • Thread starter Thread starter bfh227
  • Start date Start date
  • Tags Tags
    Proof Property
Click For Summary
SUMMARY

The discussion focuses on the proof of the Well Ordering Property, which states that every nonempty subset of the natural numbers (N) has a smallest element. The proof involves the concept of the infimum (inf) and its properties, particularly when inf(S) is not an element of S. Participants clarify that the Approximation Property for Infima justifies the existence of an element x in S that is less than inf(S) + 1. The conversation emphasizes the importance of understanding the relationship between inf(S) and elements of S to complete the proof.

PREREQUISITES
  • Understanding of real analysis concepts, particularly the Well Ordering Property.
  • Familiarity with the definitions of infimum and greatest lower bound.
  • Knowledge of the Approximation Property for Infima.
  • Basic comprehension of axioms related to real numbers and their properties.
NEXT STEPS
  • Study the Approximation Property for Infima in detail.
  • Review the definitions and properties of infimum and supremum in real analysis.
  • Explore the Completeness Axiom and its implications in real analysis.
  • Practice proving the Well Ordering Property with various subsets of natural numbers.
USEFUL FOR

Students of real analysis, mathematicians focusing on foundational properties of numbers, and anyone interested in understanding proofs related to the Well Ordering Property and infimum concepts.

bfh227
Messages
2
Reaction score
0

Homework Statement



I am working through an introductory real analysis textbook and am having a little trouble with certain aspects of the proof of the well ordering property (I am new to proving).

Theorem: Every nonempty subset of the natural numbers (N) has a smallest element.

Proof:

Let S\subsetN and S≠∅. Then inf(S) must exist and be a real number because N has lower bound. If inf(S) \in S, we are done.

If inf(S) \notin S, then it is the greatest lower bound of S but is not min(S). There must be an element x \in S that is smaller than inf(S)+1 since inf(S) is the greatest lower bound of S. Thus we have inf(S) < x < inf(S)+1.

-This is the first part I had trouble with. What is the justification for the fact that inf(S)+1 is greater than some x\inS? From which axiom(s)/definition(s) can we infer that inf(S) is a real number that is greater than the greatest integer not in S?

Since x > inf(S), it is not a lower bound of S. This means there must be another element y\inS such that inf(S) < y < x < inf(S)+1.

-Perhaps due to the earlier misunderstanding,the existence of such a y does not seem readily apparent to me. These two points are my main stumbling blocks and the rest of the proof is clear to me (contingent upon the existence of y). Any elucidation would be greatly appreciated.
 
Last edited:
Physics news on Phys.org
bfh227 said:
If inf(S) \notin S, then it is the greatest lower bound of S but is not min(S). There must be an element x \in S that is smaller than inf(S)+1 since inf(S) is the greatest lower bound of S. Thus we have inf(S) < x < inf(S)+1.


Since x > inf(S), it is not a lower bound of S. This means there must be another element y\inS such that inf(S) < y < x < inf(S)+1.

I believe these both follow from the Approximation Property for Infima. If you haven't seen this before, then it can be proved using the equivalent statement for suprema by considering ##-S##. (and clearly ##\sup(-S)## exists by the Completness axiom)
 
bfh227 said:

Homework Statement



I am working through an introductory real analysis textbook and am having a little trouble with certain aspects of the proof of the well ordering property (I am new to proving).

Theorem: Every nonempty subset of the natural numbers (N) has a smallest element.

Proof:

Let S\subsetN and S≠∅. Then inf(S) must exist and be a real number because N has lower bound. If inf(S) \in S, we are done.

If inf(S) \notin S, then it is the greatest lower bound of S but is not min(S). There must be an element x \in S that is smaller than inf(S)+1 since inf(S) is the greatest lower bound of S. Thus we have inf(S) < x < inf(S)+1.

-This is the first part I had trouble with. What is the justification for the fact that inf(S)+1 is greater than some x\inS? From which axiom(s)/definition(s) can we infer that inf(S) is a real number that is greater than the greatest integer not in S?
For any real number x, there exist at least one integer, N, such that x\le N\le x+ 1.

Since x > inf(S), it is not a lower bound of S. This means there must be another element y\inS such that inf(S) < y < x < inf(S)+1.
"inf" means, of course "greatest lower bound". Since inf(S) is the "greatest lower bound" of S there cannot be a lower bound greater than inf(S). Since x> inf(S), x cannot be a lower bound for S. If there did not exist another integer, y, in S, less than x, x would be a lower bound for S.

-Perhaps due to the earlier misunderstanding,the existence of such a y does not seem readily apparent to me. These two points are my main stumbling blocks and the rest of the proof is clear to me (contingent upon the existence of y). Any elucidation would be greatly appreciated.
 
Thanks a lot for the responses. The approximation property for infima does indeed seem to close the gap. Funnily, it wasn't in the textbook.
 
bfh227 said:
Thanks a lot for the responses. The approximation property for infima does indeed seem to close the gap. Funnily, it wasn't in the textbook.

That's okay, it will be in the exercises :smile:
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K