Antichain

Height and width

A maximal antichain is an antichain that is not a proper subset of any other antichain. A maximum antichain is an antichain that has cardinality at least as large as every other antichain. The width of a partially ordered set is the cardinality of a maximum antichain. Any antichain can intersect any chain in at most one element, so, if we can partition the elements of an order into ${\displaystyle k}$ chains then the width of the order must be at most ${\displaystyle k}$ (if the antichain has more than ${\displaystyle k}$ elements, by the pigeonhole principle, there would be 2 of its elements belonging to the same chain, a contradiction). Dilworth's theorem states that this bound can always be reached: there always exists an antichain, and a partition of the elements into chains, such that the number of chains equals the number of elements in the antichain, which must therefore also equal the width. Similarly, one can define the height of a partial order to be the maximum cardinality of a chain. Mirsky's theorem states that in any partial order of finite height, the height equals the smallest number of antichains into which the order may be partitioned.

Sperner families

An antichain in the inclusion ordering of subsets of an ${\displaystyle n}$-element set is known as a Sperner family. The number of different Sperner families is counted by the Dedekind numbers, the first few of which numbers are

2, 3, 6, 20, 168, 7581, 7828354, 2414682040998, 56130437228687557907788 (sequence A000372 in the OEIS).

Even the empty set has two antichains in its power set: one containing a single set (the empty set itself) and one containing no sets.

Join and meet operations

Any antichain ${\displaystyle A}$ corresponds to a lower set $${\displaystyle L_A=\{x:\mathrm{\exists }y\in A\text{ such that }x\le y\}.}$$ In a finite partial order (or more generally a partial order satisfying the ascending chain condition) all lower sets have this form. The union of any two lower sets is another lower set, and the union operation corresponds in this way to a join operation on antichains: $${\displaystyle A\vee B=\{x\in A\cup B:\nexists y\in A\cup B\text{ such that }x<y\}.}$$ Similarly, we can define a meet operation on antichains, corresponding to the intersection of lower sets: $${\displaystyle A\wedge B=\{x\in L_A\cap L_B:\nexists y\in L_A\cap L_B\text{ such that }x<y\}.}$$ The join and meet operations on all finite antichains of finite subsets of a set ${\displaystyle X}$ define a distributive lattice, the free distributive lattice generated by ${\displaystyle X.}$ Birkhoff's representation theorem for distributive lattices states that every finite distributive lattice can be represented via join and meet operations on antichains of a finite partial order, or equivalently as union and intersection operations on the lower sets of the partial order.

Computational complexity

In a finite partially ordered set, the maximum antichain (and its size, the width of a given partially ordered set) can be found in polynomial time. Counting the number of antichains in a given partially ordered set is #P-complete.