Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (gpt-6.1-sol)
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.

Shuffle comparison and symmetric powers of simplicial modules

Statement

Let k be a characteristic-zero field and assume AC. For arbitrary simplicial k-modules X,Y, the shuffle and Alexander–Whitney maps give natural chain-homotopy equivalences NX⊗kNY≃N(X⊗kY). The iterated shuffle is associative, unital and symmetric with the Koszul sign. For every simplicial k-module X and every r≥0, its Σr-equivariant iteration induces a quasi-isomorphism Sym⁡r(NX)⟶NSym⁡r(X). Normalization is homological in this statement; reindexing gives the nonpositive cohomological version.

Facts & Assumptions

Given: The field and arbitrary simplicial modules.

[F1]

Dold-Kan equivalence for simplicial modules with explicit inverse supplies the exact normalization functor, its natural splitting into normalized and degenerate chains, and its inverse.

[F2]

Alexander--Whitney and shuffle are natural chain-homotopy inverses fixes the front/back and signed-shuffle conventions on singular chains; the extension to arbitrary simplicial modules is proved below.

[F3]

The Axiom of Choice permits homogeneous basis and splitting choices over k.

Proof

1.1F1F2construct

On unnormalized chains use the front/back formula AW⁡(x⊗y)=∑p+q=ndp+1⋯dnx⊗d0py and the shuffle formula obtained by inserting the complementary degeneracies into x∈Xp and y∈Yq, with the shuffle permutation sign. Every summand is separately linear in x,y. The simplicial identities show these are chain maps: internal faces cancel in pairs differing by transposition of adjacent shuffle labels, and the uncancelled endpoint faces are exactly the two tensor differentials. Degenerate inputs go to sums with at least one degenerate factor. The maps therefore induce the asserted normalized maps.

2.1F1F2step 1.1construct

Here is an acyclic-model construction of the homotopies, including its linear descent. In degree n, unnormalized diagonal chains are represented bilinearly by kΔ[n],kΔ[n]; tensor chains of bidegree (p,q) are represented by kΔ[p],kΔ[q]. The target on a diagonal model is the chain complex of Δ[p]×Δ[q], contracted to (0,0) by prepending (0,0) to its two vertex lists. On a tensor model use c=hp⊗1+ιpϵp⊗hq, where hp prepends vertex 0, ϵp is augmentation and ιp includes vertex 0; tensor signs are the ordinary chain-complex signs. In either target ∂c+c∂=1−ιϵ. This identity follows by separating the first face of the prepended list from the remaining faces. It applies to zero-augmented cycles also in degree zero.

3.1F1F2step 2.1construct

For either pair u,v of composites and identity, start H−1=0. On a universal generator t in degree n, having defined lower degrees, set z=(u−v)t−Hn−1(∂t) and H~n(t)=c(z). Its boundary is z: indeed ∂z=0 by the lower-degree homotopy identity and ∂2=0, while ϵz=0 since u,v induce the same augmentation. Extend this formula by evaluating the universal simplices at the actual x,y. All evaluated expressions are finite sums of tensors of faces and degeneracies, separately linear in x,y, so this defines a natural transformation on arbitrary modules, including their linear relations. This construction does not require the chosen contractions of the models to commute with simplicial maps. Naturality follows from the evaluation prescription on the representable models.

4.1F1F2step 3.1construct

The same recursion works on normalized chains using their natural projector P supplied by [F1]. More explicitly, at each degree extend the model formula to unnormalized generators and precompose it with P; on the tensor source use P⊗P. The residual z already factors through that projector, since lower homotopies do and the normalized differential commutes with it. Projection in the target then gives ∂Hn+Hn−1∂=u−v on the normalized direct summand. This proves both normalized chain-homotopy identities without assuming the universal contraction descends to the degenerate quotient.

5.1F1F3step 4.1algebra∎

Composing shuffles of two blocks indexes both associative composites by the same ordered three-block shuffles with the same signs. Interchanging two blocks multiplies by the graded interchange sign; the zero-degree unit is fixed. Thus the r-fold shuffle is Σr-equivariant and a quasi-isomorphism by iteration. For r=0 it is the identity on k. Tensor products preserve quasi-isomorphisms over a field. Averaging by 1/r! makes coinvariants exact, so taking Σr-coinvariants preserves this quasi-isomorphism. Exact normalization commutes with coinvariants and direct sums. This gives the displayed symmetric-power comparison for every r, with no boundedness or finite-dimensionality assumption on X.

Depends on

Dependency tree · 2 levels

Sources