Order, lattices, ordered algebraic structures Binary relations and basic order notions Concept
Covering relation
Summary
In a partially ordered set, an element covers an element when and nothing lies strictly between them. The covering relation records the immediate steps of the order. For a finite poset it determines the whole order, and it is exactly what a Hasse diagram draws.
Where this leads
4 pages build on this one.
Further reading
About this page
| Tag | 4HHDPZ4BDY |
|---|---|
| URI | m2://4HHDPZ4BDY |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A06 |
| Same as | |
| 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.