Hatcher-Algebraic-Topology · Problem 4.1.21
Homotopy Theory
Mathematics — Graph Theory · postnikov-whitehead-towers
Problem
For this problem it is convenient to use the notations for the stage in a Postnikov tower for and for an -connected covering of , where is a connected CW complex. Show that , so the notation is unambiguous. Thus for and all other homotopy groups of are zero.Intuitive explanation
The key insight is that both constructions—truncating a Postnikov tower and then killing low homotopy groups, versus killing low groups first and then truncating—produce the same space up to homotopy equivalence because they're extracting the same "middle slice" of homotopy information. Since Postnikov stages kill high homotopy groups and -connected covers kill low ones, applying them in either order isolates exactly the homotopy groups in the range , making the final result independent of the order of operations. This commutativity justifies the unambiguous notation and explains why its homotopy groups are zero outside .
Intuitive explanation
The key insight is that both constructions—truncating a Postnikov tower and then killing low homotopy groups, versus killing low groups first and then truncating—produce the same space up to homotopy equivalence because they're extracting the same "middle slice" of homotopy information. Since Postnikov stages kill high homotopy groups and -connected covers kill low ones, applying them in either order isolates exactly the homotopy groups in the range , making the final result independent of the order of operations. This commutativity justifies the unambiguous notation and explains why its homotopy groups are zero outside .