Alternative Inductive Proof of Dilworth’s Theorem
May 31, 2026
Abstract
Several elegant inductive proofs of Dilworth’s theorem can be found in the literature (e.g., [1], [2]). In this note, we present another inductive proof with an algorithmic flavor based on a merging lemma.
Lemma 1. Let \(S\) be a finite poset with an initial \(k\)-chain decomposition \(\mathcal{C}=\{C_1, \dots, C_k\}\). We assign a color to each element of \(S\): for any element \(x\in C_i\), its color is defined to be \(i\). (That is, elements in the same \(C_i\) share the same color, and elements from different \(C_i\) have distinct colors.) For any chain decomposition \(\mathcal{C}'\), a legal merge* is defined as follows: if two chains in \(\mathcal{C}'\) have minimal elements of the same color, merge the monochromatic bottom segment of one into the other. The merge is directed toward the chain containing the maximal element of the two monochromatic segments. There exists a finite sequence of legal merges resulting in a decomposition \(\mathcal{C}''\) where the minimal elements of the chains have pairwise distinct colors.*
Proof. Let \(\Phi\) be the total number of monochromatic segments in \(\mathcal{C}'\). Each legal merge reduces \(\Phi\) by exactly \(1\). Since \(\Phi \ge k\) and \(S\) is finite, the process must terminate. ◻
Theorem 1 (Dilworth). The minimum number of chains needed to cover a finite poset \(S\) is equal to the maximum size of an antichain in \(S\).
Proof. Clearly, the minimum number of chains is at least the maximum size of an antichain. It remains to show that equality holds, which we prove by induction on \(|S|\).
The base case \(|S|=1\) is trivial. Let \(e\) be a maximal element of \(S\), and let \(S'=S\setminus\{e\}\). Let \(k\) be the size of the maximum antichain in \(S'\). By the inductive hypothesis, \(S'\) admits a \(k\)-chain decomposition \(\{C_1, \dots, C_k\}\). Assign to each chain \(C_i\) a distinct color \(i\), and color all elements within \(C_i\) with this color. Define \[L_i = \{c \in C_i \mid c \preceq e\}, \quad U_i = \{c \in C_i \mid c \npreceq e\}.\]
Let \(U = \bigcup_{i=1}^k U_i\). By induction, \(U\) decomposes into \(r'\) chains \(\mathcal{U}'\), where \(r'\) is the size of the largest antichain in \(U\). By the Lemma, \(\mathcal{U}'\) can be adjusted to a decomposition \(\mathcal{U}''\) with \(r''\) chains of distinct minimal element colors, where \(r'' \le r' \le k\).
Each chain in \(\mathcal{U}''\) pairs with exactly one \(L_i\) by the color of its minimal element. If \(r'' < k\), we append \(e\) to any unpaired \(L_i\) to form a chain, yielding a partition of \(S\) into \(k\) chains. If \(r'' = k\), let the element \(e\) form a separate chain; however, since \(e\) is incomparable to all elements in \(U\), any maximum antichain of \(U\) together with \(e\) forms an antichain of size \(k+1\). The equality remains satisfied. ◻