Math 2.0

Order, lattices, ordered algebraic structures Definition

Ordinal sum of posets

Builds on Partial order

Definition

Let (P,≤P)(P, \le_P) and (Q,≤Q)(Q, \le_Q) be partially ordered sets with P∩Q=∅P \cap Q = \varnothing. The ordinal sum P⊕QP \oplus Q is the set P∪QP \cup Q with the relation ≤\le given by x≤yx \le y if and only if one of the following holds:

  1. x,y∈Px, y \in P and x≤Pyx \le_P y;
  2. x,y∈Qx, y \in Q and x≤Qyx \le_Q y;
  3. x∈Px \in P and y∈Qy \in Q.

Remarks

If PP and QQ are not disjoint, first replace them by disjoint copies. Example: with P={a}P = \set{a} and Q={b,c}Q = \set{b, c} an antichain, P⊕QP \oplus Q has a<ba < b and a<ca < c by clause 3, and bb, cc stay incomparable. Non-example: in Q⊕PQ \oplus P the element aa is above bb and cc, so Q⊕PQ \oplus P differs from P⊕QP \oplus Q; 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 ω⊕{x}\omega \oplus \set{x} has order type ω+1\omega + 1.

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Partial order concept
  2. Ordinal sum of posets definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Partially_ordered_set
About this page
TagNJY30DQG3H
URIm2://NJY30DQG3H
Kinddefinition
WritingW0 stub
MSC06A06
DefinesOrdinal sum of posets
UsesPartial order
Changed2 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.