Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 under reparametrization reversal and concatenation

Statement

An increasing smooth surjective reparametrization h:[c,d][a,b], allowing h=0, leaves endpoint transport unchanged. A decreasing one reverses it. If γ1 ends where γ2 starts, their concatenation, traversing γ1 first, satisfies Pγ2γ1=Pγ2Pγ1,Pγˉ=Pγ1. These assertions include piecewise smooth reparametrizations when the composed curves admit finite smooth subdivisions, as well as inserted constant pauses.

Facts & Assumptions

Given: The stated curves and time changes, with the displayed endpoint conditions.

[F1]

The local derivative is v+ω(γ˙)v (Local frame formula for covariant differentiation along a curve).

[F2]

Parallel initial-value sections are unique (Existence and uniqueness of parallel sections).

[F3]

Reverse transport is the inverse isomorphism (Parallel transport is a linear isomorphism).

Proof

1.1

On a smooth frame segment the chain rule gives Du(Vh)=h(u)(DtV)(h(u)) from the two terms in [F1]. Thus a reparametrized parallel section is parallel even where h=0. Continuity past corners and a common finite refinement give the same result piecewise. By uniqueness, the transported endpoint vector is the value of this section, so increasing endpoint-preserving time changes leave P unchanged. A pause has constant section and makes no change.

F1F2
2.1

A decreasing time change exchanges endpoints; the same calculation gives backward transport, which equals the inverse by [F3]. To concatenate, first take the parallel section with input v along γ1, then the one with input Pγ1v along γ2. They agree at the joining point, hence give a continuous piecewise parallel section on the concatenation. Uniqueness identifies its endpoint with Pγ2γ1v, proving the composition order. A singleton or constant piece has identity transport; zero-rank fibres have the unique identity map. All refinements and concatenations here have finitely many pieces.

F2F3step 1.1

Depends on

Used by

Dependency tree · two levels

10 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