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 connection
Definition
The dual connection on the smooth bundle of Connection on a smooth vector bundle is characterized by The right side is function-linear in : replacing by introduces once with each sign, so those terms cancel.
Here is the construction, including well-definedness. In a frame write and write with dual coefficient column , so . The coordinate formula Local coordinate formula for a bundle connection gives Thus the required coefficients are , and the local connection matrix in the dual frame is . These local rules are smooth, real-linear and obey the section Leibniz rule by the scalar product rule. On an overlap both give the intrinsic displayed pairing formula; agreement against every local frame section forces equality of the dual covectors. They therefore glue to a connection, equivalently by Local connection forms glue exactly when they obey the transformation law. Testing against a basis also proves uniqueness. This verifies the implicit characterization rather than assuming that it defines an operator.
The derivative on scalar functions is ; duality preserves the evaluation pairing with that scalar connection. For rank one the matrix changes sign; for rank zero evaluation and all coefficients are empty. Zero sections give zero derivatives, while empty bases give the unique operator. This construction is local and canonical from the given connection and requires no choice axiom.
Depends on
Used by
Dependency tree · two levels
15 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)