Section6.3Dilworth's Chain Covering Theorem and its Dual¶ permalink

In this section, we prove the following theorem of R.P. Dilworth, which is truly one of the classic results of combinatorial mathematics.

Theorem6.17Dilworth's Theorem

If \(\PXP\) is a poset and \(\width(P)=w\text{,}\) then there exists a partition \(X=C_1\cup C_2\cup\dots \cup C_w\text{,}\) where \(C_i\) is a chain for \(i=1,2,\dots,w\text{.}\) Furthermore, there is no chain partition into fewer chains.

Before proceeding with the proof of Dilworth's theorem in Subsection 6.3.1, we pause to discuss the dual version for partitions into antichains, as it is even easier to prove.

Theorem6.18Dual of Dilworth's Theorem

If \(\PXP\) is a poset and \(\height(P)=h\text{,}\) then there exists a partition \(X=A_1\cup A_2\cup\dots\cup A_h\text{,}\) where \(A_i\) is an antichain for \(i=1,2,\dots,h\text{.}\) Furthermore, there is no partition using fewer antichains.

For each \(x\in X\text{,}\) let \(\height(x)\) be the largest integer \(t\) for which there exists a chain
\begin{equation*}
x_1\lt x_2\lt \dots \lt x_t
\end{equation*}
with \(x=x_t\text{.}\) Evidently, \(\height(x)\le h\) for all \(x\in X\text{.}\) Then for each \(i=1,2,\dots,h\text{,}\) let \(A_i=\{x\in X:\height(x)=i\}\text{.}\) It is easy to see that each \(A_i\) is an antichain, as if \(x,y\in A_i\) are such that \(x\lt y\text{,}\) then there is a chain \(x_1\lt x_2\lt \cdots\lt x_i=x \lt x_{i+i}=y\text{,}\) so \(\height(y)\ge i+1\text{.}\) Since \(\height(P)=h\text{,}\) there is a maximum chain \(C=\{x_1,x_2,\dots,x_h\}\text{.}\) If it were possible to partition \(\bfP\) into \(t\lt h\) antichains, then by the Pigeon Hole Principle, one of the antichains would contain two points from \(C\text{,}\) but this is not possible.

When \(\PXP\) is a poset, a point \(x\in X\) with \(\height(x)=1\) is called a minimal point of \(\bfP\text{.}\) We denote the set of all minimal points of a poset \(\PXP\) by \(\min(X,P)\text{.}\)^{ 1 }Since we use the notation \(\bfP= (X,P)\) for a poset, the set of minimal elements can be denoted by \(\min(\bfP)\) or \(\min(X,P)\text{.}\) This convention will be used for all set valued and integer valued functions of posets.

The argument given for the proof of Theorem 6.18 yields an efficient algorithm, one that is defined recursively. Set \(\bfP_0= \bfP\text{.}\) If \(\bfP_i\) has been defined and \(\bfP_i\neq \emptyset\text{,}\) let \(A_i=\min(\bfP_i)\) and then let \(\bfP_{i+1}\) denote the subposet remaining when \(A_i\) is removed from \(\bfP_i\text{.}\)

In Figure 6.19, we illustrate the antichain partition provided by this algorithm for the \(17\) point poset from Figure 6.5. The darkened points form a chain of size \(5\text{.}\)

Discussion6.20

Alice claims that it is very easy to find the set of minimal elements of a poset. Do you agree?

Dually, we can speak of the set \(\max(\bfP)\) of maximal points of \(\bfP\text{.}\) We can also partition \(\bfP\) into \(\height(\bfP)\) antichains by recursively removing the set of maximal points.

We pause to remark that when \(\PXP\) is a poset, the set of all chains of \(\bfP\) is itself partially ordered by inclusion. So it is natural to say that a chain \(C\) is maximal when there is no chain \(C'\) containing \(C\) as a proper subset. Also, a chain \(C\) is maximum when there is no chain \(C'\) with \(|C|\lt |C'|\text{.}\) Of course, a maximum chain is maximal, but maximal chains need not be maximum.

Maximal antichains and maximum antichains are defined analogously.

With this terminology, the thrust of Theorem 6.18 is that it is easy to find the height \(h\) of a poset as well as a maximum chain \(C\) consisting of \(h\) points from \(\bfP\text{.}\) Of course, we also get a handy partition of the poset into \(h\) antichains.

Subsection6.3.1Proof of Dilworth's Theorem¶ permalink

The argument for Dilworth's theorem is simplified by the following notation. When \(\PXP\) is a poset and \(x\in X\text{,}\) we let \(D(x)=\{y\in X:y\lt x \text{ in } P\}\text{;}\) \(D[x]=\{y\in X:y\le x\text{ in } P\}\text{;}\) \(U(x)=\{y\in X:y>x \text{ in } P\}\text{;}\) \(U[x]=\{y\in X:y\ge x\}\text{;}\) and \(I(x)=\{y\in X-\{x\}:x\Vert y \text{ in } P\}\text{.}\) When \(S\subseteq X\text{,}\) we let \(D(S)= \{y\in X:y\lt x\) in \(P\text{,}\) for some \(x\in S\}\) and \(D[S]=S\cup D(S)\text{.}\) The subsets \(U(S)\) and \(U[S]\) are defined dually. We call \(D(x)\text{,}\) \(D[x]\text{,}\) \(D(s)\text{,}\) and \(D[S]\) down sets, while \(U(x)\text{,}\) \(U[x]\text{,}\) \(U(s)\text{,}\) and \(U[S]\) are up sets. Note that when \(A\) is a maximal antichain in \(\bfP\text{,}\) the ground set \(X\) can be partitioned into pairwise disjoint sets as \(X=A\cup D(A)\cup U(A)\text{.}\)

We are now ready for the proof. Let \(\PXP\) be a poset and let \(w\) denote the width of \(\bfP\text{.}\) As in Theorem 6.18, the Pigeon Hole Principle implies that we require at least \(w\) chains in any chain partition of \(\bfP\text{.}\) To prove that \(w\) suffice, we proceed by induction on \(|X|\text{,}\) the result being trivial if \(|X|=1\text{.}\) Assume validity for all posets with \(|X|\le k\) and suppose that \(\PXP\) is a poset with \(|X|=k+1\text{.}\) Without loss of generality, \(w>1\text{;}\) otherwise, the trivial partition \(X=C_1\) satisfies the conclusion of the theorem. Furthermore, we observe that if \(C\) is a (nonempty) chain in \((X,P)\text{,}\) then we may assume that the subposet \((X-C,P(X-C))\) also has width \(w\text{.}\) To see this, observe that the theorem holds for the subposet, so that if \(\width(X-C,P(X-C))=w'\lt w\text{,}\) then we can partition \(X-C\) as \(X-C=C_1\cup C_2\cup\dots\cup C_{w'}\text{,}\) so that \(X=C\cup C_1\cup\dots\cup C_{w'}\) is a partition into \(w'+1\) chains. Since \(w'\lt w\text{,}\) we know \(w'+1\le w\text{,}\) so we have a partition of \(X\) into at most \(w\) chains. Since any partition of \(X\) into chains must use at least \(w\) chains, this is exactly the partition we seek.

Choose a maximal point \(x\) and a minimal point \(y\) with \(y\le x\) in \(P\text{.}\) Then let \(C\) be the chain containing only the points \(x\) and \(y\text{.}\) Note that \(C\) contains either one or two elements depending on whether \(x\) and \(y\) are distinct.

Let \(Y=X-C\) and \(Q=P(Y)\) and let \(A\) be a \(w\)-element antichain in the subposet \((Y,Q)\text{.}\) In the partition \(X=A\cup D(A)\cup U(A)\text{,}\) the fact that \(y\) is a minimal point while \(A\) is a maximal antichain imply that \(y\in D(A)\text{.}\) Similarly, \(x\in U(A)\text{.}\) In particular, this shows that \(x\) and \(y\) are distinct.

Label the elements of \(A\) as \(\{a_1,a_2,\dots,a_w\}\text{.}\) Note that \(U[A]\ne X\) since \(y\notin U[A]\text{,}\) and \(D[A]\ne X\) since \(x\notin D[A]\text{.}\) Therefore, we may apply the inductive hypothesis to the subposets of \(\bfP\) determined by \(D[A]\) and \(U[A]\text{,}\) respectively, and partition each of these two subposets into \(w\) chains:
\begin{equation*}
U[A]= C_1\cup C_2\cup\dots\cup C_w\quad\text{and} \quad
D[A]=D_1\cup D_2\cup\dots\cup D_w.
\end{equation*}
Without loss of generality, we may assume these chains have been labeled so that \(a_i\in C_i\cap D_i\) for each \(i=1,2,\dots,w\text{.}\) However, this implies that
\begin{equation*}
X=(C_1\cup D_1)\cup (C_2\cup D_2)\cup\dots\cup(C_w\cup D_w)
\end{equation*}
is the desired partition which in turn completes the proof.

In Figure 6.21, we illustrate Dilworth's chain covering theorem for the poset first introduced in Figure 6.5. The darkened points form a \(7\)-element antichain, while the labels provide a partition into \(7\) chains.

Discussion6.22

The ever alert Alice notes that the proof given above for Dilworth's theorem does not seem to provide an efficient algorithm for finding the width \(w\) of a poset, much less a partition of the poset into \(w\) chains. Bob has yet to figure out why listing all the subsets of \(X\) is a bad idea. Carlos is sitting quietly listening to their bickering, but finally, he says that a skilled programmer can devise an algorithm from the proof. Students are encouraged to discuss this dilemma—but rest assured that we will return to this issue later in the text.