Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 content at a prescribed scale

Definition

Let (X,d) be a metric space, A⊆X, s∈[0,∞) a finite real, and 0<δ≤∞. A cover is a finite or countably infinite family (Uj) of nonempty arbitrary subsets of X, with A⊆⋃jUj and diam⁡Uj≤δ. The empty family is permitted, and covers precisely the empty set. Define

Hδs(A)=inf⁡{∑j(diam⁡Uj)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 H∞s is called Hausdorff content; Hδs for finite δ is the scale approximation.

Depends on

Used by

Dependency tree · two levels

16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources