Larry Riddle, Agnes Scott College

Start with a solid (filled) square **C(0)**. Divide this into 9
smaller congruent squares. Remove the interior of the center square
(that is, do not remove the boundary) to get **C(1)**. Now
subdivide each of the eight remaining solid squares into 9 congruent
squares and remove the center square from each to obtain **C(2)**.
Continue to repeat the construction to obtain a decreasing sequence
of sets

$$ C(0) \supset C(1) \supset C(2) \supset C(3) \supset \cdots $$

The Sierpinski carpet is the intersection of all the sets in this sequence, that is, the set of points that remain after this construction is repeated infinitely often. The figures below show the first four iterations. The squares in red denote some of the smaller congruent squares used in the construction.

Function

System

Sierpinski

Converges

to his

Carpet

The original square is scaled by a factor **r**=1/3. This is
done 8 times followed by the necessary translations to arrange the
eight squares as depicted for **C(1)** If we take the original square to be a unit square with opposite corners at (0,0) and (1,1), then the IFS would be given by the following functions.

\[ \begin{align} f_1 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} \\ f_2 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} + \left[ {\begin{array}{*{20}c} 0 \\ {1/3} \\ \end{array}} \right] \\ f_3 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} + \left[ {\begin{array}{*{20}c} 0 \\ {2/3} \\ \end{array}} \right] \\ f_4 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} + \left[ {\begin{array}{*{20}c} {1/3} \\ 0 \\ \end{array}} \right] \\ f_5 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} + \left[ {\begin{array}{*{20}c} {1/3} \\ {2/3} \\ \end{array}} \right] \\ f_6 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} + \left[ {\begin{array}{*{20}c} {2/3} \\ {0} \\ \end{array}} \right] \\ f_7 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} + \left[ {\begin{array}{*{20}c} {2/3} \\ {1/3} \\ \end{array}} \right] \\ f_8 ({\bf{x}}) &= \left[ {\begin{array}{*{20}c} {1/3} & 0 \\ 0 & {1/3} \\ \end{array}} \right]{\bf{x}} + \left[ {\begin{array}{*{20}c} {2/3} \\ {2/3} \\ \end{array}} \right] \\ \end{align} \]

The Sierpinski carpet consists of eight self-similar pieces corresponding to the eight functions in the iterated function system.

L-system

Animation

L-system

Animation

Angle 90

Axiom F

F —> F+F−F−F−G+F+F+F−F

G —> GGG

Axiom F

F —> F+F−F−F−G+F+F+F−F

G —> GGG

This will produce the Sierpinski carpet rotated by 45°. In addition, there will be lines through the square "holes" (see first animation). If you want to avoid those lines, you can modify the L-system to lift the pen by using

F —> F+F−F−F−UGD+F+F+F−F

where U means the pen goes up and D means the pen goes down. You can see the effect in the second animation.

Dimension

The Sierpinski carpet is self-similar with 8 non-overlapping copies of itself, each scaled by the factor
**r** < 1. Therefore the similarity dimension, **d**,
of the unique attractor of the IFS is the solution to

$$\sum\limits_{k = 1}^8 {{r^d}} = 1\quad \Rightarrow \quad d = \frac{{\log (1/8)}}{{\log (r)}} = \frac{{\log (1/8)}}{{\log (1/3)}} = \frac{{\log (8)}}{{\log (3)}} = 1.89279$$

Properties

Suppose the area of the original square **C(0)** is equal to 1.
To get **C(k+1)**, we scale **C(k)** by 1/3, which reduces the
area by 1/9 = (1/3)^{2}. But we make 8 copies of this scaled
version to
form **C(k+1)**. Therefore the area of **C(k+1)** must be
(8/9)th of the area of **C(k)**. This means that the area of
**C(n)** is (8/9)^{n} for all **n**.

Notice that these areas go to 0 as **n** goes to infinity. This
means that we have removed "all" of the area of the original square
in constructing the Sierpinski carpet. But of course there are many
points still left in the carpet. That is one reason why area is not a
useful dimension for this set.

Sierpinski used the carpet to catalogue all compact one-dimensional objects in the plane (from a topological point of view). What this basically means is the Sierpinski carpet contains a topologically equivalent copy of any compact one-dimensional object in the plane. Thus for any curve contained in the plane, there is a set homeomorphic to the Sierpinski carpet that contains the curve. For a good discussion of this idea, consult the text by Peitgen, Jurgens, and Saupe [6], or the topology text by Engelking and Sieklucki [2].

In an article written in 1916, Sierpinski wrote [1]:

Note that as early as one year ago Mr. Mazurkiewicz found an example of a curve which was simultaneously a Jordan curve and a Cantor curve...Mazurkiewicz forms this curve by dividing the square into nine smaller squares using lines parallel to the sides and removing the interior of the center square, performing the same procedure on each of the remaining eight square, and iterating this procedure ad infinitum.So the Sierpinski carpet was actually invented by Stefan Mazurkiewicz, who in 1913 wrote his Ph.D. thesis under the supervision of Sierpinski on curves filling a square.

Rather than remove the center square at each stop of the iterative construction, keep the center square and the four corner squares but remove the other four middle squares along each edge. The produces the box fractal.

For another example of how the Sierpinski Carpet has been an artistic inspiration, see the pictures of the quilt "Sierpinski Meets Mondrian" designed by Professor Gerda de Vries, University of Alberta, or the quilt "An Infinity of Nine-Patches by Anabeth Dollins, Penn State University Greater Allegheny Campus.

During October and November 2014, twenty primary sites around the world participated in the MegaMenger challenge. As a distributed fractal project, twenty Menger Sponge cubes were built in different cities around the world. In each location, volunteers built 8,000 small cubes out of nearly 50,000 business cards. These were then combined in groups of 20 to create 400 level one Menger Sponges. These were also combined in groups of 20 to make 20 level two sponges, which then formed one massive level three Menger Sponge. The resulting fractal cube would be nearly 5 feet tall. Collectively, these twenty level three sponges could be virtually combined to form a level-4 Menger sponge, perhaps the largest fractal ever built. Here are pictures of the level three Menger sponge built by faculty and students at Agnes Scott College under the guidance of Assistant Professor of Mathematics, Rachel Bayless (with additional contributions from students at several local middle and high schools).

- Ciesielski, Krzysztof and Zdzislaw Pogoda. "The Beginning of Polish Topology," The Mathematical Intelligencer, 18 (3), 1996, 32-39.
- Engelking, R. and K. Sieklucki.
*Introduction to Topology,*Amsterdam: North-Holland, 1994. - Helmberg, Gilbert.
*Getting Acquainted with Fractals*, de Gruyter Publishing, 2007. [See Preview at Google Books] - Jones, Juw. "Fractals Before Mandelbrot-A Selective History,"
in
*Fractals and Chaos,*Crilly, Earnshaw, and Jones, Editors, Springer-Verlag 1991. - Mandelbrot, Benoit.
*The Fractal Geometry of Nature,*W.H. Freeman and Co. 1983. [Preview available at Google Books] - McWorter Jr., William A. and Jane Morrill Tazelaar. "Creating
Fractals,"
*Byte*, August 1987, 123-132. - Peitgen, Heinz-Otto, Hartmut Jurgens and Dietmar Saupe.
*Fractals for the Classroom, Part One: Introduction to Fractals and Chaos,*Springer-Verlag New York, Inc. 1990. - Sierpinski, Waclaw. "On a Cantorian curve which contains a bijective and continuous image of any given curve," Mat. Sb. 30 (1916), 267-287 [Russian].