Euclidean similarity Created 2026-10-14 Updated 2026-10-14
A Euclidean similarity is a map satisfying for a fixed . It has the form with orthogonal: after subtracting and dividing by , the map fixes zero and preserves distances, hence inner products by polarization, so it is a linear orthogonal map. It is a contraction if . Contracting Euclidean similarities define self-similar compact sets; the open set condition is a useful separation hypothesis for computing their Hausdorff dimension.
Finite similarity iterated function system 2026-10-14
For finitely many contracting Euclidean similarities, the map on nonempty compact subsets of is a contraction in the Hausdorff metric, with contraction constant . The contraction mapping theorem gives a unique nonempty compact invariant set. If the open set condition holds, its Hausdorff dimension is the unique satisfying .
Hausdorff dimension of the Cantor set 2026-10-14
The middle-third Cantor set has Hausdorff dimensionIts Lebesgue measure is zero, yet . These assertions measure different aspects of size: interval length is too coarse to distinguish this set from a null set, while the critical fractional measuring rule captures its remaining structure.
At level , the construction covers by intervals of diameter . Their total -cost isFor it tends to zero, proving the upper dimension bound. At it equals one, giving . For this particular cover's cost grows, but that alone would not prove a lower bound on Hausdorff measure.
Cantor cover costs change trend at the critical exponent, and distributed mass supplies the lower bound
. Details. For the matching lower bound, use the Cantor distribution, which assigns mass to each level- Cantor cylinder. An interval of length with meets at most two level- construction intervals, since their gaps are at least . Its mass is therefore at mostEvery covering set of diameter in the line lies in an interval of length , so any small cover must have total -cost at least . This is the mass distribution principle in its interval form: , sufficient to prove the claimed dimension. The constants are convenient bounds, rather than an assertion of the exact critical Hausdorff measure. In the diagram, the right panel is a finite-stage approximation to the Cantor function, showing how probability is shared while the middle third receives none.
The reusable pattern is to obtain an upper bound by constructing covers and a lower bound by distributing mass. The same strategy underlies Cartesian powers of the Cantor set and the dimension formula for a finite similarity iterated function system satisfying the open set condition.
Minkowski sausage 2026-10-14
The Minkowski sausage replaces a segment by eight directed unit segments whose endpoint displacement is four units. A middle straight run of length two represents two collinear unit segments. After normalizing the displacement to one, the eight contracting Euclidean similarities all have ratio . The open diamond is an open set condition witness: its eight image diamonds have disjoint interiors and lie within it. Hence , giving Hausdorff dimension . Treating the middle run as a single similarity of ratio instead defines a different iterated scheme.
Past exam of the mathematics course of the University of Cambridge 2005 ii Paper 4 12G Solution Created 2026-09-24 Updated 2026-10-14
For and , define the scale-restricted Hausdorff content at scale byusing countable covers. The Hausdorff measure is ; the limit exists by monotonicity. A conventional dimension-dependent normalizing constant does not change the Hausdorff dimensionAt , a nonempty singleton has contribution one, so the measure counts points.
Let and . For compact nonempty , matching a point of with the image of a nearby point of gives . Choose a sufficiently large closed ball with every . The nonempty compact sets are nested, so their intersection is nonempty and compact. The finite union of similarity images commutes with this decreasing compact intersection: a point lying in all unions has some repeated branch index, and compactness supplies a preimage in all the nested sets. Consequently . If is another invariant compact set, the contraction estimate gives , hence . This proves existence and uniqueness of the invariant set of a finite similarity iterated function system.
Under the open set condition, there is a nonempty bounded open set such that the lie inside and are pairwise disjoint. The dimension formula isOverlaps can invalidate this formula if that assumption is omitted.
For the printed template, subdivide the central straight run of length two into its two collinear unit steps. The eight directed steps, before dividing all coordinates by four, have successive verticesEach step defines a similarity with ratio , with rotation matching its direction. The open diamond is an explicit witness for the open set condition. Its eight image diamonds have radius in the metric, lie in , and their centres have pairwise distance at least ; their interiors are therefore disjoint. The Minkowski sausage dimension is consequentlyThis makes the subdivision convention explicit. If the length-two run were instead treated as one unsplit edge replaced at scale , there would be six maps of ratio and one of ratio . The same diamond separation works, but the equation becomes , giving , a different fractal. The requested corresponds to the eight-unit-step interpretation.
Past exam of the mathematics course of the University of Cambridge 2006 ii Paper 1 3F Solution Created 2026-09-24 Updated 2026-10-14
Under the open set condition there is a nonempty bounded open set such that the sets are pairwise disjoint and all contained in . The Hausdorff dimension of the nonempty compact invariant set is the unique satisfyingFor the carpet here the 24 retained sub-squares give Euclidean similarities for , . Their images of are disjoint and lie in , so the condition holds even though some closed images share boundary points. All contraction factors are . Thus
