Order, lattices, ordered algebraic structures Definition
Order embedding
Builds on Partial orderMonotone function
Definition
Let and be partially ordered sets. A map is an order embedding when, for all ,
Remarks
The inclusion is an order embedding, since the order of is the restriction of the order of . Let with and incomparable, and let with . The map , is monotone, but it is not an order embedding: while . An order embedding is injective: gives and , so by antisymmetry. So is an order isomorphism from onto its image with the induced order. For total orders, a strictly increasing map is the same as an order embedding.
Reading path
To understand this page from the ground up, read these 20 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
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Function definition
- Preorder definition
- Partial order definition
- Monotone function definition
- Order embedding definition
Further reading
About this page
| Tag | AZES1C6VMT |
|---|---|
| URI | m2://AZES1C6VMT |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Order embedding |
| Uses | Partial order, Monotone function |
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.
What links here
No page links to this page yet.