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.
Smooth locally defined functions can be glued by a partition of unity
Statement
Let be an open cover of a smooth manifold , let be smooth for each , and let be a smooth partition of unity subordinate to . Then the pointwise formula defines a smooth function .
Facts & Assumptions
Given: An open cover of , smooth functions , and a smooth partition of unity subordinate to .
In a smooth partition of unity subordinate to , the support family is locally finite and each support lies in (Smooth partitions of unity subordinate to an open cover).
Smooth maps paste over an open cover (Smooth maps paste over an open cover).
A locally finite sum of smooth functions is smooth (A locally finite sum of smooth functions is smooth).
For each , the product is smooth on .
Proof
Fix . On the open set let , and on the open set let . By [A1], the map is smooth on ; by [F1], the two open sets cover and on the overlap one has , so . Therefore [L1] pastes them to a smooth global function with on and .
By [F1] and step 1.1, the family is locally finite. Hence the sum is well defined and smooth by [L2].
Let . If , then and step 1.1 gives . If , then , so step 1.1 gives . Thus , and this pointwise formula is smooth by step 2.1.
Depends on
Used by
- Weighted sums do not glue arbitrary manifold-valued maps False statement
Dependency tree · two levels
9 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
- John M. Lee, Introduction to Smooth Manifolds (standard reference, not scraped)
- Will J. Merry, Differential Geometry (standard reference, not scraped)
- Nigel Hitchin, Differentiable Manifolds (standard reference, not scraped)