edited by
1,049 views
0 votes
0 votes
Let Q denote the set of rational numbers and S = {x | x belongs N ; N; x>=10}

Consider the Following POSETs

I. (Q ∩ [0, 1], ≤)

II. (S, ≤)

Which of the above POSETs are well ordered?
edited by

1 Answer

Best answer
2 votes
2 votes

Only option B should be True not First Why ???

A well ordered set is a total ordered set in which every finite subset has a least element.

Now (Q ∩ [0, 1], ≤) will eventually give ([0,1],<=) wouldn't it ?

Now [0,1] basically contains a subset (0,1) which doesn't have least element , because here if you choose any number then i can always give you a smaller number than that.

selected by

Related questions

2 votes
2 votes
0 answers
3
Lakshman Bhaiya asked Oct 6, 2018
837 views
The set of all English words ordered in a dictionary is ________$A)$ not a poset$B)$ a poset but not totally ordered$C)$ a totally ordered set but not well ordered$D)$ a ...
4 votes
4 votes
1 answer
4
ram_18051996 asked Jul 7, 2017
2,507 views
Is (S, R) a poset if S is the set of all people in the world and (a, b) ∈ R, where a and b are people,if a is not taller than b?