Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 R (Commutative ring), normalization of simplicial R-modules, N(M)n=⋂i<nker⁡diwith differential (−1)ndn, is an exact equivalence from simplicial R-modules (Simplicial objects, simplicial commutative rings and homotopy groups) to nonnegative chain complexes of R-modules (Chain complex in an abelian category, Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion). Every simplicial R-module has the natural direct-sum decomposition Mn=⨁α ⁣:[n]↠[r]N(M)r through its degeneracy maps. The inverse functor has Γ(C)n=⨁α ⁣:[n]↠[r]Cr; for a simplex operator φ ⁣:[m]→[n], the α-summand is sent by the identity when αφ surjects onto [r], by (−1)rdC when its image is [r−1], and by zero otherwise, with the resulting image-index map corestricted to its image. There are natural isomorphisms NΓ≅id and ΓN≅id. No AC is needed. Here R 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 R, a simplicial R-module M with faces di and degeneracies si, and a nonnegative chain complex C of R-modules.

[F1]

Simplicial objects satisfy the simplicial identities; in particular didj=dj−1di for i<j, sisj=sj+1si for i≤j, disj=sj−1di for i<j, disi=di+1si=id, and disj=sjdi−1 for i>j+1 (Simplicial objects, simplicial commutative rings and homotopy groups).

[F2]

The normalization N(M) is a chain complex with differential (−1)ndn, the inclusion N(M)→s(M) is a natural chain homotopy equivalence (Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion).

[F3]

A nonnegative chain complex of R-modules has a differential of degree −1 squaring to zero (Chain complex in an abelian category).

Proof

1.1F1givenconstruct

The direct-sum decomposition. Put K(n,i)=⋂j<iker⁡(dj ⁣:Un→Un−1) for 0≤i≤n. On K(n,i) the map di lands in K(n−1,i): for j<i, djdi=di−1dj vanishes. The map si carries K(n−1,i) into K(n,i) by djsi=si−1dj and is a section of di. Thus x=(x−sidix)+sidix gives the unique splitting K(n,i)=K(n,i+1)⊕siK(n−1,i). Starting with K(n,0)=Un, successively split for i=0,…,n−1 and then recursively split each lower-dimensional K(n−1,i). This produces exactly the summands si1⋯sitN(U)n−t with i1≤⋯≤it, each with a unique coefficient; the sequences are precisely the canonical degeneracy factorizations of the order-preserving surjections [n]↠[n−t], using sisj=sj+1si 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 U(α) is a natural isomorphism.

1.2F1F3construct

The inverse functor. For a nonnegative chain complex C and n≥0 put Γ(C)n=⨁α ⁣:[n]↠[r]Cr. For φ ⁣:[m]→[n] and the α-summand, put β=αφ and write [s] for the initial interval of Im⁡β when it is one: if Im⁡β=[r] map by the identity to the β-summand (with β corestricted to its image), if Im⁡β=[r−1] map by (−1)rdC, 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 dC2=0. Identity operators act identically, so Γ(C) is a simplicial R-module, functorially in C.

2.1F1F2step 1.1

The normalization differential. For x∈N(U)n and j<n−1 the identities give djdnx=dn−1djx=0, so dn maps N(U)n into N(U)n−1; therefore (−1)ndn defines a differential on N(U) and dn−1dn=dn−12=0 on normalized elements, as in [F2]. The passage to simplicial R-modules is R-linear throughout.

2.2F1F3step 1.2

NΓ≅id. The degenerate summands of Γ(C)n are exactly those with r<n, 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 id[n]-coefficient Cn has all faces zero except the last, which is (−1)ndC. Hence the normalization of Γ(C) is exactly C with its differential, so NΓ(C)≅C naturally.

2.3F1step 1.1step 1.2

ΓN≅id. 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 j<r it factors through the j-th face, which vanishes on N(U)r; if its image is initial but has lost at least two terminal indices it factors through the face r−1, which also vanishes on N(U)r; if no index is lost the composite is U(αφ); and if only the last index is lost the restriction equals (−1)rdN. These are exactly the four rules defining Γ, so the comparison ΓN(U)→U is a natural isomorphism of simplicial R-modules.

3.1F1step 1.1step 2.2step 2.3discharge-construct∎

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 N is an equivalence of categories; it replaces simplicial additive objects by nonnegative chain complexes as asserted. For exactness, let M↠M′ be degreewise surjective and let y∈N(M′)n. Lift y to x∈Mn and project x to its identity-surjection summand by the natural splitting of step 1.1; naturality makes this normalized projection a lift of y. Thus N 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 R-linear formulas, the same proof applies to simplicial modules over a constant ring R; it does not identify a variable simplicial A-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