Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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 X admits Postnikov sections

pn:XPnX(n1)

in which PnX is a CW complex obtained from X by attaching cells of dimension at least n+2. They can be equipped with maps qn:PnXPn1X satisfying qnpn=pn1 for the chosen models, with P0X=. The maps qn are unique up to homotopy rel X after the sections are fixed. No inverse-limit recovery assertion is part of the theorem.

Facts & Assumptions

[F1]

If every relative cell has dimension at least r+1, the inclusion preserves πi for i<r and is surjective on πr (High relative cells do not change lower homotopy).

[F2]

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).

[F3]

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).

[F4]

The one-cell criterion reduces each extension and homotopy-extension over a relative cell of dimension at least n+2 to a homotopy group of the (n1)-truncated target (Extending over one cell is equivalent to nullhomotoping the attaching sphere).

[A1]

AC chooses simultaneous representatives, attachments, fillers, and the countable family of stage constructions (The Axiom of Choice).

Proof

Given: A connected based CW complex X and [A1].

1.1

Fix n1 and put Zn=X. Suppose Zt1 has been constructed for t>n. Choose a based sphere map StZt1 representing every element of πt(Zt1), and attach one (t+1)-cell along each map to form Zt. The relative pair has only (t+1)-cells, so [F1] preserves every πi with i<t and makes πt(Zt1)πt(Zt) surjective.

A1F1
2.1

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 πt+1(Zt,Zt1)πt(Zt1) is surjective. Exactness and the vanishing of πt(Zt,Zt1) from [F1] therefore give πt(Zt)=0.

F1F2step 1.1
3.1

Define PnX=t>nZt and let pn be the inclusion of X. Every added cell has dimension t+1n+2. For in, all inclusions preserve πi by [F1]. For fixed i>n, Step 2.1 kills πi at stage Zi, and later cells have dimension at least i+2, so [F1] prevents its reappearance.

F1step 2.1
4.1

A sphere representative in the union has image in a finite subcomplex by [F3], hence in one Zt; the same holds for a disk nullhomotopy. It follows in both the surjective and injective directions that πi(PnX) is the sequential colimit of the stage groups. Step 3.1 thus gives

πi(PnX)πi(X) (in),πi(PnX)=0 (i>n).

Therefore pn is a Postnikov section. [F3, step 3.1]

5.1

Carry out Steps 1.1--4.1 for every n1 under [A1], and put P0X=. Suppose pn1:XPn1X is fixed. The target has no homotopy above degree n1, while every relative cell of (PnX,X) has dimension at least n+2. Extending pn1 one cell at a time encounters an attaching sphere of dimension at least n+1, whose class in the target is zero. Simultaneous fillers give qn:PnXPn1X with qnpn=pn1.

A1F4step 4.1
6.1

If qn is another such extension, regard a homotopy rel X as an extension over the relative prism cells. Their dimensions are one greater than those of (PnX,X), so every obstruction again lies above degree n1 and vanishes. Thus qnqn rel X. Together with the unique map to P0X, these maps form the claimed tower.

A1F4step 5.1
7.1

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 X to an ordinary or homotopy inverse limit, so no convergence has been smuggled in.

A1F3step 4.1step 6.1

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