Order, lattices, ordered algebraic structures Definition
Order isomorphism
Builds on Bijective functionPartial order
Definition
Let and be partially ordered sets. An order isomorphism from to is a bijective function such that, for all ,
Remarks
The inverse of an order isomorphism is an order isomorphism. The map is an order isomorphism from to the even integers. The ordered sets and are not order isomorphic, because has a least element and has none. A monotone bijection need not be an order isomorphism, when the orders are not total.
Reading path
To understand this page from the ground up, read these 23 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
- Codomain definition
- Injective function definition
- Partial order definition
- Surjective function definition
- Bijective function definition
- Order isomorphism definition
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Order_isomorphism, lead section
About this page
| Tag | 0Y74KN99A5 |
|---|---|
| URI | m2://0Y74KN99A5 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Order isomorphism |
| Uses | Bijective function, Partial order |
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)
The writing levels say how complete the text of a page is. They do not measure its truth.