Math 2.0

Order, lattices, ordered algebraic structures Binary relations and basic order notions Concept

Covering relation

Summary

In a partially ordered set, an element yy covers an element xx when x<yx < y 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

  1. Web https://en.wikipedia.org/wiki/Covering_relation
About this page
Tag4HHDPZ4BDY
URIm2://4HHDPZ4BDY
Kindconcept
WritingW0 stub
MSC06A06
Same as
Changed2 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

Used by

Definitions