Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Fiber transport and monodromy action

Definition

Let p:EB be a Hurewicz fibration, in ordinary spaces or in the explicitly chosen CGWH convention. Put Dp={(e,γ):p(e)=γ(0)}E×BI, with the corresponding path and pullback topology. Evaluation and the interval exponential law of Interval exponential law and quotient homotopies make ((e,γ),t)γ(t) a continuous homotopy with initial lift (e,γ)e. One application of Hurewicz and serre fibrations gives a universal lifting function Λ:Dp×IE with Λ(e,γ,0)=e,pΛ(e,γ,t)=γ(t). It is not assumed regular: Λ(e,cp(e),t) may move in its fiber. Selecting this one map is a single existential choice, not an application of AC.

For a path γ:bc, define its fiber transport by Tγ:FbFc, Tγ(e)=Λ(e,γ,1); fibers have the meaning of Fiber and fiber homotopy equivalence. The following proposition proves that its homotopy class is independent of the lifting function and of endpoint-fixed path homotopy, that TγηTηTγ, and that it is a homotopy equivalence. Those claims, used in the next definitions, are licensed by that declared justifier.

For every abelian coefficient group G and q0, the maps Hq(Tγ;G) consequently form a path-groupoid local system: to each point assign Hq(Fb;G) and to each endpoint-fixed path class assign its induced isomorphism. Here the path groupoid has points as objects and endpoint-fixed path classes as arrows, composed in traversal order. Homology functoriality and invariance are those used in Homotopy equivalences induce isomorphisms on singular homology. Restriction to loops at b is monodromy, written as a right action z[γ]=Hq(Tγ;G)(z) under the first-loop-first convention.

For n1, the induced based map instead has type (Tγ):πn(Fb,e)πn(Fc,Tγ(e)). It is an isomorphism by homotopy equivalence with moving-basepoint correction. The correction is Higher homotopy basepoint transport and moving homotopies: a path a:eTγ(e) in Fc gives βa(Tγ) with target πn(Fc,e). Existence of such a path is additional data; its choice can change the resulting map. To obtain a fixed based group action one must supply endpoint paths with composition compatibility, or prove hypotheses making their effect independent of choices. A homology monodromy action alone supplies neither. Precisely, if Fb is path connected and βl=id on πn(Fb,e) for every loop l at e, define x[γ]=βa(Tγ)x using any a:eTγ(e). The declared justifier proves independence of a and of the lifting function, and the right-action law. This hypothesis applies separately to each n1; for n=1 it is equivalent to abelianness, and a simply connected fiber satisfies it for every n. No unqualified fixed-basepoint action is part of the definition.

Empty fibers are allowed; the following proposition shows emptiness is constant along path components of the base. Point fibers give identity maps on their invariants. No canonical pointwise transport homeomorphism is asserted.

Depends on

Used by

Dependency tree · two levels

21 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