Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am trying to understand why we have a coequalizer $\sqcup_{0 \leq i < j \leq n} |\Delta^{n-2}| \rightrightarrows \sqcup_{0 \leq i \leq n} |\Delta^{n-1}| \rightarrow |\partial \Delta^n|$. What are all the three maps?

share|cite|improve this question

I realize I might be late but here are some hints. Let us look at simplicial sets instead of the realization, since the realization functor preserves colimits (and thus coequalizers) it will be enough. We have maps $d^i : \Delta^{n-2} \rightarrow \Delta^{n-1}$ as usual, and now, for each $i < j$ you have maps $d^jd^i = d^id^{j-1} : \Delta^{n-2} \rightarrow \Delta^n$ . The coequalizer is generated by these maps (induced by various coproducts and such) and the fact that $\partial \Delta^n$ is generated by $d^i:\Delta^{n-1} \rightarrow \Delta^n.$ ( the i-th faces) To see that this really is a coequalizer, you could aruge along the following lines. This is sketchy, but I think the idea is here. If we have a map $f: \amalg_{i=0}^n \Delta^{n-1} \rightarrow X$ such that for all $i<j$ $fd^i = fd^{j-1}$ you have to show that there's an unique map $h: \partial \Delta^n$ such that $hd^jd^i = hd^i d^{j-1} = fd^i = fd^{j-1}$. It should be easy to see what h must be. Hope this helps.

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.