Order, lattices, ordered algebraic structures Definition
Strict total order
Builds on Strict partial order
Definition
Let be a set. A strict total order on is a strict partial order on such that, for all with , or .
Remarks
The relation on is a strict total order: it is irreflexive, transitive, and for distinct reals and , or . The relation on the power set of is a strict partial order but not a strict total order. The sets and are distinct, and neither is a proper subset of the other. The condition gives trichotomy: for all , exactly one of , , holds. The strict total orders on correspond one to one with the total orders on , by if and only if or . Other names are strict linear order and strict simple order.
Reading path
To understand this page from the ground up, read these 13 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Transitive relation definition
- Strict partial order definition
- Strict total order definition
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Total_order, Strict and non-strict total orders
About this page
| Tag | C9GDH7264N |
|---|---|
| URI | m2://C9GDH7264N |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A05 |
| Defines | Strict total order |
| Uses | Strict partial order |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.