Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Fiber transport is functorial on the base fundamental groupoid

Statement

For a Serre fibration p:E→B, a commutative ring R, and q≥0, the homology assignment Hq(p;R) is a choice-free local system: constant paths act identically, endpoint-fixed homotopic paths act equally, and Hq([γ∗η])=Hq([η]) Hq([γ]) for composable paths γ:b→c and η:c→d.

Assume AC for the cohomological comparison in the preceding definition. Then Hq(p;R) satisfies the same covariant functor laws. In particular reversal before cohomological pullback gives Hq([γ∗η])=Hq([η]) Hq([γ]).

Facts & Assumptions

Given: The Serre fibration, coefficient ring, degree, and composable endpoint-fixed path classes.

[F1]

Fiber homology local system of a Serre fibration gives the two strict-fiber transport formulas and separates the choice-free homology branch from the AC-dependent cohomology branch.

[F2]

Fiber transport gives the Serre local systems gives the corresponding Hurewicz local-system identities.

[F3]

Fibers over one path component are fiber homotopy equivalent supplies the path-homotopy, constant, composition, and inverse transport laws used by [F2].

[F4]

Local systems and pullback defines a local system as a functor from the fundamental groupoid.

[F5]

The Axiom of Choice is assumed only for the cohomological comparison maps Kb from [F1].

Proof

technique · conjugation of the Hurewicz functor laws
1.1F1F2F3F4

Write Jb:Hq(Fb;R)→Hq(Fb′;R) for the homology comparison. By [F1], τγ=Jc−1Hq(Tγ)Jb. For the constant path, [F2]–[F3] give Hq(Tcb)=id⁡, so τcb=id⁡. Endpoint-fixed homotopic paths have equal middle maps. For composable γ,η, the middle identity Hq(Tγ∗η)=Hq(Tη)Hq(Tγ) makes the adjacent JcJc−1 cancel and gives τγ∗η=τητγ. Thus [F4] applies, with no choice.

1.2F1F2F3F4F5

Under [F5], write Kb=(jb)∗:Hq(Fb′;R)→Hq(Fb;R). The formula in [F1] is sγ=KcHq(Tγˉ)Kb−1. Since γ∗η‾=ηˉ∗γˉ, [F2]–[F3] give Tγ∗η‾≃TγˉTηˉ. Contravariance gives Hq(Tγ∗η‾)=Hq(Tηˉ)Hq(Tγˉ). Cancelling KcKc−1 now yields sγ∗η=sηsγ. Constants and endpoint-fixed homotopies are handled identically, so [F4] gives the cohomology local system.

2.1F1F4F5step 1.1step 1.2∎

If a component has empty fibers, all its stalks and maps are zero; a point fiber, the zero ring, and q=0 obey the same conjugation formulas. Reversal interchanges the two endpoints exactly as typed in step 1.2, and reversing twice returns the original class. The homology proof uses supplied maps and finite algebra only. The cohomology proof uses AC precisely through [F5] and does not spend it again. These checks establish every claimed functor law.

Depends on

Dependency tree · 2 levels

Sources