{"id":1573,"date":"2016-01-12T19:10:22","date_gmt":"2016-01-13T00:10:22","guid":{"rendered":"http:\/\/matroidunion.org\/?p=1573"},"modified":"2016-01-12T19:10:22","modified_gmt":"2016-01-13T00:10:22","slug":"whittles-stabilizer-theorem","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=1573","title":{"rendered":"Whittle&#8217;s Stabilizer Theorem"},"content":{"rendered":"<p>Representable matroids are an attractive subclass of matroids, because in their study you have access to an extra tool: a matrix representing this matroid. This is a concise way to describe a matroid: $O(n^2)$ numbers as opposed to $O(2^{2^n})$ bits declaring which subsets are (in)dependent. Let $M$ be a matroid, and $A$ a representation matrix of $M$. The following operations do not change the matroid:<\/p>\n<ul>\n<li>Add a multiple of a row of $A$ to another row of $A$;<\/li>\n<li>Scale a row of $A$ by a nonzero constant;<\/li>\n<li>Scale a column of $A$ by a nonzero constant;<\/li>\n<li>Add or remove all-zero rows;<\/li>\n<li>Apply a field automorphism to each entry\u00a0of $A$.<\/li>\n<\/ul>\n<p>If a matrix $A_1$\u00a0can be turned into a matrix $A_2$ through such operations, then we say $A_1$ and $A_2$ are\u00a0<em>equivalent<\/em>. If we don&#8217;t use any field automorphisms, then we say they are\u00a0<em>projectively equivalent.\u00a0<\/em>Generally, a matroid can have multiple inequivalent representations over a field. The\u00a0exceptions are the finite fields\u00a0$\\textrm{GF}(2)$ and $\\textrm{GF}(3)$ (shown in [BL]).<\/p>\n<p>When\u00a0we try to prove\u00a0some theorem about a matroid or class of matroids, inequivalent representations can be\u00a0a major complicating factor. For instance, the excluded-minor characterization of ternary matroids can be proven in under five\u00a0pages [Oxley, pp. 380-385], whereas the excluded-minor characterization of quaternary matroids takes over fifty [GGK]. It is not surprising, then, that significant efforts have been made to get a handle on inequivalent representations. In this post I will focus on one such effort, namely a very attractive theorem by Geoff Whittle, who recently celebrated his 65th birthday with a wonderful <a href=\"http:\/\/sms.victoria.ac.nz\/Events\/GeoffWhittleConference\/WebHome\">workshop<\/a>. First, a definition.<\/p>\n<p><strong>Definition.\u00a0<\/strong>Let $\\mathbb{F}$ be a field, and $\\mathcal{M}$ a\u00a0minor-closed class of $\\mathbb{F}$-representable matroids. Let $N \\in \\mathcal{M}$. We say $N$ is a\u00a0<em>stabilizer<\/em> for $\\mathcal{M}$ if, for every 3-connected matroid $M \\in \\mathcal{M}$ that has $N$ as a minor, each representation of $N$ (over $\\mathbb{F}$) extends to at most one representation of $M$ (up to the equivalence defined above).<\/p>\n<p>In other words, once we\u00a0select a representation for $N$, we have uniquely determined a representation of $M$. A small example: let $\\mathbb{F} = \\textrm{GF}(5)$, let $\\mathcal{M}$ be the set of all minors of the non-Fano matroid $F_7^-$, and let $N$ be the rank-3 wheel. Now $N$ has the following representation:<\/p>\n<p>$$<br \/>\n\\begin{bmatrix}<br \/>\n1 &amp; 0 &amp; 0 &amp; 1 &amp; 0 &amp; 1\\\\<br \/>\n0 &amp; 1 &amp; 0 &amp; 1 &amp; 1 &amp; 0\\\\<br \/>\n0 &amp; 0 &amp; 1 &amp; 0 &amp; 1 &amp; a<br \/>\n\\end{bmatrix}<br \/>\n$$<\/p>\n<p>where $a \\in \\{1, 2, 3\\}$. The only 3-connected matroids in $\\mathcal{M}$ that have $N$ as a minor are $N$ itself and $F_7^-$. We need to check that each representation of $N$ extends to at most one representation of $F_7^-$. Up to equivalence, the latter representation must look like<\/p>\n<p>$$<br \/>\n\\begin{bmatrix}<br \/>\n1 &amp; 0 &amp; 0 &amp; 1 &amp; 0 &amp; 1 &amp; 1\\\\<br \/>\n0 &amp; 1 &amp; 0 &amp; 1 &amp; 1 &amp; 0 &amp; b\\\\<br \/>\n0 &amp; 0 &amp; 1 &amp; 0 &amp; 1 &amp; a &amp; c<br \/>\n\\end{bmatrix}<br \/>\n$$<\/p>\n<p>and it is readily checked that we must have $b = c = a = 1$. Hence two of the representations of $N$\u00a0do not extend to a representation of $M$, whereas one extends uniquely to a representation of $M$. So $N$ is a stabilizer for $\\mathcal{M}$.<\/p>\n<p>If $\\mathcal{M}$ is an infinite\u00a0class, we cannot\u00a0do an exhaustive check as in the example to verify a stabilizer. But Geoff Whittle managed to prove that a finite check still suffices:<\/p>\n<p><strong>Whittle&#8217;s Stabilizer Theorem [Whi].\u00a0<\/strong><em>Let $\\mathcal{M}$ be a minor-closed class of $\\mathbb{F}$-representable matroids, and $N \\in \\mathcal{M}$ a 3-connected matroid. Exactly one of the following holds:<\/em><\/p>\n<ul>\n<li><em>$N$ is a stabilizer for $\\mathcal{M}$ over $\\mathbb{F}$;<\/em><\/li>\n<li><em>There is a 3-connected matroid $M \\in \\mathcal{M}$ such that either:<\/em>\n<ul style=\"list-style-type: circle;\">\n<li><em>$N = M\\backslash e$ and some representation of $N$ extends to more than one representation of $M$;<\/em><\/li>\n<li><em>$N = M \/ e$ and some representation of $N$ extends to more than one representation of $M$;<\/em><\/li>\n<li><em>$N = M \/ e \\backslash f$, $M \/ e$ and $M \\backslash f$ are 3-connected,\u00a0and some representation of $N$ extends to more than one representation of $M$.<\/em><\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>I will conclude this post with two applications. I will leave the finite case checks to the reader.<\/p>\n<p><strong>Lemma.\u00a0<\/strong><em>The matroid $U_{2,4}$ is a stabilizer for the class of quaternary matroids.<\/em><\/p>\n<p><strong>Corollary [Kah].\u00a0<\/strong><em>A 3-connected, quaternary, non-binary matroid has a unique representation over $\\textrm{GF}(4)$.<\/em><\/p>\n<p><em>Proof.\u00a0<\/em>A non-binary matroid $M$ has a $U_{2,4}$-minor. The matroid $U_{2,4}$ has the following representation:<\/p>\n<p>$$<br \/>\n\\begin{bmatrix}<br \/>\n1 &amp; 0 &amp; 1 &amp; 1\\\\<br \/>\n0 &amp; 1 &amp; 1 &amp; a<br \/>\n\\end{bmatrix}<br \/>\n$$<br \/>\nwhere $a \\not\\in \\{0,1\\}$. This leaves two choices for $a$, that are related through a field automorphism. Hence $U_{2,4}$ has (up to equivalence) a unique representation over $\\textrm{GF}(4)$. But $U_{2,4}$ is a stabilizer, so $M$ is uniquely representable over $\\textrm{GF}(4)$ as well. $\\square$<\/p>\n<p><strong>Lemma.\u00a0<\/strong><em>The matroids $U_{2,5}$ and $U_{3,5}$ are stabilizers for the class of quinary matroids.<\/em><\/p>\n<p><strong>Lemma.\u00a0<\/strong><em>The matroid $U_{2,4}$ is a stabilizer for the class of quinary matroids with no minor isomorphic to $U_{2,5}$ and $U_{3,5}$.<\/em><\/p>\n<p><strong>Corollary [OVW].\u00a0<\/strong><em>A 3-connected, quinary matroid has at most six inequivalent representations over $\\textrm{GF}(5)$.<\/em><\/p>\n<p><em>Proof. <\/em>$U_{2,5}$ and $U_{3,5}$ have six inequivalent representations and are stabilizers. If $M$ does not have such a minor, then either $M$ is regular (and thus uniquely representable over any field) or $M$ has a $U_{2,4}$-minor, which is has three inequivalent representations. $\\square$<\/p>\n<h3>References<\/h3>\n<ul>\n<li>[BL] Tom Brylawski and Dean Lucas,\u00a0<em>Uniquely representable combinatorial geometries.\u00a0<\/em>In\u00a0<em>Teorie Combinatorie<\/em> (proc. 1973 internat. colloq.) pp. 83-104 (1976).<\/li>\n<li>[GGK] Jim Geelen, Bert Gerards, Ajai Kapoor,\u00a0<em>The excluded minors for $\\textrm{GF}(4)$-representable matroids.\u00a0<\/em>J. Combin. Th. Ser. B, Vol. 79, pp. 247-299 (2000).<\/li>\n<li>[Kah] Jeff Kahn,\u00a0<em>On the uniqueness of matroid representations over $\\textrm{GF}(4)$.\u00a0<\/em>Bull. London Math. Soc. Vol. 20, pp. 5&#8211;10 (1988).<\/li>\n<li>[OVW] James Oxley, Dirk Vertigan, Geoff Whittle,\u00a0<em>On inequivalent representations of matroids over finite fields.<\/em>J. Combin. Theory Ser. B. Vol. 67, pp. 325&#8211;343 (1996).<\/li>\n<li>[Oxley] James Oxley,\u00a0<em>Matroid Theory, 2nd edition.\u00a0<\/em>Oxford University Press (2011).<\/li>\n<li>[Whi] Geoff Whittle,\u00a0<em>Stabilizers of classes of representable matroids.\u00a0<\/em>J. Combin. Theory Ser. B, Vol. 77, pp. 39&#8211;72 (1999).<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Representable matroids are an attractive subclass of matroids, because in their study you have access to an extra tool: a matrix representing this matroid. This is a concise way to describe a matroid: $O(n^2)$ numbers as opposed to $O(2^{2^n})$ bits &hellip; <a href=\"https:\/\/matroidunion.org\/?p=1573\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-1573","post","type-post","status-publish","format-standard","hentry","category-matroids"],"_links":{"self":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/1573","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1573"}],"version-history":[{"count":4,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/1573\/revisions"}],"predecessor-version":[{"id":1577,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/1573\/revisions\/1577"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1573"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1573"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1573"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}