in Set Theory & Algebra
226 views
0 votes
0 votes

https://gateoverflow.in/25664/tifr2013-b-4    In this question i get it the answer is E. Plz check my reason :- 

Since its a partial order relation because:- 

we can relate every Xi << Xi   itself  and  Its antisymmetric because no such pair Xi << Xi+1 and Xi+1 << Xi can exist at the same time. Its transitive as well its easy to see. And on the other hand every dictionary order is a partial order. Its a well order because if i choose any of the sequence it will always have a least element which will relate to everyone. 

Am i correct in my justification ?

in Set Theory & Algebra
by
226 views

1 Answer

0 votes
0 votes

 In this question i get it the answer is E.

No. D will be the correct answer. Check my newly added answer on that question.  

 Its a well order because if i choose any of the sequence it will always have a least element which will relate to everyone. 

No. We won't get a least element for every Non-empty subset. For example, 

$S$ = $\left \{ a^nb\,\,|\,\,n \geq 0 \right \}$.. this Subset has No least element. Hence, The given Structure $(A, dictionary order)$ is NOT Well-Ordered Structure.  

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true