Order, lattices, ordered algebraic structures Definition
Ordinal sum of posets
Builds on Partial order
Definition
Let and be partially ordered sets with . The ordinal sum is the set with the relation given by if and only if one of the following holds:
- and ;
- and ;
- and .
Remarks
If and are not disjoint, first replace them by disjoint copies. Example: with and an antichain, has and by clause 3, and , stay incomparable. Non-example: in the element is above and , so differs from ; the ordinal sum is not commutative. The ordinal sum is associative, and the ordinal sum of two total orders is a total order. For well-orders, it gives the sum of ordinal numbers, so has order type .
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Partial order concept
- Ordinal sum of posets definition
Further reading
About this page
| Tag | NJY30DQG3H |
|---|---|
| URI | m2://NJY30DQG3H |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Ordinal sum of posets |
| Uses | Partial order |
| 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.
What links here
No page links to this page yet.