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.
Smoothness of a bundle map is equivalent to smooth local matrices
Statement
Let be a fibrewise linear map over a smooth base map . Choose local frames for on and for on with . Then is smooth on if and only if there are smooth scalar functions such that
for every .
Facts & Assumptions
Given: A fibrewise linear map over a smooth map and local frames on and as above.
Local frames are equivalent to local trivializations (Local frames and local trivializations are equivalent data).
A section is smooth exactly when its local components are smooth (Smoothness of a section is equivalent to smooth local components).
Proof
By [L1], the chosen frames identify with and with . In these trivializations, fibrewise linearity forces to have the form for a unique matrix .
The local representative is smooth exactly when its matrix entries are smooth on . Equivalently, the images have smooth local components, which is the criterion in [L2].
Depends on
Used by
- A continuous fibrewise linear map over a smooth base map is automatically smooth False statement
- A fibrewise bijective smooth bundle map over a diffeomorphism is a bundle isomorphism Proposition
- Constant-rank kernels and images of bundle maps over one base are subbundles Proposition
- Sections of Hom are the same as smooth fibrewise linear maps Proposition
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 (standard reference, not scraped)
- Will J. Merry, Differential Geometry (standard reference, not scraped)