# Sierpinski Gasket by Trema Removal

One of the ways to construct the Sierpinski gasket (also known as the *Sierpinski triangle*) is by starting with a triangle. Then splitting the triangle into four and removing the (open) middle one. The same procedure then applies to the remaining three triangles. The term *trema* refers to the removed pieces.

Professor McWorter drew my attention to the fact that this is not the only way to obtain the Sierpinski gasket by removing tremas. The applet on the right illustrates his approach. The original shape is a square which is split into four smaller squares with the south-eastern one subsequently removed. The same procedure then applies to the remaining three squares. Move the slider to perform successive steps.

When you reach the last step allowed with the accuracy of a square the size of a pixel, it becomes absolutely obvious that the two ways (and the two trema shapes) lead to exactly same result.

Let's ask how much area we remove in this process. The original square had side of length 1. Skip the first step and start with the inverted L-shape of area 3/4. On the next step, me remove 3 smaller squares, then 9, then 27, and so on. On every step, the side of the removed squares is divided by 2. The first 3 squares had side 1/4 and area 1/16. The 9 smaller ones had area 1/64=(1/8)^{2} each. Afterwards, me removed 27 squares of the total area 27/16^{2}. And so on. We get a series:

3/4^{2} + 9/8^{2} + 27/16^{2} + ... =

3/16(1 + 3/4 + 9/16 + 27/64 + ...) =

3/16·1/(1-3/4) =

3/4.

This is exactly the area of the inverted L-shape. Therefore, Sierpinski gasket's area is 0.

Can we obtain the same result when removing triangular tremas? Assume the whole triangle's area is 1. The number of triangles removed at each step is multiplied by 3 whereas the area of any one triangle removed is divided by 4. Check that the process leads to a geometric series that sums up to 1.

Another derivation does not directly appeal to the notion of limit. It applies in exactly the same way to both trema removal procedures. In both cases, assume the starting shape(a square or a triangle) has area 1. Let's denote the total removed area as S. We want to show that

### About Fractals

- Dot Patterns, Pascal Triangle and Lucas Theorem
- Sierpinski Gasket Via Chaos Game
- The Chaos Game: Address Space vs IFS
- Sierpinski Gasket By Common Trema Removal
- Sierpinski Gasket By Trema Removal
- Sierpinski's Gasket and Dihedral Symmetry
- Collage Theorem And Iterated Function Systems
- Variations on the Theme of (Triangular) Tremas
- Variations on the Theme of (Rectangular) Tremas
- Sierpinski Gasket and Tower of Hanoi
- Fractal Curves and Dimension
- Color Cycling on the Mandelbrot Set
- Iterations and the Mandelbrot Set
- Mandelbrot and Julia sets
- Emergence of Chaos
- Logistic Model
- Weird curves bound normal areas
- Exercise with Square Spiral

|Contact| |Front page| |Contents| |Geometry|

Copyright © 1996-2018 Alexander Bogomolny

64666555 |