Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $X$ be some sort of sufficiently nice space, e.g. a (connected) cell complex. Then $X$ has a universal cover $\tilde{X}$. This is simply connected by definition and it is easy to show that $\pi_n(\tilde{X})\cong\pi_n(X)$ for all $n>1$. We have, in effect, killed off a homotopy group of $X$ with a construction that seems fundamentally different than merely attaching cells to $X$ like crazy.

I wonder if there is a way to continue this process. Obviously, taking covering spaces won't get us anywhere, so we allow ourselves some more leeway. Specifically, I'm asking whether there exist spaces $X_n$ and maps $f_{n+1}\colon X_{n+1}\to X_n$ such that:

  • $X_0=X$ and $X_1=\tilde{X}$, the universal cover
  • $f_1\colon\tilde{X}\to X$ is the covering projection
  • $f_n$ is a (either Serre or Hurewicz) fibration for all $n$
  • $\pi_i(X_n)=1$ for $i\leq n$ and $\pi_i(X_n)\cong \pi_i(X)$ for $i>n$

I've look around a bit for answers to this, but I don't really know what to search for. I did find out about Postnikov towers, which seem related; I'm asking for some sort of "reverse Postnikov tower", if that makes any sense.

share|cite|improve this question
This isn't quite what you want, but for an $(n-1)$-connected space $X$ with $\pi_n(X) = G$ you can find a map $X \to K(G,n)$ that induces an isomorphism on $\pi_n$; then you can take the homotopy fiber $F$. Then $\pi_k(F) \cong \pi_k(X)$ for $k > n$, and $\pi_k(F) = 0$ for $k \le n$. (You can then iterate this, since $F$ will be $n$-connected.) – Thomas Belulovich Nov 9 '12 at 3:02
Yes, this is called the Whitehead tower. I'm pretty sure you can find out about it in Bott & Tu. – Aaron Mazel-Gee Nov 9 '12 at 4:41
Thanks @ThomasBelulovich and @Aaron! This was exactly what I was looking for. If someone wants to write this as an answer, please do. – Miha Habič Nov 10 '12 at 17:02

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.