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.
Connection one form transformation law
Statement
If are two frames on an overlap, their matrices for the same connection satisfy All entries of are differentials of scalar functions; the order of the matrix factors is as displayed.
Facts & Assumptions
Given: Two rank- frames related by a smooth and the connection matrices .
In frame , covariant differentiation has coefficient column (Local coordinate formula for a bundle connection).
Proof
The coefficient column of in frame is the th column of . Applying the local formula to every column gives . By definition in frame , it is also . Equality of the coefficients in a basis gives .
Left multiplication by gives the asserted formula. For it returns ; constant gives conjugation; in rank one it gives , valid for either sign of the nonzero scalar . In rank zero all matrices are empty and the identity is unique. Empty overlaps impose no condition. Smooth invertibility is needed at every point, so singular frame changes are not admitted.
Depends on
Used by
- Gauge transformation of a connection one form Example
- Local frame formula for covariant differentiation along a curve Proposition
- The difference of two connections is an endomorphism valued one form Proposition
- Local connection forms glue exactly when they obey the transformation law Theorem
- Pullback connection is well defined and functorial Theorem
Dependency tree · two levels
3 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)