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.
Postnikov towers exist for connected CW complexes
Statement
Assume AC. Every connected based CW complex admits Postnikov sections
in which is a CW complex obtained from by attaching cells of dimension at least . They can be equipped with maps satisfying for the chosen models, with . The maps are unique up to homotopy rel after the sections are fixed. No inverse-limit recovery assertion is part of the theorem.
Facts & Assumptions
If every relative cell has dimension at least , the inclusion preserves for and is surjective on (High relative cells do not change lower homotopy).
For a cell attachment, the relative homotopy boundary sends the characteristic-disk class to the attaching-sphere class (Long exact sequence of relative homotopy groups).
Each sphere map, disk map, and homotopy in a CW union has finite cell support, so it occurs at a finite construction stage (Each homotopy representative is supported on a finite CW subcomplex).
The one-cell criterion reduces each extension and homotopy-extension over a relative cell of dimension at least to a homotopy group of the -truncated target (Extending over one cell is equivalent to nullhomotoping the attaching sphere).
AC chooses simultaneous representatives, attachments, fillers, and the countable family of stage constructions (The Axiom of Choice).
Proof
Given: A connected based CW complex and [A1].
Fix and put . Suppose has been constructed for . Choose a based sphere map representing every element of , and attach one -cell along each map to form . The relative pair has only -cells, so [F1] preserves every with and makes surjective.
In the relative homotopy exact sequence, each selected attaching map is the boundary of its characteristic-disk class by [F2]. Because all elements were selected, the boundary is surjective. Exactness and the vanishing of from [F1] therefore give .
Define and let be the inclusion of . Every added cell has dimension . For , all inclusions preserve by [F1]. For fixed , Step 2.1 kills at stage , and later cells have dimension at least , so [F1] prevents its reappearance.
A sphere representative in the union has image in a finite subcomplex by [F3], hence in one ; the same holds for a disk nullhomotopy. It follows in both the surjective and injective directions that is the sequential colimit of the stage groups. Step 3.1 thus gives
Therefore is a Postnikov section. [F3, step 3.1]
Carry out Steps 1.1--4.1 for every under [A1], and put . Suppose is fixed. The target has no homotopy above degree , while every relative cell of has dimension at least . Extending one cell at a time encounters an attaching sphere of dimension at least , whose class in the target is zero. Simultaneous fillers give with .
If is another such extension, regard a homotopy rel as an extension over the relative prism cells. Their dimensions are one greater than those of , so every obstruction again lies above degree and vanishes. Thus rel . Together with the unique map to , these maps form the claimed tower.
Empty higher homotopy groups merely yield empty attachment families, and the trivial group requires no representative. Connectedness supplies a common component and based groups throughout. All arbitrary family selections occur in Steps 1.1 and 5.1--6.1 and are covered by [A1]; the limit argument itself is the individual finite-support argument of [F3]. The construction gives no comparison from to an ordinary or homotopy inverse limit, so no convergence has been smuggled in.
Depends on
Used by
Dependency tree · two levels
23 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)