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.
A Lipschitz graph has finite Hausdorff length
Example
Assume the Axiom of Countable Choice. If is -Lipschitz, , its graph satisfies
Facts & Assumptions
Given: The objects, conventions, and hypotheses in the statement above.
Under the standing Countable Choice hypothesis, an -Lipschitz map with multiplies by at most . Lipschitz maps control Hausdorff measure
Under the standing Countable Choice hypothesis, for every subset , . One-dimensional Hausdorff measure on the line is Lebesgue outer measure
Finite positive implies dimension one. Hausdorff dimension is the unique critical exponent
Verification
The graph map satisfies . Its Lipschitz constant is at most , which is positive even for . Since the unit interval has Lebesgue length one, [F2] gives and hence the upper measure bound.
The coordinate projection is -Lipschitz and onto. Therefore . Both bounds show finite positive measure, and thus dimension one. For both measure bounds equal one.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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
- Fremlin 264G and 264Xf(i) (specialised Lipschitz graph) (standard reference, not scraped)