Sierpiński triangle

Lore & Background

The Sierpiński triangle can be constructed by repeatedly removing the central triangle from an equilateral triangle subdivided into four congruent smaller triangles. This process, applied infinitely, yields the fractal. Alternatively, one can shrink a triangle to half height and half width, make three copies, and position them to touch at corners, repeating the process. The fractal is the fixed set of the transformation combining dilations by a factor of 1/2 about its three corners.

Reader's Guide

The Sierpiński triangle is significant as a foundational example of a self-similar fractal and an iterated function system. Its construction methods—removing triangles, shrinking and duplicating, the chaos game, arrowhead curve, and cellular automata—illustrate key concepts in fractal geometry. It appears in Pascal's triangle when even numbers are colored white and odd numbers black, and in the Towers of Hanoi puzzle graph. The fractal's Hausdorff dimension satisfies 2^d = 3, giving d = log 3 / log 2. Its properties have influenced mathematics, computer graphics, and the study of dynamical systems.

Did You Know?

• The Sierpiński triangle appeared as a decorative pattern many centuries before Wacław Sierpiński's work.
• The chaos game method generates the triangle by repeatedly moving half the distance from a current point to a randomly chosen vertex.
• The Sierpiński triangle can be approximated by coloring odd numbers black in Pascal's triangle with 2^n rows.
• The states of the Towers of Hanoi puzzle form a graph that corresponds to the Sierpiński triangle's construction.

Origins and Historical Roots

The Sierpiński triangle bears the name of Polish mathematician Wacław Sierpiński, yet the underlying pattern predates his work by many centuries, having appeared as decorative motifs long before any formal mathematical treatment. Sierpiński's own 1915 article was actually aimed at demonstrating a specific type of continuous path—what he termed a Cantorian curve—and the triangle as we recognize it emerged from that broader investigation into curves in the plane. The object is also known by alternative names, including the Sierpiński gasket and the Sierpiński sieve, each reflecting a different facet of its structure. At its core, it belongs to the family of self-similar sets: mathematically generated patterns that reproduce their own structure identically at any scale of magnification or reduction. This property of exact scale invariance makes it one of the most fundamental examples in fractal geometry, bridging the gap between elementary Euclidean shapes and the infinitely complex patterns that emerge from simple recursive rules applied without end.

Geometric Construction Methods

The Sierpiński triangle can be built through several distinct geometric procedures, all converging to the same limiting object. The most intuitive approach begins with a solid equilateral triangle, subdivides it into four congruent smaller triangles, removes the central one, and repeats the operation infinitely on each remaining piece. Each excised triangle—called a trema—is topologically an open set, and the whole process exemplifies a finite subdivision rule. An alternative method, sometimes called shrinking and duplication, starts with any closed bounded region, scales it to half its dimensions, makes three copies, and arranges them so each touches the others at a single corner. The central gap appears immediately because three half-scale copies cover only three-quarters of the original area. Remarkably, this process works from a square or even a fish-shaped region, as Michael Barnsley demonstrated in his work on variable fractals. A third geometric route, the arrowhead construction, replaces line segments with three shorter segments at 120-degree angles, producing a single continuous directed path that traces the entire gasket in the limit.

The Chaos Game and Iterated Function Systems

Perhaps the most surprising way to generate the Sierpiński triangle involves randomness. The so-called chaos game works as follows: choose three vertices forming a triangle, pick any starting point, then repeatedly select one vertex at random and move halfway toward it, plotting each new position. After roughly a hundred plotted points, a faint triangular outline emerges; after a few hundred, the characteristic recursive detail becomes visible. This algorithm is a concrete instance of an iterated function system, where three contraction maps—each scaling by a factor of one-half about a different vertex—are applied in random sequence. The mathematical guarantee is that the resulting set of points is dense in the Sierpiński triangle, regardless of where the process begins. If the initial point already lies on the gasket, every subsequent point does as well. If it lies inside the triangle's perimeter but off the gasket, no plotted point will ever land exactly on the fractal, yet the cloud converges toward it. Starting outside the triangle, a point can only land on the gasket if it corresponds to a location that would exist on an infinitely scaled version of the figure.

Formal Mathematical Structure

At its most abstract level, the Sierpiński triangle is defined as the fixed set of a union of three dilation transformations, each scaling by a factor of one-half about one of the triangle's vertices A, B, or C. This fixed set possesses an attractive property: applying the combined transformation repeatedly to any compact set of points causes the successive images to converge, in the Hausdorff metric, to the Sierpiński triangle. This universality means the starting shape is mathematically irrelevant—a square, a disk, or an irregular blob will all be drawn into the same fractal limit. The recursive removal of triangular subsets produces a structure where each excised hole is an open set in the topological sense, and the collection of all such tremas is a defining feature of the gasket. The self-similarity is exact: every small triangle within the figure is a perfect half-scale replica of the whole. This property of scale invariance, combined with the convergence guarantee from the iterated function system framework, makes the Sierpiński triangle one of the most fundamental examples of a self-similar set in mathematics, illustrating how simple contraction rules applied repeatedly can generate infinitely detailed structure from an arbitrary starting region.