Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-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 gives the Serre local systems

Statement

Let p:EB be a Hurewicz fibration, Fb=p1(b), R a commutative unital ring, and q0. The assignments bHq(Fb;R),[γ:bc]Hq(Tγ;R) and bHq(Fb;R),[γ:bc]Hq(Tγˉ;R) are R-module local systems on B. Thus cohomology uses transport along the reversed path before applying contravariance.

For a commutative square of fibrations with total map u:EE over f:BB, the fiber maps induce a natural transformation from the homology system of p to the pullback of that of p, and a natural transformation in the reverse coefficient direction from the pullback of the cohomology system of p to that of p.

Facts & Assumptions

Given: The fibration, coefficient ring, degree, and, for functoriality, the commutative square in the statement.

[F1]

Fiber transport and monodromy action proves that the homotopy class of Tγ depends only on [γ], that TγηTηTγ, and that Tγˉ is a fiber-homotopy inverse to Tγ.

[F2]

The singular chain homotopy formula says homotopic maps induce chain-homotopic singular chain maps.

[F3]

Singular cochain complex with coefficients defines cochains by applying Hom(,R) to singular chains, with positive coboundary.

[F4]

Local systems and pullback identifies the required conclusion with functorial transport on the fundamental groupoid.

Proof

technique · direct
1.1

If maps a0,a1:XY are homotopic, [F2] supplies a1#a0#=P+P. Hence they induce the same map in homology. Precomposition with this equality gives a1a0=δP+Pδ on cochains, where (Pφ)(c)=φ(Pc); thus they induce the same map in cohomology as well. A homotopy equivalence therefore induces isomorphisms in both theories.

F2F3
2.1

For homology, path-homotopy invariance and composition follow from [F1] and step 1.1: Hq(Tγη)=Hq(Tη)Hq(Tγ). Constant paths give identity maps in homology even if the chosen lifting function is not regular, because [F1] makes their transports homotopic to the identity. Reversed paths give inverse maps. This is the covariant groupoid functor required by [F4].

F1F4step 1.1
2.2

Define cohomology transport along γ:bc to be Sγ=Hq(Tγˉ):Hq(Fb;R)Hq(Fc;R). Since γη=ηˉγˉ, [F1] gives TγηTγˉTηˉ. Contravariance and step 1.1 then give Sγη=SηSγ. Constants give identities, and Sγˉ is inverse to Sγ. Thus this too is a covariant fundamental-groupoid functor.

F1F3F4step 1.1
3.1

In the commutative square, write ub:FbFf(b). For a path γ:bc, the two maps ucTγ and Tfγub are fiber transports over the same base path with the same initial fiber map. The lifting comparison in [F1] gives a vertical homotopy between them. Step 1.1 therefore gives Hq(uc)Hq(Tγ)=Hq(Tfγ)Hq(ub), exactly naturality of Hq(Fb)Hq(Ff(b)).

F1F4step 1.1step 2.1
3.2

Apply the same comparison to γˉ. Contravariance gives Hq(Tγˉ)Hq(ub)=Hq(uc)Hq(Tfγ) as maps from Hq(Ff(b);R) to Hq(Fc;R). This is naturality of the stalk maps Hq(ub):Hq(Ff(b);R)Hq(Fb;R) from the pulled-back cohomology system to the source system.

F1F3F4step 1.1step 2.2
4.1

Empty fibers give zero modules, and [F1] makes emptiness constant along each path component; point fibers and q=0 obey the same formulas. The zero ring gives zero systems. Disconnected bases are handled componentwise. A universal lifting function is one supplied map, and all subsequent transports and prism homotopies concern specified paths or maps; no family of representatives is selected, so no AC is used.

F1step 2.1step 2.2step 3.1step 3.2

Depends on

Used by

Dependency tree · two levels

19 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