Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Alexander--Whitney and shuffle are natural chain-homotopy inverses

Statement

For arbitrary spaces X,Y and every commutative unital ring R, the Alexander–Whitney map A and signed shuffle map S are natural chain maps C(X×Y;R)ASC(X;R)RC(Y;R). Both preserve degree-zero augmentation, and AS and SA are naturally chain homotopic to the respective identity maps. Moreover, for the specified natural inverse T constructed below there is a natural chain homotopy AT. This holds for ordinary unnormalized chains and requires no AC.

Facts & Assumptions

[F1]

Alexander–Whitney map and diagonal approximation constructs A, proves its chain-map and naturality identities, and identifies its degree-zero action.

[F2]

The singular chain cross product on generators specifies the finite signed shuffle sum. The singular chain cross product satisfies the boundary formula proves that S is a chain map, and Singular chain cross products are natural proves its naturality.

[F3]

Singular product chain equivalence by simplex models states that S has a natural inverse and natural homotopies, without AC, and that scalar extension preserves the result.

[F4]

The singular chain homotopy formula gives the explicit prism homotopy for a specified homotopy of spaces. Singular cochain complex with coefficients supplies ordinary unnormalized singular chains as free modules on singular simplices.

Proof

Given: Work first over Z. Write D=C(X×Y) and F=C(X)C(Y) with the signed tensor differential.

1.1

By [F1] and [F2], A and S are natural chain maps. Both act in degree zero by the inverse identifications between a pair of vertices and their tensor.

F1F2given
1.2

We now construct the model contractions used below. If Q is a standard simplex or a product of two standard simplices and v is its first vertex, the affine homotopy H(x,t)=(1t)v+tx stays in Q. Let p:C(Q)C() collapse Q and let j:C()C(Q) include v. The prism P of [F4] satisfies dP+Pd=1jp. The point complex has one generator en in each degree, with den=en1 for positive even n and den=0 for odd n. Define aen=en+1 for odd n and aen=0 for even n. Direct substitution gives da+ad=1iϵ, where ϵ:C()Z[0] is augmentation and i includes degree zero. Thus hQ=P+jap satisfies dhQ+hQd=1eQ, where eQ=jiϵp projects onto the first vertex. For a product model in F, put hF(xy)=hCxy+(1)xeCxhEy. The mixed terms cancel, giving dhF+hFd=1eCeE. Hence in either D- or F-model every positive-degree cycle, and every augmentation-zero degree-zero cycle, has the specified filling hz.

F4givenalgebra
2.1

Construct a natural chain map T:DF. In degree zero send the vertex (x,y) to xy. Suppose T is defined naturally below degree n>0. On the universal diagonal simplex an:ΔnΔn×Δn, the chain z=Tn1dan is a cycle when n>1 and has augmentation zero when n=1. Define Tn(an)=hFz using step 1.2, and for σ=(x,y) put Tn(σ)=(x#y#)Tn(an). Freeness in [F4] extends this linearly. Then dTn=Tn1d, and composition of pair maps proves naturality. Thus T is a specified natural chain map whose degree-zero action equals that of A.

F4step 1.1step 1.2
2.2

More generally, let u,v:EG be natural chain maps between D or F functors that agree in degree zero. Set H1=0. Assuming H defined below degree n, for each universal degree-n generator a put z=(uv)aHn1da. The lower homotopy identity makes z a cycle for n>0, while at n=0 it is zero. Define Hn(a)=hz with the appropriate model contraction from step 1.2, and push forward to arbitrary generators. Then dHn+Hn1d=uv; the specified pushforward rule makes H natural.

F4step 1.2algebra
3.1

Since T and S are natural chain maps and T0S0=S0T0=1, step 2.2 applied to (TS,1F) and (ST,1D) gives natural homotopies U and V with dU+Ud=TS1 and dV+Vd=ST1. This independently realizes the existence asserted in [F3].

F2F3step 2.1step 2.2
3.2

The maps A,T:DF agree in degree zero by steps 1.1 and 2.1. Applying step 2.2 to (A,T) gives a natural K with dK+Kd=AT. This is the stated comparison with the specified inverse, including its degree-zero normalization.

step 1.1step 2.1step 2.2
4.1

Compose the identity of step 3.2 with the chain map S. Then d(KS+U)+(KS+U)d=(AT)S+(TS1)=AS1, and d(SK+V)+(SK+V)d=S(AT)+(ST1)=SA1. All summands and composites are natural, so these are the required natural chain homotopies.

F2step 3.1step 3.2
5.1

Tensor these integral identities with R. The canonical identification sends (xy)r to (x1)(yr); its inverse sends (xa)(yb) to (xy)ab. The tensor relations and commutativity of R make the maps well-defined inverses commuting with the signed differential. The extended maps are the stated AW and shuffle formulas. Additivity of tensoring preserves the homotopy identities without a flatness hypothesis.

F1F2F3step 4.1
6.1

An empty factor or R=0 makes both complexes zero. Degree zero and augmentation were checked in step 1.1; the point calculation in step 1.2 retains the nonzero higher unnormalized chains. Every image is a finite chain because the model contractions are finite prism sums and each recursion uses only finitely many faces and already defined chains. Hence degeneracy, the lowest degree, and coefficient zero impose no exception, and no choice axiom is used.

F3step 1.1step 1.2step 2.1step 2.2step 5.1

Depends on

Used by

Dependency tree · two levels

14 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