{"id":2026,"date":"2016-01-01T01:00:50","date_gmt":"2016-01-01T01:00:50","guid":{"rendered":"http:\/\/blogs.ams.org\/visualinsight\/?p=2026"},"modified":"2016-10-14T16:46:02","modified_gmt":"2016-10-14T16:46:02","slug":"free-modular-lattice-on-3-generators","status":"publish","type":"post","link":"https:\/\/blogs.ams.org\/visualinsight\/2016\/01\/01\/free-modular-lattice-on-3-generators\/","title":{"rendered":"Free Modular Lattice on 3 Generators"},"content":{"rendered":"<div align=\"center\">\n<div id=\"attachment_2027\" style=\"width: 506px\" class=\"wp-caption alignnone\"><a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/09\/free_modular_lattice_on_3_generators.gif\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-2027\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/09\/free_modular_lattice_on_3_generators.gif\" alt=\"Free Modular Lattice on 3 Generators - Jesse McKeown\" width=\"500\" height=\"510\" class=\"size-full wp-image-2027\" \/><\/a><p id=\"caption-attachment-2027\" class=\"wp-caption-text\"><br \/>\nFree Modular Lattice on 3 Generators &#8211; Jesse McKeown<\/p><\/div>\n<\/div>\n<p>This is the free <a href=\"https:\/\/en.wikipedia.org\/wiki\/Modular_lattice\">modular lattice<\/a> on 3 generators, as drawn by Jesse McKeown.  First discovered by Dedekind in 1900, this structure turns out to have an interesting connection to 8-dimensional Euclidean space.<\/p>\n<p>The set of subspaces of any vector space \\(V\\) is a <a href=\"https:\/\/en.wikipedia.org\/wiki\/Lattice_%28order%29\"><b>lattice<\/b><\/a>: that is, a partially ordered set where every finite subset has a greatest lower bound and a least upper bound.  <\/p>\n<p>The ordering is defined by saying \\(A \\le B\\) when the subspace \\(A\\) is contained in the subspace \\(B\\).  The greatest lower bound of \\(A \\) and \\(B\\), denoted \\(A \\wedge B\\), is just the intersection \\(A \\cap B\\), while the least upper bound of \\(A\\) and \\(B\\), denoted \\(A \\vee B\\), is the smallest subspace containing \\(A \\cup B\\).   The greatest lower bound of the empty set, or <b>top<\/b> element \\(\\top\\), is the whole space \\(V\\), while the least upper bound of the empty set, or <b>bottom<\/b> element \\(\\bot\\), is the subspace \\(\\{0\\}\\).<\/p>\n<p>A lattice is <a href=\"https:\/\/en.wikipedia.org\/wiki\/Modular_lattice\"><b>distributive<\/b><\/a> if <\/p>\n<p>$$ A \\vee (B \\wedge C) = (A \\vee B) \\wedge (A \\vee C) $$<\/p>\n<p>holds for all \\(A,B,C\\).  (Surprisingly, this is equivalent to requiring the law with the roles of \\(\\vee\\) and \\(\\wedge\\) reversed.)  The lattice of subspaces of a finite-dimensional vector space is not distributive, but it\u2019s always <a href=\"https:\/\/en.wikipedia.org\/wiki\/Distributive_lattice\"><b>modular<\/b><\/a>, meaning that the distributive law holds when \\(A \\le B\\) or \\(A \\le C\\).  <\/p>\n<p>The concept of a lattice can also be defined in a purely algebraic way.  Namely, we can define a lattice to be a set with binary operations \\( \\vee \\) and \\(\\wedge \\) that are commutative, associative, and obey the <b>absorption laws<\/b>:<\/p>\n<p>$$  A \\wedge (A \\vee B) = A , \\qquad A \\vee (A \\wedge B) = A $$<\/p>\n<p>together with elements \\(\\bot\\) and \\(\\top\\) that serve as identities for \\(\\vee\\) and \\(\\wedge\\), respectively.  Starting from this we may define \\(A \\le B\\) to mean \\(A = A \\wedge B\\), or equivalently \\(B = A \\vee B\\).  <\/p>\n<p>Since a lattice and also a modular lattice is a purely algebraic structure, ideas from <a href=\"https:\/\/en.wikipedia.org\/wiki\/Universal_algebra\">universal algebra<\/a> allow  us to define the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Free_object\">free<\/a> modular lattice on any number of generators.  This is roughly one where every element is built from the generators using \\(\\vee, \\wedge, \\top\\) and \\(\\bot\\) and no relations hold except those that follow from the definition of modular lattice.<\/p>\n<p>A remarkable fact, discovered by Dedekind in 1900, is that the free modular lattice on 3 generators has 30 elements, while the free modular lattice on 4 or more generators is infinite.   The <a href=\"https:\/\/en.wikipedia.org\/wiki\/Hasse_diagram\">Hasse diagram<\/a> of the free modular lattice on 3 generators is shown above.  This has one dot for each lattice element, and \\(A \\le B\\) iff we can go from the dot for \\(A\\) to the dot for \\(B\\) by climbing upwards along edges.<\/p>\n<p>Here we are simplifying the actual history.  In fact, Dedekind worked with a definition of lattice, still widely used, that does not require the existence of \\(\\bot\\) and \\(\\top\\).  Thus, his free modular lattice on 3 generators had only 28 elements: it was missing the bottom and top dots in the picture above.  It still had a bottom and top element, but these were not &#8216;free&#8217;: they could be defined in terms of the generators.  <\/p>\n<p>If we call the 3 generators \\(X,Y,\\) and \\(Z\\), Dedekind&#8217;s 28-element lattice looks like this:<\/p>\n<div align=\"center\">\n<div id=\"attachment_2036\" style=\"width: 760px\" class=\"wp-caption alignnone\"><a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/free_modular_lattice_on_3_generators_egan.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-2036\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/free_modular_lattice_on_3_generators_egan.png\" alt=\"Free Modular Lattice on 3 Generators (Without Top or Bottom) - Greg Egan\" width=\"750\" height=\"750\" class=\"size-full wp-image-2036\" srcset=\"https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/free_modular_lattice_on_3_generators_egan.png 750w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/free_modular_lattice_on_3_generators_egan-150x150.png 150w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/free_modular_lattice_on_3_generators_egan-300x300.png 300w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/free_modular_lattice_on_3_generators_egan-50x50.png 50w\" sizes=\"auto, (max-width: 750px) 100vw, 750px\" \/><\/a><p id=\"caption-attachment-2036\" class=\"wp-caption-text\">Free Modular Lattice on 3 Generators (Without \\(\\top\\) or \\(\\bot\\)) &#8211; Greg Egan<\/p><\/div>\n<\/div>\n<p>Notice that this picture has 9 levels, or &#8216;ranks&#8217;.  The generators \\(X,Y,Z\\) are on the middle rank.  The top 3 ranks form a cube: this consists of \\(X \\vee Y\\), \\(X \\vee Z\\), \\(Y \\vee Z\\) and all elements formed from these using \\(\\wedge\\) and \\(\\vee\\).  Dually, the bottom 3 ranks form a cube consisting of \\(X \\wedge Y\\), \\(X \\wedge Z\\), \\(Y \\wedge Z\\) and the elements formed from these via \\(\\wedge\\) and \\(\\vee\\).  <\/p>\n<p>Dedekind showed that his 28-element lattice could be represented as subspaces of an 8-dimensional vector space.  To do this, he chose three subspaces \\(X,Y,Z \\subseteq \\mathbb{R}^8\\) and showed that the lattice they generate has 28 elements.  <\/p>\n<p>It&#8217;s not a coincidence that 8-dimensional space shows up in this problem!  Let us see why.<\/p>\n<p>Start with the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Dynkin_diagram\">Dynkin diagram<\/a> of \\(\\mathfrak{so}(8)\\), which is the <a href=\"https:\/\/en.wikipedia.org\/wiki\/Lie_algebra\">Lie algebra<\/a> of \\(\\mathrm{SO}(8)\\), the group of rotations in 8 dimensions:<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_dynkin.png\" alt=\"\\(D_4\\) Dynkin diagram - John Baez\" width=\"150\" class=\"size-full wp-image-2060\" \/>\n<\/div>\n<p>If we draw arrows on its edges like this:<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver.png\" alt=\"\\(D_4\\) Quiver - John Baez\" width=\"150\" class=\"size-full wp-image-2059\" \/>\n<\/div>\n<p>we get a directed graph, also known as a <a href=\"https:\/\/en.wikipedia.org\/wiki\/Quiver_%28mathematics%29\">quiver<\/a>.  Let us call this particular directed graph the <b>D<sub>4<\/sub> quiver<\/a><\/b>, after the name of the Dynkin diagram.<\/p>\n<p>This quiver is closely connected to a famous puzzle: the <b>3 subspace problem<\/b>.  This problem asks us to classify triples of subspaces of a finite-dimensional vector space \\(L\\), up to invertible linear transformations of \\(L\\).  It turns out that for any choice of the dimension of \\(L\\) there are finitely many possibilities.  This is surprisingly nice compared to the 4 subspace problem, where there are infinitely many possibilities.<\/p>\n<p>One way to solve the 3 subspace problem is to note that 3 subspaces \\(L_1,L_2,L_3 \\subseteq L\\) give a representation of the \\(\\mathrm{D}_4\\) quiver.  This fact is trivial: by definition, a <b>representation<\/b> of the \\(\\mathrm{D}_4\\) quiver is just a triple of linear maps like this:<\/p>\n<div align=\"center\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_generic.png\" alt=\"\\(D_4\\) Quiver Representation (Generic) - John Baez\" width=\"178\" height=\"152\" class=\"size-full wp-image-2105\" \/><\/div>\n<p>and here we are taking those to be inclusions.   The nontrivial part is how we can use this viewpoint, together with some quiver representation theory, to solve the 3 subspace problem.<\/p>\n<p>There is an obvious notion of two representations of the \\(\\mathrm{D}_4\\) quiver being isomorphic.  We can also take direct sums of quiver representations.  We define an <b>indecomposable<\/b> representation to be one that it is not a direct sum of two others unless one of those others is trivial.<\/p>\n<p>It is a remarkable fact, a spinoff of <a href=\"https:\/\/en.wikipedia.org\/wiki\/Gabriel's_theorem\">Gabriel&#8217;s theorem<\/a>, that indecomposable representations of any quiver coming from a Dynkin diagram correspond in a natural one-to-one way with positive roots of the corresponding Lie algebra.  As mentioned, the Lie algebra corresponding \\(\\textrm{D}_4\\) is \\(\\mathfrak{so}(8)\\), the Lie algebra of the group of rotations in 8 dimensions.  This Lie algebra has 12 positive roots.  So, the \\(\\textrm{D}_4\\) quiver has 12 indecomposable representations which we list below.  The representation coming from any triple of subspaces \\(X, Y, Z \\subseteq V\\) must be a direct sum of these indecomposable representations, so we can classify the possibilities and solve the 3 subspace problem.<\/p>\n<p>What does this have to do with the free modular lattice on 3 generators? <\/p>\n<p>Given any representation \\(f_i : L_i \\to L\\) of the \\(\\mathrm{D}_4\\) quiver, the images of the maps \\(f_i\\) generate a sublattice \\(\\mathcal{L}\\) of the lattice of all subspaces of \\(L\\).  \\(\\mathcal{L}\\) is a modular lattice with 3 generators.  So, representations of the \\(\\mathrm{D}_4\\) quiver give modular lattices with 3 generators.  Moreover we have:<\/p>\n<p><b>Theorem 1.<\/b> If we take a direct sum of indecomposable representations of the \\(D_4\\) quiver, one from each isomorphism class, we obtain a representation of the \\(D_4\\) quiver whose corresponding modular lattice is the free modular lattice on 3 generators.  In this representation, say \\(f_i : L_i \\to L\\), the spaces \\(\\mathrm{im} (f_i)\\) have dimension 5 and the space \\(L\\) has dimension 10.  10 is the smallest possible dimension for a vector space containing subspaces that generate a copy of the free modular lattice on 3 generators.<\/p>\n<p><b>Proof.<\/b> This will follow from Theorem 2 below.  \u25ae<\/p>\n<p>Let us call a representation of the \\(\\mathrm{D}_4\\) quiver <b>injective<\/b> if all 3 maps \\(f_i : L_i \\to L\\) are injective.  Of the indecomposable representations of the \\(\\mathrm{D}_4\\) quiver, exactly 3 are not injective:<\/p>\n<div align=\"center\"><img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_noninjective.png\" alt=\"Noninjective Indecomposable \\(D_4\\) Quiver Representations - John Baez\" width=\"160\" class=\"size-full wp-image-2067\" srcset=\"https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_noninjective.png 177w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_noninjective-96x300.png 96w\" sizes=\"(max-width: 177px) 100vw, 177px\" \/><\/div>\n<p>Note that these representations contribute trivially to the direct sum in Theorem 1.  So, we can leave them out of this direct sum without affecting the result.  This reduces Theorem 1 to<\/p>\n<p><b>Theorem 2.<\/b> If we take a direct sum of injective indecomposable representations of the \\(D_4\\) quiver, one from each isomorphism class, we obtain an injective representation of the \\(D_4\\) quiver whose corresponding modular lattice is the free modular lattice on 3 generators.  In this representation, say \\(f_i : L_i \\to L\\), the spaces \\(L_i\\) have dimension 5 while \\(L\\) has dimension 10.  10 is the smallest possible dimension for a vector space containing subspaces that generate a copy of the free modular lattice on 3 generators.<\/p>\n<p><b>Proof.<\/b> &#8211; It is clear that the direct sum of injective representations is injective.  The rest will follow from Theorem 3.  \u25ae<\/p>\n<p>If we want to get Dedekind&#8217;s 28-element lattice, we need to leave out two injective indecomposable representations from the direct sum.  To understand what is special about these two, and explicitly construct Dedekind&#8217;s lattice, let us go ahead and list the 12 indecomposable representations of the \\(\\mathrm{D}_4\\) quiver.<\/p>\n<p>For the 9 injective ones, we can assume without loss of generality that the maps are inclusions of subspaces.  One of the injective indecomposable representations involves a triple of subspaces of zero dimension, while another involves a triple of subspaces that all equal the space they are included in:<\/p>\n<div align=\"center\"><img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_trivial.png\" alt=\"Indecomposable \\(D_4\\) Quiver Representations That Do Not Affect the Lattice - John Baez\" width=\"170\" class=\"size-full wp-image-2070\" srcset=\"https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_trivial.png 188w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_trivial-163x300.png 163w\" sizes=\"(max-width: 188px) 100vw, 188px\" \/><\/div>\n<p>The remaining 7 injective indecomposable representations are the ones relevant to Dedekind&#8217;s 28-element lattice.  We call them \\(A, B, C, D, E, F\\) and \\(G\\):<\/p>\n<p>\\(A\\):<\/p>\n<div align=\"center\"><img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_A.png\" alt=\"\\(D_4\\) Quiver Representation A - John Baez\" width=\"150\" class=\"size-full wp-image-2075\" \/><\/div>\n<p>\\(B\\):<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_B.png\" alt=\"\\(D_4\\) Quiver Representation B - John Baez\" width=\"150\" class=\"size-full wp-image-2076\" \/>\n<\/div>\n<p>\\(C\\):<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_C.png\" alt=\"\\(D_4\\) Quiver Representation C - John Baez\" width=\"150\" class=\"size-full wp-image-2077\" \/>\n<\/div>\n<p>\\(D\\):<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_D.png\" alt=\"\\(D_4\\) Quiver Representation D - John Baez\" width=\"150\" class=\"size-full wp-image-2078\" \/>\n<\/div>\n<p>\\(E\\):<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_E.png\" alt=\"\\(D_4\\) Quiver Representation E - John Baez\" width=\"145\" class=\"size-full wp-image-2080\" \/>\n<\/div>\n<p>\\(F\\):<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_F.png\" alt=\"\\(D_4\\) Quiver Representation F - John Baez\" width=\"160\" class=\"size-full wp-image-2081\" \/>\n<\/div>\n<p>\\(G\\):<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_G.png\" alt=\"\\(D_4\\) Quiver Representation G - John Baez\" width=\"160\" class=\"size-full wp-image-2082\" \/>\n<\/div>\n<p>If we take the direct sum of all 7 of these quiver representations we obtain a representation that we call<\/p>\n<div align=\"center\"><img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_representation.png\" alt=\"\\(D_4\\) Quiver Representation - John Baez\" width=\"120\" class=\"size-full wp-image-2089\" srcset=\"https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_representation.png 161w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_representation-150x150.png 150w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_representation-50x50.png 50w\" sizes=\"(max-width: 161px) 100vw, 161px\" \/><\/div>\n<p>Here the central dot of the \\(D_4\\) quiver has been assigned a vector space \\(V\\) which contains 3 subspaces \\(X,Y,Z\\).   We have:<\/p>\n<p><b>Theorem 3.<\/b> The modular lattice generated by \\(X,Y,Z \\subset V\\) is the free modular lattice on 3 generators with its top and bottom removed: that is, Dedekind&#8217;s 28-element lattice.  \\(V\\) is 8-dimensional, and Dedekind&#8217;s lattice cannot be embedded in the lattice of subspaces of a vector space of dimension \\(\\lt 8\\).<\/p>\n<p>Theorem 3 easily implies Theorem 2.  To prove Theorem 2, we shall explicitly compute the vector space \\(V\\) and its three subspaces \\(X,Y,Z\\).<\/p>\n<p>Abusing notation a little, let us write<\/p>\n<p>$$ V = A \\oplus B \\oplus C \\oplus D \\oplus E \\oplus F \\oplus G $$<\/p>\n<p>where now \\(A, \\dots, G\\) denote the vector spaces assigned to the central dot by the quiver representations of the same name.  Looking at the list above we see that \\(A, B, C, D, E\\) and \\(F\\) are 1-dimensional while \\(G\\) is 2-dimensional.  So, <\/p>\n<p>$$ V \\cong \\mathbb{R}^8 .$$<\/p>\n<p>The next step is to determine the 3 subspaces \\(X,Y,Z \\subset V\\).  <\/p>\n<p>We need a bit more notation to name all the subspaces associated to the quiver representation \\(G\\):<\/p>\n<div align=\"center\">\n<img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_G.png\" alt=\"\\(D_4\\) Quiver Representation G - John Baez\" width=\"163\" height=\"142\" class=\"size-full wp-image-2082\" \/>\n<\/div>\n<p>We are calling the copy of \\(\\mathbb{R}^2\\) here \\(G\\).  Let us denote the three copies of \\(\\mathbb{R}\\) by \\(G_1, G_2,\\) and \\(G_3\\), starting at the top and going around clockwise:<\/p>\n<div align=\"center\">\n<img decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/d4_quiver_rep_G_labelled.png\" alt=\"\\(D_4\\) Quiver Representation \\(G\\) (Labelled) - John Baez\" width=\"150\" class=\"size-full wp-image-2085\" \/>\n<\/div>\n<p>The vector space $G$ is 2-dimensional, while $G_1, G_2, G_3$ are 1-dimensional and distinct, so <\/p>\n<p>$$ G_1 \\vee G_2 = G_2 \\vee G_3 = G_3 \\vee G_1 = G $$<\/p>\n<p>and <\/p>\n<p>$$ G_1 \\wedge G_2 = G_2 \\wedge G_3 = G_3 \\wedge G_1 = \\{0\\} . $$<\/p>\n<p>We can now determine the subspaces \\(X,Y,Z \\subset V\\).  The subspace \\(X\\) is the direct sum of the vector spaces assigned to the top dot of the \\(\\mathbb{D}_4\\) quiver by all 7 quiver representations under consideration.  So, using the notation we have set up,<\/p>\n<p>$$ X = A \\oplus E \\oplus F \\oplus G_1 .$$<\/p>\n<p>Similarly <\/p>\n<p>$$ Y =  B \\oplus D \\oplus F \\oplus G_2 $$<\/p>\n<p>and <\/p>\n<p>$$ Z = C \\oplus D \\oplus E \\oplus G_3 .$$<\/p>\n<p>Using these facts we can work out the subspace of<\/p>\n<p>$$ V = A \\oplus B \\oplus C \\oplus D \\oplus E \\oplus F \\oplus G \\cong \\mathbb{R}^8 $$<\/p>\n<p>corresponding to any element of the lattice generated by $X,Y,Z$.  For example, we have<\/p>\n<p>$$ X \\wedge Y = ( A \\oplus E \\oplus F \\oplus G_1) \\wedge (B \\oplus D \\oplus F \\oplus G_2) = F$$<\/p>\n<p>where we used the fact that $G_1 \\wedge G_2 = \\{0\\}$.  <\/p>\n<p><a href=\"http:\/\/www.gregegan.net\">Greg Egan<\/a> has summarized the results in this chart:<\/p>\n<div align=\"center\">\n<div id=\"attachment_2052\" style=\"width: 760px\" class=\"wp-caption alignnone\"><a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/modular_lattice_of_28_subspaces_egan.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-2052\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/modular_lattice_of_28_subspaces_egan.png\" alt=\"Modular Lattice of 28 Subspaces - Greg Egan\" width=\"750\" height=\"750\" class=\"size-full wp-image-2052\" srcset=\"https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/modular_lattice_of_28_subspaces_egan.png 750w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/modular_lattice_of_28_subspaces_egan-150x150.png 150w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/modular_lattice_of_28_subspaces_egan-300x300.png 300w, https:\/\/blogs.ams.org\/visualinsight\/files\/2016\/01\/modular_lattice_of_28_subspaces_egan-50x50.png 50w\" sizes=\"auto, (max-width: 750px) 100vw, 750px\" \/><\/a><p id=\"caption-attachment-2052\" class=\"wp-caption-text\">Modular Lattice of 28 Subspaces &#8211; Greg Egan<\/p><\/div>\n<\/div>\n<p>Tim Silverman prepared this table of the results:<\/p>\n<p>$$\\array{<br \/>\n\\textrm{dimension 8:} \\\\<br \/>\nX\\vee Y\\vee Z&amp;A\\oplus B\\oplus C\\oplus D\\oplus E\\oplus F\\oplus<br \/>\nG\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 7:} \\\\<br \/>\nX\\vee Y&amp;A\\oplus B\\oplus D\\oplus E\\oplus F\\oplus G\\\\<br \/>\nX\\vee Z&amp;A\\oplus<br \/>\nC\\oplus D\\oplus E\\oplus F\\oplus G\\\\<br \/>\nY\\vee Z&amp;B\\oplus C\\oplus D\\oplus<br \/>\nE\\oplus F\\oplus G\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 6:} \\\\<br \/>\n(X\\vee Y)\\wedge (X\\vee Z)&amp;A\\oplus D\\oplus E\\oplus F\\oplus G\\\\<br \/>\n(X\\vee Y)\\wedge (Y\\vee Z)&amp;B\\oplus D\\oplus E\\oplus F\\oplus G\\\\<br \/>\n(X\\vee Z)\\wedge (Y\\vee Z)&amp;C\\oplus D\\oplus E\\oplus F\\oplus G\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 5:} \\\\<br \/>\n(X\\vee Y)\\wedge (X\\vee Z)\\wedge (Y\\vee Z)&amp;D\\oplus E\\oplus F\\oplus G\\\\<br \/>\nX\\vee (Y\\wedge Z)&amp;A\\oplus D\\oplus E\\oplus F\\oplus G_1\\\\<br \/>\nY\\vee (X\\wedge Z)&amp;B\\oplus D\\oplus E\\oplus F\\oplus G_2\\\\<br \/>\nZ\\vee (X\\wedge Y)&amp;C\\oplus D\\oplus E\\oplus F\\oplus G_3\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 4:} \\\\<br \/>\n(X\\vee (Y\\wedge Z)\\wedge (Y\\vee Z)&amp;D\\oplus<br \/>\nE\\oplus F\\oplus G_1\\\\<br \/>\n(Z\\vee (X\\wedge Y))\\wedge (X\\vee Y)&amp;D\\oplus E\\oplus<br \/>\nF\\oplus G_3\\\\<br \/>\n(Y\\vee (X\\wedge Z))\\wedge (X\\vee Z)&amp;D\\oplus E\\oplus F\\oplus<br \/>\nG_2\\\\<br \/>\nX&amp;A\\oplus E\\oplus F\\oplus G_1\\\\<br \/>\nY&amp;B\\oplus D\\oplus F\\oplus G_2\\\\<br \/>\nZ&amp;C\\oplus D\\oplus E\\oplus G_3\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 3:} \\\\<br \/>\n(X\\wedge Y)\\vee (X\\wedge Z)\\vee (Y\\wedge Z)&amp;D\\oplus E\\oplus F\\\\<br \/>\nX\\wedge (Y\\vee Z)&amp;E\\oplus F\\oplus G_1\\\\<br \/>\nY\\wedge (X\\vee Z)&amp;D\\oplus F\\oplus G_2\\\\<br \/>\nZ\\wedge (X\\vee Y)&amp;D\\oplus E\\oplus G_3\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 2:} \\\\<br \/>\n(X\\wedge Y)\\vee (X\\wedge Z)&amp;E\\oplus F\\\\<br \/>\n(X\\wedge Y)\\vee (Y\\wedge Z)&amp;D\\oplus F\\\\<br \/>\n(X\\wedge Z)\\vee (Y\\wedge Z)&amp;D\\oplus E\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 1:} \\\\<br \/>\nX\\wedge Y&amp;F\\\\<br \/>\nX\\wedge Z&amp;E\\\\<br \/>\nY\\wedge Z&amp;D\\\\<br \/>\n\\\\<br \/>\n\\textrm{dimension 0:} \\\\<br \/>\nX\\wedge Y \\wedge Z&amp; \\{0\\}<br \/>\n}$$<\/p>\n<p>Since all 28 of these subspaces are distinct, the lattice generated by \\(X,Y,\\) and \\(Z\\) is the same as the free modular lattice on 3 generators with \\(\\top\\) and \\(\\bot\\) removed: that is, Dedekind&#8217;s original lattice.  One can check that Dedekind&#8217;s lattice does not embed in the lattice of subspaces of a space of dimension \\(\\lt 8\\), because the corresponding quiver representation needs to contain copies of all 7 quiver representations \\(A,\\dots, G\\), or extra relations would hold.<\/p>\n<p><b>Puzzle 1.<\/b>  Is it a coincidence that \\(V\\) is 8-dimensional and the \\(\\mathrm{D}_4\\) quiver is associated to the \\(\\mathfrak{so}(8)\\) Lie algebra?  There is no <i>obvious<\/i> relation visible in the argument above. <\/p>\n<p><b>Puzzle 2.<\/b> Is it a coincidence that Dedekind&#8217;s lattice has 28 elements and \\(\\mathfrak{so}(8)\\) is 28-dimensional?  Again this relation plays no obvious role in the argument above.  <\/p>\n<div align=\"center\">\n<div id=\"attachment_2027\" style=\"width: 506px\" class=\"wp-caption alignnone\"><a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/09\/free_modular_lattice_on_3_generators.gif\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-2027\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/09\/free_modular_lattice_on_3_generators.gif\" alt=\"Free Modular Lattice on 3 Generators - Jesse McKeown\" width=\"500\" height=\"510\" class=\"size-full wp-image-2027\" \/><\/a><p id=\"caption-attachment-2027\" class=\"wp-caption-text\">Free Modular Lattice on 3 Generators &#8211; Jesse McKeown<\/p><\/div>\n<\/div>\n<p>As a hint for Puzzle 2, Hugh Thomas pointed out that the portion of the free modular lattice on 3 generators above the middle rank is isomorphic to the poset of <a href=\"https:\/\/en.wikipedia.org\/wiki\/Root_system#Positive_roots_and_simple_roots\">positive roots<\/a> of \\(\\mathfrak{so}(4)\\), with its usual ordering.  This poset has 12 elements.  Similarly, we can identify the portion below the middle rank with the poset of <a href=\"https:\/\/en.wikipedia.org\/wiki\/Root_system#Positive_roots_and_simple_roots\">negative roots<\/a>.  The reason for this is unclear, and this leaves the middle rank somewhat mysterious: it has \\(30 &#8211; 12 &#8211; 12 = 6\\) elements.  The Lie algebra \\(\\mathfrak{so}(4)\\) is spanned by the positive roots, the negative roots, and its <a href=\"https:\/\/en.wikipedia.org\/wiki\/Cartan_subalgebra\">Cartan subalgebra<\/a>, so its Cartan subalgebra has dimension \\(28 &#8211; 12 &#8211; 12 = 4\\).<\/p>\n<p>For Dedekind&#8217;s original paper, see:<\/p>\n<p>&bull; Richard Dedekind, <a href=\"http:\/\/www.digizeitschriften.de\/dms\/img\/?PID=GDZPPN002257947\">&Uuml;ber die von drei Moduln erzeugte Dualgruppe<\/a>, <i>Mathematische Annalen<\/i> <b>53<\/b> (1900), 371&ndash;403.<\/p>\n<p>For the four subspace problem, see:<\/p>\n<p>&bull; I. M. Gelfand, and V. A. Ponomarev, Problems of linear algebra and classification of quadruples of subspaces in a finite-dimensional vector space, <i>Coll. Math. Spc. Bolyai<\/i> <b>5<\/b> (1970), 163&ndash;237.<\/p>\n<p>To see the difficulty with the problem, note that starting with 4 generically chosen points on a plane, and repeatedly drawing lines through points and creating new points by intersecting lines, one can generate infinitely many points and lines. Viewing this in terms of projective geometry, it follows that starting with 4 generically chosen 2-dimensional subspaces in \\(\\mathbb{F}^3\\), where \\(\\mathbb{F}\\) is an infinite field, one can generate infinitely many subspaces using \\(\\vee\\) and \\(\\wedge\\).<\/p>\n<p>The new ideas in this post, if any, were obtained collaboratively in discussions here:<\/p>\n<p>&bull; John Baez, <a href=\"https:\/\/golem.ph.utexas.edu\/category\/2015\/09\/the_free_modular_lattice_on_3.html\">The free modular lattice on 3 generators<\/a>, <i>The n-Category Caf&eacute;<\/i>, 19 September 2015.<\/p>\n<p>&bull; John Baez, <a href=\"http:\/\/mathoverflow.net\/q\/218718\/2893\">How is the free modular lattice on 3 generators related to 8-dimensional space?<\/a>, <i>MathOverflow<\/i>, 20 September 2015.<\/p>\n<hr \/>\n<p><i>Visual Insight<\/i> is a place to share striking images that help explain advanced topics in mathematics. I\u2019m always looking for truly beautiful images, so if you know about one, please drop a comment <a href=\"http:\/\/blogs.ams.org\/visualinsight\/about-visual-insight\/\">here<\/a> and let me know!<\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" ><\/div>","protected":false},"excerpt":{"rendered":"<p>This is the free <a href=\"https:\/\/en.wikipedia.org\/wiki\/Modular_lattice\">modular lattice<\/a> on 3 generators, as drawn by Jesse McKeown.  First discovered by Dedekind in 1900, this structure turns out to have an interesting connection to 8-dimensional Euclidean space.<\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" data-url=https:\/\/blogs.ams.org\/visualinsight\/2016\/01\/01\/free-modular-lattice-on-3-generators\/><\/div>\n","protected":false},"author":66,"featured_media":2027,"comment_status":"open","ping_status":"closed","sticky":true,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[23,2,24],"tags":[],"class_list":["post-2026","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-groups","category-images-library","category-posets"],"jetpack_featured_media_url":"https:\/\/blogs.ams.org\/visualinsight\/files\/2015\/09\/free_modular_lattice_on_3_generators.gif","jetpack_shortlink":"https:\/\/wp.me\/p42Vmc-wG","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/2026","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/users\/66"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/comments?post=2026"}],"version-history":[{"count":80,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/2026\/revisions"}],"predecessor-version":[{"id":2876,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/2026\/revisions\/2876"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media\/2027"}],"wp:attachment":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media?parent=2026"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/categories?post=2026"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/tags?post=2026"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}