Order, lattices, ordered algebraic structures Maps between ordered sets Concept
Order embedding
Summary
An order embedding is a map between partially ordered sets that both preserves and reflects the order. It places a copy of one poset inside another, with exactly the same comparisons. An order embedding is automatically injective, and a surjective order embedding is an order isomorphism.
Further reading
About this page
| Tag | RH0HD05BMN |
|---|---|
| URI | m2://RH0HD05BMN |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A06 |
| Specializes | Monotone function |
| Same as | |
| 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.