Hausdorff Measure and Dimension with Examples
Umberto Michelucci
TL;DR
This work presents two principal approaches to computing the Hausdorff dimension: the Mass Distribution Principle-based lower/upper bound method and the Similarity Dimension method for self-similar sets. It provides explicit, step-by-step demonstrations on the unit square and the Cantor set, illustrating how coverings, mass distributions, and iterated function system (IFS) structures yield exact dimensions such as $\dim_{\mathcal{H}}(S)=2$ and $\dim_{\mathcal{H}}(C)=\frac{\log 2}{\log 3}$, with the Moran-Hutchinson Open Set Condition guaranteeing equality between the similarity and Hausdorff dimensions. The paper clarifies theoretical underpinnings like invariance of $\dim_{\mathcal{H}}$ under covering shapes and the use of the mass distribution principle to obtain nontrivial lower bounds. By coupling rigorous derivations with classical self-similar examples, it highlights practical pathways for fractal-dimension computation in metric spaces. The results reinforce the relevance of OSC and IFS-based approaches for accurate dimension assessment in fractal geometry.
Abstract
This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for calculating the dimension of a set, ensuring all calculation details are transparent for the reader. The paper first establishes the theoretical groundwork by reviewing the definitions of the Hausdorff measure, proving the dimensional invariance under changes to the shape of the covering sets, and confirming the dimensional property of open sets. It then introduces the two main methodologies. The first is the Lower and Upper Bound Estimation, which uses the relationship between the measure $H^s(A)$ and the dimension $\dim_{H}(A)$. This method emphasizes the use of the Mass Distribution Principle for establishing the lower bound, which is essential when the Lebesgue measure of the set is zero. The second, more computationally efficient method is the Similarity Dimension Method, introduced via the definitions of Similitudes, Iterated Function Systems (IFS), and the Moran-Hutchinson Theorem. Both methodologies are applied rigorously to classic examples: the Unit Square (yielding dimension $2$) and the Cantor Set (yielding the fractional dimension $\log 2 / \log 3$). The paper serves as a detailed, step-by-step guide intended to make the application of these fundamental fractal geometry concepts clearer and easier to understand.
