maths.free › Combinatorics & Graph Theory › Partially Ordered Sets › Dilworth's Chain Covering Theorem and its Dual

Dilworth's Chain Covering Theorem and its Dual

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

Dilworth's Chain Covering Theorem and its Dual

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

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

Theorem: Dual of Dilworth's Theorem

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

Proof

For each \(x\in X\), let \(\height(x)\) be the largest integer \(t\) for which there exists a chain \[\begin{aligned}\end{aligned}\] with \(x=x_t\). Evidently, \(\height(x)\le h\) for all \(x\in X\). Then for each \(i=1,2,\dots,h\), let \(A_i=\{x\in X:\height(x)=i\}\). 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\), then there is a chain \(x_1\lt x_2\lt \cdots\lt x_i=x \lt x_{i+i}=y\), so \(\height(y)\ge i+1\). Since \(\height(P)=h\), there is a maximum chain \(C=\{x_1,x_2,\dots,x_h\}\). 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\), 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\). We denote the set of all minimal points of a poset \(\PXP\) by \(\min(X,P)\).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)\). This convention will be used for all set valued and integer valued functions of posets.

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

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

Maximal antichains and maximum antichains are defined analogously.

Condensed: the full section is in Keller & Trotter, Applied Combinatorics.

Indi sen Hiç bir hasapçy buny çözmez, emma onuň bölekleri hasaplanmak üçindir. Aşakda birini synla ýa-da özüňi ýaz.

Tälim (1)

Her birini kagyzda synlap gör. Çözgüni barlap görmek üçin aç; barlap görlenler her bir ädim üçin çözgüççide açylyp bilner.

Consider implementing an algorithm from on the poset of . First, verify that you agree with the labeling of the points with their heights, which assigns the points to antichains. Explain why this poset is a good illustration of why finding the chain of five points is best done by starting with a point labeled \(5\) and working down instead of starting with a point labeled \(1\) and working up.

Özüň işle

Mugt hasap her bir ders üçin notlar goşýar, tamamlanan zadyňyzyň ýazgysyny, çözen problemaňyzy bir ýerde, we bu sahypa barada sorap biljek mugallymy. Matematika özüçe her kim üçin açyk, girseň ýa girmeseň.

_Gün _Giriş

Şu ýerde ulanylan simwollar

Eň täze düşündirme, surat, we her harpyň manysy üçin her bir simwoly basyň.

Adamlar soraýan soraglar

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Bu sahypanyň käbir bölegi şundan alyndy Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Bu ýerde gysgaldylan we tekrar beýan edilen; hatalar biziňkidir.

_Ýaşa Combinatorics & Graph Theory

The counting principles Pigeonhole principle and inclusion, exclusion Binomial coefficients and Pascal's triangle Recurrences and generating functions Graphs: vertices, edges, degrees Paths, cycles, trees, Euler and Hamilton Colouring and planar graphs