Proof of Well Ordering Property

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

Homework Help Overview

The discussion revolves around the proof of the well ordering property in real analysis, specifically addressing the existence of a smallest element in nonempty subsets of natural numbers. Participants are exploring the implications of the greatest lower bound (infimum) and its relationship to elements within the set.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants are questioning the justification for the existence of an element in the set that is smaller than the infimum plus one. There is also discussion about the implications of the approximation property for infima and its relevance to the proof.

Discussion Status

Some participants have provided insights regarding the approximation property for infima, which appears to address some of the original poster's concerns. However, there is still exploration of the underlying assumptions and definitions related to the proof.

Contextual Notes

There is mention of the original poster being new to proving concepts, which may influence their understanding of the axioms and definitions involved in the proof. Additionally, the approximation property for infima is noted as not being included in the textbook, which could affect the discussion.

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[itex]\subset[/itex]N and S≠∅. Then inf(S) must exist and be a real number because N has lower bound. If inf(S) [itex]\in[/itex] S, we are done.

If inf(S) [itex]\notin[/itex] S, then it is the greatest lower bound of S but is not min(S). There must be an element x [itex]\in[/itex] 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[itex]\in[/itex]S? 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[itex]\in[/itex]S 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) [itex]\notin[/itex] S, then it is the greatest lower bound of S but is not min(S). There must be an element x [itex]\in[/itex] 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[itex]\in[/itex]S 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[itex]\subset[/itex]N and S≠∅. Then inf(S) must exist and be a real number because N has lower bound. If inf(S) [itex]\in[/itex] S, we are done.

If inf(S) [itex]\notin[/itex] S, then it is the greatest lower bound of S but is not min(S). There must be an element x [itex]\in[/itex] 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[itex]\in[/itex]S? 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 [itex]x\le N\le x+ 1[/itex].

Since x > inf(S), it is not a lower bound of S. This means there must be another element y[itex]\in[/itex]S 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
3K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K