Coproduct of Ordered Sets

This page has been identified as a candidate for refactoring of medium complexity. In particular: This definition (effectively pasting posets side by side) deserves a separate page, but I don't know a name; possibly "Disjoint Ordering", if no literature defining it can be located Until this has been finished, please leave {{Refactor}} in the code. New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code.

Theorem

Let $\mathbf{OrdSet}$ be the category of ordered sets.

Let $\left({P, \preceq_1}\right)$ and $\left({Q, \preceq_2}\right)$ be ordered sets.

Let $P \sqcup Q$ be the disjoint union of $P$ and $Q$.

Let $\preceq$ be the ordering on $P \sqcup Q$ defined by:

$\left({x, i}\right) \preceq \left({y, j}\right)$ if and only if $i = j$ and $x \preceq_i y$

where $i = 1$ or $i = 2$ depending on whether $x,y \in P$ or $x,y \in Q$.

Then $\left({P \sqcup Q, \preceq}\right)$ is the coproduct of $P$ and $Q$ in $\mathbf{OrdSet}$.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• 2010: Steve Awodey: Category Theory (2nd ed.) ... (previous) ... (next): $\S 3.2$