Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Fibers over one path component are fiber homotopy equivalent

Statement

For a Hurewicz fibration, fibers joined by a path in the base are homotopy equivalent as spaces. Transport Tγ is independent up to homotopy of its continuous lifting function and of endpoint-fixed homotopy of γ. For consecutive paths γ,η, TγηTηTγ,TcbidFb,TγˉTγidFb,TγTγˉidFc. All homotopies have fixed target fiber. The pullback to an interval along γ is fiber homotopy equivalent over the interval to Fb×I. This is choice-free. For a Serre fibration, the inclusions FbγEFc are weak homotopy equivalences: they induce bijections on path components and isomorphisms on every positive homotopy group at every fiber basepoint. Arbitrary Serre fibers need not be homotopy equivalent, as the explicit ordinary-space counterexample below shows. For a Hurewicz fibration, if Fb is path connected and every fiber loop acts trivially by basepoint transport on πn(Fb,e), transport gives a canonical right action of π1(B,b) on this fixed group, for that n1.

Facts & Assumptions

[F1]

A continuous universal lifting function defines transport without a regularity assumption. Fiber transport and monodromy action

[F2]

Pullbacks preserve both Hurewicz and Serre fibrations. Pullbacks of fibrations are fibrations

[F3]

Relative lifting follows by a disk-cylinder change of domain and, for CGWH closed cofibrations, by the explicit HLP construction. A fibration has path lifting and homotopy lifting relative to a subspace

[F4]

Basepoint transport has βab=βaβb, and a moving homotopy with basepoint track d gives f=βdg. Higher homotopy basepoint transport and moving homotopies

Proof

Given: A fibration of the specified type and a path γ:bc; for the Hurewicz clauses use the continuous lift families of F1.

1.1

For the Serre assertion let q:P=γEI and fix i=0 or 1. By F2 it is Serre. Given a based cube a:(In,In)(P,e) with eFi, deform its height by K(x,s)=(1s)q(a(x))+si. F3 lifts this finite relative problem starting at a, with constant value e prescribed on In×I. The endpoint is a based cube in Fi and the lift is a based homotopy in P. Thus inclusion is surjective on every πn, n1. To prove injectivity, start with a based homotopy a:In×IP between cubes in Fi and deform its height by the same formula. Prescribe a unchanged on (In×I)(In×{0,1}), where the height is already i. This is a finite cubical subcomplex, so F3 supplies the relative lift; its deformation endpoint is a homotopy wholly in Fi. Inclusion is injective, and is a homomorphism because postcomposition preserves cubical concatenation. For components, lift a height path from any point of P to i; deform a path between two points of Fi by the same relative procedure with both endpoints fixed. This proves surjectivity and injectivity on π0. If a fiber is empty then path lifting makes P empty, with the unique bijection of empty component sets and no based assertions. Only finite lifting problems were used.

F2F3
1.2

We first compare continuous lift families. Suppose a0,a1:Z×IE project to the two ends of a continuous base-path homotopy h:Z×I×IB, fixed in its path endpoints, and their initial values agree. On the parameter square prescribe a0,a1 on its two vertical sides and their common initial map on the bottom. The bottom-and-sides square is carried to a single bottom edge by the disk-pair homeomorphism in F3. Tensor this homeomorphism with Z and apply Hurewicz HLP with parameter Z×I to obtain a lift over the square. Its top edge is a homotopy between the two endpoint maps into the same endpoint fiber (or fiber over the varying endpoint map of Z). This argument works for arbitrary ordinary Z, and in CGWH with k-products. It needs neither a cofibration of a point in Z nor a regular lifting function.

F3
1.3

For a counterexample put C={0,1}N with the topology of finite coordinate cylinders. Every singleton is closed, distinct points are separated by complementary clopen coordinate cylinders, and no singleton is open: any finite cylinder permits changing a later coordinate. Every path in C is constant, since each coordinate of a path maps the connected interval continuously into the discrete two-point space. Likewise every map from Dn into C is constant, by restricting it to line segments between pairs of points (also for n=0). Give the set E=C×I the topology generated by product opens and Vc={c}×[0,1) for each c. The projections p:EI and r:EC are continuous. Each vertical map sc(t)=(c,t) is continuous: the inverse image of Vd is [0,1) if d=c, otherwise empty, and product opens also have open inverse images.

F5
1.4

Fix n1 and a path-connected fiber F=Fb such that βl=id on πn(F,e) for every loop l at e. For any map f:FF and path a:ef(e) set Af=βaf. This is independent of a: if a is another choice then aaˉ is a loop at e, so F4 gives βaβaˉ=id and hence βa=βa. If H:fg has track d:f(e)g(e), F4 gives f=βdg; thus correction by a for f equals correction by ad for g. Finally the radial-shell formula in F4 commutes pointwise with any continuous postcomposition g, giving gβa=βgag with the appropriate source basepoints. For corrections af:ef(e) and ag:eg(e), the concatenation agg(af) goes from e to gf(e), and this naturality and F4 give Agf=AgAf. All endpoint paths exist by path connectedness, and the resulting maps are uniquely specified, so no indexed choice of paths is required.

F4
2.1

Apply step 1.2 with Z=Fb, constant initial map in the path parameter equal to ee, and either two lifting functions for the same path or lifts of two endpoint-fixed-homotopic paths. This proves both independence assertions. The constant path has the continuous constant lift a(e,t)=e, so comparison gives Tcbid. Concatenate the chosen continuous lifts of γ and η, the latter starting at the first endpoint. The resulting endpoint is TηTγ; comparison with a lift of γη proves the composition formula.

F1step 1.2
2.2

In the example, for f:DnE and a base homotopy H starting at pf, the map rf is a constant c. Consequently L(z,t)=sc(H(z,t)) is a continuous lift with the required initial value. This proves Serre HLP in every degree without choosing any family of lifts. The fiber at 0 is discrete because the sets Vc isolate its points; the fiber at 1 has exactly the original cylinder topology of C, because every additional generator misses it. Both fibers have only constant paths. Hence any homotopy into either is pointwise constant; homotopy-inverse maps would therefore be inverse homeomorphisms. Such a homeomorphism cannot exist since one fiber is discrete and the other has no isolated points. This refutes unrestricted Serre homotopy equivalence. More precisely, f:CE, f(c)=(c,1), is continuous, but H(c,t)=1t has no continuous lift starting at f. A lift must have constant label on each time path, hence be (c,1t); at any fixed t>0 the inverse image of Vd is the nonopen singleton {d}. Thus whole-fiber HLP fails. This counterexample is asserted in ordinary spaces; no compact-generation claim is needed.

F5step 1.3
3.1

The retracing loop γγˉ contracts rel endpoints by the formula γ(2t(1s)) on t1/2 and γ(2(1t)(1s)) on t1/2. Reversing the path gives the analogous contraction at c. Step 2.1 gives both inverse homotopies displayed in the statement, so transports are homotopy equivalences. If one fiber is empty, a nonempty other fiber would lift the reversed path into it, a contradiction; thus both are empty, and their unique maps are equivalences.

F1step 2.1
3.2

Let q:PI be the pullback along γ, a Hurewicz fibration by F2. For tI put αt(s)=st and αˉt(s)=(1s)t. Transport in q gives continuous maps U:F0×IP, U(e,t)=Tαt(e), and V:PF0×I, V(z)=(Tαˉq(z)(z),q(z)). These maps are over I. Their composites transport along αtαˉt and αˉtαt, up to the comparison of step 1.2, now with the extra t or z parameter. Retracing contracts these paths with their endpoints fixed, continuously in the parameter. Step 1.2 therefore gives homotopies of both composites to the identity over I, proving the fiber homotopy equivalence. This uses continuous families, not separate equivalences selected for each t.

F1F2step 1.2step 2.1
4.1

Constant paths, t=0 in step 3.2, and one-point fibers satisfy the same comparison argument; it does not require Tcb to equal the identity pointwise. The homology local system and its isomorphisms in F1 now follow by functoriality and homotopy invariance. All constructed homotopies are obtained from single HLP problems, so no indexed choice is used. The argument uses parameter spaces as large as the whole fiber; disk HLP alone would not authorize it. The Serre conclusion follows from its separate finite-domain argument.

F1step 2.1step 3.1step 3.2
5.1

Apply step 1.4 to the transport maps. Step 2.1 identifies transports for homotopic base paths and different lifting functions up to homotopy, and gives TγηTηTγ. Therefore Aγη=AηAγ and Acb=id. The reversed loop supplies the inverse. Thus x[γ]=Aγx is a right group action, with automorphisms of πn(F,e), independent of all auxiliary endpoint paths and lifts. For n=1 the trivial-loop-transport hypothesis says the group is abelian, by the conjugation formula in F4; a simply connected fiber satisfies the hypothesis in every positive degree. The empty fiber has no based group and is excluded by the chosen basepoint; a singleton satisfies the condition and has the trivial action.

F4step 2.1step 1.4

Depends on

Used by

Cited to discharge well-definedness by Fiber transport and monodromy action.

Dependency tree · two levels

37 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