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 with fiber , the sequence is exact wherever there is an incoming and outgoing arrow. Basepoints are 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 meets every path component of .
There is a right action of on : is the endpoint component of a lift of starting at , with loop products traversed left-to-right. Its orbits are precisely the fibers of , and the stabilizer of is . Our boundary convention gives . These assertions require no AC.
Facts & Assumptions
Relative homotopy for maps bijectively to absolute homotopy of , with connecting map equal to relative boundary after the inverse. The fibration connecting map is independent of lift and representative
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
Paths characterize path components. Paths, path-connected spaces and path components
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 , and left-to-right loop concatenation.
Replace each relative term of F2 by using F1. The composite from is actual composition with , since the relative representative is the same cube. The outgoing map is exactly 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 , including with a pointed-set outgoing map.
A component of containing a fiber point maps to . Conversely, if is joined to , lift a path from to starting at using F4. Its endpoint is in and in the component of . This proves exactness at . The image of the last arrow is by definition the set of components meeting , proving the precise surjectivity criterion.
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.
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 . Reversal gives inverses. If a loop in is based at , it exhibits that its projected loop stabilizes . Conversely, for a stabilizing base loop, lift it from and join its endpoint to in . Pasting gives a based loop of whose projection is the original loop with a constant segment, hence the same based class. Thus the stabilizer is exactly the claimed image.
Points related by the action are connected in by a lifted loop, with possible fiber paths. Conversely a path in between two points of projects to a loop at and witnesses the corresponding action relation. Thus orbits are exactly fibers of , even when or is disconnected. A lift of ending at , read backwards, is a lift of starting there. Its initial component is therefore by step 1.3, proving the boundary formula.
The specified makes 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 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.
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
- May, A Concise Course in Algebraic Topology (standard reference, not scraped)
- Hatcher, Algebraic Topology (standard reference, not scraped)