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.
False: summing unweighted atlas integrals is valid
Statement
False assertion: for an arbitrary covering atlas one may integrate a compactly supported top form by summing unweighted chart integrals, without partition weights.
Facts & Assumptions
Independence of atlas, partition and refinement: The compact-support integral on an oriented manifold is independent of the chart cover, coordinate maps, subordinate partition, and refinement. If is open and contains , with its restricted orientation, then .
Positivity of the oriented integral: Let be nonnegative on the positive determinant ray of an oriented smooth manifold. Then , and implies .
Refutation
Given: The proposed assertion; use the data constructed below.
On with increasing orientation choose the two distinct global charts and . Let for and zero otherwise, and . This is a nonnegative smooth compactly supported nonzero form, so . Smoothness at the cut follows since every derivative is an exponential factor times a polynomial in reciprocal powers of , tending to zero there.
Each of the two charts contains the support and computes by chart/partition independence. The proposed unweighted sum is . The atlas genuinely has distinct coordinate maps; its overlap is counted twice.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Lee Proposition 16.5 proof pp.405–406 (necessity of partition weights) (standard reference, not scraped)