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.
Circle overlap weights count each arc once
Example
Assume . For take the angular charts with images and . The coefficient one in both charts defines a positive smooth density with total mass , for any subordinate partition.
Facts & Assumptions
Given: Assume . Manifolds are Hausdorff, second countable and smooth, with boundary allowed; is allowed unless excluded. Densities are pointwise Borel, , and . Circle overlap translations and a disjoint semicircle calculation.
Countable choice is The Axiom of Countable Choice (); it is assumed for the chart-gluing and integration results [F1] and [F2].
Intrinsic density measure and its chart restriction: Every Borel set in a chart has its coefficient integral, independent of partition.
Measurable integration extends smooth density integration: Nonnegative integration equals the sum of weighted chart integrals.
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: An interval has its length as measure; a singleton has length zero.
Verification
Write for the quotient. The chart domains are and . On one overlap component , and on the other . Both derivatives equal one, so the two constant coefficients satisfy the density law.
The disjoint decomposition is . The chart formula assigns the two arcs masses and , and the endpoints mass zero. Hence .
For any subordinate pair , translate the negative-angle part of the first chart by . Translation has unit Jacobian. The chart-sum formula becomes , ignoring only the already null endpoints. Thus overlapping chart weights count each arc once. Empty arcs contribute zero.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Intrinsic density measure and its chart restriction
- Measurable integration extends smooth density integration
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
41 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)