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.
Pullback connection
Definition
Let be smooth and let be a connection on . Give the subspace topology. If is a vector-bundle chart and , then Both displayed maps are continuous in the subspace and product topologies, so this is a homeomorphism from to . On overlaps its change of coordinates is which is smooth and fibrewise linear. These charts therefore supply the smooth rank- bundle structure directly. Its total space is Hausdorff and second countable: is a smooth manifold by Products of smooth manifolds have a canonical product smooth structure, and both properties pass to the subspace by , , and Hausdorffness are hereditary and Second countability is hereditary.
In a pulled-back frame on , the pullback connection is specified by where entrywise and is any smooth coefficient column on . These are local prescriptions under the gluing criterion Local connection forms glue exactly when they obey the transformation law; their compatibility and hence well-definedness are proved in the next theorem.
In particular, coefficient functions are not required to factor through . For constant , a constant frame of gives zero pulled-back matrix and ordinary differentiation of arbitrary ; it does not make every varying section parallel. Empty source and rank-zero bundles use empty coefficient data. No injectivity, immersion, submersion, or choice of an extension is part of this definition.
Depends on
Used by
Dependency tree · two levels
21 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
- Ved Datar, Lectures on Riemannian Geometry (standard reference, not scraped)