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.
Chain rule for smooth half-space maps
Statement
If and are smooth maps between relatively open half-space sets, then is smooth and .
Facts & Assumptions
Given: Relatively open half-space sets , smooth maps and , and a point .
Half-space smoothness supplies smooth Euclidean extensions near every point (Smooth functions on relatively open half-space sets).
The derivatives of two Euclidean extensions agreeing on a relatively open half-space set agree on that set (Half-space extensions agreeing on a relatively open set have the same derivatives there).
Total derivatives satisfy the Euclidean chain rule (The chain rule for total derivatives: ).
Proof
By [L1], choose Euclidean extensions near and and shrink the first neighbourhood so that its image lies in the domain of the second extension. Their ordinary composite then extends near .
Applying [L3] to the extensions from step 1.1 gives the displayed formula, and [L2] makes the resulting derivatives independent of both extension choices. Hence is smooth and the formula is intrinsic.
Depends on
Used by
- Smooth charts, atlases, and structures with boundary Definition
- Boundary smoothness is independent of charts and extensions Lemma
- Boundary-defining functions exist locally and detect inward vectors Proposition
- Smooth invariance of the manifold boundary Theorem
- Tangent and cotangent bundles extend over a boundary Theorem
Dependency tree · two levels
8 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
- Ioan Mărcuț, Manifolds (2017 lecture notes), §§14.5, 15.1 (standard reference, not scraped)
- Will Merry, Differential Geometry (2021), Lecture 24 (standard reference, not scraped)