<?xml version="1.0" encoding="UTF-8" standalone="yes"?><oembed><version><![CDATA[1.0]]></version><provider_name><![CDATA[Geometry and the imagination]]></provider_name><provider_url><![CDATA[https://lamington.wordpress.com]]></provider_url><author_name><![CDATA[Danny Calegari]]></author_name><author_url><![CDATA[https://lamington.wordpress.com/author/dannycaltech/]]></author_url><title><![CDATA[Zonohedra and the Sylvester-Gallai theorem]]></title><type><![CDATA[link]]></type><html><![CDATA[<p>When I was in Melbourne recently, I spent some time browsing through a copy of &#8220;<a href="http://www.ams.org/mathscinet-getitem?mr=310745">Twelve Geometric Essays</a>&#8221; by Harold Coxeter in the (small) library at <a href="http://www.amsi.org.au/">AMSI</a>. One of these essays was entitled &#8220;<a href="http://www.ams.org/mathscinet-getitem?mr=141004">The classification of zonohedra by means of projective diagrams</a>&#8221;, and it contained a very cute proof of the Sylvester-Gallai theorem, which I thought would make a nice (short!) blog post.</p>
<p>The Sylvester-Gallai theorem says that a finite collection of points in a projective plane are either all on a line, or else there is some line that contains exactly two of the points. Coxeter&#8217;s proof of this theorem falls out incidentally from an apparently unrelated study of certain polyhedra known as <strong>zonohedra</strong>.</p>
<p>For subsets <img src="https://s0.wp.com/latex.php?latex=P&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P" title="P" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=Q&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Q" title="Q" class="latex" /> of a vector space <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" />, the <strong>Minkowski sum</strong> <img src="https://s0.wp.com/latex.php?latex=P%2BQ&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P+Q" title="P+Q" class="latex" /> is the set of points of the form <img src="https://s0.wp.com/latex.php?latex=p%2Bq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p+q" title="p+q" class="latex" /> for <img src="https://s0.wp.com/latex.php?latex=p%5Cin+P&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p&#92;in P" title="p&#92;in P" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=q+%5Cin+Q&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="q &#92;in Q" title="q &#92;in Q" class="latex" />. If <img src="https://s0.wp.com/latex.php?latex=P&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P" title="P" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=Q&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Q" title="Q" class="latex" /> are polyhedra, so is <img src="https://s0.wp.com/latex.php?latex=P+%2B+Q&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P + Q" title="P + Q" class="latex" />, and the vertices of <img src="https://s0.wp.com/latex.php?latex=P%2BQ&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P+Q" title="P+Q" class="latex" /> are sums of vertices of <img src="https://s0.wp.com/latex.php?latex=P&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P" title="P" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=Q&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Q" title="Q" class="latex" />. One natural way to think of <img src="https://s0.wp.com/latex.php?latex=P%2BQ&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P+Q" title="P+Q" class="latex" /> is that it is the projection of the product <img src="https://s0.wp.com/latex.php?latex=P%5Ctimes+Q&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="P&#92;times Q" title="P&#92;times Q" class="latex" /> under the affine map <img src="https://s0.wp.com/latex.php?latex=%2B%3AV%5Ctimes+V+%5Cto+V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="+:V&#92;times V &#92;to V" title="+:V&#92;times V &#92;to V" class="latex" />.</p>
<p><!--more--></p>
<p>The simplest definition of a zonohedron (in any dimension) is that it is the Minkowski sum of finitely many intervals. Thus the faces of a zonohedra are themselves zonohedra. In 2 dimensions a zonohedron is a centrally symmetric polygon, and therefore has an even number of edges which come in parallel pairs of the same length. A zonohedron is convex, being the Minkowski sum of convex sets. Thus it is topologically a ball, and its boundary is topologically a sphere. A parallelepiped is an example of a 3-dimensional zonohedron; so is the rhombic dodecahedron and the rhombic triacontahedron. One can think of a zonohedron as a projection to a low dimensional space of a high dimensional parallelepiped; one can use this observation to produce interesting aperiodic tilings from zonohedra.</p>
<p>Here is Coxeter&#8217;s proof of the Sylvester-Gallai theorem. Let <img src="https://s0.wp.com/latex.php?latex=Z%3D+%2B_i+I_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Z= +_i I_i" title="Z= +_i I_i" class="latex" /> be a 3-dimensional zonohedron, expressed as the Minkowski sum of some collection of intervals <img src="https://s0.wp.com/latex.php?latex=I_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="I_i" title="I_i" class="latex" />. Each <img src="https://s0.wp.com/latex.php?latex=I_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="I_i" title="I_i" class="latex" /> determines a point <img src="https://s0.wp.com/latex.php?latex=p_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p_i" title="p_i" class="latex" /> in the projective plane; conversely, a collection of points in the projective plane determines a family of zonohedra, where each element of the family is determined by the edge lengths of the <img src="https://s0.wp.com/latex.php?latex=I_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="I_i" title="I_i" class="latex" />. The faces of the zonohedra correspond to the colinear collections of <img src="https://s0.wp.com/latex.php?latex=p_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p_i" title="p_i" class="latex" />. A decomposition of the sphere into polygons meeting at least 3 to a vertex must contain at least one polygon with <img src="https://s0.wp.com/latex.php?latex=%3C6&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&lt;6" title="&lt;6" class="latex" /> sides, by Euler&#8217;s formula; hence every 3 dimensional zonohedron has at least one face with exactly <img src="https://s0.wp.com/latex.php?latex=4&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="4" title="4" class="latex" /> sides. This corresponds to a line containing exactly 2 of the <img src="https://s0.wp.com/latex.php?latex=p_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p_i" title="p_i" class="latex" />; qed.</p>
]]></html></oembed>