Koch’s Snowflake
Intuition has often led me astray, but (luckily?) never more than when studying mathematics. Koch’s Snowflake is that reminder for me.
Koch’s Snowflake is a fractal, a class of complex geometric shapes that display self-similarity on all scales. It is “grown” from a single equilateral triangle. At each stage in growth, equilateral triangles of diminishing size are appended to every side. As the number of iterations increases, the shape converges to a six-sided crystalline shape – hence a snowflake.
Honestly, it’s easier to draw than describe.
Below are the first six iterations of Koch’s snowflake. Assuming a side length of 1, you can see the area,
, and the perimeter,
, as the number of iterations,
, increases.
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
Now get this. As the number of iterations
approaches infinity, the area
is bounded but the perimeter
diverges to infinity. So, the perimeter can be made arbitrarily large while at the same time the area can never grow beyond some fixed limit… if intuitively you’re cool with that, congratulations, you have better intuition than me.
When I first encountered Koch’s Snowflake, I was certain that if the area was bounded, then the perimeter must be bounded too. Intuitively, it just made sense; they literally define each other. But my gut was wrong. Even after working through the math – which is detailed below if you’re feeling mathy – I still struggle to wrap my head around what. is. even. going. on.
The Area of Koch’s Snowflake
Let
denote the area of the
iteration of Koch’s Snowflake.
The area of a triangle is given by
, so assuming an equilateral triangle of side length
, it follows that:

![]()
![]()
The next iteration of the fractal is equal to
plus the incremental area of the three additional new triangles. Note that, the way the fractal transformation is defined, every side length is equal to
the length of the original side
. Therefore,
is equal to:

![]()
![]()
![]()
Continuing to recursively calculate the area of Koch’s Snowflake in this manner, and then simplifying the expression, the pattern becomes clear. The derivation of the following expressions is left to the reader.

![]()
![]()
Let’s reflect for a minute on what is occurring in the parentheses of summands in the formula above. Each summand is equal to the number of additional triangles,
, times their respective area,
, at the
iteration. Using this, we can calculate the incremental area added at the
iteration as the product of additional triangles by their respective area, which algebraically simplifies to:
, for side length
.
So, we can generalize the total area of Koch’s Snowflake at the
iteration to:
![]()
So what happens to
as
approaches infinity? To answer this question we need to know about geometric series and their properties.
Aside: Geometric Series
A geometric series is a series of the form
, which expands to:
![]()
Note that, if we multiply the above expression by
, we have:
![]()
Multiplying by
may seem arbitrary, but considering the expression
we see that every term except
cancels, thereby transforming an expression of two infinite series into a simple finite expression. It’s clever, that’s for sure.
INSERT: math showing cancellation of infinite series
And we have:
![]()
![]()
, for ![]()
TODO: prove for -1 < r < 1
So not only does a geometric series converge if
, it converges to
.
We will express the perimeter of Koch’s Snowflake,
, as a geometric series and show that
, therefore it converges to
.
Proof
To prove
converges to some real number, we only need to consider the infinite sum within the expression, since everything else is constant.
![]()
Which is a geometric series with
and
, and since
it converges. Using the identity of the geometric series derived above,
it follows that:

![]()
![]()
Therefore, the area of Koch’s Snowflake converges to
for side length
.
![]()
The Perimeter of Koch’s Snowflake
At each iteration in the fractal, all incremental side lengths are equal. Therefore, the perimeter of Koch’s Snowflake at the
iteration is given by,
, for
the number of sides and
the length of each side.
The Number of Sides


![]()
![]()


![]()
![]()


![]()
![]()
It appears that
generalizes to
and
generalizes to
. Therefore:
![]()
So what happens to the perimeter,
, as
approaches infinity? Mathematically, we would like to evaluate the following expression:
![]()
Note that we can pull the constant out of the limit, and so we are really only interested in what
does as
approaches infinity. To answer this, we will need to know about Cauchy sequences and their properties.
Aside: Cauchy Sequences
A sequence is Cauchy if we can always find two points that are arbitrarily close. It’s just another way of defining a convergent sequence, and in fact, a sequence is Cauchy if and only if it converges to some
.
Formally, a sequence
is Cauchy if there exists
such that for
,
for all
.
We rely on the fact that a sequence is Cauchy if and only if it converges to some
to demonstrate that the perimeter of Koch’s Snowflake,
, is not convergent. This is accomplished by assuming that
is convergent, then reaching a contradiction in demonstrating it is also a Cauchy sequence, therefore,
must diverge.
Proof
Assume that
converges to some
. Then it follows that
is a Cauchy Sequence, and there exists
such that for
,
for all
.
Choose
and let
. If the sequence is Cauchy, then we should be able to find
such that for
:
.
The choice of
is not arbitrary here, nor is the choice of
, as you will soon see.
Then it follows that:
![]()
![]()
![]()
![]()
![]()
Which, because we are taking the absolute value, is equivalent to:
![]()
Which cannot be possible, because
for all
, and
multiplied by any number greater than
must be greater than
, therefore, there is no
such that for
it is true that
.
![]()
A convergent sequence generates points that get arbitrarily close, but we have shown that no matter how far out we go there does not exist any two points whose distance is less than
. This implies that the gaps between elements do not fade to zero. Intuitively, if the distance between points does not diminish then we can continue adding elements of the sequence to reach any arbitrarily large number, larger than
, or
, or
.