Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Hausdorff Measure and Hausdorff Dimension

1 · Prerequisites

2 · Summary

Diameter-power covers lead to Hausdorff measure, its critical dimension, Lipschitz comparisons, Euclidean volume comparison, and exact Cantor and digit-set computations. All exponents are finite and nonnegative; covers have nonempty members and may be empty only for the empty set. Countable Choice is assumed for the measure-theoretic results. The exact higher-dimensional normalising factor is recorded separately without a local proof.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Extended diameter for Hausdorff covers

Definition

For a metric space (X,d) extend the diameter of Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space to every subset AX by

diamA={0A=,sup{d(x,y):x,yA}A and A bounded,+A unbounded.

The bounded nonempty branch is the existing real diameter; the infinite value belongs to The extended real line R=R{,+}, its order, and the arithmetic that is left undefined. A nonempty set has diameter zero exactly when it is a singleton: all its pairwise distances must be zero. No value of a point-to-empty-set distance is introduced.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Hausdorff content at a prescribed scale

Definition

Let (X,d) be a metric space, AX, s[0,) a finite real, and 0<δ. A cover is a finite or countably infinite family (Uj) of nonempty arbitrary subsets of X, with AjUj and diamUjδ. The empty family is permitted, and covers precisely the empty set. Define

Hδs(A)=inf{j(diamUj)s:(Uj) is such a cover}.

Use Extended diameter for Hausdorff covers and the nonnegative extended sums of Series in the nonnegative extended real line. For this covering cost only, define r0=1 for every r[0,], including 0 and ; for s>0, use Real powers for positive bases, with the zero-base positive-exponent convention at finite bases and set s=. Thus a nonempty singleton costs one when s=0, and zero when s>0. Finite covers are not padded with empty sets.

The infimum is in [0,], with inf= when there is no admissible cover; existence follows from Every subset of R has a least upper bound and a greatest lower bound in R, agreeing with the real supremum and infimum on nonempty sets bounded in R. The empty sum is zero. The value Hs is called Hausdorff content; Hδs for finite δ is the scale approximation.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The small-scale Hausdorff limit exists

Statement

For ABX and 0<ηδ,

Hδs(A)Hδs(B),Hδs(A)Hηs(A).

For every metric space, every subset A, and every finite s0,

sup0<δ<Hδs(A)=limkH2ks(A)[0,].

No separability or existence of a countable small-scale cover is assumed.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

The scale value is the infimum of admissible covering costs, with empty infimum . Hausdorff content at a prescribed scale

Proof

1.1

Every cover of B covers A, and every η-cover is a δ-cover. Infima over the larger families are smaller, including when a family is empty.

F1
2.1

The dyadic values form a nondecreasing nonnegative sequence. Its supremum M exists; if finite, the definition of supremum gives eventual values above Mε, and if infinite, eventual values above every real bound. Thus the sequence has extended limit M.

F2step 1.1
3.1

For each δ>0 there is k with 2kδ, so Hδs(A)M. Conversely every dyadic value occurs among the scale values. Their suprema agree. For A= all values are zero; no part divided by s, so s=0 is included.

F1step 1.1step 2.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Unnormalised Hausdorff measure

Definition

For every subset A of a metric space and finite real s0, define the unnormalised Hausdorff measure by

Hs(A)=sup0<δ<Hδs(A)=limkH2ks(A).

The scale functions use Hausdorff content at a prescribed scale and the limit exists by The small-scale Hausdorff limit exists. The name here initially denotes a set function on all subsets. Its outer-measure axioms and the measure on its Carathéodory measurable domain are established below; no measurability of an arbitrary subset is built into the notation. No volume normalising factor is inserted.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Hausdorff measure is an outer measure

Statement

Assume the Axiom of Countable Choice. For any metric space and finite s0, each Hδs, 0<δ, is an outer measure. So is Hs: it vanishes at , is monotone, and satisfies

Hs(j0Aj)j0Hs(Aj).

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Hs is the supremum of the finite-scale covering infima. Unnormalised Hausdorff measure

[F2]

An outer measure vanishes at the empty set, is monotone, and is countably subadditive on all subsets. Outer measures

[F3]

Countable Choice selects one member from each nonempty set in a countable family. The Axiom of Countable Choice (ACω)

[F4]

Nonnegative extended sums are suprema of finite partial sums. Series in the nonnegative extended real line

Proof

1.1

The empty cover has cost zero at every scale; a cover of a larger set covers each subset. Hence both functions vanish at the empty set and are monotone. This uses no positive-exponent assumption.

F1
1.2

Fix δ and (Aj). If jHδs(Aj)=, subadditivity is automatic. Otherwise, for ε>0 select for each j a cover with cost at most Hδs(Aj)+ε2j1; select an enumerated cover, so the resulting double family is countable. Empty Aj may use the empty family.

F3F1
2.1

Flatten these covers along an enumeration of the pairs of indices. Every finite subfamily cost is bounded by the corresponding iterated sum, and every finite rectangle is eventually included; thus the nonnegative sums agree. The union has scale cost at most jHδs(Aj)+ε. Letting ε decrease to zero proves the fixed-scale assertion.

F4step 1.2
3.1

For finite δ, the same inequality is at most jHs(Aj). This bound is independent of δ; taking the supremum proves the claimed inequality, including infinite right sides. Together with the first step these are all the outer-measure axioms.

F1F2step 1.1step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Hausdorff measure is metric and measures every Borel set

Statement

Assume the Axiom of Countable Choice. On every metric space, Hs is a metric outer measure for each finite s0. In particular, if nonempty A,B have d(A,B)>0,

Hs(AB)=Hs(A)+Hs(B).

The equality also holds if either set is empty. Every Borel set is Carathéodory measurable, and the restriction to the full Carathéodory sigma-algebra is a complete measure.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Hs is an outer measure under Countable Choice. Hausdorff measure is an outer measure

[F2]

A metric outer measure is additive on nonempty positively separated sets. Metric outer measures

[F3]

Every Borel subset of a metric space is Carathéodory measurable for every metric outer measure. Every Borel set is Carathéodory measurable for a metric outer measure

[F4]

The Carathéodory domain of an outer measure is a sigma-algebra and its restriction is complete. Carathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure

Proof

1.1

Let h=d(A,B)>0. A covering set of diameter at most δ<h cannot meet both A and B. Partition any cover of their union by which set it meets, discarding sets meeting neither. Its cost is at least Hδs(A)+Hδs(B); if no cover exists the inequality still holds.

given
2.1

Take small-scale suprema in that inequality. The supremum of the sums of the two nondecreasing scale values is the sum of their suprema: approximate both finite lower bounds at one common scale; this also proves the assertion when one supremum is infinite. Subadditivity gives the opposite inequality. Empty sets use the outer-measure zero axiom. Thus the metric condition holds, also at s=0.

F1F2step 1.1
3.1

The metric criterion gives Borel measurability, and the Carathéodory theorem gives completeness on the full measurable domain.

F3F4step 2.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Zero-dimensional Hausdorff measure is counting measure

Statement

Assume the Axiom of Countable Choice. For every subset A of a metric space, H0(A)=#A when A is finite and H0(A)= otherwise. Every subset is H0-measurable.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

At exponent zero every nonempty covering set costs one; the empty family costs zero. Hausdorff content at a prescribed scale

[F2]

The counting set function equals cardinality on finite sets and infinity on infinite sets. Counting measure on an arbitrary set

Proof

1.1

For a finite A of size N, its singleton cover costs N at every scale, including N=0. If N2, choose δ smaller than the minimum distance between distinct points; every cover then has at least N members. For N=1 any cover needs one member. Thus H0(A)=N.

F1
2.1

If A is infinite, for each positive integer N it contains an N-point subset. The preceding lower bound gives H0(A)N for every N, hence infinity. The formula is exactly the counting set function.

F2step 1.1
3.1

For any test set T and subset E, if T is finite its partition into TE and TE splits its cardinality. If T is infinite at least one piece is infinite, and both sides of the splitting identity are infinity. This is the Carathéodory criterion for every E.

step 1.1step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Hausdorff measure is Borel regular

Statement

Assume the Axiom of Countable Choice. For every subset A of a metric space and every finite s0 there is a Borel set GA with Hs(G)=Hs(A). Consequently

Hs(A)=inf{Hs(B):AB, B Borel},

so this is also the outer measure induced by the Borel restriction. In Euclidean spaces G may be chosen Gδ. This regularity assertion does not assert local finiteness.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under Countable Choice, Hausdorff measure is a metric outer measure and measures Borel sets. Hausdorff measure is metric and measures every Borel set

[F2]

Under the standing Countable Choice hypothesis, H0 counts finite sets and is infinite on infinite sets. Zero-dimensional Hausdorff measure is counting measure

[F3]

Countable Choice allows a sequence of choices from nonempty families. The Axiom of Countable Choice (ACω)

Proof

1.1

If Hs(A)=, take G=X. If A=, take G=. If s=0 and the measure is finite, A is finite, hence closed and Borel. In Euclidean space a finite set is a Gδ, by intersecting its open 1/k-neighbourhoods.

F1F2
1.2

In the remaining case s>0 and M=Hs(A)<, choose for each k1 a 2k-cover (Ukj) of cost at most M+2k. Replacing each set by its closure preserves diameter: approximate two closure points by original points and use the triangle inequality. Set G=kjUkj. This is Borel and contains A.

F3given
2.1

For fixed δ>0 and all sufficiently large k, the kth closed cover also covers G at scale δ. Hence Hδs(G)M+2k, so Hδs(G)M. Take the supremum over δ and use monotonicity to get equality. Infimising Borel-superset measures gives the displayed identity: every such value is at least Hs(A) and this G attains it.

F1step 1.2
3.1

For Euclidean X in the finite positive-exponent case, enlarge Ukj to the open neighbourhood Vkj={x:d(x,Ukj)<ηkj} with 0<ηkj<2k2 and (diamUkj+2ηkj)s(diamUkj)s+2kj1. Continuity of the positive power at every nonnegative finite base supplies these choices, including singleton sets. Then G=kjVkj is Gδ, each covering diameter is at most 21k, and each cost is at most M+21k. The same fixed-scale argument proves equality.

F3step 2.1
PropositionStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07Open item page →

Borel cores of sigma-finite Hausdorff measurable sets

Statement

Assume the Axiom of Countable Choice. Let E be Hs-measurable and sigma-finite, where s0 is finite. There are Borel sets EEE+ such that Hs(E+E)=0. If ERn has finite measure, it contains an Fσ set of equal measure; for every ε>0 it contains a closed set F with Hs(EF)<ε.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Every set has an equal-measure Borel hull; in Euclidean space it has an equal-measure Gδ hull, under Countable Choice. Hausdorff measure is Borel regular

[F2]

Measures are continuous from below on increasing sequences of measurable sets, without a finiteness hypothesis. Continuity from below for measures

Proof

1.1

First suppose Hs(E)<. Choose a Borel hull B of E. Measurability of E gives Hs(B)=Hs(E)+Hs(BE), hence BE is null. Choose a null Borel hull N of that difference; then BNEB is the required sandwich. This also covers empty or null E.

F1
1.2

For the Euclidean assertion take G=i1OiE, with Oi open and Hs(GE)=0. Each Oi has an increasing closed exhaustion: if its complement is nonempty, use Fij={x:xj, d(x,Oic)1/j}; for Oi=Rn use the closed balls. Continuity of the distance function follows from its triangle-inequality Lipschitz bound. These sets exhaust Oi.

F1
2.1

For sigma-finite E, write E=jEj with measurable finite-measure Ej and apply the first step to each. The unions of the lower and upper hulls are Borel, and their difference is contained in the union of the null differences. Thus it is null. Only the finite pieces required subtraction; this includes infinite E.

F1step 1.1
2.2

Fix ε>0. Continuity from below on EFij, with Hs(E)<, gives ji such that Hs(EFiji)<ε2i. The closed set F=iFiji lies in G and loses less than ε of E. Its excess FE is null. Take a null Gδ hull N of that excess. Then FN is Fσ, lies in E, and loses less than ε of E.

F1F2step 1.2
3.1

Apply this for ε=1/k and take the union of the resulting Fσ sets; it is an Fσ subset H of E with Hs(EH)=0. Express H as an increasing union of closed sets (replace any closed sequence by its finite unions). Continuity from below now gives a closed subset of E with deficit less than any prescribed positive number. The argument applies to s=0 as well; in that case finite-measure E is finite.

F2step 2.2
PropositionStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07Open item page →

Content and measure have the same null sets

Statement

For a subset A of any metric space and finite s0,

Hs(A)=0(δ(0,)) Hδs(A)=0Hs(A)=0.

This is equality of null-set classes, not equality of the set functions.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Hs is the supremum of finite-scale contents, each at least the unrestricted content. Unnormalised Hausdorff measure

Proof

1.1

Suppose s>0 and Hs(A)=0. Given finite δ>0 and ε>0, take a cover with cost less than min(ε,δs). Each diameter is strictly below δ, so Hδs(A)<ε. Therefore every scale value is zero.

F1
1.2

When s=0, any nonempty member costs one. Content less than one forces the empty family, hence A=. All its scale values are zero. This deals with empty and singleton possibilities without division by the exponent.

F1
2.1

If all finite-scale values vanish their supremum vanishes. Conversely, a zero supremum forces all those nonnegative values, and then the smaller unrestricted content, to vanish. These implications complete both equivalences.

F1step 1.1step 1.2
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Lipschitz maps control Hausdorff measure

Statement

Assume the Axiom of Countable Choice. Let f:DXY be an L-Lipschitz map between metric spaces and AD. For finite s0 and L>0,

Hs(f(A))LsHs(A).

If L=0, the image is empty or a singleton: Hs(f(A))=0 for s>0 and H0(f(A))H0(A). No product 0 is used.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Hausdorff outer values come from arbitrary nonempty covers and small-scale suprema. Unnormalised Hausdorff measure

[F2]

Under the standing Countable Choice hypothesis, H0 is counting measure. Zero-dimensional Hausdorff measure is counting measure

[F3]

L-Lipschitz means dY(f(x),f(y))LdX(x,y) for all points in the domain. Lipschitz map, α-Hölder map for rational 0<α1, and contraction

Proof

1.1

For L>0, replace every member U of a δ-cover of A by f(UD) and discard empty images. The image diameter is at most LdiamU. For positive s its cost is at most Ls times the old cost; for s=0 each retained member still costs one.

F1F3
2.1

Infimising gives HLδs(f(A))LsHδs(A); if the right scale infimum is infinite the inequality is automatic. Let δ tend to zero to obtain the assertion, since L is finite and positive.

F1step 1.1
3.1

For L=0, any two image points have distance zero, so a nonempty image is a singleton. Its singleton cover costs zero for s>0. For s=0, image cardinality cannot exceed domain cardinality, whether finite or infinite. Empty images have zero measure at every exponent.

F1F2F3
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Similarities scale Hausdorff measure exactly

Statement

Assume the Axiom of Countable Choice. If f:DXY satisfies dY(f(x),f(y))=cdX(x,y) for a finite constant c>0, then for every AD and finite s0,

Hs(f(A))=csHs(A).

This includes isometries and Euclidean translations and dilations. The Hausdorff outer value of a subset of a metric subspace equals its value computed in the ambient metric space.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, for a positive Lipschitz constant L, Hs(f(A))LsHs(A), including s=0. Lipschitz maps control Hausdorff measure

Proof

1.1

Since c>0, equality of images implies distance zero in D, so f is injective. Its inverse on f(D) is 1/c-Lipschitz. Apply the inequality to f and its inverse to obtain both bounds and hence equality; all scalar multipliers are positive, so infinite values cause no indeterminate product.

F1
2.1

An ambient cover can be intersected with the subspace and its empty members discarded, without increasing cost or diameter. Conversely every subspace cover is an ambient cover. Infima at each scale, and then their suprema, agree. The empty set and s=0 obey the same comparison. Taking c=1 gives isometries and translations; a Euclidean dilation by c>0 scales distances by c.

givenstep 1.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Increasing the exponent past finite measure gives zero

Statement

For 0s<t< and finite δ>0,

Hδt(A)δtsHδs(A).

Consequently Hs(A)< implies Ht(A)=0.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Hausdorff values are small-scale suprema of diameter-power covering costs. Unnormalised Hausdorff measure

[F2]

For positive bases the usual real-power multiplication laws hold. The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents

Proof

1.1

For 0<rδ, rt=rsrtsrsδts. At r=0 the left side is zero; the right is zero for s>0 and δt for s=0. Thus the inequality holds for every admissible covering member. Summation and infimisation prove the fixed-scale bound; if no cover exists its right side is infinity.

F1F2
2.1

If M=Hs(A)<, then Hδt(A)δtsM. Given any fixed η>0, use all 0<δη and monotonicity to bound Hηt(A) by a quantity tending to zero. Every scale value is therefore zero and so is the supremum. This includes M=0 and the empty set.

F1step 1.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Hausdorff dimension

Definition

For a subset A of a metric space define

dimHA=inf{s[0,):Hs(A)=0}[0,].

Here Hs is Unnormalised Hausdorff measure, s always denotes a finite real exponent, and inf=, in the extended order of Every subset of R has a least upper bound and a greatest lower bound in R, agreeing with the real supremum and infimum on nonempty sets bounded in R. Thus dimH=0. Dimension itself may be infinite, but no measure with exponent is being defined. Any empty supremum over exponents below is taken in [0,] and equals zero, not the empty supremum in the whole extended real line.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Hausdorff dimension is the unique critical exponent

Statement

Write d=dimHA. For finite exponents s0,

s<d    Hs(A)=,s>d    Hs(A)=0.

Moreover

d=inf{s0:Hs(A)<}=sup{s0:Hs(A)=},

where all tested exponents are finite, inf= and the supremum is in [0,], so sup=0. If 0<Hs(A)<, then d=s. The ray assertions impose no value at a finite critical exponent itself.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Dimension is the infimum of the zero-measure exponents with empty infimum infinity. Hausdorff dimension

[F2]

Finite measure at an exponent forces zero measure at every larger finite exponent. Increasing the exponent past finite measure gives zero

Proof

1.1

If s<d and Hs(A) were finite, choose a finite t strictly between s and d (also possible for d=). Then Ht(A)=0, contrary to d being the infimum of the zero exponents. Hence Hs(A)=.

F1F2
1.2

If d<s<, the zero-exponent set is nonempty and contains u<s by its infimum property. Exponent comparison gives Hs(A)=0. Thus when d=0 all positive exponents vanish, and when d= every finite exponent has infinite measure.

F1F2
2.1

The first two steps place every finite-measure exponent at least d, and every exponent strictly greater than finite d among the finite-measure exponents. Their infimum is d, also when the set is empty. Similarly the infinite-measure exponents lie at most d and contain every nonnegative exponent strictly below d. Their supremum is d; for d=0 it is zero whether that set is empty or consists of zero. Finite positive measure at s excludes s<d and s>d, hence forces equality. Empty A has d=0 and no infinite-measure exponent.

step 1.1step 1.2F1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Hausdorff dimension is monotone and countably stable

Statement

Assume the Axiom of Countable Choice. For any countable family of subsets of a metric space,

dimH(k0Ak)=supk0dimHAk.

Inclusion implies monotonicity of dimension. Every at most countable set, including the empty set, has dimension zero.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Below the critical dimension the Hausdorff measure is infinite, and above it the measure is zero. Hausdorff dimension is the unique critical exponent

[F2]

Hausdorff outer measures are monotone and countably subadditive under Countable Choice. Hausdorff measure is an outer measure

Proof

1.1

If AB, every exponent with Hs(B)=0 also has Hs(A)=0. Infimising zero exponents gives dimHAdimHB, including empty zero-exponent sets. Thus the dimension of the union is at least D=supkdimHAk.

F2
2.1

If D= that lower bound is equality. If D<, for every t>D all Ht(Ak) vanish, so countable subadditivity makes their union null. Its dimension is at most every t>D, hence at most D. This includes D=0.

F1F2step 1.1
3.1

An at most countable set has a cover by its singletons, whose total cost is zero for each t>0. The empty set has the empty cover. Thus their dimensions are zero; one point and every finite set are included.

given
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Lipschitz monotonicity and bi-Lipschitz invariance of dimension

Statement

Assume the Axiom of Countable Choice. A Lipschitz map f:DXY satisfies dimHf(A)dimHA for every AD. If f is a bijection from D onto f(D) and there exist 0<ab< with

adX(x,y)dY(f(x),f(y))bdX(x,y)(x,yD),

then dimHf(A)=dimHA (bi-Lipschitz invariance).

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, positive Lipschitz constants transfer each zero Hausdorff measure to zero; a zero-Lipschitz image is empty or a singleton. Lipschitz maps control Hausdorff measure

[F2]

Every exponent strictly above finite dimension has zero Hausdorff measure. Hausdorff dimension is the unique critical exponent

Proof

1.1

For a positive Lipschitz constant and finite d=dimHA, every t>d has Ht(f(A))=0, so dimHf(A)d. For d= the inequality is automatic. A constant map has empty or singleton image, with dimension zero from its singleton covers, so its case also holds.

F1F2
2.1

The two-sided bounds make f Lipschitz with constant b and its inverse on f(D) Lipschitz with constant 1/a. Apply the first step in both directions. Empty sets and the value zero are allowed throughout.

step 1.1given
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Elementary lower and upper bounds on a unit cube

Statement

Assume the Axiom of Countable Choice. For every integer n1 and ARn in the Euclidean metric,

λn(A)Hn(A),1Hn((0,1]n)nn/2.

Only coordinate boxes, not the isodiametric inequality, are needed.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Hausdorff measure is the supremum of diameter-power covering infima. Unnormalised Hausdorff measure

[F2]

Under Countable Choice Lebesgue outer measure is countably subadditive and agrees with elementary volume. Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume

[F3]

Under the standing Countable Choice hypothesis, a finite coordinate box of any endpoint convention has measure the product of its side lengths, including zero side lengths. A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included

Proof

1.1

If a nonempty bounded U has diameter r, its ith coordinate ranges between an infimum ai and supremum bi with biair. Hence Ui[ai,bi] and λn(U)i(biai)rn. If r=0 this is a zero-volume singleton box.

F2F3
2.1

For every finite-scale cover of A, countable subadditivity gives λn(A)j(diamUj)n. Infimising and then taking the small-scale supremum gives the lower bound; absent covers give the same inequality with infinity on the right. The empty set has both values zero.

F1F2step 1.1
3.1

Partition (0,1]n into mn half-open cubes of side 1/m. Each has diameter n/m (the supremum of corner distances), so the total cost is mn(n/m)n=nn/2. Choose m large for any prescribed positive scale. Thus the upper bound holds, while the lower bound is the unit box volume one. For n=1 both bounds equal one.

F1F3F4step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

One-dimensional Hausdorff measure on the line is Lebesgue outer measure

Statement

Assume the Axiom of Countable Choice. For every AR,

H1(A)=λ1(A).

Consequently their Carathéodory measurable domains and completed measures agree.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, for every subset of the line, λ1(A)H1(A). Elementary lower and upper bounds on a unit cube

[F2]

Lebesgue outer measure is the infimum of total elementary volumes of countable elementary-set covers. Lebesgue outer measure on Rn

[F3]

Hausdorff measure is the supremum of scale covering costs. Unnormalised Hausdorff measure

Proof

1.1

Only the reverse inequality needs proof. If λ1(A)=, the lower inequality already gives equality. Otherwise choose an elementary-set cover of total volume less than λ1(A)+ε. Each finite-volume elementary set is a finite disjoint union of bounded half-open intervals; zero-volume empty pieces can be discarded. This is the elementary algebra and its volume appearing in the defining infimum.

F1F2
2.1

Fix δ>0. Subdivide each such interval into finitely many half-open intervals of lengths at most δ, without changing the sum of lengths. Flatten the resulting countable family. It is an admissible Hausdorff cover of cost at most λ1(A)+ε. Hence Hδ1(A)λ1(A) after letting ε decrease to zero. Taking the supremum over δ proves equality. For empty A use the empty cover.

F2F3step 1.1
3.1

For every test set T the two outer values in the Carathéodory splitting identity are identical. Thus a set satisfies that identity for one outer measure if and only if it does for the other, and the restricted values agree. Both restrictions are their complete Carathéodory measures.

step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Euclidean Hausdorff measure is proportional to Lebesgue measure

Statement

Assume the Axiom of Countable Choice. For each integer n1 there is a finite cn[1,nn/2] such that

Hn(B)=cnλn(B)(B Borel),Hn(A)=cnλn(A)(ARn).

Here cn=Hn((0,1]n) and c1=1. For n2 no exact identification of cn is proved here.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, the Hausdorff measure of (0,1]n lies between one and nn/2. Elementary lower and upper bounds on a unit cube

[F2]

Under the standing Countable Choice hypothesis, isometries, including translations, preserve Hausdorff outer measure. Similarities scale Hausdorff measure exactly

[F3]

Under the standing Countable Choice hypothesis, hausdorff outer measure restricts to a measure on the Borel sets. Hausdorff measure is metric and measures every Borel set

[F4]

Under the standing Countable Choice hypothesis, every set has an equal-Hausdorff-measure Borel hull. Hausdorff measure is Borel regular

[F5]

Under Countable Choice, a translation-invariant Borel measure on Rn giving (0,1]n value one equals Lebesgue measure on Borel sets. A translation-invariant measure on the Borel sets of Rn giving the unit cube measure one is the restriction of Lebesgue measure

[F6]

Under Countable Choice, every subset of Rn has a Borel (indeed Gδ) superset of equal Lebesgue outer measure. Every subset of Rn has a Gδ measurable hull of the same outer measure

[F7]

Under the standing Countable Choice hypothesis, on the line H1=λ1 on all subsets. One-dimensional Hausdorff measure on the line is Lebesgue outer measure

Proof

1.1

Set cn=Hn((0,1]n), which is finite and positive. The Borel function ν(B)=cn1Hn(B) is a measure, since multiplication by a fixed positive scalar preserves nonnegative sums.

F1F3
2.1

Translations preserve ν and ν((0,1]n)=1. The uniqueness theorem therefore gives ν(B)=λn(B) for every Borel B. Its hypotheses include Countable Choice, the Borel domain, and precisely the half-open normalising cube used here.

F2F5step 1.1
3.1

For arbitrary A, take its Hausdorff Borel hull G. Then cnλn(A)cnλn(G)=Hn(A). Take instead a Lebesgue Borel hull H; then Hn(A)Hn(H)=cnλn(A). Both inequalities remain valid for infinite values, and the empty set has zero value.

F4F6step 2.1
4.1

The line equality gives c1=1 by evaluation on (0,1]. The higher-dimensional proof used only the finite positive cube bounds, so it has established no sharper constant.

F7step 1.1
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Euclidean space and positive-volume sets have their Euclidean dimension

Statement

Assume the Axiom of Countable Choice. For each integer n1, dimHRn=n and every subset of Rn has dimension at most n. Every ARn with λn(A)>0 has dimension n.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, Hn(A)=cnλn(A) for all subsets, with 0<cn<. Euclidean Hausdorff measure is proportional to Lebesgue measure

[F2]

Under the standing Countable Choice hypothesis, dimension is monotone and countably stable. Hausdorff dimension is monotone and countably stable

[F3]

Finite positive measure at exponent n gives dimension n; positive measure at n rules out dimension below n. Hausdorff dimension is the unique critical exponent

Proof

1.1

Every nondegenerate bounded cube has finite positive Lebesgue volume, hence finite positive Hn and dimension n. Countably many such cubes cover Rn, so its dimension is n by countable stability.

F1F2F3
2.1

Monotonicity bounds every subset above by n, including the empty set. If its Lebesgue outer measure is positive, its Hn is positive, possibly infinite, and the critical-exponent theorem bounds its dimension below by n. Thus equality holds. The statements include n=1.

F1F2F3step 1.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The mass distribution principle

Statement

Assume the Axiom of Countable Choice. Let μ be a finite Borel measure on a metric space X and define

μ(E)=inf{μ(B):EB, B Borel}.

Let AX have μ(A)>0, and let s0 be finite. If C>0 and r0>0 satisfy μ(U)C(diamU)s for every nonempty U of diameter less than r0, then

Hs(A)μ(A)/C>0,dimHAs.

For Borel A, μ(A)=μ(A). A bound μ(B(x,r))Crs for every open ball with 0<r<r0 implies the same diameter bound (with the same C) for sets of diameter less than r0. At exponent zero the nonempty-set cost is one.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Hausdorff scale values infimise arbitrary-set covering costs. Unnormalised Hausdorff measure

[F2]

Positive Hs(A) implies dimHAs. Hausdorff dimension is the unique critical exponent

[F3]

Outer measures are monotone and countably subadditive on arbitrary subsets. Outer measures

[F4]

A Borel measure is countably additive on disjoint Borel sets and vanishes at the empty set. Measures on sigma-algebras

Proof

1.1

The function μ vanishes on the empty set, is monotone, and agrees with μ on Borel sets: inclusion gives the lower inequality, while the set itself is a candidate hull. It is countably subadditive: for finite jμ(Ej) choose Borel supersets Bj of costs at most μ(Ej)+ε2j1 and use μ(jBj)jμ(Bj). The latter follows by disjointifying the Borel sets and applying countable additivity. Infinite right sides are automatic. Let ε decrease to zero. Thus it is an outer measure.

F3F4
2.1

Fix 0<δ<r0 and any admissible cover (Uj) of A. Subadditivity and the assumed bound give μ(A)jμ(Uj)Cj(diamUj)s. Infimising gives Hδs(A)μ(A)/C, even if no cover exists. Taking the supremum and using the critical-exponent criterion proves both conclusions; at s=0 the dimension bound is the automatic nonnegativity.

F1F2step 1.1
3.1

For the ball hypothesis, fix a nonempty U of diameter d<r0 and one xU. For every d<r<r0, UB(x,r), so μ(U)Crs. Let r decrease to d. If d=0 and s>0 the bound is zero; if s=0 it is C, as required by the covering-cost convention. This proves the sufficient ball condition without evaluating μ on a non-Borel set.

step 1.1given
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Cantor basic intervals have their expected masses

Statement

Assume the Axiom of Countable Choice. For the middle-thirds Cantor set, a level-m basic interval is

Ib=[j=1m2bj3j, j=1m2bj3j+3m],bj{0,1}.

Every such interval has Cantor measure μc(Ib)=2m, including m=0, where the interval is [0,1].

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, the Cantor measure is the Lebesgue–Stieltjes measure of the Cantor function extended by zero to the left and one to the right. The Cantor measure

[F2]

The Cantor measure is atomless, is a probability, and is concentrated on C, under Countable Choice. The Cantor measure is a singular atomless probability measure concentrated on the Cantor set

[F4]

Under the standing Countable Choice hypothesis, for continuous distribution functions the interval formula gives μF([a,b])=F(b)F(a), and μF({a})=F(a)F(a). Interval formulas and atoms for a Lebesgue-Stieltjes measure

Proof

1.1

The left endpoint has digits 2b1,,2bm followed by zeros; the right endpoint has that same prefix followed by twos, since j>m23j=3m. Their Cantor-function values are respectively q=j=1mbj2j and q+j>m2j=q+2m.

F3F5
2.1

The distribution-function interval formula and absence of endpoint atoms give μc(Ib)=(q+2m)q=2m. This also applies at the endpoints zero and one of the extended distribution function; for m=0 it agrees with probability mass one.

F1F2F4step 1.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The sharp interval bound for Cantor measure

Statement

Assume the Axiom of Countable Choice. Set s=log2/log3. For every interval IR,

μc(I)(diamI)s.

In particular, for every nonempty bounded UR, its induced Cantor outer measure satisfies μc(U)(diamU)s.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, every level-m basic Cantor interval has mass 2m. Cantor basic intervals have their expected masses

[F2]

For αR, positive-base powers are differentiable with derivative αxα1. Continuity and derivatives of positive-base real powers

[F3]

Measures are continuous from below on increasing measurable sequences. Continuity from below for measures

[F4]

Under the standing Countable Choice hypothesis, μc is an atomless probability concentrated on C. The Cantor measure is a singular atomless probability measure concentrated on the Cantor set

Proof

1.1

Here 0<s<1 and 3s=2. For a,b,c0 with a,cb, one has as+cs(a+b+c)s. Indeed the function (x+y)sxs is nonincreasing in x>0 for fixed y0, by its derivative; continuity extends this to x=0. Increasing a to b and then c to b can only decrease (a+b+c)sascs, whose final value is bs(3s2)=0. If b=0 all three numbers are zero.

F2
1.2

Fix m. For each basic interval J at a level m and each interval I, let NJ(I) count the level-m basic descendants contained in IJ. We prove 2mNJ(I)diam(IJ)s by induction upwards from level m. At that level the count is zero or one; a count of one forces diameter at least 3m and hence the desired bound. Empty intersections have count and diameter zero.

given
2.1

For an earlier J, its two children have length b and are separated by a gap of length b. If I meets neither child the count is zero. If I meets only one child, use its inductive bound and diameter monotonicity. If it meets both, put a=diam(IJleft) and c=diam(IJright). Then a,cb and diam(IJ)a+b+c. Adding the two inductive bounds and using the first step proves the claim for J. Thus for J=[0,1] the total number Nm(I) of level-m intervals contained in I satisfies 2mNm(I)diam(I)s.

step 1.1step 1.2
3.1

For a bounded open interval I, let Em be the union of all level-m basic intervals wholly contained in I. These sets need not increase as subsets of the line, but EmC do increase: each point of C lies in a child of its previous interval. Their union is CI because basic diameters tend to zero. They have measure 2mNm(I) by disjointness, concentration and cylinder masses. Continuity from below therefore gives μc(I)diam(I)s.

F1F3F4step 2.1
4.1

Other bounded interval endpoint conventions change at most two points, which have zero mass, so the same bound holds. A singleton has mass zero, and an empty interval has mass zero; an unbounded interval has infinite diameter and the inequality is immediate. Finally a nonempty bounded U lies in [infU,supU], whose length is exactly its diameter. This Borel superset bounds μc(U) as claimed.

F4step 3.1
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-07Open item page →

The Cantor set has dimension log 2 / log 3 and critical measure one

Statement

Assume the Axiom of Countable Choice. For the middle-thirds Cantor set C and s=log2/log3,

Hs(C)=1,dimHC=s.

These values use the unnormalised diameter-power convention.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

Under the standing Countable Choice hypothesis, for the Cantor probability measure, every nonempty bounded set U has μc(U)(diamU)s at s=log2/log3. The sharp interval bound for Cantor measure

[F2]

Under the standing Countable Choice hypothesis, a finite Borel measure with outer mass on A positive and diameter bound C0rs gives Hs(A)μ(A)/C0. The mass distribution principle

[F3]

Finite positive Hausdorff measure at s forces dimension s. Hausdorff dimension is the unique critical exponent

[F5]

Positive real powers obey the multiplication and power-of-power laws. The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents

[F6]

Under the standing Countable Choice hypothesis, μc is a probability measure concentrated on C. The Cantor measure is a singular atomless probability measure concentrated on the Cantor set

[F7]

Under Countable Choice, μc=μFc, where the extended Cantor function Fc is nondecreasing and right-continuous on R. The Cantor measure

[F8]

Under Countable Choice, the Lebesgue–Stieltjes measure μF of a nondecreasing right-continuous real function F is a Borel measure on R. Assuming countable choice, a nondecreasing right-continuous function defines a Borel measure on R

Proof

1.1

The 2m length-3m basic intervals cover C and have total s-cost 2m(3m)s=1. At each positive scale take m sufficiently large. Thus Hs(C)1, including the level-zero cover at its own scale.

F4F5
2.1

The defining function in F7 satisfies F8, so μc is a Borel measure; F6 makes it finite with total mass one and μc(RC)=0. Every Borel superset B of C has μc(RB)=0 by monotonicity, hence μc(B)=1. Thus the Borel-hull outer measure in F2 satisfies μc(C)=1. F1 supplies its diameter bound with constant one, in particular for every nonempty set of diameter less than r0=1. F2 gives Hs(C)1. Together with step 1.1 this gives finite positive measure one, so F3 gives dimHC=s.

F1F2F3F6F7F8step 1.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Sets defined by permitted binary digit positions

Definition

Let N+={1,2,} and SN+. Define the binary digit restriction set

AS={k=1ak2k:ak{0,1}, ak=0 if kS},aS(n)=#(S{1,,n}).

Here n0 and aS(0)=0. The series is the positive-start-index series of Series, partial sums, convergence and the sum, divergence, and the tail series, convergent since its tails are bounded by the geometric tails of For r<1, k0rk=1/(1r), and for r1 the series diverges. In particular AS[0,1] and 0AS. The cardinality symbol uses Finite, countably infinite, countable, uncountable. Membership requires the existence of an allowed expansion; points with two binary expansions are retained if either expansion is allowed. No choice of a preferred expansion is part of this definition.

PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Digit-position density determines Hausdorff dimension

Statement

Assume the Axiom of Countable Choice. For every SN+, the set AS is compact and

dimHAS=lim infnaS(n)n.

If N+S is infinite, then H1(AS)=λ1(AS)=0. If both S and its complement are infinite, AS is uncountable. Finite S, including S=, gives a finite set of dimension zero.

Facts & Assumptions

Given: The objects, conventions, and hypotheses in the statement above.

[F1]

AS is the set of allowed binary sums with digits outside S fixed to zero; aS(n) counts the allowed positions through n. Sets defined by permitted binary digit positions

[F2]

Under the standing Countable Choice hypothesis, a finite Borel measure with positive outer mass and small-set diameter bound Crt proves dimension at least t. The mass distribution principle

[F3]

For finite nonnegative exponents, measure is infinite below the critical dimension and zero above it; finite positive measure identifies the critical exponent. Hausdorff dimension is the unique critical exponent

[F4]

Under the standing Countable Choice hypothesis, on the real line H1=λ1 on every subset. One-dimensional Hausdorff measure on the line is Lebesgue outer measure

[F5]

Under the standing Countable Choice hypothesis, intervals of any endpoint convention have Lebesgue measure their length. A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included

[F6]

A pointwise limit of measurable extended-real functions is measurable. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable

[F8]

A subset of the real line is compact if and only if it is closed and bounded. A subset of R is compact if and only if it is closed and bounded

Proof

1.1

For an allowed prefix b1,,bn, with positions starting at one, put p=knbk2k. The closed intervals [p,p+2n], one for each prefix, form a 2aS(n)-member cover Kn of AS, and Kn+1Kn[0,1]. Conversely, if xnKn, among the finitely branching allowed prefixes whose intervals contain x there is a branch: at each step take the first child with extensions of arbitrarily large depth, which exists because there are finitely many children. Its prefix sums tend to x since the tail bound is 2n. Thus AS=nKn is closed and bounded, hence compact. This retains both expansions at endpoints.

F1F7F8
2.1

Write d=lim infaS(n)/n. For any t>d, choose u with d<u<t. Infinitely many n have aS(n)<un; the corresponding covers have t-cost at most 2n(tu)0 and diameters 2n0. At each fixed scale these arbitrarily cheap covers prove Ht(AS)=0. Thus dimHASd. If S is finite then AS is finite, its singleton covers cost zero for positive exponents, and d=0; this includes the empty position set.

F1F3step 1.1
2.2

For infinite S list its elements increasingly as k1<k2<. On [0,1) put bj(u)=2ju22j1u and T(u)=j1bj(u)2kj. Each partial sum is a finite Borel step function, and convergence follows from the geometric tail. Hence T is Borel measurable. Set ν(B)=λ1({u[0,1):T(u)B}) for Borel B. Borel preimages preserve disjoint unions, so countable additivity follows directly from that of Lebesgue measure. This is a probability with ν(AS)=1.

F5F6F7step 1.1
2.3

The level-n cover has total length 2aS(n)n. An infinite complement means naS(n), so λ1(AS)=0 by those covers; compactness supplies measurability. The line equality gives H1(AS)=0.

F4F5step 1.1
3.1

Each prescribed first j binary digits of u describes one half-open dyadic interval of length 2j, hence mass 2j. A real number has at most two binary expansions: at the first differing digit, equality of the sums requires the full possible tail k>n2k=2n, forcing the two opposite constant tails. Therefore a fibre T1({x}) is contained, for every n, in at most two prefix events of mass 2aS(n). Since aS(n), every singleton has ν-mass zero. Away from endpoints, any level-n dyadic cell can receive only its own allowed prefix. Its mass, with either closed or half-open endpoints, is consequently at most 2aS(n).

F5F7step 2.2
4.1

If 0<t<d, then for all sufficiently large n, aS(n)tn. A closed interval of length r with 2nr<21n meets at most three closed dyadic cells of length 2n; the strict upper bound includes boundary contacts. Its mass is at most 32aS(n)3rt. Any nonempty bounded set lies in a closed interval of the same diameter, and diameter-zero sets have zero mass by the preceding step. Apply mass distribution with ν(AS)=1 to get dimHASt. Let t increase to d. When d=0, nonnegativity gives the lower bound directly. This proves the dimension formula also at d=1.

F2step 2.2step 3.1step 2.1
5.1

If S and its complement are both infinite, insert arbitrary infinite bits successively at the positions kj. Two different bit sequences first differ at some kj; the maximal possible allowed tail is strictly less than 2kj because some later position is forbidden. Their sums are distinct. Infinite bit sequences are uncountable by the diagonal argument (a purported enumeration is defeated by changing its jth bit at position j). Thus this injection proves uncountability of AS.

F1F7
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Dimension leaves the critical measure undetermined

Discussion

Assume the Axiom of Countable Choice. Dimension one permits all three critical-measure behaviours. For S the positive nonsquares, aS(n)=nn, so Digit-position density determines Hausdorff dimension gives dimHAS=1 and H1(AS)=0. On the other hand One-dimensional Hausdorff measure on the line is Lebesgue outer measure gives H1([0,1])=1 and H1(R)=. Both sets have dimension one by Euclidean space and positive-volume sets have their Euclidean dimension, since they have positive Lebesgue measure. The critical exponent alone therefore specifies none of zero, finite positive, or infinite critical measure.

RemarkRemark: AI-adaptedProof: Not applicable sources checked 2026-09-07 not proved hereOpen item page →
Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Content, spherical covers, and normalisation

Discussion

Assume the Axiom of Countable Choice. The covering convention matters. For the diameter-power definition, replacing nonempty covering sets by their closures leaves diameters unchanged, hence gives the same infimum even at a fixed scale. Open enlargement gives the same limiting measure for positive exponents, with scale and cost slack. Finite-scale content should not be confused with the limiting measure: Content and measure have the same null sets establishes only their common null sets.

If Ss denotes the analogous limiting infimum restricted to open metric balls, then for s>0,

Hs(A)Ss(A)2sHs(A).

For the second inequality, enclose each nonempty cover member of diameter dj in a ball about one of its points, of radius slightly greater than dj. Its diameter is at most twice that radius. Choose positive enlargements with summable cost error, including when dj=0; the covering scale is increased by a factor tending to two and still tends to zero. Infimisation, vanishing cost error, and the small-scale limit give the inequality. The first inequality is inclusion of cover families. The ball-only convention is called spherical Hausdorff measure; equality with arbitrary-cover measure is not a general convention equivalence (Falconer §1.2).

Recorded, not proved here. The sharper Euclidean identification for this unnormalised convention is

cn=2nλn(B(0,1)).

Fremlin 264H–I supplies the isodiametric argument and exact factor. The local theorem Euclidean Hausdorff measure is proportional to Lebesgue measure proves proportionality and elementary bounds only. No proof or example here uses the displayed exact identification for n2.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Chart surface measure and Hausdorff measure: a boundary of scope

Discussion

The definition Unnormalised Hausdorff measure provides a metric notion of size, and Euclidean Hausdorff measure is proportional to Lebesgue measure relates its ambient-dimensional instance to Euclidean volume. The planned PDE applications may use chartwise C1 change of variables already supplied by the integration track. Identifying chart-defined hypersurface measure with an appropriately normalised Hausdorff measure requires a further geometric-measure theorem. That identification belongs to a future treatment; it is not established or used here. Fremlin separates these topics between §§264 and 265.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07 rests on unproved materialOpen item page →

Orientation for the published Weierstrass graph remark

Discussion

The definition Hausdorff dimension now gives meaning to the dimension notation in the earlier orientation Hausdorff dimension of the graph of the Weierstrass function . That external remark is mentioned only as a reading connection. No graph-dimension value, parameter range, or present state of the Weierstrass dimension problem is asserted or proved by this page.

5 · Examples, counterexamples and false statements

None yet.

Sources