Dilworth's theorem

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, in the areas of order theory and combinatorics, Dilworth's theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician Robert P. Dilworth (1950).

An antichain in a partially ordered set is a set of elements no two of which are comparable to each other, and a chain is a set of elements every two of which are comparable. Dilworth's theorem states that there exists an antichain A, and a partition of the order into a family P of chains, such that the number of chains in the partition equals the cardinality of A. When this occurs, A must be the largest antichain in the order, for any antichain can have at most one element from each member of P. Similarly, P must be the smallest family of chains into which the order can be partitioned, for any partition into chains must have at least one chain per element of A. The width of the partial order is defined as the common size of A and P.

An equivalent way of stating Dilworth's theorem is that, in any finite partially ordered set, the maximum number of elements in any antichain equals the minimum number of chains in any partition of the set into chains. A version of the theorem for infinite partially ordered sets states that, in this case, a partially ordered set has finite width w if and only if it may be partitioned into w chains, but not less.

Inductive proof[edit]

The following proof by induction on the size of the partially ordered set P is based on that of Galvin (1994).

Let P be a finite partially ordered set. The theorem holds trivially if P is empty. So, assume that P has at least one element, and let a be a maximal element of P.

By induction, we assume that for some integer k the partially ordered set P':=P\setminus\{a\} can be covered by k disjoint chains C_1,\dots,C_k and has at least one antichain A_0 of size k. Clearly, A_0\cap C_i\ne\emptyset for i=1,2,\dots,k. For i=1,2,\dots,k, let x_i be the maximal element in C_i that belongs to an antichain of size k in P', and set A:=\{x_1,x_2,\dots,x_k\}. We claim that A is an antichain. Let A_i be an antichain of size k that contains x_i. Fix arbitrary distinct indices i and j. Then A_i\cap C_j\ne\emptyset. Let y\in A_i\cap C_j. Then y\le x_j, by the definition of x_j. This implies that x_i\not \ge x_j, since x_i\not\ge y. By interchanging the roles of i and j in this argument we also have x_j\not\ge x_i. This verifies that A is an antichain.

We now return to P. Suppose first that a\ge x_i for some i\in\{1,2,\dots,k\}. Let K be the chain \{a\}\cup\{z\in C_i:z\le x_i\}. Then by the choice of x_i, P\setminus K does not have an antichain of size k. Induction then implies that P\setminus K can be covered by k-1 disjoint chains since A \setminus \{x_i \} is an antichain of size k - 1 in P \setminus K. Thus, P can be covered by k disjoint chains, as required. Next, if a\not\ge x_i for each i\in\{1,2,\dots,k\}, then A\cup\{a\} is an antichain of size k+1 in P (since a is maximal in P). Now P can be covered by the k+1 chains \{a\},C_1,C_2,\dots,C_k, completing the proof.

Proof via König's theorem[edit]

Proof of Dilworth's theorem via König's theorem: constructing a bipartite graph from a partial order, and partitioning into chains according to a matching

Like a number of other results in combinatorics, Dilworth's theorem is equivalent to König's theorem on bipartite graph matching and several other related theorems including Hall's Marriage theorem (Fulkerson 1956).

To prove Dilworth's theorem for a partial order S with n elements, using König's theorem, define a bipartite graph G = (U,V,E) where U = V = S and where (u,v) is an edge in G when u < v in S. By König's theorem, there exists a matching M in G, and a set of vertices C in G, such that each edge in the graph contains at least one vertex in C and such that M and C have the same cardinality m. Let A be the set of elements of S that do not correspond to any vertex in C; then A has at least n - m elements (possibly more if C contains vertices corresponding to the same element on both sides of the bipartition). Let P be a family of chains formed by including x and y in the same chain whenever there is an edge (x,y) in M; then P has n - m chains. Therefore, we have constructed an antichain and a partition into chains with the same cardinality.

To prove König's theorem from Dilworth's theorem, for a bipartite graph G = (U,V,E), form a partial order on the vertices of G in which u < v exactly when u is in U, v is in V, and there exists an edge in E from u to v. By Dilworth's theorem, there exists an antichain A and a partition into chains P both of which have the same size. But the only nontrivial chains in the partial order are pairs of elements corresponding to the edges in the graph, so the nontrivial chains in P form a matching in the graph. The complement of A forms a vertex cover in G with the same cardinality as this matching.

This connection to bipartite matching allows the width of any partial order to be computed in polynomial time.

Extension to infinite partially ordered sets[edit]

Dilworth's theorem for infinite partially ordered sets states that a partially ordered set has finite width w if and only if may be partitioned into w chains. For, suppose that an infinite partial order P has width w, meaning that there are at most a finite number w of elements in any antichain. For any subset S of P, a decomposition into w chains (if it exists) may be described as a coloring of the incomparability graph of S (a graph that has the elements of S as vertices, with an edge between every two incomparable elements) using w colors; every color class in a proper coloring of the incomparability graph must be a chain. By the assumption that P has width w, and by the finite version of Dilworth's theorem, every finite subset S of P has a w-colorable incomparability graph. Therefore, by the De Bruijn–Erdős theorem, P itself also has a w-colorable incomparability graph, and thus has the desired partition into chains (Harzheim 2005).

However, the theorem does not extend so simply to partially ordered sets in which the width, and not just the cardinality of the set, is infinite. In this case the size of the largest antichain and the minimum number of chains needed to cover the partial order may be very different from each other. In particular, for every infinite cardinal number κ there is an infinite partially ordered set of width 0 whose partition into the fewest chains has κ chains (Harzheim 2005).

Perles (1963) discusses analogues of Dilworth's theorem in the infinite setting.

Dual of Dilworth's theorem (Mirsky's theorem)[edit]

Main article: Mirsky's theorem

A dual of Dilworth's theorem states that the size of the largest chain in a partial order (if finite) equals the smallest number of antichains into which the order may be partitioned (Mirsky 1971). The proof of this is much simpler than the proof of Dilworth's theorem itself: for any element x, consider the chains that have x as their largest element, and let N(x) denote the size of the largest of these x-maximal chains. Then each set N−1(i), consisting of elements that have equal values of N, is an antichain, and these antichains partition the partial order into a number of antichains equal to the size of the largest chain.

Perfection of comparability graphs[edit]

A comparability graph is an undirected graph formed from a partial order by creating a vertex per element of the order, and an edge connecting any two comparable elements. Thus, a clique in a comparability graph corresponds to a chain, and an independent set in a comparability graph corresponds to an antichain. Any induced subgraph of a comparability graph is itself a comparability graph, formed from the restriction of the partial order to a subset of its elements.

An undirected graph is perfect if, in every induced subgraph, the chromatic number equals the size of the largest clique. Every comparability graph is perfect: this is essentially just Mirsky's theorem, restated in graph-theoretic terms (Berge & Chvátal 1984). By the perfect graph theorem of Lovász (1972), the complement of any perfect graph is also perfect. Therefore, the complement of any comparability graph is perfect; this is essentially just Dilworth's theorem itself, restated in graph-theoretic terms (Berge & Chvátal 1984). Thus, the complementation property of perfect graphs can provide an alternative proof of Dilworth's theorem.

Width of special partial orders[edit]

The Boolean lattice Bn is the power set of an n-element set X—essentially {1, 2, …, n}—ordered by inclusion or, notationally, (2[n], ⊆). Sperner's theorem states that a maximum antichain of Bn has size at most

\mbox{width}(B_n) = {n \choose \lfloor{n/2}\rfloor}.

In other words, a largest family of incomparable subsets of X is obtained by selecting the subsets of X that have median size. The Lubell–Yamamoto–Meshalkin inequality also concerns antichains in a power set and can be used to prove Sperner's theorem.

If we order the integers in the interval [1, 2n] by divisibility, the subinterval [n + 1, 2n] forms an antichain with cardinality n. A partition of this partial order into n chains is easy to achieve: for each odd integer m in [1,2n], form a chain of the numbers of the form m2i. Therefore, by Dilworth's theorem, the width of this partial order is n. Abouabdillah's theorem characterizes the integers that can belong to maximum antichains in this order.

The Erdős–Szekeres theorem on monotone subsequences can be interpreted as an application of Dilworth's theorem to partial orders of order dimension two (Steele 1995).

The "convex dimension" of an antimatroid is defined as the minimum number of chains needed to define the antimatroid, and Dilworth's theorem can be used to show that it equals the width of an associated partial order; this connection leads to a polynomial time algorithm for convex dimension (Edelman & Saks 1988).

References[edit]

External links[edit]