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.
A vector field tangent to an embedded submanifold restricts to a vector field on it
Statement
Let be an embedded submanifold, and let be a smooth vector field on such that for every . Then the restriction is a smooth vector field on .
Facts & Assumptions
Given: An embedded submanifold and a smooth vector field on tangent to .
Embedded submanifolds admit slice charts (Embedded submanifolds and slice charts).
Smooth vector fields are characterized by smooth coordinate coefficient functions (Smoothness of a vector field is equivalent to smooth coordinate components).
Smoothness of a map into an embedded submanifold is detected after composing with the inclusion (Smoothness into an embedded submanifold is an initial property).
Proof
In a slice chart for , the submanifold is given by . By [L2], write with smooth coefficients on .
Tangency means that at each point of the normal components vanish: on . Hence on the field is whose coefficients are smooth on the slice.
The local expressions from step 2.1 define a smooth section of in each restricted slice chart, and these local sections agree on overlaps because they are all restrictions of . By [L3], they therefore glue to a smooth vector field on .
Therefore a smooth ambient vector field tangent to an embedded submanifold restricts to a smooth vector field on that submanifold.
Depends on
Used by
Dependency tree · two levels
13 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, 2nd ed. (standard reference, not scraped)
- Will J. Merry, Differential Geometry (standard reference, not scraped)