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.
Difference cochains classify homotopies of extensions in the stable stage
Statement
Assume AC. Let be a relative CW complex, let , and let be -connected and -simple; when , assume in particular that is abelian. Fix and put with its resulting simple coefficient system.
Let consist of maps extending whose obstruction cochain is zero, modulo homotopy rel on . Equivalently, these are the -stage maps which extend over , with an extension chosen only when needed. If is nonempty, then
acts freely and transitively on it. For , the displacement is the difference class
and this class is zero if and only if and are homotopic rel through the -skeleton. For a finite relative CW pair, only finite choice is used.
Facts & Assumptions
Since is -connected, every two extensions of are homotopic rel through ; for , abelianness makes the conjugation action simple.
For a chosen prior-stage homotopy, (The primary obstruction class is independent of cellular choices).
The difference-cochain construction uses one shifted prism cell for each relative cell and identifies its primary obstruction cochain with the signed difference cochain (Difference cochain between two cellular extensions).
For every cellular -cochain , the vanishing-obstruction theorem constructs a map equal to on the prior skeleton and having prescribed difference , by relative pinch maps and simultaneous choice; it makes no claim that and are homotopic on the -skeleton (Vanishing of the primary obstruction is equivalent to extension over the next skeleton).
AC is used only to choose representatives and fillers for arbitrary cell families (The Axiom of Choice).
Proof
Given: , , , and [A1] as in the statement.
Let . By [F1], choose a homotopy rel between their restrictions to . Because , [F2] gives . Thus the difference cochain defines a class in .
Changing or changing either endpoint through a homotopy rel changes this cocycle by a coboundary: apply the obstruction-class independence theorem to the corresponding boundary map on the product pair. Hence depends only on the two classes in . Reversing a prism changes its sign, and gluing prisms gives
[F3]
Regard the homotopy problem as extension over the product pair in [F3]. Suppose , and choose with . Keep both endpoint maps fixed. On each relative prism , whose dimension is , insert by the relative pinch construction of [F4] a sphere representative of into the interior of , leaving its entire boundary, including the two endpoint faces, fixed. AC makes these simultaneous insertions over arbitrary cells; the CW pushout glues them to a new prior-stage homotopy rel with the same endpoints. On a boundary prism , the only changed faces are the prisms over the -cells of . Their signed incidence sum, with the interval-last sign in [F3], is ; the same oriented boundary calculation as [F2] therefore gives as a cochain, not just as a class. The zero obstruction on each now supplies a filling extending over the relative -prisms, while the fixed bottom and top faces remain and . The glued fillings are a homotopy on rel . Conversely, such a homotopy fills every prism, making its difference cochain zero and hence its class zero.
Fix and let . Since has zero obstruction as in Step 1.1, apply [F4] to a stationary prior-stage homotopy and prescribe difference cochain . It produces with . By [F2],
so . [F2, F4]
If and differ by a coboundary, Step 1.2 gives , so Step 2.1 makes and equivalent. Thus Step 2.2 defines an action of on . The addition formula in Step 1.2 proves the action law.
For any , the class sends to , proving transitivity. If a class fixes , its displacement is zero by Step 2.1, proving freeness. AC enters only in [F4] and in simultaneous extension over arbitrary cell families; finite families need only finite choice. Empty cell sets, , and the zero group give the asserted singleton torsors.
Depends on
Used by
Dependency tree · two levels
11 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
- James Davis and Paul Kirk, Lecture Notes in Algebraic Topology (standard reference, not scraped)
- Haynes Miller, MIT 18.906 Algebraic Topology II lecture notes (standard reference, not scraped)