Fundamental Fractal Types

Why This Matters

Fractal geometry sits at the intersection of mathematics, physics, and computer science—and you're being tested on more than just pretty pictures. Understanding fractals means grasping how simple iterative rules produce infinite complexity, why self-similarity appears across scales, and how fractal dimension challenges our intuitions about measurement. These concepts connect directly to chaos theory, dynamical systems, topology, and computational algorithms.

Don't just memorize names and formulas. For each fractal type, know what mathematical process generates it, what properties make it significant, and how it relates to other fractals. Exam questions often ask you to compare fractals by their construction method, dimensionality, or the mathematical principles they illustrate. Master the underlying concepts, and you'll handle any question they throw at you.

---

Complex Plane Fractals

These fractals emerge from iterating simple functions in the complex plane. The behavior of points under repeated application of a function determines whether they belong to the set or escape to infinity.

Mandelbrot Set

• Defined by the iteration $z_{n+1} = z_n^2 + c$—points where the sequence remains bounded form the set, with $z_0 = 0$ and $c$ varying across the complex plane
• Infinite boundary complexity with self-similarity at every magnification level, revealing miniature copies of the whole set
• Serves as a "map" of Julia sets—each point $c$ in the complex plane corresponds to a unique Julia set, making the Mandelbrot set a parameter space

Julia Set

• Uses the same formula $z_{n+1} = z_n^2 + c$ but fixes $c$ while varying the starting point $z_0$ across the complex plane
• Connected vs. disconnected structure depends on whether $c$ lies inside or outside the Mandelbrot set—this relationship is fundamental
• Infinite variety of forms—each value of $c$ produces a unique Julia set, from simple circles to intricate dust-like patterns

---

Geometric Construction Fractals

These fractals are built through deterministic geometric rules—start with a simple shape and apply the same transformation recursively at each iteration.

Sierpinski Triangle

• Recursive removal process—begin with an equilateral triangle, remove the central inverted triangle, repeat on each remaining triangle
• Fractal dimension of approximately $\log(3)/\log(2) \approx 1.585$—more than a line but less than a plane, quantifying its "in-between" complexity
• Multiple construction methods including chaos game (random vertex jumping), Pascal's triangle modulo 2, and L-systems—demonstrating how different processes converge to the same structure

Koch Snowflake

• Built by adding triangular bumps—start with an equilateral triangle, divide each side into thirds, replace the middle third with two sides of a smaller equilateral triangle
• Infinite perimeter, finite area—the perimeter grows by factor $\frac{4}{3}$ each iteration while area converges to $\frac{8}{5}$ of the original triangle
• Fractal dimension of $\log(4)/\log(3) \approx 1.262$—a classic example of a curve that's "more than one-dimensional" but doesn't fill a plane

Menger Sponge

• Three-dimensional analog of the Sierpinski carpet—recursively remove the center and face-centers of each cube, creating 20 smaller cubes per iteration
• Fractal dimension of $\log(20)/\log(3) \approx 2.726$—more complex than a surface but less than a solid volume
• Zero volume, infinite surface area—the ultimate porous structure, significant in topology for its universal properties

---

Topological Fractals

These fractals challenge our understanding of dimension and measure. They demonstrate that removing "most" of a set can still leave something mathematically rich.

Cantor Set

• Middle-third removal—start with $[0,1]$, remove the open middle third, repeat on each remaining segment infinitely
• Uncountably infinite points with zero length—contains as many points as the real line but has Lebesgue measure zero
• Fractal dimension of $\log(2)/\log(3) \approx 0.631$—between a point (dimension 0) and a line (dimension 1), foundational for understanding measure theory

Apollonian Gasket

• Circle packing construction—begin with three mutually tangent circles, inscribe a circle in each gap, repeat infinitely
• Descartes Circle Theorem governs curvatures—if four circles are mutually tangent with curvatures $k_1, k_2, k_3, k_4$, then $(k_1 + k_2 + k_3 + k_4)^2 = 2(k_1^2 + k_2^2 + k_3^2 + k_4^2)$
• Fractal dimension approximately 1.3057—demonstrates how packing problems naturally generate fractal structures in bounded regions

---

Chaos Theory Fractals

These fractals arise from dynamical systems and reveal the geometric structure of chaos. They visualize how deterministic systems can produce unpredictable, yet bounded, behavior.

Lorenz Attractor

• Strange attractor from weather modeling—solutions to the Lorenz equations $\frac{dx}{dt} = \sigma(y-x)$, $\frac{dy}{dt} = x(\rho-z)-y$, $\frac{dz}{dt} = xy - \beta z$ never repeat but stay bounded
• Butterfly-shaped structure with sensitive dependence on initial conditions—tiny differences in starting points lead to wildly divergent trajectories
• Fractal dimension approximately 2.06—the attractor is more than a surface but doesn't fill three-dimensional space, representing deterministic chaos

Lyapunov Fractal

• Visualizes stability in logistic maps—generated by computing Lyapunov exponents for alternating growth parameters in the sequence $x_{n+1} = rx_n(1-x_n)$
• Color encodes chaos vs. stability—negative exponents (stable) typically shown in one color family, positive exponents (chaotic) in another
• Bridges bifurcation diagrams and fractal geometry—shows how parameter choices create intricate boundaries between order and chaos

---

Recursive Curve Fractals

These fractals demonstrate how simple folding or replacement rules generate complex self-similar curves. The construction algorithm directly encodes the fractal's properties.

Dragon Curve

• Paper-folding construction—fold a strip in half repeatedly (always same direction), unfold to 90° angles, trace the resulting path
• Fractal dimension of approximately $2$—the curve is space-filling in the limit, tiling the plane when four copies are arranged together
• L-system representation makes it ideal for teaching recursive algorithms—replacement rules $F \rightarrow F+G$ and $G \rightarrow F-G$ generate the curve

---

Quick Reference Table

---

Self-Check Questions

1. Both the Mandelbrot Set and Julia Set use the iteration $z_{n+1} = z_n^2 + c$. What determines whether a given $c$ value produces a connected or disconnected Julia set?

2. Compare the construction methods of the Sierpinski Triangle and Koch Snowflake. How do their "removal vs. addition" approaches relate to their respective fractal dimensions?

3. The Cantor Set has measure zero yet contains uncountably many points. Explain how this paradox illustrates the difference between cardinality and measure in fractal geometry.

4. If an FRQ asks you to explain how deterministic systems can produce unpredictable behavior, which fractal would you use as your primary example, and what specific property would you emphasize?

5. The Dragon Curve and Koch Snowflake are both recursive curves, yet one is space-filling while the other is not. What aspect of their construction rules accounts for this difference in fractal dimension?