{"id":952,"date":"2014-07-01T01:00:12","date_gmt":"2014-07-01T01:00:12","guid":{"rendered":"http:\/\/blogs.ams.org\/visualinsight\/?p=952"},"modified":"2017-12-01T17:42:27","modified_gmt":"2017-12-01T17:42:27","slug":"sierpinski-carpet","status":"publish","type":"post","link":"https:\/\/blogs.ams.org\/visualinsight\/2014\/07\/01\/sierpinski-carpet\/","title":{"rendered":"Sierpinski Carpet"},"content":{"rendered":"<div align=\"center\">\n<div id=\"attachment_953\" style=\"width: 760px\" class=\"wp-caption alignnone\"><a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2014\/06\/sierpinski_carpet.gif\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-953\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2014\/06\/sierpinski_carpet.gif\" alt=\"Sierpinski Carpet - Noon Silk\" width=\"750\" height=\"750\" class=\"size-full wp-image-953\" \/><\/a><p id=\"caption-attachment-953\" class=\"wp-caption-text\">Sierpinski Carpet &#8211; Noon Silk<\/p><\/div>\n<\/div>\n<p>To build the <b><a href=\"https:\/\/en.wikipedia.org\/wiki\/Sierpinski_carpet\">Sierpinski carpet<\/a><\/b> you take a square, cut it into 9 equal-sized smaller squares, and remove the central smaller square. Then you apply the same procedure to the remaining 8 subsquares, and repeat this <i>ad infinitum<\/i>.  This image by <a href=\"https:\/\/sites.google.com\/site\/noonsilk\/\">Noon Silk<\/a> shows the first six stages of the procedure.<\/p>\n<p>The Sierpinski carpet is the set of points in the unit square whose coordinates written in base three do not both have a digit &#8216;1&#8217; in the same position.  It is thus a 2-dimensional analogue of the Cantor set. <\/p>\n<p>The <a href=\"http:\/\/en.wikipedia.org\/wiki\/Lebesgue_covering_dimension\"><b>Lebesgue covering dimension<\/b><\/a> of a topological space $X$ is the least natural number $n$ such that every finite open cover of $X$ admits a refinement to a finite open cover in which no point of $X$ is included in more than $n+1$ sets.  For example, a smooth curve embedded in $\\mathbb{R}^n$ has Lebesgue covering dimension 1.  More generally, any compact metric space with Lebesgue dimension 1 is called a <b>curve<\/b>.   <\/p>\n<p>The Sierpinski carpet is a <b>plane curve<\/b>: that is, a curve homeomorphic to a subspace of the plane.   In fact, in 1916 Sierpinski showed that his carpet is a <b>universal plane curve<\/b>: any plane curve is homeomorphic to a subspaces of the Sierpinksi carpet!<\/p>\n<p>The Menger sponge is also a curve, but not a plane curve:<\/p>\n<p>&bull; <a href=\"http:\/\/blogs.ams.org\/visualinsight\/2014\/03\/01\/menger-sponge\/\">Menger sponge<\/a>.<\/p>\n<p>Menger showed in 1926 that his sponge is a <b>universal curve<\/b>: any curve is homeomorphic to a subspace of the Menger sponge.  For example, the Sierpinski carpet is clearly a subspace of the Menger sponge, since every face of that sponge is a Sierpinski carpet.<\/p>\n<p>The &#8216;universality properties&#8217; of the Sierpinski carpet and Menger sponge are not universal properties in the sense of category theory: they do not uniquely characterize these spaces up to homeomorphism.  For example, the disjoint union of a Sierpinski carpet and a circle is also a universal plane curve.  <\/p>\n<p>However, in 1958 <a href=\"http:\/\/www-history.mcs.st-andrews.ac.uk\/Biographies\/Whyburn.html\">Gordon Whyburn<\/a> uniquely characterized the Sierpinski carpet as follows: any plane curve that is <a href=\"https:\/\/en.wikipedia.org\/wiki\/Locally_connected_space\">locally connected<\/a> and has no &#8216;local cut points&#8217; is homeomorphic to the Sierpinski carpet.  Here a <b>local cut point<\/b> is a point $p$ for which some connected neighborhood $U$ of $p$ has the property that $U &#8211; \\{p\\}$ is not connected.  So, for example, any point of the circle is a local cut point.<\/p>\n<p>Whyburn also gave another nice characterization of the Sierpinski carpet.   A <b><a href=\"https:\/\/en.wikipedia.org\/wiki\/Continuum_%28topology%29\">continuum<\/a><\/b> is a nonempty connected compact metric space<\/b><\/a>.  Suppose $X$ is a continuum embedded in the plane.  Suppose the complement $\\mathbb{R}^2 &#8211; X$ has countably many connected components $C_1, C_2, C_3, \\dots$, and suppose:<\/p>\n<p>&bull; the diameter of $C_i$ goes to zero as $i \\to \\infty$;<\/p>\n<p>&bull; the boundary of $C_i$ and the boundary of $C_j$ are disjoint if $i \\ne j$; <\/p>\n<p>&bull; the boundary of $C_i$ is a simple closed curve for each $i$; <\/p>\n<p>&bull; the union of the boundaries of $C_i$ is dense in $X$.<\/p>\n<p>Then $X$ is homeomorphic to the Sierpinski carpet!  <\/p>\n<p>For more properties of Sierpinski carpet see:<\/p>\n<p>&bull; Janusz J. Charatonik, Pawel Krupski and Pavel Pyrih, <a href=\"http:\/\/www.karlin.mff.cuni.cz\/~pyrih\/e\/e2001v2\/c\/ect\/node29.html\">Sierpinski carpet<\/a>.<\/p>\n<p>I had a little contest to create this image, and besides <a href=\"http:\/\/imgur.com\/9JASssb\">Noon Silk<\/a>, also <a href=\"http:\/\/imgur.com\/SJTMq65\">Nathan Reed<\/a>, <a href=\"http:\/\/imgur.com\/CoATsPn\">Chris Greene<\/a>, <a href=\"http:\/\/naml.us\/random\/sierpinski.gif\">Geoffrey Irving<\/a> created images; Noon Silk merely got the job done a few minutes earlier.  Silk used Mathematica code roughly like this:<\/p>\n<pre>\r\ncarpet[n_] :=\r\n  Nest[ArrayFlatten[{{#, #, #} , {#, 0, #} , {#, #, #}}] &amp; 1, n];\r\ndata = Table[\r\n   ArrayPlot[carpet[k],\r\n   ColorRules -&gt; {0 -&gt; White, 1 -&gt; RGBColor[66\/255, 0, 130\/255]} \r\n    ], {k, 1, 6, 1}\r\n   ];\r\nExport[\"anim.gif\", data, \"DisplayDurations\" -&gt; 1,\r\n  ImageSize -&gt; {750, 750}];\r\n<\/pre>\n<p>Greene used <a href=\"https:\/\/gist.github.com\/cwgreene\/2f158934e9128906ea4c\">Javascript<\/a>, and Irving used <a href=\"https:\/\/github.com\/otherlab\/fractal\/blob\/master\/sierpinski\">Python<\/a>, creating a version that goes to the 10th stage.  Nathan Reed used <a href=\"https:\/\/gist.github.com\/Reedbeta\/25bc105a4c0aa7c927c8\">Python<\/a> to create a &#8216;negative&#8217; version where the holes are purple.<\/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>To build the <b><a href=\"https:\/\/en.wikipedia.org\/wiki\/Sierpinski_carpet\">Sierpinski carpet<\/a><\/b> you take a square, cut it into 9 equal-sized smaller squares, and remove the central smaller square. Then you apply the same procedure to the remaining 8 subsquares, and repeat this <i>ad infinitum<\/i>.  This image by <a href=\"https:\/\/sites.google.com\/site\/noonsilk\/\">Noon Silk<\/a> shows the first six stages of the procedure.<\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" data-url=https:\/\/blogs.ams.org\/visualinsight\/2014\/07\/01\/sierpinski-carpet\/><\/div>\n","protected":false},"author":66,"featured_media":962,"comment_status":"open","ping_status":"closed","sticky":true,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[26,14,2],"tags":[],"class_list":["post-952","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-continua","category-fractals","category-images-library"],"jetpack_featured_media_url":"https:\/\/blogs.ams.org\/visualinsight\/files\/2014\/07\/sierpinski_carpet_small.jpg","jetpack_shortlink":"https:\/\/wp.me\/p42Vmc-fm","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/952","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=952"}],"version-history":[{"count":22,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/952\/revisions"}],"predecessor-version":[{"id":3054,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/952\/revisions\/3054"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media\/962"}],"wp:attachment":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media?parent=952"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/categories?post=952"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/tags?post=952"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}