- This pop-up object is not just a regular pop-up—it is also a fractal!
- 1 Basic Description
- 2 A More Mathematical Explanation
- 3 Why It's Interesting
- 4 Teaching Materials (1)
- 5 About the Creator of this Image
- 6 Related Links
As you may know, fractals are never-ending patterns. They are made by repeating the same process over and over, which is called a reiterative process (click here for more information on fractals). Fractals are found everywhere, e.g. in nature and in math. Is it possible, then, to make a pop-up fractal? The answer is yes!
The image on the right shows a pop-up fractal in its stage 5 iteration. Notice that parts of the construction paper are cut to pop out. Like other pop-ups, such as pop-up books, cards, etc., it can be folded flat. What makes this creation different is that it is constructed by reiterating a simple process, which makes it a fractal. Not only is it visually appealing, but its patterns can also be mathematically analyzed.
Note: The original instructions for constructing a pop-up fractal were retrieved from FractalFoundation. This resource simply acts as a jumpstart for our further exploration.
How to Make a Pop-Up Fractal
Although it seems difficult, the process of making a pop-up fractal is actually quite simple.
- Rectangular piece of paper
Stage 1 (Initial Iteration)
Preparing the Paper: Starting with a rectangular piece of paper, fold the paper vertically.
Step 1: Use a ruler to find the midpoint of the folded paper.
Step 2: Draw a straight line from the middle of the folded edge to the midpoint. Cut on the line.
Step 3: Fold the top flap over. Then take the flap and invert it so that it is folded inside itself. The paper should now look like a series of steps. If you open the entire piece of paper like a book, the flap that was folded over and inverted should appear to be popping out.
For Future Iterations: Repeat this process starting from Step 1, for as many iterations as you like. Find the midpoint of the section, and continue the steps. Remember to treat the new sections as individual pieces of paper! This is a fractal, so this process repeats itself for further iterations, just on a different scale.
For visual reference, see the image to the right.
|As you may have noticed, the pop-up fractal looks very similar to a Sierpinski's Triangle. However, our fractal has some different characteristics. First of all, a pop-up fractal only resembles Sierpinski's Triangle from the front—when tilted in different angles, the pop-up is 3-D and no longer resembles a flat Sierpinski's Triangle. Also, if you look closely at the "triangles" of the pop-up fractal, they are not actually triangles. The bases are ridges instead of straight lines.
Despite the differences, the pop-up fractal and Sierpinski's Triangle share many similarities. Both figures use triangular numbers, which are numbers that can be used to form equilateral triangles.
A More Mathematical Explanation
- Note: understanding of this explanation requires: *Fractals
Before we go in depth with the math, let's review all of the parts of the fractal that we will refer [...]
Before we go in depth with the math, let's review all of the parts of the fractal that we will refer to.
|When we talk about area, we are referring to the area that is inside the holes of the fractal. We are focusing on the holes because they are the main differences between the pop-up fractal and Sierpinski's triangle.
In the stage 2 iteration (Fig. 1), you can see that we split the fractal's holes into sections. The section names are based on the number of units inside.
For example, the One's have one unit inside. No matter what stage you are on, the One's will always be the smallest holes. The next smallest holes are known as Three's, because they have three units inside.
|Fig. 2 shows the stage 3 iteration. The size of the One's have now become smaller. Now, we have a new section, Ten's, which have ten units inside. These sections continue to grow as the iterations progress. In the stage 5 interation, the sections are One's, Three's, Ten's, 36's, and 136's.|
|Furthermore, later on in the page, we will often use terms such as gaps (Fig. 3) and steps (Fig. 4) to describe various parts of the fractal.|
|Fig. 3||Fig. 4|
Now that we know our terms and our sections, it is time to get started! As we worked our way up to making a Stage 5 fractal, we recorded how many One's sections, Three's sections, Ten's sections, 36's sections, and 136's sections there were in each iteration:
|Iteration||Number of One's||Number of Three's||Number of Ten's||Number of 36's||Number of 136's||Total Area|
|Stage 1||1||-||-||-||-||1 unit2|
|Stage 2||3||1||-||-||-||6 units2|
|Stage 3||9||3||1||-||-||28 units2|
|Stage 4||27||9||3||1||-||120 units2|
|Stage 5||81||27||9||3||1||496 units2|
There seems to be a general pattern in the table that can lead us in finding the total area for the entire fractal holes. Once we knew how many of the sections there were, we multiplied that quantity with the section number. For example, if we wanted to know the area for all the Three's in Stage 4, we would multiply 9 (the number of Three's) by 3, which equals 27. 27 is the area of all the Three sections. To find the area of the entire fractal, you must add all the total areas for each individual section.
- Stage 1
Area = (1 x 1)
Area = 1 unit2
- Stage 2
Area = (3 x 1) + (1 x 3)
Area = 3 + 3
Area = 6 units2
- Stage 3
Area = (9 x 1) + (3 x 3) + (1 x 10)
Area = 9 + 9 + 10
Area = 28 units2
- Stage 4
Area = (27 x 1) + (9 x 3) + (3 x 10) + (1 x 36)
Area = 27 + 27 + 30 + 36
Area = 120 units2
- Stage 5
Area = (81 x 1) + (27 x 3) + (9 x 10) + (3 x 36) + (1 x 136)
Area = 81 + 81 + 90 + 108 + 120
Area = 496 units2
- Area of Fractal
Total Area = 1 + 6 + 46 + 120 + 496
Total Area = 669 units2 Tableexplanations.png, Tableexplanations2.png, area.png
Is it possible to find a relationship between the iteration number and the amount of sections there are? For example, can we find the number of Ten's in a stage 4 iteration just by using an equation? The answer is yes! The following equations relate the iteration number, n, with the amount of certain sections found in that iteration:
Number of One's = 3(n - 1)
Number of Three's = 3(n - 2)
Number of Ten's = 3(n - 3)
Number of 36's = 3(n - 4)
Number of 136's = 3(n - 5) Equationsss.png
As you can see, the equations are exponential. Remember, these equations only give you the amount of sections. To find the total area, you must multiply by the area of each section.
For example, if there are nine Ten’s, you must multiply 9 by 10 units2 to find the total area for the Ten’s section. In this case, the total area for the Ten’s sections is 90 units2 . Once you find the total area for each section, you add them together to find the total area of the holes in the fractal.
Note: If the exponent (e.g. n - 3) is negative, this means that that section size does not exist in that iteration.
Number of One's = 3(n - 1) = 3(5 - 1) = 34 = 81
There are 81 One's. Fractal5.png
Now what about iterations beyond stage 5? Further iterations can become tedious and even impossible to create with paper. How, then, do we determine the area of the new sections? Is there a way to relate the iteration number to the total area of the fractal? As it turns out, yes, there is! Let's say we want to make a stage 7 fractal. We know the areas of the previous sections: One's, Three's, Ten's, 36's, and 136's. Now let's determine the areas of the next section.
There are several methods to find the next section number. The first involves triangular numbers. Triangular numbers are a number of objects that can be arranged to form an equilateral triangle. For example, 3 is a triangular number because you can arrange 3 objects into a triangle (1 in the top row, 2 in the bottom row). Now take a look at the list of triangular numbers up to 2080:
The highlighted numbers are section numbers. They seem to be distanced in a pattern. For example, to get from 3 to 10, you must advance two spaces. To get from 10 to 36, you must advance four spaces. To get from 36 to 136, you must advance eight spaces.
If we want to know the area of the holes in a stage 6 pop-up fractal, we must know what the section size is after 136 units2, which is the largest section size in a stage 5 fractal. The pattern we've seen so far is to advance 2, 4, and 8 spaces—multiplying each step by 2. To find the section size for a stage 6 fractal, we must advance 8 x 2 = 16 spaces, which leads you to 528 units2. We can continue to use this pattern to find the sections of further iterations. For example, for a stage 7 fractal, you advance 16 x 2 = 32 spaces, which leads to 2080 units2.
An alternate solution to finding the area with just the stage number would be through mathematical means. When folded up, it appears as if the pop-up fractal has a set of “steps”. As each stage of iteration increases, the number of steps increases exponentially. Using the exponential function 2x, where x = the stage of iteration, we can find the number of steps for any iteration stage.
Using our previous knowledge we can find the largest section in an iteration. By dividing the number of steps in the same iteration by 2, we find the number of gaps for the largest section.
We plug the number of gaps in to the formula for finding triangular numbers [n(n+1)]/2 as n. The outcome should be the number of unit squares in the largest empty space.
If we work backwards from the stage we started at to find the biggest area, we can find the total area by repeating the process. We do this by subtracting 1 from the stage number each time until we reach 0.
Why It's Interesting
The Pop-Up Fractal is interesting and unique because it shows the nature of fractals in a simple, easy to visualize, fun way. Everyone loves pop-ups! They have a compelling artistic side to them, especially when viewed in different angles. Making pop-up fractals shows how fractals with regards to reiterations, and lets you physically explore their properties.
Putting visual features aside, as you may know, creating a pop-up fractal requires cutting. There is a pattern that governs how many times you need to cut to reach each stage of iteration. The number of cuts needed to iterate the pop-up fractal to the next stage is exponential:
From Stage 0 to 1: 1 cut required
From Stage 1 to 2: 3 cuts required
From Stage 2 to 3: 9 cuts required
From Stage 3 to 4: 27 cuts required
From Stage 4 to 5: 81 cuts required
And so on...
Does this pattern look familiar? It is yet another exponential pattern, 3(n - 1), where n = the number of the latter stage. For example, from Stage 0 to 1, the latter stage is 1. The number of cuts required, then, is 3(n - 1) = 3(1 - 1) = 30 = 1.
If we were able to iterate the pop-up fractal infinitely, the corners of the "triangle" would never touch the edge of the paper!
Teaching Materials (1)
Teaching Materials (1)Add teaching materials.
About the Creator of this Image
Leave a message on the discussion page by clicking the 'discussion' tab at the top of this image page.