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 relative homotopy groups
Statement
For every based pair , the natural sequence is exact at each term with an incoming and outgoing arrow. Exactness means that the incoming image equals the inverse image of the distinguished element under the outgoing arrow. Basepoints are throughout. No terminal surjectivity onto is claimed. Arrows are homomorphisms where both group structures have been established.
Facts & Assumptions
Boundary maps, pair maps and their group ranges are well-defined. Relative homotopy operations are well defined in their valid degrees
Relative nullity is equivalent to compression into A fixing the whole disk boundary. Relative cubical disk model and compression
Based maps induce homomorphisms and preserve homotopy classes. Higher homotopy groups are functorial and based homotopy invariant
Two points lie in the same path component when a path joins them. Paths, path-connected spaces and path components
Proof
Given: The spaces, maps, and hypotheses in the statement above.
At , an absolute class represented by a map into A is relatively null: in the disk model contract its domain to the marked boundary point, through maps into A. Conversely a class killed by j compresses into A with its full boundary fixed by F2; since that boundary was constant x0, the compressed representative defines an absolute class in mapping to the original. This proves both image inclusions for all n≥1.
At for n≥2, the boundary of an absolute representative is constant, so . If has distinguished face nullhomotopic in A, take a boundary-fixed from h to x0. For a collar width define for , and for . At the seam both values are h. As λ goes from 0 to 1, using this formula for and , it gives a relative homotopy: near λ=t=0 both arguments tend to the common value h. At λ=1 the bottom value is , and all other faces are fixed, so it is an absolute representative.
At for n≥1, a relative -cube is itself an X-nullhomotopy of its distinguished face, so . Conversely, if an A-based cube is nullhomotopic in X rel its boundary, that nullhomotopy, with time as the final coordinate, is a relative -cube whose boundary is the given cube. This proves equality of kernel and image there.
At , a path α starts at some and ends at x0. Its boundary component is distinguished precisely when a can be joined to x0 in A. Given a path in A, the based loop has the same relative class as α: attach the terminal segment ahead of α with width s/2. At s=0 it is α; at s=1 it is the loop, the changing initial endpoint stays in A, and the seam agrees at a. Conversely the initial point of a based loop is x0, and any relative homotopy keeps its initial endpoint within the same A-component.
At , the component of a maps to the distinguished X-component exactly when a path in X joins a to x0. Such a path is a relative degree-one representative with boundary component [a]. Conversely every relative path provides that connection. Components of X not meeting A are not constrained by this calculation.
Composition with a map of based pairs commutes pointwise with inclusion and distinguished-face restriction. Hence every square of the displayed sequence commutes by F1 and F3. Steps 1.1–1.5 establish exactness at all eligible terms, with the pointed-set interpretation in the low tail.
Depends on
Used by
Dependency tree · two levels
20 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
- Hatcher, Algebraic Topology, Chapter 4 (standard reference, not scraped)