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

Singular product chain equivalence by simplex models

Statement

For all spaces X,Y, the singular shuffle map S:C(X;Z)C(Y;Z)C(X×Y;Z) is a natural chain homotopy equivalence. The tensor complex has differential d(xy)=dxy+(1)xxdy and direct-sum totalization. A natural inverse and natural homotopies can be specified without AC. Extension of scalars gives the same assertion over every commutative unital ring.

Facts & Assumptions

[F1]

The singular chain cross product on generators gives the shuffle map, equal to the vertex-pair identification in degree zero. The singular chain cross product satisfies the boundary formula proves its tensor differential identity, and Singular chain cross products are natural proves naturality.

[F2]

The singular chain homotopy formula supplies the explicit prism homotopy for any specified homotopy of spaces, including its degree-zero identity.

[F3]

Singular chains are free on singular simplices and coefficients are obtained by scalar extension, as recalled in Singular cochain complex with coefficients.

Proof

Given: Put F(X,Y)=C(X)C(Y) and D(X,Y)=C(X×Y), initially over Z. All complexes have zero negative degrees and ordinary, unnormalized singular chains.

1.1

Let Q be a standard simplex or a product of two standard simplices, with first vertex v. The specified affine homotopy H(x,t)=(1t)v+tx is continuous and takes values in Q by convexity. Let p:C(Q)C() and j:C()C(Q) be induced by collapse and inclusion of v. By [F2], its prism P satisfies dP+Pd=1jp. The point complex has a generator en in every degree; den=en1 for positive even n and zero for odd n. Define an(en)=en+1 for odd n, and zero for even n. If ϵ:C()Z[0] and i:Z[0]C() are identity in degree zero, direct substitution in even, odd and zero degrees gives da+ad=1iϵ. Therefore h=P+jap satisfies dh+hd=1jiϵp. Put e=jiϵp; this is the degree-zero augmentation projection onto the vertex. This contraction treats the nonzero higher chains of a point explicitly.

F2F3given
1.2

In degree n, the basis of D(X,Y) consists of maps σ=(σX,σY):ΔnX×Y. Each is the unique pushforward under the pair map (σX,σY) of the diagonal simplex an in D(Δn,Δn). The basis of Fn(X,Y) consists of pairs of simplices of degrees p,q with p+q=n. Each is the unique pushforward under its pair map of bp,q=idΔpidΔq. Accordingly any specified value on each of these universal generators defines a linear natural transformation, by pushing the value forward and extending linearly. Composition of pair maps proves naturality; even coincident image simplices cause no ambiguity because the maps define the basis elements themselves.

F3given
2.1

For a model pair (Δp,Δq), use step 1.1 to obtain contractions hC,hE of its two factors, with projections eC,eE. On their tensor complex set h(xy)=hCxy+(1)xeCxhEy. The second term is zero unless x=0. In dh+hd, the mixed terms from the first summand cancel because their signs are (1)x+1 and (1)x. The mixed terms of the second cancel because eC is a chain map, leaving (1eC)1+eC(1eE)=1eCeE. Thus F on every model has a specified contraction onto its vertex in degree zero. Step 1.1 gives such a contraction for D on every model as well. In either target, every positive-degree cycle z has dhz=z; a degree-zero cycle has the same property if its augmentation is zero.

step 1.1
3.1

Define T0:D0F0 by sending the vertex (x,y) to xy, inverse to S0. Suppose T is a natural chain map below degree n1. In the model (Δn,Δn) put z=Tn1dan. For n>1, dz=Tn2d2an=0. For n=1, z has augmentation zero since the two endpoint vertices have opposite coefficients and T0 preserves their augmentations. Apply the specified contraction of the target F to define tn=hz, so dtn=z. Define Tn on every simplex by pushing tn forward as in step 1.2. Naturality of lower T, the boundary, and pushforward gives dTn=Tn1d on every generator. Induction constructs a natural chain map T in every degree. No choice of a filling is made: the contraction gives its formula.

F1step 2.1step 1.2
3.2

Here is the homotopy construction needed for the composites. Let u,v:EG be natural chain maps, where E is F or D with the universal generators of step 1.2, and G is F or D with the model contractions of step 2.1. Suppose u,v preserve the same augmentation in degree zero. Start with H1=0. Given H below degree n, for each universal generator a of degree n put z=(uv)aHn1da. For n>0, applying d and using the chain-map identities and dHn1+Hn2d=uv in degree n1 gives dz=(uv)da(uv)da+Hn2d2a=0. For n=0, the augmentation of z is zero by hypothesis. Define Hn(a)=hz in the target model, and push forward to all generators. Then dHn(a)=z by the contraction, proving dHn+Hn1d=uv. Naturality follows from the prescribed pushforward rule; hence the induction gives a natural chain homotopy.

step 2.1step 1.2
4.1

The map S is a natural chain map by [F1], and T is one by step 3.1. The composites TS and ST are the identity on degree-zero generators, so they and the appropriate identities have the same augmentation. Apply step 3.2 first with (E,G,u,v)=(F,F,TS,1) and then (D,D,ST,1). This supplies natural homotopies TS1 and ST1, proving the integral equivalence. In particular the construction has not inferred a chain equivalence merely from an isomorphism in homology.

F1step 3.1step 3.2
5.1

Tensor all the integral maps and homotopies with R. Chain-homotopy identities remain identities under any additive functor. The canonical map (C(X;Z)ZC(Y;Z))ZRC(X;R)RC(Y;R) sends (xy)r to (x1)(yr); its inverse sends (xa)(yb) to (xy)ab. Tensor relations make these well-defined inverses, commuting with the signed differential. Thus the extended equivalence is exactly the asserted coefficient version.

F3step 4.1
6.1

If either space is empty, both complexes are zero and all maps are unique. For two points, higher singular generators remain present, with the contraction calculated in step 1.1; degree zero is the identity on the single vertex pair. The zero ring gives zero complexes. Each tensor-degree diagonal has finitely many pairs p+q=n, and all image chains are finite because each prism and each input chain is finite. The recursion uses uniquely specified model contractions in every degree and no arbitrary selection, hence no AC.

F1F2F3step 1.1step 2.1step 1.2step 3.1step 3.2step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

12 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