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.
Dual and Hom transition functions define smooth bundles
Statement
If and are smooth vector bundles, then and are smooth vector bundles. In local bundle charts, the dual transition matrices are and the Hom transition matrices are .
Facts & Assumptions
Given: Smooth vector bundles and with local transition matrices and .
Vector bundle chart changes are fibrewise linear and smooth (Vector bundle charts and transition functions).
The matrix of the transpose linear map is the transpose matrix (In dual bases, the matrix of is the transpose of the matrix of ).
Proof
If has row-coordinate vector in one dual basis, then after changing the primal basis by , the same functional has coordinate vector . By [L2], the dual transition matrix is therefore .
If has matrix in one pair of local frames, then after changing frames by and , the same linear map has matrix . These formulas are smooth on overlaps because they are built from the smooth transition functions, so they define smooth bundle atlases on and .
Depends on
- Dual and Hom vector bundles
- Vector bundle charts and transition functions
- The transpose or algebraic adjoint $T^*:W^*\to V^*$, $T^*(g)=g\circ T$, of a linear map $T:V\to W$
- In dual bases, the matrix of $T^*$ is the transpose of the matrix of $T$
- A finite square real matrix is invertible if and only if its determinant is nonzero
Used by
Dependency tree · two levels
19 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)