|
|
| Line 1: |
Line 1: |
| 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 a set|partition]] of the order into a minimum number of chains. It is named for the mathematician {{harvs|first=Robert P.|last=Dilworth|authorlink=Robert P. Dilworth|year=1950|txt}}.
| | These are one-year term prices and, of course, subject to change at any given moment. With Hostgator's Baby plan this is just the case, you have a lot of freedom to make the web pages you want as well as manage more than one website or blog. Hostgator have over 200,000 satisfied clients, the reviews across the internet are mainly positive and the only negative reviews are from those people who dont know anything about the internet. We dare say it's the best hosting service provider. The best thing you can do to further your writing career is...write! I will advise you about the best way to get a high level of support at NameCheap. You need a domain name. They have 24/7 tech support that will literally walk you threw everything or do it for you. If you are looking for web hosting packages, you'll be [http://browse.deviantart.com/?q=surprised surprised] to find a great number of web hosting companies and even individuals offering this type of services. What makes a blog different from a static website is the ability for users to interact through various methods; the most common being a commenting system where users can leave additional information, comments and insights about your posts.<br><br><br><br>[http://www.google.de/url?url=https://www.facebook.com/HostgatorCoupons2015&rct=j&q=&esrc=s&sa=U&ei=ghjtVLGyDIm67gaJgYHgBw&ved=0CFYQFjAJ&usg=AFQjCNFZV08fcGdiUfiXV6DoJCc89otV0Q google.de]<br><br>You acquire boundless WordPress blogs, limitless bandwidth plus web freedom surrounded by many new benefits. Unlike regular blogs or websites, phpbb message board requires maintenance daily and weekly. You get to keep a hundred of the profits. Supposing you have decided to use Wordpress as your blogging platform of choice. However with the variety of decisions accessible, it is often tough to determine which one to utilize. Now, I can tell you exactly how to do this because I've done it literally hundreds of times now. For shared hosting services you may want to launch a small online business with a shopping cart, a personal website, blog, forum or photo gallery. If you have any concerns with regards to the place and how to use [http://dawonls.dothome.co.kr/db/?document_srl=404383 Hostgator Voucher], you can speak to us at our site. With the most professional and complete web hosting services and plans to choose from. |
| | |
| 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 ==
| |
| | |
| The following proof by induction on the size of the partially ordered set <math>P</math> is based on that of {{harvs|last=Galvin|authorlink=Fred Galvin|txt|year=1994}}.
| |
| | |
| Let <math>P</math> be a finite partially ordered set. The theorem holds trivially if <math>P</math> is empty. So, assume that <math>P</math> has at least one element, and let <math>a</math> be a maximal element of <math>P</math>.
| |
| | |
| By induction, we assume that for some integer <math>k</math> the partially ordered set <math>P':=P\setminus\{a\}</math> can be covered by <math>k</math> disjoint chains <math>C_1,\dots,C_k</math> and has at least one antichain <math>A_0</math> of size <math>k</math>. Clearly, <math>A_0\cap C_i\ne\emptyset</math> for <math>i=1,2,\dots,k</math>. For <math>i=1,2,\dots,k</math>, let <math>x_i</math> be the maximal element in <math>C_i</math> that belongs to an antichain of size <math>k</math> in <math>P'</math>, and set <math>A:=\{x_1,x_2,\dots,x_k\}</math>.
| |
| We claim that <math>A</math> is an antichain.
| |
| Let <math>A_i</math> be an antichain of size <math>k</math> that contains <math>x_i</math>. Fix arbitrary distinct indices <math>i</math> and <math>j</math>. Then <math>A_i\cap C_j\ne\emptyset</math>. Let <math>y\in A_i\cap C_j</math>. Then <math>y\le x_j</math>, by the definition of <math>x_j</math>. This implies that <math>x_i\not \ge x_j</math>, since <math>x_i\not\ge y</math>. By interchanging the roles of <math>i</math> and <math>j</math> in this argument we also have <math>x_j\not\ge x_i</math>. This verifies that <math>A</math> is an antichain.
| |
| | |
| We now return to <math>P</math>. Suppose first that <math>a\ge x_i</math> for some <math>i\in\{1,2,\dots,k\}</math>. Let <math>K</math> be the chain <math>\{a\}\cup\{z\in C_i:z\le x_i\}</math>. Then by the choice of <math>x_i</math>, <math>P\setminus K</math> does not have an antichain of size <math>k</math>. Induction then implies that <math>P\setminus K</math> can be covered by <math>k-1</math> disjoint chains since <math>A \setminus \{x_i \}</math> is an antichain of size <math>k - 1</math> in <math>P \setminus K</math>.
| |
| Thus, <math>P</math> can be covered by <math>k</math> disjoint chains, as required. Next, if <math>a\not\ge x_i</math> for each <math>i\in\{1,2,\dots,k\}</math>, then <math>A\cup\{a\}</math> is an antichain of size <math>k+1</math> in <math>P</math> (since <math>a</math> is maximal in <math>P</math>). Now <math>P</math> can be covered by the <math>k+1</math> chains <math>\{a\},C_1,C_2,\dots,C_k</math>, completing the proof.
| |
| | |
| ==Proof via König's theorem== | |
| [[Image:Dilworth-via-König.svg|thumb|300px|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 (graph theory)|König's theorem]] on [[bipartite graph]] matching and several other related theorems including Hall's [[Marriage theorem]] {{harv|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==
| |
| 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 [[graph coloring|coloring]] of the [[comparability graph|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 (graph theory)|De Bruijn–Erdős theorem]], ''P'' itself also has a ''w''-colorable incomparability graph, and thus has the desired partition into chains {{harv|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 [[Aleph-naught|ℵ<sub>0</sub>]] whose partition into the fewest chains has κ chains {{harv|Harzheim|2005}}.
| |
| | |
| {{harvtxt|Perles|1963}} discusses analogues of Dilworth's theorem in the infinite setting.
| |
| | |
| ==Dual of Dilworth's theorem (Mirsky's theorem)==
| |
| {{main|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 {{harv|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''<sup>−1</sup>(''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==
| |
| 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 (graph theory)|clique]] in a comparability graph corresponds to a chain, and an [[Independent set (graph theory)|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 graph|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 {{harv|Berge|Chvátal|1984}}. By the [[perfect graph theorem]] of {{harvtxt|Lovász|1972}}, the [[Complement graph|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 {{harv|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== | |
| The [[Boolean lattice]] ''B''<sub>''n''</sub> is the [[power set]] of an ''n''-element set ''X''—essentially {1, 2, …, ''n''}—ordered by [[inclusion (set theory)|inclusion]] or, notationally, (2<sup>[''n'']</sup>, ⊆). [[Sperner's theorem]] states that a maximum antichain of ''B''<sub>''n''</sub> has size at most
| |
| :<math>\mbox{width}(B_n) = {n \choose \lfloor{n/2}\rfloor}.</math>
| |
| 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, 2''n''] by [[divisibility]], the subinterval [''n'' + 1, 2''n''] 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,2''n''], form a chain of the numbers of the form ''m''2<sup>''i''</sup>. 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 {{harv|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 {{harv|Edelman|Saks|1988}}.
| |
| | |
| ==References==
| |
| *{{citation
| |
| | last1 = Berge | first1 = Claude | author1-link = Claude Berge
| |
| | last2 = Chvátal | first2 = Václav | author2-link = Václav Chvátal
| |
| | isbn = 978-0-444-86587-8
| |
| | page = viii
| |
| | publisher = Elsevier
| |
| | series = Annals of Discrete Mathematics
| |
| | title = Topics on Perfect Graphs
| |
| | volume = 21
| |
| | year = 1984}}
| |
| *{{citation
| |
| | last = Dilworth | first = Robert P.
| |
| | authorlink = Robert P. Dilworth
| |
| | title = A Decomposition Theorem for Partially Ordered Sets
| |
| | jstor = 1969503
| |
| | journal = [[Annals of Mathematics]]
| |
| | volume = 51
| |
| | issue = 1 | pages = 161–166 | year = 1950
| |
| | doi = 10.2307/1969503}}.
| |
| *{{citation
| |
| | last1 = Edelman | first1 = Paul H.
| |
| | last2 = Saks | first2 = Michael E.
| |
| | doi = 10.1007/BF00143895
| |
| | issue = 1
| |
| | journal = [[Order (journal)|Order]]
| |
| | pages = 23–32
| |
| | title = Combinatorial representation and convex dimension of convex geometries
| |
| | volume = 5
| |
| | year = 1988}}.
| |
| *{{citation
| |
| | last = Fulkerson | first = D. R.
| |
| | authorlink = D. R. Fulkerson
| |
| | title = Note on Dilworth’s decomposition theorem for partially ordered sets
| |
| | journal = [[Proceedings of the American Mathematical Society]]
| |
| | volume = 7
| |
| | issue = 4 | pages = 701–702 | year = 1956
| |
| | jstor = 2033375}}.
| |
| *{{citation
| |
| | last = Galvin | first = Fred | authorlink = Fred Galvin
| |
| | title = A proof of Dilworth's chain decomposition theorem
| |
| | mr = 1270960
| |
| | jstor = 2975628
| |
| | journal = [[American Mathematical Monthly|The American Mathematical Monthly]]
| |
| | year = 1994 | volume = 101 | issue = 4 | pages = 352–353
| |
| | doi = 10.2307/2975628}}.
| |
| *{{citation
| |
| | last = Harzheim | first = Egbert
| |
| | isbn = 0-387-24219-8
| |
| | location = New York
| |
| | mr = 2127991
| |
| | at = Theorem 5.6, p. 60
| |
| | publisher = Springer
| |
| | series = Advances in Mathematics (Springer)
| |
| | title = Ordered sets
| |
| | url = http://books.google.com/books?id=FYV6tGm3NzgC&pg=PA59
| |
| | volume = 7
| |
| | year = 2005}}.
| |
| *{{citation
| |
| | last = Lovász | first = László | author-link = László Lovász
| |
| | doi = 10.1016/0012-365X(72)90006-4
| |
| | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
| |
| | pages = 253–267
| |
| | title = Normal hypergraphs and the perfect graph conjecture
| |
| | volume = 2
| |
| | year = 1972
| |
| | issue = 3}}.
| |
| *{{citation
| |
| | authorlink = Leon Mirsky
| |
| | last = Mirsky | first = Leon
| |
| | title = A dual of Dilworth's decomposition theorem
| |
| | jstor = 2316481
| |
| | journal = [[American Mathematical Monthly]]
| |
| | volume = 78
| |
| | issue = 8 | year = 1971 | pages = 876–877
| |
| | doi = 10.2307/2316481}}.
| |
| *{{citation
| |
| | last1 = Nešetřil | first1 = Jaroslav | author1-link = Jaroslav Nešetřil
| |
| | last2 = Ossona de Mendez | first2 = Patrice
| |
| | contribution = Theorem 3.13
| |
| | doi = 10.1007/978-3-642-27875-4
| |
| | isbn = 978-3-642-27874-7
| |
| | location = Heidelberg
| |
| | mr = 2920058
| |
| | page = 42
| |
| | publisher = Springer
| |
| | series = Algorithms and Combinatorics
| |
| | title = Sparsity: Graphs, Structures, and Algorithms
| |
| | volume = 28
| |
| | year = 2012}}.
| |
| *{{citation
| |
| | last = Perles | first = Micha A. | |
| | title = On Dilworth's theorem in the infinite case
| |
| | mr = 0168497
| |
| | journal=Israel Journal of Mathematics
| |
| | year = 1963 | volume = 1 | pages = 108–109
| |
| | doi=10.1007/BF02759806
| |
| | issue = 2}}.
| |
| *{{citation
| |
| | last = Steele | first = J. Michael | authorlink = J. Michael Steele
| |
| | contribution = Variations on the monotone subsequence theme of Erdős and Szekeres
| |
| | editor1-last = Aldous | editor1-first = David | editor1-link = David Aldous
| |
| | editor2-last = Diaconis | editor2-first = Persi | editor2-link = Persi Diaconis
| |
| | editor3-last = Spencer | editor3-first = Joel | editor3-link = Joel Spencer
| |
| | editor4-last = Steele | editor4-first = J. Michael | editor4-link = J. Michael Steele
| |
| | pages = 111–131
| |
| | publisher = Springer-Verlag
| |
| | series = IMA Volumes in Mathematics and its Applications
| |
| | title = Discrete Probability and Algorithms
| |
| | url = http://www-stat.wharton.upenn.edu/~steele/Publications/PDF/VOTMSTOEAS.pdf
| |
| | volume = 72
| |
| | year = 1995}}.
| |
| | |
| == External links ==
| |
| * [http://robertborgersen.info/Presentations/GS-05R-1.pdf Equivalence of seven major theorems in combinatorics]
| |
| * {{Citation| url = http://planetmath.org/encyclopedia/DualOfDilworthsTheorem.html
| |
| | title = Dual of Dilworth's Theorem
| |
| | work = [[PlanetMath]]| postscript =
| |
| }}
| |
| * {{Citation| author = Babai, László
| |
| | authorlink = László Babai
| |
| | url = http://www.classes.cs.uchicago.edu/archive/2005/spring/37200-1/notes/10.pdf
| |
| | title = Lecture notes in Combinatorics and Probability, Lecture 10: Perfect Graphs
| |
| | year = 2005| postscript =
| |
| }}
| |
| * {{Citation| author = Felsner, S., Raghavan, V., and Spinrad, J.
| |
| | year = 1999
| |
| | title = Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number
| |
| | url = http://www.inf.fu-berlin.de/inst/pubs/tr-b-99-05.abstract.html| postscript =
| |
| }}
| |
| * {{mathworld | title = Dilworth's Lemma | urlname = DilworthsLemma}}
| |
| | |
| [[Category:Order theory]]
| |
| [[Category:Theorems in combinatorics]]
| |
| [[Category:Articles containing proofs]]
| |
| [[Category:Perfect graphs]]
| |