Order, lattices, ordered algebraic structures Definition
Covering relation
Builds on Partial order
Definition
Let be a partially ordered set, and write for and . For , the element covers , written , when both conditions hold.
- .
- There is no with .
The covering relation of is the set of pairs with .
Remarks
Order the positive integers by divisibility. Then : the only divisors of that divides are and , so nothing lies strictly between. In general exactly when and is prime. The pair is not a cover, since , so the second condition fails. In a finite poset, holds if and only if there is a finite sequence with . So the covering relation determines a finite partial order. This fails for infinite posets: in the covering relation is empty.
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
- Covering relation definition
Further reading
About this page
| Tag | EHXHC4ZNPA |
|---|---|
| URI | m2://EHXHC4ZNPA |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Covering relation |
| Uses | Partial order |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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.
What links here
No page links to this page yet.