Order, lattices, ordered algebraic structures Definition
Strict partial order
Builds on Binary relationTransitive relation
Definition
Let be a set. A strict partial order on is a binary relation on with these two properties.
- Irreflexivity: holds for no .
- Transitivity: for all , if and , then .
Remarks
The relation "is a proper subset of" on the power set of a set is a strict partial order. It is irreflexive since no set is a proper subset of itself, and it is transitive since gives . The relation on is irreflexive but not transitive: and , but fails. A strict partial order is asymmetric: and together would give . From a partial order one gets a strict partial order by if and only if and . Conversely, from a strict partial order one gets a partial order by if and only if or . These two constructions are inverse to each other.
Reading path
To understand this page from the ground up, read these 12 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
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Partially_ordered_set, Strict partial orders
About this page
| Tag | SWB1ZXFVKY |
|---|---|
| URI | m2://SWB1ZXFVKY |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Strict partial order |
| Uses | Binary relation, Transitive relation |
| Changed | 2 November 2026 |
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.