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.
Parallel transport depends only on the endpoints of a curve
Statement
For any connection, two piecewise smooth curves with the same starting and ending points have the same parallel transport.
Facts & Assumptions
Given: The asserted endpoint independence.
A smooth one-form in a global line frame defines a connection (Local connection forms glue exactly when they obey the transformation law).
In a frame, parallel coefficients satisfy (Local frame formula for covariant differentiation along a curve).
Concatenation composes transports and constant curves give the identity (Parallel transport under reparametrization reversal and concatenation).
Refutation
Take and in its unit frame. This is a smooth connection by [F1]. Traverse the unit square through , using each side's affine parameter . The four values of are respectively . Thus the four equations in [F2] are , with solution multipliers respectively. The multiplier on the second side follows directly by differentiating .
By [F3] the square's transport multiplies by , whereas the constant loop at multiplies by . These differ on the unit vector of the endpoint fibre, since . The zero vector is fixed by both and is not a witness. Both paths are continuous finite piecewise smooth loops with exactly the same endpoints; corners cause no additional derivative condition. No curvature or homotopy theorem is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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)