math_newbie85
New member
- Joined
- Apr 28, 2020
- Messages
- 5
Hi everyone. Sorry if this is in the wrong forum (do move this thread if it is, thank you!).
I am going crazy over a principle that seem to be easy and my lecturer is not good at explaining it despite me asking him! The lecture notes are equally insufficient and I have tried to search online before coming here as a last resort.
I have been given two questions:
1. Is set [9, 20) under usual order <= well-ordered?
2. Is set (9, 20] under usual order <= well-ordered?
According to the principle - set S with an order <= is called well-ordered if every non-empty subset of S has a least element.
Axiom - the natural numbers N with the usual order <= is well-ordered.
Now, this are my answer:
1. Yes, as it has the least element 9
2. No, as it does not have the least element
How I approached was that the principle says that it needs to have a least element, in this case, there is 9 inclusive in the first one and 9 exclusive in the second one. I believe I should be trying to see all the possible subsets of the set in order to determine the answer? If yes, how should I approach?
Lastly, should I be concern about any largest element in this principle?
Thank you.
P.S: I am just starting out discrete mathematics, please go easy on me.
I am going crazy over a principle that seem to be easy and my lecturer is not good at explaining it despite me asking him! The lecture notes are equally insufficient and I have tried to search online before coming here as a last resort.
I have been given two questions:
1. Is set [9, 20) under usual order <= well-ordered?
2. Is set (9, 20] under usual order <= well-ordered?
According to the principle - set S with an order <= is called well-ordered if every non-empty subset of S has a least element.
Axiom - the natural numbers N with the usual order <= is well-ordered.
Now, this are my answer:
1. Yes, as it has the least element 9
2. No, as it does not have the least element
How I approached was that the principle says that it needs to have a least element, in this case, there is 9 inclusive in the first one and 9 exclusive in the second one. I believe I should be trying to see all the possible subsets of the set in order to determine the answer? If yes, how should I approach?
Lastly, should I be concern about any largest element in this principle?
Thank you.
P.S: I am just starting out discrete mathematics, please go easy on me.