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 smooth positive density with infinite mass
Statement refuted
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). The assertion that every positive smooth density measure has finite total mass fails for the density on .
Facts & Assumptions
Given: The Axiom of Countable Choice as in the Statement. Manifolds are Hausdorff, second countable and smooth, with boundary allowed; is allowed unless excluded. Densities are pointwise Borel, , and . Independent B-page witness: compact-finite Euclidean density with total mass infinity.
Intrinsic density measure and its chart restriction: The identity-chart density one integrates to Lebesgue measure.
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: A closed interval has its length as measure.
Counterexample
On the coefficient is positive and smooth. For every integer , . Every point has a bounded interval neighborhood of finite measure, so the measure is locally finite. Each compact is bounded, hence contained in some and has finite measure.
Given any finite , an integer yields , proving infinite total mass. Thus the hypothesis holds and the asserted finite-total-mass conclusion fails. The same chart computation gives and .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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
- Folland, Real Analysis, second edition, §11.4 pp.361–363; Theorems 2.14–2.15 pp.50–51 (standard reference, not scraped)