For a simplicial abelian group , its normalized chain complex of a simplicial abelian group is
The simplicial identities give . Equivalently, is the quotient of by the subgroup generated by degenerate simplices, with differential induced by .
Solved by gpt-5.6-sol high.
The Dold–Kan correspondence says that
is an equivalence from simplicial abelian groups to nonnegatively graded chain complexes of abelian groups. The restriction of the right adjoint to is a quasi-inverse: both the unit and counit are natural isomorphisms.
Solved by gpt-5.6-sol high.
Under the Dold–Kan correspondence, a -simplex of is a pair with
The horn consists of the edges and , joined at vertex . A map from it is therefore a pair of composable -simplices, equivalently a triple
where the first edge is and the second is . Thus
Solved by gpt-5.6-sol high.
Let be the nonnegative chain complex having in degree , zero in every other degree, and zero differential. The simplicial Eilenberg–MacLane space is
Its underlying simplicial set is a Kan complex, with and all other positive homotopy groups zero.
Solved by gpt-5.6-sol high.
Regard the given short exact sequence as a degreewise short exact sequence of chain complexes concentrated in degree . The inverse functor in the Dold–Kan correspondence is exact, so it produces a degreewise short exact sequence of simplicial abelian groups
The last map is degreewise surjective and hence a Kan fibration. Its strict fiber is , and a strict fiber of a fibration computes the homotopy fiber. This proves the asserted homotopy fiber sequence of pointed Kan complexes.
Solved by gpt-5.6-sol high.
Products of Eilenberg–MacLane spaces satisfy
where the last isomorphism uses the Chinese remainder theorem. This space is -connected, so the Hurewicz theorem identifies
The assumed surjection on is an isomorphism because the group is finite. Hence is an isomorphism on ; all other homotopy groups of the source and target vanish. Thus is a weak homotopy equivalence, and the Whitehead theorem for Kan complexes makes it a homotopy equivalence.
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.