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.
Dold-Kan equivalence for simplicial modules with explicit inverse
Statement
For a commutative unital ring (Commutative ring), normalization of simplicial -modules, is an exact equivalence from simplicial -modules (Simplicial objects, simplicial commutative rings and homotopy groups) to nonnegative chain complexes of -modules (Chain complex in an abelian category, Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion). Every simplicial -module has the natural direct-sum decomposition through its degeneracy maps. The inverse functor has ; for a simplex operator , the -summand is sent by the identity when surjects onto , by when its image is , and by zero otherwise, with the resulting image-index map corestricted to its image. There are natural isomorphisms and . No AC is needed. Here is constant; the theorem does not identify modules over a variable simplicial coefficient ring with ordinary complexes over a single fixed ring.
Facts & Assumptions
Given: A commutative unital ring , a simplicial -module with faces and degeneracies , and a nonnegative chain complex of -modules.
Simplicial objects satisfy the simplicial identities; in particular for , for , for , , and for (Simplicial objects, simplicial commutative rings and homotopy groups).
The normalization is a chain complex with differential , the inclusion is a natural chain homotopy equivalence (Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion).
A nonnegative chain complex of -modules has a differential of degree squaring to zero (Chain complex in an abelian category).
Proof
The direct-sum decomposition. Put for . On the map lands in : for , vanishes. The map carries into by and is a section of . Thus gives the unique splitting . Starting with , successively split for and then recursively split each lower-dimensional . This produces exactly the summands with , each with a unique coefficient; the sequences are precisely the canonical degeneracy factorizations of the order-preserving surjections , using to put any factorization in this form. The splitting formulas commute with homomorphisms of simplicial abelian groups, so the resulting direct-sum map with components is a natural isomorphism.
The inverse functor. For a nonnegative chain complex and put . For and the -summand, put and write for the initial interval of when it is one: if map by the identity to the -summand (with corestricted to its image), if map by , and otherwise map by zero; a gap in the image or the loss of at least two terminal vertices both fall under the zero case. These formulas respect composition: if an intermediate image has a gap, then any later initial-interval image lies below the gap and has lost at least two vertices, so the direct formula is zero; losing two or more terminal vertices stays zero under further restriction; if the first map loses none the second rule is the composite rule; if it loses exactly one index, the second map either loses none (same single signed differential), has a gap (zero), or loses at least one more, and the only possibly nonzero iterated case gives . Identity operators act identically, so is a simplicial -module, functorially in .
The normalization differential. For and the identities give , so maps into ; therefore defines a differential on and on normalized elements, as in [F2]. The passage to simplicial -modules is -linear throughout.
. The degenerate summands of are exactly those with , since every nonidentity surjection factors through an elementary degeneracy and the rule of step 1.2 makes that factorization the identity on the corresponding coefficient. The -coefficient has all faces zero except the last, which is . Hence the normalization of is exactly with its differential, so naturally.
. The direct-sum map of step 1.1 is bijective in every degree, and its compatibility with a simplex operator can be checked on an -summand: if has a missing index it factors through the -th face, which vanishes on ; if its image is initial but has lost at least two terminal indices it factors through the face , which also vanishes on ; if no index is lost the composite is ; and if only the last index is lost the restriction equals . These are exactly the four rules defining , so the comparison is a natural isomorphism of simplicial -modules.
Equivalence and scope. The two natural isomorphisms of steps 2.2 and 2.3 are inverse to each other on the nose by the uniqueness of the decomposition, so is an equivalence of categories; it replaces simplicial additive objects by nonnegative chain complexes as asserted. For exactness, let be degreewise surjective and let . Lift to and project to its identity-surjection summand by the natural splitting of step 1.1; naturality makes this normalized projection a lift of . Thus preserves epimorphisms; it preserves kernels because normalization is an intersection of face kernels. Applying these facts to a short exact sequence proves exactness. Since all constructions are -linear formulas, the same proof applies to simplicial modules over a constant ring ; it does not identify a variable simplicial -module with an ordinary chain complex over a fixed ring, for which a separate coefficient-base analysis is required.
Depends on
Used by
Dependency tree · two levels
15 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
- The Stacks Project, Chapter 14 (Simplicial Methods) (standard reference, not scraped)