in Set Theory & Algebra edited by
618 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?
in Set Theory & Algebra edited by
618 views

1 comment

Both, right ?
0
0

1 Answer

2 votes
2 votes
Best answer

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
by

4 Comments

It's somewhat complex

That's why I'm leaving for now :p

Waiting for someone who properly explain
0
0
edited by

Sorry for late reply brother i was out.

In total ordered set we look for the whole set as well as all the subsets so cant i say (0,1) is a subset of [0,1] for which there is no least element ?

Its important to see for whole set and every finite subset of it :

https://en.wikipedia.org/wiki/Well-order

0
0
ok
0
0

Related questions