Sierpiński triangle

The Sierpiński triangle (sometimes spelled Sierpinski), also called the Sierpiński gasket or Sierpiński sieve, is a fractal attractive fixed set with the overall shape of an equilateral triangle, subdivided recursively into smaller equilateral triangles. Originally constructed as a curve, this is one of the basic examples of self-similar sets—that is, it is a mathematically generated pattern that is reproducible at any magnification or reduction. It is named after the Polish mathematician Wacław Sierpiński, but appeared as a decorative pattern many centuries before the work of Sierpiński.

Sierpiński triangle

Generated using a random algorithm

Sierpiński triangle in logic: The first 16 conjunctions of lexicographically ordered arguments. The columns interpreted as binary numbers give 1, 3, 5, 15, 17, 51... (sequence A001317 in the OEIS)

Constructions

There are many different ways of constructing the Sierpinski triangle.

Removing triangles

 

The evolution of the Sierpinski triangle

The Sierpinski triangle may be constructed from an equilateral triangle by repeated removal of triangular subsets:

1. Start with an equilateral triangle.
2. Subdivide it into four smaller congruent equilateral triangles and remove the central triangle.
3. Repeat step 2 with each of the remaining smaller triangles infinitely.

Each removed triangle (a trema) is topologically an open set.^[1] This process of recursively removing triangles is an example of a finite subdivision rule.

Shrinking and duplication

The same sequence of shapes, converging to the Sierpiński triangle, can alternatively be generated by the following steps:

1. Start with any triangle in a plane (any closed, bounded region in the plane will actually work). The canonical Sierpiński triangle uses an equilateral triangle with a base parallel to the horizontal axis (first image).
2. Shrink the triangle to 1/2 height and 1/2 width, make three copies, and position the three shrunken triangles so that each triangle touches the two other triangles at a corner (image 2). Note the emergence of the central hole—because the three shrunken triangles can between them cover only 3/4 of the area of the original. (Holes are an important feature of Sierpinski's triangle.)
3. Repeat step 2 with each of the smaller triangles (image 3 and so on).

Note that this infinite process is not dependent upon the starting shape being a triangle—it is just clearer that way. The first few steps starting, for example, from a square also tend towards a Sierpinski triangle. Michael Barnsley used an image of a fish to illustrate this in his paper "V-variable fractals and superfractals."^[2][3]

 

Iterating from a square

The actual fractal is what would be obtained after an infinite number of iterations. More formally, one describes it in terms of functions on closed sets of points. If we let d_A denote the dilation by a factor of 1/2 about a point A, then the Sierpiński triangle with corners A, B, and C is the fixed set of the transformation d_A ∪ d_B ∪ d_C.

This is an attractive fixed set, so that when the operation is applied to any other set repeatedly, the images converge on the Sierpiński triangle. This is what is happening with the triangle above, but any other set would suffice.

Chaos game

 

Animated creation of a Sierpinski triangle using the chaos game

If one takes a point and applies each of the transformations d_A, d_B, and d_C to it randomly, the resulting points will be dense in the Sierpiński triangle, so the following algorithm will again generate arbitrarily close approximations to it:^[4]

Start by labeling p₁, p₂ and p₃ as the corners of the Sierpinski triangle, and a random point v₁. Set v_n+1 = 1/2(v_n + p_rn), where r_n is a random number 1, 2 or 3. Draw the points v₁ to v_∞. If the first point v₁ was a point on the Sierpiński triangle, then all the points v_n lie on the Sierpiński triangle. If the first point v₁ to lie within the perimeter of the triangle is not a point on the Sierpiński triangle, none of the points v_n will lie on the Sierpiński triangle, however they will converge on the triangle. If v₁ is outside the triangle, the only way v_n will land on the actual triangle, is if v_n is on what would be part of the triangle, if the triangle was infinitely large.

 

Animated construction of a Sierpinski triangle

 

A Sierpinski Triangle is outlined by a fractal tree with three branches forming an angle of 120° and splitting off at the midpoints. If the angle is reduced, the triangle can be continuously transformed into a fractal resembling a tree.

 

Each subtriangle of the nth iteration of the deterministic Sierpinski triangle has an address on a tree with n levels (if n=∞ then the tree is also a fractal); T=top/center, L=left, R=right, and these sequences can represent both the deterministic form and, "a series of moves in the chaos game"^[5]

Or more simply:

1. Take three points in a plane to form a triangle.
2. Randomly select any point inside the triangle and consider that your current position.
3. Randomly select any one of the three vertex points.
4. Move half the distance from your current position to the selected vertex.
5. Plot the current position.
6. Repeat from step 3.

This method is also called the chaos game, and is an example of an iterated function system. You can start from any point outside or inside the triangle, and it would eventually form the Sierpiński Gasket with a few leftover points (if the starting point lies on the outline of the triangle, there are no leftover points). With pencil and paper, a brief outline is formed after placing approximately one hundred points, and detail begins to appear after a few hundred.

 

Sierpinski triangle using an iterated function system

Arrowhead construction of Sierpiński gasket

 

Animated arrowhead construction of Sierpinski gasket

 

Arrowhead construction of the Sierpinski gasket

Another construction for the Sierpinski gasket shows that it can be constructed as a curve in the plane. It is formed by a process of repeated modification of simpler curves, analogous to the construction of the Koch snowflake:

1. Start with a single line segment in the plane
2. Repeatedly replace each line segment of the curve with three shorter segments, forming 120° angles at each junction between two consecutive segments, with the first and last segments of the curve either parallel to the original line segment or forming a 60° angle with it.

At every iteration, this construction gives a continuous curve. In the limit, these approach a curve that traces out the Sierpinski triangle by a single continuous directed (infinitely wiggly) path, which is called the Sierpinski arrowhead.^[6] In fact, the aim of the original article by Sierpinski of 1915, was to show an example of a curve (a Cantorian curve), as the title of the article itself declares.^[7][8]

Cellular automata

The Sierpinski triangle also appears in certain cellular automata (such as Rule 90), including those relating to Conway's Game of Life. For instance, the Life-like cellular automaton B1/S12 when applied to a single cell will generate four approximations of the Sierpinski triangle.^[9] A very long, one cell–thick line in standard life will create two mirrored Sierpiński triangles. The time-space diagram of a replicator pattern in a cellular automaton also often resembles a Sierpiński triangle, such as that of the common replicator in HighLife.^[10] The Sierpinski triangle can also be found in the Ulam-Warburton automaton and the Hex-Ulam-Warburton automaton.^[11]

Pascal's triangle

 

A level-5 approximation to a Sierpinski triangle obtained by shading the first 2⁵ (32) levels of a Pascal's triangle white if the binomial coefficient is even and black otherwise

If one takes Pascal's triangle with $2^{n}$  rows and colors the even numbers white, and the odd numbers black, the result is an approximation to the Sierpiński triangle. More precisely, the limit as $n$  approaches infinity of this parity-colored $2^{n}$ -row Pascal triangle is the Sierpinski triangle.^[12]

Towers of Hanoi

The Towers of Hanoi puzzle involves moving disks of different sizes between three pegs, maintaining the property that no disk is ever placed on top of a smaller disk. The states of an $n$ -disk puzzle, and the allowable moves from one state to another, form an undirected graph, the Hanoi graph, that can be represented geometrically as the intersection graph of the set of triangles remaining after the $n$ th step in the construction of the Sierpinski triangle. Thus, in the limit as $n$  goes to infinity, this sequence of graphs can be interpreted as a discrete analogue of the Sierpinski triangle.^[13]

Properties

For integer number of dimensions $d$ , when doubling a side of an object, $2^{d}$  copies of it are created, i.e. 2 copies for 1-dimensional object, 4 copies for 2-dimensional object and 8 copies for 3-dimensional object. For the Sierpiński triangle, doubling its side creates 3 copies of itself. Thus the Sierpiński triangle has Hausdorff dimension ${\displaystyle {\tfrac {\log 3}{\log 2}}\approx 1.585}$ , which follows from solving ${\displaystyle 2^{d}=3}$  for $d$ .^[14]

The area of a Sierpiński triangle is zero (in Lebesgue measure). The area remaining after each iteration is ${\tfrac {3}{4}}$  of the area from the previous iteration, and an infinite number of iterations results in an area approaching zero.^[15]

The points of a Sierpinski triangle have a simple characterization in barycentric coordinates.^[16] If a point has barycentric coordinates ${\displaystyle (0.u_{1}u_{2}u_{3}\dots ,0.v_{1}v_{2}v_{3}\dots ,0.w_{1}w_{2}w_{3}\dots )}$ , expressed as binary numerals, then the point is in Sierpiński's triangle if and only if ${\displaystyle u_{i}+v_{i}+w_{i}=1}$  for all $i$ .

Generalization to other moduli

A generalization of the Sierpiński triangle can also be generated using Pascal's triangle if a different modulus $P$  is used. Iteration $n$  can be generated by taking a Pascal's triangle with $P^{n}$  rows and coloring numbers by their value modulo $P$ . As $n$  approaches infinity, a fractal is generated.

The same fractal can be achieved by dividing a triangle into a tessellation of $P^{2}$  similar triangles and removing the triangles that are upside-down from the original, then iterating this step with each smaller triangle.

Conversely, the fractal can also be generated by beginning with a triangle and duplicating it and arranging ${\displaystyle {\tfrac {n(n+1)}{2}}}$  of the new figures in the same orientation into a larger similar triangle with the vertices of the previous figures touching, then iterating that step.^[17]

Analogues in higher dimensions

 

Sierpinski pyramid recursion progression (7 steps)

 

A Sierpiński triangle-based pyramid as seen from above (4 main sections highlighted). Note the self-similarity in this 2-dimensional projected view, so that the resulting triangle could be a 2D fractal in itself.

The Sierpinski tetrahedron or tetrix is the three-dimensional analogue of the Sierpiński triangle, formed by repeatedly shrinking a regular tetrahedron to one half its original height, putting together four copies of this tetrahedron with corners touching, and then repeating the process.

A tetrix constructed from an initial tetrahedron of side-length $L$  has the property that the total surface area remains constant with each iteration. The initial surface area of the (iteration-0) tetrahedron of side-length $L$  is ${\displaystyle L^{2}{\sqrt {3}}}$ . The next iteration consists of four copies with side length ${\displaystyle {\tfrac {L}{2}}}$ , so the total area is ${\textstyle 4{\bigl (}{\tfrac {L}{2}}{\bigr )}^{2}{\sqrt {3}}=L^{2}{\sqrt {3}}}$  again. Subsequent iterations again quadruple the number of copies and halve the side length, preserving the overall area. Meanwhile, the volume of the construction is halved at every step and therefore approaches zero. The limit of this process has neither volume nor surface but, like the Sierpinski gasket, is an intricately connected curve. Its Hausdorff dimension is ${\textstyle {\tfrac {\log 4}{\log 2}}=2}$ ; here "log" denotes the natural logarithm, the numerator is the logarithm of the number of copies of the shape formed from each copy of the previous iteration, and the denominator is the logarithm of the factor by which these copies are scaled down from the previous iteration. If all points are projected onto a plane that is parallel to two of the outer edges, they exactly fill a square of side length ${\displaystyle {\tfrac {L}{\sqrt {2}}}}$  without overlap.^[18]

 

Animation of a rotating level-4 tetrix showing how some orthographic projections of a tetrix can fill a plane – in this interactive SVG, move left and right over the tetrix to rotate the 3D model

History

Wacław Sierpiński described the Sierpiński triangle in 1915. However, similar patterns appear already as a common motif of 13th-century Cosmatesque inlay stonework.^[19]

The Apollonian gasket was first described by Apollonius of Perga (3rd century BC) and further analyzed by Gottfried Leibniz (17th century), and is a curved precursor of the 20th-century Sierpiński triangle.^[20]

Etymology

The usage of the word "gasket" to refer to the Sierpiński triangle refers to gaskets such as are found in motors, and which sometimes feature a series of holes of decreasing size, similar to the fractal; this usage was coined by Benoit Mandelbrot, who thought the fractal looked similar to "the part that prevents leaks in motors".^[21]

See also

• Apollonian gasket, a set of mutually tangent circles with the same combinatorial structure as the Sierpinski triangle
• List of fractals by Hausdorff dimension
• Sierpiński carpet, another fractal named after Sierpiński and formed by repeatedly removing squares from a larger square
• Triforce, a relic in the Legend of Zelda series

References

1. ""Sierpinski Gasket by Trema Removal"".
2. Michael Barnsley; et al. (2003), "V-variable fractals and superfractals", arXiv:math/0312314
3. NOVA (public television program). The Strange New Science of Chaos (episode). Public television station WGBH Boston. Aired 31 January 1989.
4. Feldman, David P. (2012), "17.4 The chaos game", Chaos and Fractals: An Elementary Introduction, Oxford University Press, pp. 178–180, ISBN 9780199566440.
5. Peitgen, Heinz-Otto; Jürgens, Hartmut; Saupe, Dietmar; Maletsky, Evan; Perciante, Terry; and Yunker, Lee (1991). Fractals for the Classroom: Strategic Activities Volume One, p.39. Springer-Verlag, New York. ISBN 0-387-97346-X and ISBN 3-540-97346-X.
6. Prusinkiewicz, P. (1986), "Graphical applications of L-systems" (PDF), Proceedings of Graphics Interface '86 / Vision Interface '86, pp. 247–253.
7. Sierpinski, Waclaw (1915). "Sur une courbe dont tout point est un point de ramification". Compt. Rend. Acad. Sci. Paris. 160: 302–305.
8. Brunori, Paola; Magrone, Paola; Lalli, Laura Tedeschini (2018-07-07), "Imperial Porphiry and Golden Leaf: Sierpinski Triangle in a Medieval Roman Cloister", Advances in Intelligent Systems and Computing, Springer International Publishing, pp. 595–609, doi:10.1007/978-3-319-95588-9_49, ISBN 9783319955872, S2CID 125313277
9. Rumpf, Thomas (2010), "Conway's Game of Life accelerated with OpenCL" (PDF), Proceedings of the Eleventh International Conference on Membrane Computing (CMC 11), pp. 459–462.
10. Bilotta, Eleonora; Pantano, Pietro (Summer 2005), "Emergent patterning phenomena in 2D cellular automata", Artificial Life, 11 (3): 339–362, doi:10.1162/1064546054407167, PMID 16053574, S2CID 7842605.
11. Khovanova, Tanya; Nie, Eric; Puranik, Alok (2014), "The Sierpinski Triangle and the Ulam-Warburton Automaton", Math Horizons, 23 (1): 5–9, arXiv:1408.5937, doi:10.4169/mathhorizons.23.1.5, S2CID 125503155
12. Stewart, Ian (2006), How to Cut a Cake: And other mathematical conundrums, Oxford University Press, p. 145, ISBN 9780191500718.
13. Romik, Dan (2006), "Shortest paths in the Tower of Hanoi graph and finite automata", SIAM Journal on Discrete Mathematics, 20 (3): 610–62, arXiv:math.CO/0310109, doi:10.1137/050628660, MR 2272218, S2CID 8342396.
14. Falconer, Kenneth (1990). Fractal geometry: mathematical foundations and applications. Chichester: John Wiley. p. 120. ISBN 978-0-471-92287-2. Zbl 0689.28003.
15. Helmberg, Gilbert (2007), Getting Acquainted with Fractals, Walter de Gruyter, p. 41, ISBN 9783110190922.
16. "Many ways to form the Sierpinski gasket".
17. Shannon, Kathleen M.; Bardzell, Michael J. (November 2003). "Patterns in Pascal's Triangle – with a Twist". Convergence. Mathematical Association of America. Retrieved 29 March 2015.
18. Jones, Huw; Campa, Aurelio (1993), "Abstract and natural forms from iterated function systems", in Thalmann, N. M.; Thalmann, D. (eds.), Communicating with Virtual Worlds, CGS CG International Series, Tokyo: Springer, pp. 332–344, doi:10.1007/978-4-431-68456-5_27
19. Williams, Kim (December 1997). Stewart, Ian (ed.). "The pavements of the Cosmati". The Mathematical Tourist. The Mathematical Intelligencer. 19 (1): 41–45. doi:10.1007/bf03024339. S2CID 189885713.
20. Mandelbrot B (1983). The Fractal Geometry of Nature. New York: W. H. Freeman. p. 170. ISBN 978-0-7167-1186-5.
    Aste T, Weaire D (2008). The Pursuit of Perfect Packing (2nd ed.). New York: Taylor and Francis. pp. 131–138. ISBN 978-1-4200-6817-7.
21. Benedetto, John; Wojciech, Czaja. Integration and Modern Analysis. p. 408.

External links

 

Wikimedia Commons has media related to Sierpinski triangles.

• "Sierpinski gasket", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Weisstein, Eric W. "Sierpinski Sieve". MathWorld.
• Rothemund, Paul W. K.; Papadakis, Nick; Winfree, Erik (2004). "Algorithmic Self-Assembly of DNA Sierpinski Triangles". PLOS Biology. 2 (12): e424. doi:10.1371/journal.pbio.0020424. PMC 534809. PMID 15583715.
• Sierpinski Gasket by Trema Removal at cut-the-knot
• Sierpinski Gasket and Tower of Hanoi at cut-the-knot
• Real-time GPU generated Sierpinski Triangle in 3D
• Pythagorean triangles, Waclaw Sierpinski, Courier Corporation, 2003
• A067771    Number of vertices in Sierpiński triangle of order n. at OEIS
• Interactive version of the chaos game