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.
Boundary smoothness is independent of charts and extensions
Statement
The local-extension definition of a smooth map between manifolds with boundary is independent of the chosen boundary charts and of all chosen extensions.
Facts & Assumptions
Given: A continuous map between smooth manifolds with boundary, two compatible source charts, two compatible target charts, and any local Euclidean extensions of the resulting coordinate representatives.
Boundary-chart transition maps are smooth in the local-extension sense (Smooth charts, atlases, and structures with boundary).
Smooth half-space maps are closed under composition and satisfy the chain rule (Chain rule for smooth half-space maps).
Agreeing smooth Euclidean extensions have identical derivatives on their common half-space domain (Half-space extensions agreeing on a relatively open set have the same derivatives there).
Proof
On every common domain, the two coordinate representatives differ by composition on the left and right with the source and target transition maps, which are smooth by [L1].
By [L2], one representative is extension-smooth exactly when the other is, because the transition maps are diffeomorphisms with smooth inverses. By [L3], all derivatives obtained from different extensions agree on the half-space. Thus neither the charts nor the extensions affect the definition.
Depends on
Used by
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
- 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)