PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: Very high
extension of a poset (Definition)

Let $(P,\le_P)$ be a poset. An extension of $(P,\le_P)$ is a poset $(Q,\le_Q)$ such that

  • $Q=P$ , and
  • if $a\le_P b$ , then $a\le_Q b$ .

From the definition, the underlying set of an extension of a poset does not change. We may therefore, when there is no ambiguity, say that $Q$ is an extension of a poset $P$ and use $\le_Q$ and $\le_P$ to distinguish the partial ordering on $Q$ and $P$ respectively.

Every poset has a trivial extension, namely itself. A poset is maximal if the only extension is the trivial one. Given a poset that is not maximal, can we find a non-trivial extension? Suppose $P$ is a poset and $(a,b)\notin \le_P$ ($a,b$ not comparable). Then $\le_Q:=\le_P\cup A$ , where $A=\lbrace (r,s)\mid r\le a\mbox{ and }b\le s\rbrace$ , is a non-trivial partial order extending $\le_P$ , non-trivial since $(a,b)\in \le_Q-\le_P$ . So a maximal poset is just a linearly ordered set, as any pair of elements is comparable.

An extension $Q$ of $P$ is said to be linear if $Q$ is a linearly ordered set. By Zorn's lemma, and the construction above, every poset $P$ has a linear extension: take $\mathcal{P}$ to be the poset of all extension of $P$ (ordered by inclusion), given a chain $\mathcal{C}$ of elements in $\mathcal{P}$ , the union $\bigcup \mathcal{C}$ is an element of $\mathcal{P}$ , so that $\mathcal{P}$ has a maximal element, which can easily be seen to be linear. Thus we have just proved what is known as the order extension principle:

Proposition 1 (order extension principle)   Every partial ordering on a set can be extended to a linear ordering.
And since every set is trivially a poset, where $a\le b$ iff $a=b$ , we record the following corollary, known as the ordering principle:
Corollary 1 (ordering principle)   Every set can be linearly ordered.

In fact, every poset is the intersection of all of its linear extensions $$P=\bigcap \lbrace L \mid L \mbox{ is a linear extension of } P\rbrace,$$ for if $(a,b)$ is not in the intersection, a linear extension $M$ of $P$ can be constructed via above containing $(a,b)$ , which is a contradiction. A set $\mathcal{S}$ of linear extensions of a poset $P$ is said to be a realizer of $P$ if $\displaystyle{\bigcap \mathcal{S}=P}$ . Every poset has a realizer.

Remark. Instead of the stronger axiom of choice, the order extension principle can be proved using the weaker Boolean prime ideal theorem. Furthermore, the ordering principle implies the axiom of choice for finite sets.

Bibliography

1
W. T. Trotter, Combinatorics and Partially Ordered Sets, Johns-Hopkins University Press, Baltimore (1992).
2
T. J. Jech, The Axiom of Choice, North-Holland Pub. Co., Amsterdam, (1973).




"extension of a poset" is owned by CWoo.
(view preamble | get metadata)

View style:

Other names:  linear extension
Also defines:  maximal poset, linear extension of a poset, realizer, ordering principle, order extension principle

Attachments:
dimension of a poset (Definition) by CWoo
Log in to rate this entry.
(view current ratings)

Cross-references: axiom of choice for finite sets, implies, Boolean prime ideal theorem, axiom of choice, stronger, contradiction, intersection, linearly ordered, iff, linear ordering, maximal element, union, chain, inclusion, Zorn's lemma, elements, linearly ordered set, comparable, partial ordering, extension, poset
There are 4 references to this entry.

This is version 12 of extension of a poset, born on 2007-01-04, modified 2009-08-21.
Object id is 8713, canonical name is ExtensionOfAPoset.
Accessed 3448 times total.

Classification:
AMS MSC06A06 (Order, lattices, ordered algebraic structures :: Ordered sets :: Partial order, general)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)