1,009 views
0 votes
0 votes
can anyone explain what is total ordered set by giving suitable example..and also well ordered sets.

1 Answer

2 votes
2 votes

Totally Ordered Set

A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for apartial order plus an additional condition known as the comparability condition. A relation <= is a total order on a set S ("<= totally orders S") if the following properties hold.

1. Reflexivity: a<=a for all a in S.

2. Antisymmetry: a<=b and b<=a implies a=b.

3. Transitivity: a<=b and b<=c implies a<=c.

4. Comparability (trichotomy law): For any a,b in S, either a<=b or b<=a.

The first three are the axioms of a partial order, while addition of the trichotomy law defines a total order.

Every finite totally ordered set is well ordered. Any two totally ordered sets with k elements (for k a nonnegative integer) are order isomorphic, and therefore have the same order type (which is also an ordinal number).

For more information plz refer the link mentioned below....

http://www.cs.elte.hu/~karolyik/SER.pdf

 

Related questions

2 votes
2 votes
0 answers
1
Lakshman Bhaiya asked Oct 6, 2018
859 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 ...
0 votes
0 votes
1 answer
2
Badayayash asked Jan 26, 2019
1,104 views
Let Q denote the set of rational numbers and S = {x | x belongs N ; N; x>=10}Consider the Following POSETsI. (Q ∩ [0, 1], ≤)II. (S, ≤)Which of the above POSETs are ...