Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 connections intertwine parallel transport

Statement

For f:N→M smooth and γ:[a,b]→N piecewise smooth, let Jt:(f∗E)γ(t)→Ef(γ(t)) be the canonical fibre identification. Then JbPγf∗∇=Pf∘γ∇Ja.

Facts & Assumptions

Given: A connection on E, the map f and the curve γ.

[F1]

Pullback connections are functorial under the canonical bundle identifications (Pullback connection is well defined and functorial).

[F2]

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

[F3]

Transport is endpoint evaluation of that section (Parallel transport along a piecewise smooth curve).

Proof

1.1F1

The fibre identifications give the canonical isomorphism γ∗(f∗E)≅(f∘γ)∗E. Functoriality identifies their connections and hence their derivatives in direction ∂t. Thus they identify parallel sections, piecewise and continuously at all corners. Explicitly, both coefficient equations use ωf(γ(t))(dfγ(t)γ˙(t)).

2.1F2F3step 1.1∎

A parallel section on the left with initial vector v corresponds to one on the right with initial vector Jav. Uniqueness and endpoint evaluation give the asserted identity on every v. Constant f gives zero matrix in a fixed target fibre frame; no injectivity of f or nonzero curve velocity is required. For a=b the two sides are Ja, and rank-zero bundles have the unique maps. The identifications are canonical, not selected trivializations.

Depends on

Used by

Nothing in the library uses this result yet.

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