Order, lattices, ordered algebraic structures Definition
Dense order
Builds on Partial order
Definition
Let be a partially ordered set, and write for and . The order is dense when, for all with , there is with .
Remarks
The order of is dense: for rationals , the rational satisfies . The order of is not dense: for and there is no integer strictly between. A dense order has no covering pairs. A poset with at most one element is dense, since there is no pair to check. The term is used mostly for total orders, where it is a basic property in the study of order types. The order topology of a dense total order with more than one element has no isolated points.
Reading path
To understand this page from the ground up, read these 16 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
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Preorder definition
- Partial order definition
- Dense order definition
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | JB9HJ9CPEN |
|---|---|
| URI | m2://JB9HJ9CPEN |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A05, 06A06 |
| Defines | Dense order |
| Uses | Partial order |
| 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)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.