Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 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 connection is well defined and functorial

Statement

The pullback prescription defines a unique connection f∗∇, independent of frames. Under the canonical bundle isomorphisms it satisfies id⁡∗∇=∇ and g∗(f∗∇)=(f∘g)∗∇. For a local section s of E, (f∗∇)X(f∗s)(q)=(∇s)f(q)(dfqXq). The right side is interpreted in the fibre of the pullback bundle at q.

Facts & Assumptions

Given: Smooth maps g:P→N, f:N→M and a connection on E→M.

[F1]

The pullback prescription uses matrix f∗ω in frame f∗e (Pullback connection).

[F2]

Matrices transform by ω′=A−1ωA+A−1dA (Connection one form transformation law).

[F3]

The matrix overlap condition is necessary and sufficient for unique gluing (Local connection forms glue exactly when they obey the transformation law).

[F4]

The canonical composite pullback isomorphisms preserve fibre coordinates in pulled-back charts (Pullback is functorial up to canonical bundle isomorphism).

Proof

1.1F1F2F3

Pull back the identity in [F2]. Composition preserves matrix products and inverses, and the chain rule gives d(A∘f)=f∗(dA). Thus f∗ω′=(A∘f)−1(f∗ω)(A∘f)+(A∘f)−1d(A∘f). These are exactly the transition matrices of the pulled-back frames, so the prescription glues uniquely and is frame independent.

2.1F1F3F4step 1.1

For a one-form entry η and v∈TxP, (g∗f∗η)x(v)=ηf(g(x))(dfg(x)dgxv)=((f∘g)∗η)x(v) by the chain rule. Hence the connection matrices coincide in the frames identified by the canonical bundle isomorphism. Gluing uniqueness gives composite functoriality; the identity case is the same evaluation with did⁡=id⁡.

3.1F1step 1.1∎

If s=eu, then f∗s=(f∗e)(u∘f). Its coefficient derivative is X(u∘f)=du(dfX), giving the displayed section identity. Constant f has df=0, so pulled-back sections from E are parallel, whereas general coefficients on N still differentiate as prescribed. Empty bases and rank-zero bundles give unique zero operators; no rank condition on df was used and rank one follows entrywise. All local values are specified uniquely without AC.

Depends on

Dependency tree · 2 levels

Sources