Antichain

In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two elements in the subset are incomparable. (Some authors use the term "antichain" to mean strong antichain, a subset such that there is no element of the poset smaller than 2 distinct elements of the antichain.)

Let "S" be a partially ordered set. We say two elements "a" and "b" of a partially ordered set are comparable if "a" ≤ "b" or "b" ≤ "a". If two elements are not comparable, we say they are incomparable; that is, "x" and "y" are incomparable if neither "x" ≤ "y" nor "y" ≤ "x".

A chain in "S" is a subset "C" of "S" in which each pair of elements is comparable; that is, "C" is totally ordered. An antichain in "S" is a subset "A" of "S" in which each pair of different elements is incomparable; that is, there is no order relation between any two different elements in "A".

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 "k" chains then the width of the order must be at most "k". 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, we can define the "height" of a partial order to be the maximum cardinality of a chain. A dual of Dilworth's theorem states similarly that in any partial order of finite height, the height equals the smallest number of antichains into which the order may be partitioned.

Integer sequences

The Dedekind numbers count the number of antichains in the power set of an "n"-element set, ordered by inclusion. The first few of these numbers are:2, 3, 6, 20, 168, 7581, 7828354, 2414682040998, 56130437228687557907788 OEIS|id=A000372.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 "A" corresponds to a lower set:$L\_A\; =\; \{x\; mid\; exists\; yin\; Ambox\{\; s.t.\; \}xle\; 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 operationon antichains::$A\; vee\; B\; =\; \{\; S\; in\; Acup\; B\; mid\; otexists\; Tin\; Acup\; Bmbox\{\; s.t.\; \}Ssubset\; T\}.$Similarly, we can define a meet operation on antichains, corresponding to the intersection of lower sets::$A\; wedge\; B\; =\; \{\; xin\; L\_Acap\; L\_Bmid\; otexists\; yin\; L\_Acap\; L\_Bmbox\{\; s.t.\; \}xle\; y\}.$The join and meet operations on all finite antichains of finite subsets of a set "X" define a distributive lattice, the free distributive lattice generated by "X". Garrett 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.

See also

* Strong antichain
* Sperner's theorem

References

*
*