Alphabeta Math
TheoremStatement: 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.

Long exact sequence of homotopy groups of a fibration

Statement

For a based Serre fibration p:(E,e0)(B,b0) with fiber F=p1(b0), the sequence πn(F)iπn(E)pπn(B)pπn1(F)π1(B)pπ0(F)iπ0(E)pπ0(B) is exact wherever there is an incoming and outgoing arrow. Basepoints are e0,b0 as appropriate. Exactness means incoming image equals the inverse image of the distinguished element. Arrows are homomorphisms where both group structures are defined; the component terms are pointed sets. The last arrow is onto precisely when p(E) meets every path component of B.

There is a right action of π1(B,b0) on π0(F): [e][γ] is the endpoint component of a lift of γ starting at e, with loop products traversed left-to-right. Its orbits are precisely the fibers of i:π0(F)π0(E), and the stabilizer of [e0] is pπ1(E,e0). Our boundary convention gives p[γ]=[e0][γ]1. These assertions require no AC.

Facts & Assumptions

[F1]

Relative homotopy for (E,F) maps bijectively to absolute homotopy of B, with connecting map equal to relative boundary after the inverse. The fibration connecting map is independent of lift and representative

[F2]

The based pair LES is exact in all group and pointed-set degrees, with natural inclusion and boundary maps. Long exact sequence of relative homotopy groups

[F3]

Paths characterize path components. Paths, path-connected spaces and path components

[F4]

Finite relative cubical lifting holds for Serre fibrations without AC. A fibration has path lifting and homotopy lifting relative to a subspace

Proof

Given: The based Serre fibration, its fiber inclusion i, and left-to-right loop concatenation.

1.1

Replace each relative term πn(E,F) of F2 by πn(B) using F1. The composite from πn(E) is actual composition with p, since the relative representative is the same cube. The outgoing map is exactly p by F1. Bijections preserve inverse images of distinguished points and images; in group degrees F1 gives group isomorphisms. F2 therefore proves the displayed exactness through π0(F), including π1(B) with a pointed-set outgoing map.

F1F2
1.2

A component of E containing a fiber point maps to [b0]. Conversely, if p(e) is joined to b0, lift a path from p(e) to b0 starting at e using F4. Its endpoint is in F and in the component of e. This proves exactness at π0(E). The image of the last arrow is by definition the set of components meeting p(E), proving the precise surjectivity criterion.

F3F4
1.3

To verify the proposed action, first fix a path γ and two lifts whose initial points are joined by a path in its initial fiber. More generally let the base paths vary through an endpoint-fixed homotopy. On a square prescribe the two given lifts on its vertical sides and the given initial fiber path on its bottom. F4 extends the lift, using base path time as lifting time and the other coordinate as parameter. The top is a path in the terminal fiber, so the endpoint components agree. This proves simultaneous independence of the initial point within its component, of the lift, and of the endpoint-fixed base representative. Existence is path lifting.

F3F4
2.1

The constant lift proves the identity law on components. Pasting a lift of γ with a lift of η starting at its endpoint gives a lift of γη. Step 1.3 therefore proves ([e][γ])[η]=[e]([γ][η]). Reversal gives inverses. If a loop in E is based at e0, it exhibits that its projected loop stabilizes [e0]. Conversely, for a stabilizing base loop, lift it from e0 and join its endpoint to e0 in F. Pasting gives a based loop of E whose projection is the original loop with a constant segment, hence the same based class. Thus the stabilizer is exactly the claimed image.

F3F4step 1.3
2.2

Points related by the action are connected in E by a lifted loop, with possible fiber paths. Conversely a path in E between two points of F projects to a loop at b0 and witnesses the corresponding action relation. Thus orbits are exactly fibers of i, even when E or F is disconnected. A lift of γ ending at e0, read backwards, is a lift of γ1 starting there. Its initial component is therefore [e0][γ]1 by step 1.3, proving the boundary formula.

F1F3step 1.3
3.1

The specified e0 makes E,B,F nonempty, but other base components may have empty fibers; step 1.2 explicitly allows this. In degree one the boundary is a component and no group structure on π0(F) is asserted. For a one-point or path-connected fiber its component action is trivial. All extra lifting problems use a point or finite square, and uniqueness of the resulting component defines the action without choosing a family of lifts. The preceding steps prove exactness, action laws, and all low-degree qualifications.

step 1.1step 1.2step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

26 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