{"id":5242,"date":"2024-01-01T01:00:00","date_gmt":"2024-01-01T06:00:00","guid":{"rendered":"http:\/\/matroidunion.org\/?p=5242"},"modified":"2023-12-30T01:22:15","modified_gmt":"2023-12-30T06:22:15","slug":"spreads-decomposing-projective-geometries","status":"publish","type":"post","link":"https:\/\/matroidunion.org\/?p=5242","title":{"rendered":"Spreads: Decomposing projective geometries"},"content":{"rendered":"\n<p>Happy New Year from all of us at the Matroid Union!<\/p>\n\n\n\n<p>Decomposition of objects into smaller or simpler objects is a central theme in combinatorics. Think about decomposing a graph into its connected components or <a href=\"https:\/\/en.wikipedia.org\/wiki\/Biconnected_component\" alt=\"Block @ WikiPedia\">blocks<\/a>, or into <a href=\"https:\/\/en.wikipedia.org\/wiki\/Arboricity\" alt=\"The arboricity of a graph is the minimum number of forests needed to decompose the graph @ WikiPedia\">forests<\/a>. In today&#8217;s post, I discuss decomposing finite projective geometries into projective geometries of smaller rank.<\/p>\n\n\n\n<p><strong>Definition:<\/strong> Let $q$ be prime power, let $n \\ge t \\ge 1$ be integers and let $M = \\text{PG}(n-1,q)$ be the projective geometry over the field with $q$ elements. A <a href=\"https:\/\/en.wikipedia.org\/wiki\/Spread_(projective_geometry)\">$t$-spread<\/a> of $G$ is a collection of rank-$t$ flats of $M$ that partition the points of $M$\u2014that is, these flats are pairwise disjoint and their union is the set of all points of $M$.<\/p>\n\n\n\n<p>(Geometers often use dimension instead of rank; the dimension of a projective geometry is one less than its rank. Their $t$-spreads are collections of $t$-dimensional subspaces of an $n$-dimensional space. We will however stick to the terminology that is more familiar in the matroid theory setting.)<\/p>\n\n\n\n<p>Every projective geometry has a 1-spread: the flats making up the spread are simply the points of the geometry. It is much more interesting to look into the existence of $t$-spreads when $t \\ge 2$.<\/p>\n\n\n\n<p>The Fano plane $F_7 = \\text{PG}(2,2)$ does not admit a decomposition into triangles. The quickest argument to see this is based on counting the number of points: any matroid that can be decomposed into triangles necessarily has a number of points that is a multiple of 3, but the Fano plane has seven points. By contrast, the projective geometry $\\text{PG}(3,2)$, which has fifteen points, can be partitioned into five triangles (as encoded using different colours in the following representation:<\/p>\n\n\n\n<div class=\"wp-block-image\"><figure class=\"aligncenter size-full\"><a href=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/12\/pg-triangle-decomposition.png\"><img loading=\"lazy\" decoding=\"async\" width=\"335\" height=\"66\" src=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/12\/pg-triangle-decomposition.png\" alt=\"The projective geometry PG(3,2) can be decomposed into five triangles.\" class=\"wp-image-5250\" srcset=\"https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/12\/pg-triangle-decomposition.png 335w, https:\/\/matroidunion.org\/wp-content\/uploads\/2023\/12\/pg-triangle-decomposition-300x59.png 300w\" sizes=\"auto, (max-width: 335px) 100vw, 335px\" \/><\/a><figcaption>The projective geometry $\\text{PG}(3,2)$ can be decomposed into five triangles (indicated here using five different colours).<\/figcaption><\/figure><\/div>\n\n\n\n<p>The counting argument above can be generalised. In order for $M = \\text{PG}(n-1,q)$ to have any hope of admitting a $t$-spread, the number of points in a projective geometry of rank $t$ should evenly divide the number of points in $M$, or $\\frac{q^t-1}{q-1} \\bigg| \\frac{q^n-1}{q-1}$. It is a nice exercise to show that the latter happens precisely when $n$ is a multiple of $t$. So, if $\\text{PG}(n-1,q)$ can be decomposed into rank-$t$ subgeometries, we must have $t|n$.<\/p>\n\n\n\n<p>It turns out that this divisibility criterion is not only necessary\u2014it is sufficient as well. We end this blog post with a slick proof of this fact. The proof can be found in many introductory texts on projective geometry.<\/p>\n\n\n\n<p><strong>Theorem:<\/strong> The projective geometry $M=\\text{PG}(n-1,q)$ admits a $t$-spread if and only if $t|n$.<\/p>\n\n\n\n<p><em>Proof:<\/em> We already proved the implication from left to right. The implication in the other direction follows from a construction.<\/p>\n\n\n\n<p>Suppose that $n = kt$ for some integer $k$. The points of $M$ can be identified with the 1-dimensional subspaces of the vector space $\\mathbb{F}_q^n$. We will show that $\\mathbb{F}_q^n$ can be decomposed into $t$-dimensional subpspaces that are pairwise disjoint (except that they all contain the zero-vector). As the 1-dimensional subspaces of $\\mathbb{F}_q^t$ can be identified with the points of a $\\text{PG}(t-1,q)$, this immediately implies the theorem.<\/p>\n\n\n\n<p>Consider the $k$-dimensional $\\mathbb{F}_{q^t}$-vector space $\\mathbb{F}_{q^t}^k$. Its 1-dimensional subspaces intersect only in the zero-vector. These 1-dimensional subspaces give us our spread, as each such subspace can alternatively be viewed as a $t$-dimensional $\\mathbb{F}_q$-vector space. $\\Box$<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Happy New Year from all of us at the Matroid Union! Decomposition of objects into smaller or simpler objects is a central theme in combinatorics. Think about decomposing a graph into its connected components or blocks, or into forests. In &hellip; <a href=\"https:\/\/matroidunion.org\/?p=5242\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":18,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-5242","post","type-post","status-publish","format-standard","hentry","category-matroids"],"_links":{"self":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/5242","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\/18"}],"replies":[{"embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=5242"}],"version-history":[{"count":8,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/5242\/revisions"}],"predecessor-version":[{"id":5251,"href":"https:\/\/matroidunion.org\/index.php?rest_route=\/wp\/v2\/posts\/5242\/revisions\/5251"}],"wp:attachment":[{"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=5242"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=5242"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/matroidunion.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=5242"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}