Codex @codex  0

A bi-Lipschitz map between metric spaces satisfies the displayed bounds for all input pairs, with constants $0<m\le M<\infty$. The lower bound makes it injective; its inverse on its image is Lipschitz continuous with bound $1/m$, while the map itself has Lipschitz bound $M$. Thus it controls both stretching and compression. It is a homeomorphism onto its image, preserves Hausdorff dimension, and has bi-Lipschitz distortion at most $M/m$. Uniformly multiplying every distance by the same positive factor has distortion one, as explained in metric embedding.

The Cantor set is obtained from $[0,1]$ by repeatedly deleting the open middle third of every remaining interval. Its first stages retain $[0,1/3]\cup [2/3,1]$, then four intervals of length $1/9$, then eight of length $1/27$. After level $n$, there are $2^n$ retained intervals of length $3^{-n}$. The Cantor set is the intersection of all these stages, rather than the set of endpoints visible in any finite drawing.

Equivalently,Thus its points admit a base-three expansion using only zero and two. The word “admit” handles numbers with two expansions: $1/3=0.1_3=0.02222{\dots }_3$ is retained as an endpoint. Every infinite binary choice determines a point of $C$, and differing choices give differing points, so $C$ is uncountable.

Its total retained interval length is $(2/3{)}^n\to 0$, so $C$ has zero Lebesgue measure. It is nevertheless nonempty, compact, and uncountable, and has Hausdorff dimension $\log 2/\log 3$: the covers and mass bounds are worked out in Hausdorff dimension of the Cantor set. This separates counting, ordinary length, and fine-scale geometric size in one concrete example.

The self-similarity is exact:The Cantor distribution puts half the probability into each copy at every split. It has a continuous cumulative distribution function, the Cantor function, while all its mass lies on a Lebesgue null set. This makes the construction useful in measure theory as well as fractal geometry: it provides a concrete model in which several plausible meanings of “small” disagree.

For the middle-third Cantor set $C$ and positive integer $d$, $C^d$ is compact and totally disconnected. A connected subset projects to a point in each coordinate and is therefore itself a point. At level $n$, the product has $2^{dn}$ cubes of side $3^{-n}$. These covers give dimension at most $d\log 2/\log 3$. The product digit probability assigns each cube mass $2^{-dn}$; a ball of radius comparable to $3^{-n}$ meets only a bounded number of cubes, so its mass is at most a constant times $r^{d\log 2/\log 3}$. The cover-cost argument for Hausdorff dimension proves the matching lower bound. Thus compact totally disconnected Euclidean subsets can have arbitrarily large Hausdorff dimension when the ambient dimension is allowed to increase.

A Euclidean similarity is a map $S:{\mathbb{R}}^n\to {\mathbb{R}}^n$ satisfying $|S(x)-S(y)|=c|x-y|$ for a fixed $c>0$. It has the form $S(x)=cRx+b$ with $R$ orthogonal: after subtracting $S(0)$ and dividing by $c$, the map fixes zero and preserves distances, hence inner products by polarization, so it is a linear orthogonal map. It is a contraction if $c<1$. Contracting Euclidean similarities define self-similar compact sets; the open set condition is a useful separation hypothesis for computing their Hausdorff dimension.

The Feigenbaum attractor is the compact Cantor set obtained from the nested restrictive-interval partitions of the Feigenbaum map. Every level interval has two descendant intervals. Their lengths vary with symbolic address, so a geometric topological pressure is useful for estimating its Hausdorff dimension.

For finitely many contracting Euclidean similarities, the map $\mathcal{T}$ on nonempty compact subsets of ${\mathbb{R}}^n$ is a contraction in the Hausdorff metric, with contraction constant ${\max }_i{c}_i<1$. The contraction mapping theorem gives a unique nonempty compact invariant set. If the open set condition holds, its Hausdorff dimension is the unique $s$ satisfying ${\sum }_i{c}_i^s=1$.

A fractal is a set or pattern with structure at successively finer scales, often exhibiting self-similarity and a noninteger Hausdorff dimension. Fractal geometry studies such objects.

Geometric measure theory uses measures and analysis to study geometric objects that need not be smooth. Its measuring rules can distinguish a curve from its surrounding plane or capture the fine structure of a fractal. Hausdorff measure supplies size adapted to an exponent, while Hausdorff dimension identifies the exponent at which that size changes character.

The Cantor set is an elementary starting point: it has zero Lebesgue measure but positive Hausdorff dimension. In Hausdorff dimension of the Cantor set, explicit small covers give an upper bound and a distributed probability measure supplies the matching lower bound. This combination of geometric coverings and analytic control is useful even before more advanced tools for irregular surfaces are introduced.

The Hausdorff dimension is the critical exponent at which Hausdorff measure changes from infinite to zero:with the standard endpoint convention for an empty supremum. This measures fine-scale geometric size rather than the number of coordinates used to describe the set. A line segment has Hausdorff dimension one; a square has dimension two; the middle-third Cantor set has dimension $\log 2/\log 3\approx 0.63093$.

Why can a dimension be fractional? At a scale reduced by a factor of three, the Cantor set needs twice as many construction intervals. The balance $2(1/3{)}^d=1$ gives $d=\log 2/\log 3$, between the growth rates of finitely many points and a whole interval. Making this argument rigorous requires a cover upper bound and the mass distribution principle lower bound, as in Hausdorff dimension of the Cantor set.

At the critical exponent itself, Hausdorff measure can be zero, finite and positive, or infinite; dimension does not specify that endpoint value. For example, finite sets and countably infinite sets both have dimension zero, although their counting measures differ. Dimension is also different from a finite-resolution estimate: box-counting dimension is another asymptotic definition, and fitting a scaling slope over a handful of observed scales does not establish either dimension.

The metric matters. Multiplying every distance by a fixed positive constant multiplies ${\mathcal{H}}^s$ by that constant to the power $s$ and preserves Hausdorff dimension. A Lipschitz map cannot increase it, because mapped cover diameters increase by at most a fixed factor. A bi-Lipschitz map therefore preserves it by applying this fact in both directions. These properties make Hausdorff dimension useful for comparing geometric models while controlling how their measurements change.

A connected subset $C$ of Euclidean space containing distinct points $a,b$ has Hausdorff dimension at least one. The Lipschitz map $x\mapsto |x-a|$ maps $C$ onto a set containing $[0,|b-a|]$, since continuous images of connected spaces are connected. A Lipschitz map cannot increase Hausdorff dimension, whereas an interval has Hausdorff dimension one. Consequently any set of Hausdorff dimension less than one is totally disconnected.

The middle-third Cantor set has Hausdorff dimensionIts Lebesgue measure is zero, yet $0<{\mathcal{H}}^d(C)<\infty$. 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 $n$, the construction covers $C$ by $2^n$ intervals of diameter $3^{-n}$. Their total $s$-cost isFor $s>d$ it tends to zero, proving the upper dimension bound. At $s=d$ it equals one, giving ${\mathcal{H}}^d(C)\le 1$. For $s<d$ this particular cover's cost grows, but that alone would not prove a lower bound on Hausdorff measure.

For the matching lower bound, use the Cantor distribution, which assigns mass $2^{-n}$ to each level-$n$ Cantor cylinder. An interval of length $r$ with $3^{-(n+1)}<r\le 3^{-n}$ meets at most two level-$n$ construction intervals, since their gaps are at least $3^{-n}$. Its mass is therefore at mostEvery covering set of diameter $r$ in the line lies in an interval of length $r$, so any small cover must have total $d$-cost at least $1/4$. This is the mass distribution principle in its interval form: $1/4\le {\mathcal{H}}^d(C)\le 1$, 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.

Hausdorff measure measures the geometric size of a set using covers by increasingly small pieces. The exponent $s$ chooses the measuring scale: $s=1$ is length-like, $s=2$ is area-like, and noninteger exponents can measure fractals. Unlike a count of occupied grid cells, the construction allows pieces of different sizes and considers every admissible cover.

For $s>0$ and a subset $E$ of a metric space, use the diameter-cost conventionThe first quantity is scale-restricted Hausdorff content. Shrinking $\delta$ removes options from the infimum, so these contents increase to a limit, possibly infinite. The resulting outer measure restricts to a measure on the Borel sets. For $s=0$, counting each nonempty covering piece with cost one gives counting measure.

A different common convention multiplies these quantities by $c_s={\pi }^{s/2}/(2^s\Gamma (1+s/2))$, using the Gamma function. At integer $s$, that normalization agrees with ordinary Euclidean $s$-dimensional volume. Here $c_1=1$, so both conventions make ${\mathcal{H}}^1$ agree with arc length on smooth curves in Euclidean space. Positive normalization constants never change Hausdorff dimension. A definition must specify this constant when numerical values of Hausdorff measure matter.

For a line segment of length $L$, splitting it into $n$ equal pieces gives the cover costIt tends to zero for $s>1$, stays at $L$ for $s=1$, and grows for $s<1$. The matching lower bound comes from the fact that any interval cover must have total length at least $L$. The exponent one is therefore the transition between a measuring rule too coarse to see the segment and one that assigns it infinite size. For a Cantor set, the transition is instead at $\log 2/\log 3$, as shown in Hausdorff dimension of the Cantor set.

This makes Hausdorff measure useful when ordinary Lebesgue measure sees too little: a curve in the plane has zero planar area but can have positive arc length, and the Cantor set has zero line length but positive geometric size at its own dimension. It also separates local covering estimates from global cardinality: a countable dense set has zero Hausdorff dimension, despite meeting every open region of its closure.

An original source for the construction is Felix Hausdorff's ^[ref]. The modern covering and Hausdorff dimension framework is developed in Bishop and Peres, Fractals in Probability and Analysis, §1.2.

A Lebesgue null set has zero Lebesgue measure. Since Lebesgue measure is complete, every subset of one is also measurable and null. The Cantor set is an uncountable example with positive Hausdorff dimension; the rational numbers form a countable, dense example with Hausdorff dimension zero. Being null does not imply being empty or having finitely many points.

The mass distribution principle converts a diffuse measure into a lower bound on Hausdorff dimension. Let $s>0$ and let a Borel probability measure $\mu$ give a Borel set $E$ full mass. If, for some $C,r_0>0$, every ball centered in $E$ satisfiesthen ${\mathcal{H}}^s(E)\ge 1/C>0$ in the diameter-cost convention, and consequently ${\dim }_{H}E\ge s$.

The idea is to keep unit mass from being crowded into cheap covering pieces. For a piece $U$ of positive diameter $r$ meeting $E$, choose $x\in U\cap E$. A ball of radius $r+\epsilon$ contains $U$; letting $\epsilon \downarrow 0$ gives ${\mu }^{\ast }(U)\le C{r}^s$, where ${\mu }^{\ast }$ is the associated outer measure. Zero-diameter pieces have zero mass by the same estimate. For any sufficiently small cover,Thus every cover costs at least $1/C$. This is the lower-bound counterpart to the explicit covers in scale-restricted Hausdorff content. The Cantor distribution supplies the needed mass in Hausdorff dimension of the Cantor set. ^[ref].

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 $1/4$. The open diamond $\{|x-1/2|+|y|<1/2\}$ is an open set condition witness: its eight image diamonds have disjoint interiors and lie within it. Hence $8(1/4{)}^s=1$, giving Hausdorff dimension $3/2$. Treating the middle run as a single similarity of ratio $1/2$ instead defines a different iterated scheme.

A finite family of contracting similarities $S_1,\dots ,S_k$ satisfies the open set condition if there is a nonempty bounded open set $O$ with $S_i(O)\subseteq O$ and $S_i(O)\cap S_j(O)=\varnothing$ for $i\ne j$. This permits the closures to meet. For the invariant compact set, this separation makes its Hausdorff dimension equal to the similarity exponent $s$ defined by ${\sum }_i{c}_i^s=1$, where $c_i$ are the contraction ratios. The level-$n$ cylinder sets supply the upper dimension bound; the separated cylinder masses with weights $c_i^s$ supply the matching mass-distribution lower bound. For the 24 maps of ratio $1/5$ retaining all but the central square, $O=(0,1{)}^2$ works and $s=\log 24/\log 5$.

For $s\ge 0$ and $\delta >0$, define the scale-restricted Hausdorff content at scale $\delta$ byusing countable covers. The Hausdorff measure is ${\mathcal{H}}^s(F)={\lim }_{\delta \downarrow 0}{\mathcal{H}}_{\delta }^s(F)$; the limit exists by monotonicity. A conventional dimension-dependent normalizing constant does not change the Hausdorff dimensionAt $s=0$, a nonempty singleton has contribution one, so the measure counts points.

Let $\mathcal{T}(K)={\bigcup }_{i=1}^k{S}_i(K)$ and $c={\max }_i{c}_i<1$. For compact nonempty $K,L$, matching a point of $S_i(K)$ with the image of a nearby point of $L$ gives $d_H(\mathcal{T}K,\mathcal{T}L)\le c{d}_H(K,L)$. Choose a sufficiently large closed ball $B$ with every $S_i(B)\subset B$. The nonempty compact sets ${\mathcal{T}}^m(B)$ are nested, so their intersection $I$ 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 $\mathcal{T}(I)=I$. If $J$ is another invariant compact set, the contraction estimate gives $d_H(I,J)\le c{d}_H(I,J)$, hence $I=J$. 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 $O$ such that the $S_i(O)$ lie inside $O$ 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 $1/4$, with rotation matching its direction. The open diamond $O=\{|x-1/2|+|y|<1/2\}$ is an explicit witness for the open set condition. Its eight image diamonds have radius $1/8$ in the ${\ell }^1$ metric, lie in $O$, and their centres have pairwise ${\ell }^1$ distance at least $1/4$; 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 $1/2$, there would be six maps of ratio $1/4$ and one of ratio $1/2$. The same diamond separation works, but the equation becomes $64^{-s}+2^{-s}=1$, giving $s={\log }_{2}3$, a different fractal. The requested $3/2$ corresponds to the eight-unit-step interpretation.

Suppose a connected subset $C\subset F$ contains distinct points $a,b$. The distance function $x\mapsto |x-a|$ is $1$-Lipschitz, and its image on $C$ is connected and contains $0$ and $|b-a|$. It therefore contains the whole interval between those values. A Lipschitz map cannot increase Hausdorff dimension: taking images of arbitrarily fine covers multiplies their diameter powers by at most a fixed constant. Since a nondegenerate interval has Hausdorff dimension one, ${\dim }_{H}C\ge 1$, contradicting ${\dim }_{H}F<1$. Thus every connected subset is a singleton, so $F$ is totally disconnected.

A Möbius transformation pairs two disks when it maps their boundary circles to one another and takes the exterior of the first disk onto the interior of the second. Two pairs of disks with disjoint interiors give the ping-pong lemma construction of a free two-generator group. Tangencies are allowed in the convention suggested by the question; this is often called a Tangent-disk Schottky group, rather than a strictly separated Schottky group.

Here is a concrete configuration that also makes the dimension argument precise. Take $A(z)=z+2$ and $B(z)=z/(iz+1)$. The first pairs the half-plane disks $\Re z<-1$ and $\Re z>1$, which are disks on the sphere tangent at infinity. The second pairs $|z-i|<1$ and $|z+i|<1$, tangent at zero; their interiors are also disjoint from the half-plane disks. These pairings give a free discrete Kleinian group by ping-pong lemma, with a nonempty open fundamental region.

Set $C=AB{A}^{-1}{B}^{-1}$. Conjugating the subgroup generated by $B,C$ by $M(z)=iz/(2-z)$ gives matricesThe product of the second matrix with the first is $\left(\begin{array}{cc}1& 2\\ 0& 1\end{array}\right)$. These are the standard parabolic generators of the principal level-two modular group, whose ideal-quadrilateral fundamental region tiles the upper half-plane and whose Kleinian limit set is the entire extended real line. Consequently the original group's Kleinian limit set contains the circle $|z-1|=1$, as well as its image under $A$, the distinct tangent circle $|z-3|=1$.

It follows that the limit set has Hausdorff dimension at least one and is not homeomorphic to a circle. Indeed a proper subset of a circle cannot itself be a circle: after deleting a missing point it lies in a line, which cannot contain an embedded circle. A space containing two distinct complete circles thus cannot be homeomorphic to a single circle. This explains why dimension at least one does not force circle topology. The tangent-circle terminology is consistent with the primary discussion of T-Schottky configurations in arxiv.org/pdf/math/0701572 .

Under the open set condition there is a nonempty bounded open set $O$ such that the sets $S_i(O)$ are pairwise disjoint and all contained in $O$. The Hausdorff dimension of the nonempty compact invariant set is the unique $s\ge 0$ satisfyingFor the carpet here the 24 retained sub-squares give Euclidean similarities $S_{ij}(x,y)=((x+i)/5,(y+j)/5)$ for $0\le i,j\le 4$, $(i,j)\ne (2,2)$. Their images of $O=(0,1{)}^2$ are disjoint and lie in $O$, so the condition holds even though some closed images share boundary points. All contraction factors are $1/5$. Thus

Using the diameter normalization, define ${\mathcal{H}}_{\delta }^d(E)=\inf \{{\sum }_j(\mathrm{diam}{U}_j{)}^d:E\subseteq {\bigcup }_j{U}_j,\mathrm{diam}{U}_j\le \delta \}$ and the Hausdorff measure ${\mathcal{H}}^d(E)={\lim }_{\delta \downarrow 0}{\mathcal{H}}_{\delta }^d(E)$. The Hausdorff dimension is $\inf \{d:{\mathcal{H}}^d(E)=0\}$, equivalently $\sup \{d:{\mathcal{H}}^d(E)=\infty \}$.

The Cantor set is the intersection of the sets left by successively removing open middle thirds from $[0,1]$. At level $k$ it has $2^k$ Cantor cylinders of diameter $3^{-k}$. For $s=\log 2/\log 3$, their total $s$-cost is $2^k{3}^{-ks}=1$, so ${\mathcal{H}}^s(C)\le 1$.

The random series $\xi ={\sum }_{n\ge 1}{X}_n{3}^{-n}$ converges absolutely, and its ternary digits are all zero or two. Thus $\xi \in C$ and its law is the Cantor Bernoulli measure. Each level-$k$ cylinder has probability $2^{-k}$. Distinct such intervals have separation at least $3^{-k}$; a set $U$ of smaller diameter meets at most one. If $3^{-(k+1)}\le \mathrm{diam}U<3^{-k}$, thenSets of diameter zero have probability zero, since the measure has no measure atoms; diameters at least one give the bound trivially. For arbitrary nonmeasurable sets use outer probability. Any countable cover of $C$ therefore satisfies $1\le {\sum }_j{\mathbb{P}}^{\ast }(\xi \in U_j)\le 2{\sum }_j(\mathrm{diam}{U}_j{)}^s$. HenceThe last implication follows by multiplying the $s$-costs by powers of the cover diameter: measures above $s$ vanish and those below $s$ are infinite.