{"id":4970,"date":"2023-07-03T08:05:49","date_gmt":"2023-07-03T12:05:49","guid":{"rendered":"http:\/\/matroidunion.org\/?p=4970"},"modified":"2026-02-09T15:10:02","modified_gmt":"2026-02-09T20:10:02","slug":"matroid-lifts-and-representability","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=4970","title":{"rendered":"Matroid lifts and representability"},"content":{"rendered":"\n<p><strong>1. Introduction<\/strong><\/p>\n\n\n\n<p>In this post I&#8217;ll highlight some new constructions related to matroid lifts as detailed in the recent papers [Wal22] and [BW23]. If a matroid $M$ is represented by a matrix $A$, one can naturally obtain a new matroid $L$ by adding rows to $A$ as in Figure 1.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><a href=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images.png\"><img loading=\"lazy\" decoding=\"async\" width=\"234\" height=\"128\" src=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images.png\" alt=\"\" class=\"wp-image-5003\"\/><\/a><figcaption class=\"wp-element-caption\"><strong>Figure 1. <\/strong>$M(A&#8217;)$ is a lift of $M(A)$.<\/figcaption><\/figure><\/div>\n\n\n<p class=\"p1\">Certainly $M$ and $L$ have a special relationship, which can be defined for general matroids as follows.<\/p>\n<p><strong>Definition 1: <\/strong>Given matroids $M$ and $L$ on a common ground set $E$, we say that $L$ is a <em>lift<\/em> of $M$ (and $M$ is a <em>projection <\/em>or <em>quotient <\/em>of $L$) if there exists a matroid $K$ on ground set $E \\cup F$ such that $M = K \/ F$ and $L = K \\setminus F$. We say that $L$ is a <em>rank-$k$ lift<\/em> of $M$ if $r(L) &#8211; r(M) = k$.<\/p>\n<p class=\"p1\">Continuing with the example in Figure 1, the matroid $K$ could be represented by the matrix obtained from $A&#8217;$ by appending the first $k$ unit column vectors. Rank-$1$ lifts, called <em>elementary lifts<\/em>, are well understood. A classical theorem of Brylawski [Bry86], which was previously stated in the dual by Crapo [Cra65], says that elementary lifts of a matroid $M$ are in bijection with special sets of circuits of $M$.<\/p>\n<p><strong>Theorem 1 (Crapo-Brylawski): <\/strong>Let $M$ be a matroid on ground set $E$ and let $\\mathcal C$ be a set of circuits of $M$ so that<\/p>\n<ul>\n<li>\n<p class=\"p1\">if $C_1,C_2$ are circuits in $\\mathcal C$ for which $|C_1 \\cup C_2| &#8211; r_M(C_1 \\cup C_2) = 2$, then each circuit $C$ of $M$ contained in $C_1 \\cup C_2$ is also in $\\mathcal C$.<\/p>\n<\/li>\n<\/ul>\n<p class=\"p1\">Then the function $r \\colon 2^E \\to \\mathbb Z$ defined, for all $X \\subseteq E$, by<\/p>\n<p class=\"p1\"><span style=\"font-size: revert;\">$$r(X) = \\bigg\\{\\begin{array}{cc}\u00a0 r_M(X) &amp; \\textrm{if each circuit of $M|X$ is in $\\mathcal C$} \\\\r_M(X) + 1 &amp; \\textrm{otherwise} \\end{array}$$<\/span><\/p>\n<p class=\"p1\">is the rank function of an elementary lift of $M$. Moreover, every elementary lift of $M$ can be obtained in this way.<\/p>\n<p class=\"p1\">The set $\\mathcal C$ is a <em>linear class<\/em> of circuits of $M$, and the pair $(C_1, C_2)$ is a <em>modular pair<\/em> of circuits. This theorem was famously used by Zaslavsky to define the <em>lift matroid<\/em> of a biased graph [Zas91]. A wonderful introduction to biased graphs and their associated matroids can be found <a href=\"https:\/\/matroidunion.org\/?p=161\" target=\"_blank\" rel=\"noopener\">elsewhere on this blog<\/a>. Since Theorem 1 has proved to be an important characterization of elementary lifts, [Wal22] and [BW23] focused on the following questions.<\/p>\n<p><strong>Question 1: <\/strong>Is there a construction that generalizes the Crapo-Brylawski construction to non-elementary lifts? If so, can every matroid lift be obtained via this construction?<\/p>\n<p>We shall see that the answer to the first question is &#8220;yes&#8221;, the answer to the second question is &#8220;no&#8221;, and the matroids used to certify the &#8220;no&#8221; answer form an interesting infinite antichain of non-representable sparse paving matroids.<\/p>\n\n\n\n<p><strong>2. The construction<\/strong><\/p>\n<p class=\"p1\">The Crapo-Brylawski construction was generalized to non-elementary lifts in [Wal22, Theorem 2], and this construction was stated in the following simpler form in [BW23, Theorem 2].<\/p>\n\n\n\n<p><strong>Theorem 2: <\/strong>Let $M$ be a matroid on ground set $E$ and let $N$ be a matroid whose ground set is the circuit set of $M$ so that<\/p>\n<ul>\n<li>$(*)$ if $C_1,C_2$ are circuits of $M$ for which $|C_1 \\cup C_2| &#8211; r_M(C_1 \\cup C_2) = 2$, then each circuit $C$ of $M$ contained in $C_1 \\cup C_2$ satisfies $C \\in \\textrm{cl}_N(\\{C_1, C_2\\})$.<\/li>\n<\/ul>\n<p class=\"p1\">Then the function $r \\colon 2^E \\to \\mathbb Z$ defined, for all $X \\subseteq E$, by<\/p>\n<p class=\"p1\"><span style=\"font-size: revert;\">$$r(X)=\u00a0 r_M(X) + r_N(\\{C \\colon \\textrm{$C$ is a circuit of $M|X$}\\})$$<\/span><\/p>\n<p class=\"p1\">is the rank function of a rank-$r(N)$ lift of $M$.\u00a0<\/p>\n<p class=\"p1\">Roughly speaking, the matroid $N$ tells us the rank increase of each set in the lift of $M$, and condition $(*)$ is necessary because certain triples of circuits are naturally `dependent&#8217;. Condition $(*)$ also implies that the set of loops of $N$ is a linear class of circuits of $M$, and so the case when $r(N) = 1$ is precisely the Crapo-Brylawski construction. We write $M^N$ for the matroid constructed in Theorem 2. There are natural choices for a matroid $N$ satisfying the hypothesis of Theorem 2, such as the derived matroids of [Lon80], [OW22], and [FJK22], and rank-$2$ uniform matroids. However, the motivation for Theorem 2 was its application to gain graphs, as illustrated in the following example.<\/p>\n<p class=\"p1\"><strong>Example 1. <\/strong>Let $G$ be a graph with edges labeled by elements of $\\mathbb Z_2^j$ (the direct sum of $j$ copies of the cyclic group of order $2$), or equivalently with vectors in the binary vector space $\\mathbb F_2^j$ (see Figure 2). Then associating each cycle of $G$ with the sum of the vectors on its edges defines a (binary) matroid $N$ on the set of cycles of $G$. It is straightforward to check that $N$ satisfies $(*)$, and so Theorem 2 gives a rank-$r(N)$ lift of $M(G)$, the graphic matroid of $G$.<\/p>\n<p>\u00a0<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><a href=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_gain_graph_image.png\"><img loading=\"lazy\" decoding=\"async\" width=\"345\" height=\"371\" src=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_gain_graph_image.png\" alt=\"\" class=\"wp-image-5015\" srcset=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_gain_graph_image.png 345w, https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_gain_graph_image-279x300.png 279w\" sizes=\"auto, (max-width: 345px) 100vw, 345px\" \/><\/a><figcaption class=\"wp-element-caption\"><strong>Figure 2. <\/strong>A graph with edges labeled by the group $\\mathbb Z_2^2$.<\/figcaption><\/figure><\/div>\n\n\n<p class=\"p1\">The previous example works more generally for groups of the form $\\mathbb Z_p^j$ for a prime $p$ and integer $j \\ge 1$ [Wal22, Theorem 3], and generalizes Zaslavsky&#8217;s construction of the lift matroid of a gain graph [Zas91] for these special groups. And, surprisingly, non-elementary lifts with a certain natural property only exist for gain graphs over groups of this special form [WB23, Theorem 6]. But we shall save this discussion for a future blog post!<\/p>\n\n\n\n<p><strong>3. The converse<\/strong><\/p>\n<p class=\"p1\">Now that we have Theorem 2 as a generalization of the Crapo-Brylawski construction to non-elementary lifts, we move on to the second part of Question 1: can every lift be obtained via this construction? It was conjectured in [Wal22, Conjecture 6] that the answer is &#8220;yes&#8221;; i.e. that for every matroid $K$ and subset $X$ of $E(K)$, there is a matroid $N$ on the circuits of $K\/X$ so that $(K\/X)^N \\cong K \\backslash X$. This is true when $K$ is representable, and straightforward to prove [WB23, Proposition 9].<\/p>\n<p><strong>Proposition 1. <\/strong>Let $K$ be an $\\mathbb F$-representable matroid and let $X$ be a subset of its ground set. Then there exists an $\\mathbb F$-representable matroid $N$ on the circuits of $K\/X$ such that $(K\/X)^N \\cong K \\backslash X$.<\/p>\n<p class=\"p1\">However, it is false in general! We next construct a family of sparse paving matroids to show this. (A rank-$r$ matroid is <em>sparse paving<\/em> if every $r$-element subset is a basis or a circuit-hyperplane.) As we shall see, these matroids generalize the cyclic arrangement of the circuit-hyperplanes of the V\u00e1mos matroid.<\/p>\n<p><strong>Definition 2. <\/strong>Let $r \\ge 4$ and $t \\ge 3$ be integers satisfying $r \\le 2t-2$. For $i = 1,\\dots, t$, let $C_i \\subseteq [2t]$ be defined as $C_i = \\{1+2(i-1),\\dots, (r-2) + 2(i-1)\\}$ with numbers taken cyclically modulo $2t$. Then define:<\/p>\n<ul>\n<li>$X = \\{2t+1,2t+2\\}$,<\/li>\n<li>$\\mathcal C'(r,t) = \\{C_i \\cup X \\colon i \\in [t]\\}$, and<\/li>\n<li>$\\mathcal C^{&#8221;}(r,t) = \\{C_i \\cup C_{i+1} \\colon i \\in [t &#8211; 1]\\}$.<\/li>\n<\/ul>\n<p>Then $\\mathcal C'(r,t) \\cup \\mathcal C^{&#8221;}(r,t)$ is the set of circuit-hyperplanes of a sparse paving matroid $K(r,t)$ [WB23, Proposition 11].\u00a0<\/p>\n<p>The key feature is that $C_1 \\cup C_t$ is not a circuit-hyperplane of $K(r,t)$. As a concrete example, when $r = 4$ and $t = 3$ we have $\\mathcal C'(r,t) = \\{1278, 3478, 5678\\}$ and $\\mathcal C^{&#8221;}(r,t) = \\{1234, 3456\\}$, and we leave it to the reader to check that $K(4,3)$ is isomorphic to the V\u00e1mos matroid. Figure 3 illustrates the cyclic nature of the sets $C_i$ in $K(r,t)$ (which are also the circuit-hyperplanes of $K(r,t)\/X$).<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><a href=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images_hyperplanes.png\"><img loading=\"lazy\" decoding=\"async\" width=\"789\" height=\"417\" src=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images_hyperplanes.png\" alt=\"\" class=\"wp-image-5025\" srcset=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images_hyperplanes.png 789w, https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images_hyperplanes-300x159.png 300w, https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images_hyperplanes-768x406.png 768w, https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/06\/Blog_images_hyperplanes-500x264.png 500w\" sizes=\"auto, (max-width: 789px) 100vw, 789px\" \/><\/a><figcaption class=\"wp-element-caption\"><strong>Figure 3.<\/strong><\/figcaption><\/figure><\/div>\n\n\n<p>We now use $K(r,t)$ to show that the construction of Theorem 2 is not a characterization of matroid lifts [WB23, Theorem 12].<\/p>\n<p class=\"p1\"><strong>Theorem 3. <\/strong>Let $r \\ge 4$ and $t \\ge 3$ be integers satisfying $r \\le 2t-2$. There is no matroid $N$ on the circuits of $K(r,t)\/X$ for which $K(r,t)\\backslash X$ is isomorphic to $(K(r,t)\/X)^N$. Moreover, $K(r,t)$ is not representable over any field.<\/p>\n<p class=\"p1\"><em>proof.<\/em> Let $K = K(r,t)$, $M = K\/X$, and $L = K \\backslash X$, so $L$ is a rank-$2$ lift of $M$.<br \/>It is straightforward to check the following properties from Definition 2.<\/p>\n<ol style=\"list-style-type: lower-alpha;\">\n<li>\n<p class=\"p1\">$(C_i , C_{i+1})$ is a modular pair of circuits of $M$ for each $i \\in [t-1]$,<\/p>\n<\/li>\n<li>$(C_1, C_t)$ is a modular pair of circuits of $M$,<br \/><br \/><\/li>\n<li>\n<p class=\"p1\">$r_L(C_i \\cup C_{i+1}) &#8211; r_M(C_i \\cup C_{i+1}) = 1$ for each $i \\in [t-1]$, and<\/p>\n<\/li>\n<li>\n<p class=\"p1\">$r_L(C_1 \\cup C_{t}) &#8211; r_M(C_1 \\cup C_{t}) = 2$.<\/p>\n<\/li>\n<\/ol>\n<p>Suppose $N$ exists. For each $i \\in [t]$, the set $C_i$ is a circuit of $M$ and is independent in $L$ and is therefore a non-loop of $N$ by the rank function of $M^N$. Properties (a) and (c) and the rank function of $M^N$ imply that $C_i$ and $C_{i+1}$ are parallel in $N$ for all $i \\in [t-1]$, and so $C_1$ and $C_t$ are parallel in $N$. But (b) and (d) and the rank function of $M^N$ imply that $C_1$ and $C_t$ are independent in $N$, a contradiction. Proposition 1 now implies that $K(r,t)$ is non-representable. $\\Box$<\/p>\n<p>We have now answered Question 1. We comment that while $K(r,t)$ is constructed using rank-$2$ lifts, related constructions using rank-$k$ lifts with $k &gt; 2$ are likely possible as well, and we hope that this method can be used to construct interesting classes of non-representable matroids. To illustrate this, we mention a few interesting properties of $K(r,t)$. Note that when $r \\ge 5$ and $r \\le 2t &#8211; 3$, the matroid $K(r,t)$ has rank and corank at least $5$. The following is [BW23, Propositions 13, 15] and can be proved using techniques from [NV18].<\/p>\n<p><strong>Proposition 2.\u00a0<\/strong>$\\{K(r,t) \\colon t \\ge 3 \\textrm{ and } 5 \\le r \\le 2t &#8211; 3\\}$ is an infinite antichain of non-representable sparse paving matroids that do not violate Ingleton&#8217;s inequality.<\/p>\n<p>This is interesting because while $K(r,t)$ is inspired by the V\u00e1mos matroid, the V\u00e1mos matroid violates Ingleton&#8217;s inequality. We also conjecture that any matroid obtained from $K(r,t)$ by relaxing a circuit-hyperplane into a basis is representable [BW23, Conjecture 14]. This may not even be difficult to prove for an expert on sparse paving matroids.<\/p>\n<p>Finally, the fact that the converse of Theorem 2 is true for representable matroids but false in general leads to the following question.\u00a0<\/p>\n<p><strong>Question 2:\u00a0<\/strong>Which matroids $K$ have the property that for every set $X \\subseteq E(K)$ there is a matroid $N$ on the circuits of $K\/X$ so that $(K\/X)^N \\cong K \\backslash X$?<\/p>\n<p>For example, if every algebraic matroid has this property then $K(r,t)$ would be non-algebraic for all $r \\ge 4$ and $t \\ge 3$. This may be a promising direction since the V\u00e1mos matroid is non-algebraic [IM75] and isomorphic to $K(4,3)$.<\/p>\n\n\n\n<p><strong>References<\/strong><\/p>\n<p class=\"p1\">[BW23] D. I. Bernstein, Z. Walsh. Matroid lifts and representability. <em>arXiv preprint arXiv:2306.12543<\/em>.<\/p>\n<p class=\"p1\">[Bry86] T. H. Brylawski. Constructions. In <em>Theory of matroids<\/em> (ed. N. White), pp. 127-223. Cambridge University Press, Cambridge, 1986.<\/p>\n<p class=\"p1\">[Cra65] H. H. Crapo. Single-element extensions of matroids. <em>J. Res. Nat. Bur. Standards Sect. B<\/em>, 69B:55&#8211;65, 1965.<\/p>\n<p class=\"p1\">[Ing71] A. W. Ingleton. Representations of matroids. In D. J. A. Welsh, editor, <em>Combinatorial mathematics and its applications (Proceedings of a conference held at theMathematical Institute, Oxford, from 7-10 July, 1969)<\/em>. Academic Press, 1971.<\/p>\n<p class=\"p1\">[IM75] A. W. Ingleton and R. A. Main. Non-algebraic matroids exist. <em>Bull. London Math. Soc.<\/em>, 7:144-146, 1975.<\/p>\n<p class=\"p2\">[Lon80] J. Q. Longyear. The circuit basis in binary matroids. <em>J. Number Theory<\/em>, 12:71-76, 1980.<\/p>\n<p class=\"p1\">[NV18] P. Nelson and J. van der Pol. Doubly exponentially many Ingleton matroids. <em>SIAM J. Disc. Math.<\/em>, 32(2):1145-1153, 2018.<\/p>\n<p class=\"p1\">[OW19] J. Oxley, S. Wang. Dependencies among dependencies in matroids. <em>Electron. J. Combin.<\/em>, 26, 2019.<\/p>\n<p class=\"p1\">[FJK22] Freij-Hollanti, R. Jurrius, and O. Kuznetsova. Combinatorial derived matroid. <em>arXiv <\/em><em>preprint arXiv:2206.06881<\/em>, 2022.<\/p>\n<p class=\"p1\">[Wal22] Z. Walsh. A new matroid lift construction and an application to group-labeled graphs. <em>Electr. J. Combin.<\/em>, 29, 2022.<\/p>\n<p class=\"p1\">[Zas91] T. Zaslavsky. Biased graphs. II. The three matroids. <em>J. Combin. Theory Ser. B<\/em>, 51:46-72, 1991.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>1. Introduction In this post I&#8217;ll highlight some new constructions related to matroid lifts as detailed in the recent papers [Wal22] and [BW23]. If a matroid $M$ is represented by a matrix $A$, one can naturally obtain a new matroid &hellip; <a href=\"https:\/\/matroidunion.org\/?p=4970\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":21,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-4970","post","type-post","status-publish","format-standard","hentry","category-matroids"],"_links":{"self":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4970","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\/21"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=4970"}],"version-history":[{"count":117,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4970\/revisions"}],"predecessor-version":[{"id":6026,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/4970\/revisions\/6026"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4970"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4970"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4970"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}