Fractals and Dimension - Main Theorem

TheoremHutchinson's Theorem (IFS Attractor)

Let $\{S_1, \ldots, S_k\}$ be a collection of contraction mappings on a complete metric space $(X, d)$ with contraction ratios $r_i < 1$ . Then there exists a unique nonempty compact set $A \subset X$ (the attractor) satisfying:

$A = \bigcup_{i=1}^k S_i(A)$

Moreover, for any nonempty compact set $B$ , the sequence $S^n(B) = \bigcup_{i_1, \ldots, i_n} S_{i_1} \circ \cdots \circ S_{i_n}(B)$ converges to $A$ in the Hausdorff metric.

This theorem guarantees existence and uniqueness of IFS attractors, providing a systematic method for constructing fractals.

Hutchinson's theorem is fundamental to fractal geometry. It guarantees that iterating any collection of contractions produces a unique limit set—the attractor. This explains why fractals like the Sierpinski gasket and Cantor set arise robustly: they're fixed points of the IFS operators in the space of compact sets.

The theorem's power lies in its generality: it applies to any contractions, not just similarities. This enables construction of diverse fractals by choosing appropriate mappings, making IFS a practical tool for computer graphics, data compression, and mathematical modeling.

TheoremMoran's Formula for Self-Similar Sets

For a self-similar set $F$ with IFS $\{S_1, \ldots, S_k\}$ having contraction ratios $\{r_1, \ldots, r_k\}$ , if the open set condition holds (there exists an open set $O$ such that $S_i(O) \subset O$ and $S_i(O) \cap S_j(O) = \emptyset$ for $i \neq j$ ), then:

$\dim_H(F) = \dim_B(F) = s$

where $s$ is the unique solution to:

$\sum_{i=1}^k r_i^s = 1$

This formula allows exact computation of fractal dimension for self-similar sets satisfying the open set condition.

Moran's formula is remarkably simple and powerful. For classic fractals like the Cantor set, Sierpinski gasket, and Koch curve, dimension calculation reduces to solving a single equation. The open set condition ensures pieces don't overlap excessively, making the scaling straightforward.

When the open set condition fails (overlapping pieces), dimension can be smaller than Moran's formula predicts. This occurs for some Julia sets and leads to rich phenomena in fractal geometry, where geometric overlap reduces effective dimension below the algebraic value.

ExampleComputing Dimensions via Moran's Formula

Cantor set: Two pieces, $r_1 = r_2 = 1/3$ : $2(1/3)^s = 1 \Rightarrow s = \log 2/\log 3 \approx 0.631$

Sierpinski gasket: Three pieces, $r_i = 1/2$ : $3(1/2)^s = 1 \Rightarrow s = \log 3/\log 2 \approx 1.585$

Koch curve: Four pieces, $r_i = 1/3$ : $4(1/3)^s = 1 \Rightarrow s = \log 4/\log 3 \approx 1.262$

These exact values match numerical estimates, validating both the theory and computational methods.

Remark

Hutchinson and Moran's theorems transform fractal construction from art to science. Rather than ad-hoc methods, we have:

Systematic construction via IFS
Guaranteed convergence to unique attractors
Exact dimension formulas under mild conditions

This rigor enables applications from image compression (fractal compression exploits IFS representations) to modeling natural phenomena (coastlines, lightning, blood vessels all exhibit approximate self-similarity amenable to IFS modeling).

These theorems provide both existence results (Hutchinson) and computational tools (Moran's formula) for fractal analysis. Together, they form the foundation of rigorous fractal geometry, converting intuitive notions of self-similarity into precise mathematical statements with practical computational algorithms.