Order, lattices, ordered algebraic structures Definition
Disjoint union of posets
Builds on Partial order
Definition
Let and be partially ordered sets with . The disjoint union is the set with the following relation . For , holds if and only if either and , or and .
Remarks
If and are not disjoint, first replace them by disjoint copies, such as and . The same construction works for any family of pairwise disjoint posets. Example: if is the chain and is the chain , then is the poset with exactly the strict relations and . Non-example: the poset with , and also is not , since it relates an element of to an element of . An antichain with elements is the disjoint union of one-element posets. The width of is the sum of the widths, and its height is the larger of the two heights.
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
- Disjoint union of posets definition
Further reading
About this page
| Tag | 2YHG0X6EA0 |
|---|---|
| URI | m2://2YHG0X6EA0 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Disjoint union 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.