Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Relative singular product comparison for CW pairs

Statement

Let (X,A) and (Y,B) be CW pairs with their characteristic maps supplied, and let R be a commutative unital ring. Give products their ordinary product topologies and use unnormalized singular chains. Put U=(A×Y)(X×B). The natural shuffle map descends to a chain homotopy equivalence C(X,A;R)RC(Y,B;R)C(X×Y,U;R). There is a compatible Alexander–Whitney inverse through the quotient by C(A×Y;R)+C(X×B;R). Dualizing gives a cochain homotopy equivalence, and the induced relative external product is the relative cup product of the two projection pullbacks. These cohomology comparisons are natural in maps of pairs. No dimension bound, finite-rank chain hypothesis, or AC is required.

Facts & Assumptions

[F1]

Relative CW inclusions are cofibrations supplies HEP into every topological target with ordinary products, arbitrary CW dimension and supplied characteristic maps, without choice.

[F2]

The cover-small inclusion is a chain homotopy equivalence supplies a small-chain retraction r and homotopy D with 1ir=dD+Dd. Its proof constructs them from finite affine subdivision sums and least subdivision counts; hence each preserves the chains on every subspace.

[F3]

The prism operator of a homotopy and The prism triangulation has the stated oriented boundary give a prism P with dP+Pd=H1#H0#. Its formula preserves chains in a subspace which the homotopy preserves.

[F4]

Alexander--Whitney and shuffle are natural chain-homotopy inverses supplies natural AW and shuffle chain maps and natural homotopies for both inverse identities, over R and without choice.

[F5]

Relative singular cochain complex identifies relative cochains with Hom on the relative free chain complex, with positive coboundary. Relative cup product for an excisive triad defines the product first on the quotient by the sum of subspace chain complexes, and then uses a proved quotient-cochain comparison.

Proof

Given: Write W=X×Y, C(Z)=C(Z;R), N=C(A×Y)+C(X×B), E=C(W)/N, and Q=C(W)/C(U). The degreewise bases of these quotients are exactly the singular simplices not in their respective indicated subspace bases. Tensor differentials have the sign d(ce)=dce+(1)ccde.

1.1

Let TX=(X×{0})(A×I) with its subspace topology in X×I. Apply [F1] with target TX, initial map x(x,0) and prescribed homotopy (a,t)(a,t). These maps are continuous into the subspace because their ambient maps are continuous and land in it. The resulting rX:X×ITX fixes TX. Write its coordinates as (HX,hX). Then HX(x,0)=x, HX(a,t)=a, and the open set OX={x:hX(x,1)>0} contains A and satisfies HX(OX,1)A. Indeed a point of TX with positive second coordinate has its first coordinate in A. Repeat this construction for (Y,B) to obtain HY,OY. Only two applications of the choice-free HEP construction are involved. [F1, given] 1.2 Put M=C(A)C(Y)+C(X)C(B)C(X)C(Y). The quotient by M is canonically V=C(X,A)C(Y,B): its basis tensors are precisely pairs of simplices with the first not wholly in A and the second not wholly in B. This identification commutes with the tensor differential since faces in the subspace become zero on either side. Naturality in [F4], applied to each of the two inclusions of pairs of spaces, shows that AW maps N into M, shuffle maps M into N, and their homotopies preserve N and M on their respective sides. They therefore descend to maps a:EV, b:VE and homotopies ab1V, ba1E. This uses naturality of the homotopies as well as of the chain maps; it does not assume that an individual AW cut of a simplex in U belongs to M.

F4given
2.1

The homotopy H((x,y),t)=(HX(x,t),HY(y,t)) preserves both A×Y and X×B, and therefore U. The sets V1=U(OX×Y) and V2=U(X×OY) form an open cover of U: points in A×Y lie in V1, and points in X×B lie in V2. At time one, H maps V1 into A×Y and V2 into X×B. Put F=H1#:C(U)C(U), and let P be its prism. Thus F1=dP+Pd, with P(N)N by the explicit simplex formula in [F3].

F3step 1.1
3.1

Apply [F2] to this open cover of U, writing R=ir for the small-chain retraction regarded as an endomorphism of C(U). We have 1R=dD+Dd. Both R and D preserve chains in A×Y and in X×B: in the cited construction every affine term on a simplex has image inside that simplex's image, and taking finite sums, boundaries and least subdivision counts does not change this property. Hence they preserve N. Since R lands in cover-small chains, step 2.1 gives FR(C(U))N. Combining the two homotopy identities gives 1FR=(1R)+(1F)R=d(DPR)+(DPR)d. Consequently K=DPR preserves N and descends to a contraction k of J=C(U)/N: dk+kd=1J. This contraction is prescribed by the constructions and requires no basis selection.

F2step 2.1
4.1

Regard J as the subcomplex of E spanned by simplices wholly in U but not wholly in either of its two members. Extend k to a graded map e:EJE by zero on all the remaining simplex basis vectors. There is no claim that e commutes with d. The map T=1deed does commute with d and kills J, by step 3.1. Hence it factors as sq, where q:EQ is the canonical quotient and s:QE is a chain map. Since e lands in J, qT=q, so qs=1Q by surjectivity of q. Also sq=1deed. Thus q and s are chain homotopy inverses. With positive coboundary, precomposition by e obeys δ(ϕe)+(δϕ)e=ϕ(de+ed) in the corresponding degrees. This explicitly dualizes the homotopy equivalence, without any appeal to exactness of Hom.

F5step 3.1
5.1

The relative shuffle is qb:VQ, which is well-defined already on the original quotient tensors. Its homotopy inverse is as:QV: (as)(qb)=a(sq)bab1V and (qb)(as)=q(ba)sqs=1Q. Composing the homotopies just written gives actual chain homotopies, and precomposition dualizes each identity as in step 4.1. Since q,a,b come from natural inclusions, quotient maps and [F4], their induced cohomology maps are natural. The inverse of the isomorphism q on cohomology is unique and hence natural too: invert q in each commuting square. No natural choice of the auxiliary s is asserted or needed.

F4step 1.2step 4.1
6.1

For relative cocycles φCp(X,A;R) and ψCq(Y,B;R) define J(φ,ψ)(ce)=φ(c)ψ(e) on the (p,q) summand and zero on all other total-degree summands. Evaluation on the signed tensor differential gives δJ(φ,ψ)=J(δφ,ψ)+(1)pJ(φ,δψ). Thus cocycles give cocycles and changing a representative by a coboundary changes Ja by a coboundary; for a second-factor change the primitive is (1)pJ(φ,θ)a. On E the AW front/back formula for Ja is exactly prXφprYψ. By [F5] and step 4.1 the corresponding class in Hp+q(W,U;R) is (q)1[Ja]=[Jas]. This is the claimed relative external product and its compatibility with the cup construction. Pair pullbacks commute with the evaluations and AW, so step 5.1 also proves its naturality.

F4F5step 1.2step 4.1step 5.1
7.1

If either space is empty or R=0, all product complexes are zero. If A=X or B=Y, then N=C(U)=C(W) and V=Q=0. If A=B=, then N=C(U)=0 and q is the identity, recovering [F4]; with just one empty member the same open-cover and quotient formulas still apply. In degree zero the AW and shuffle identifications are the vertex-pair tensor identification, and prisms still have the top-minus-bottom boundary. A one-point factor retains all its unnormalized higher simplices. No step discards degenerate simplices. The only degree sums are finite sums along a fixed total degree; all negative chain groups are zero. Homotopy times zero and one were checked in steps 1.1–2.1. Finite formulas, least subdivision counts and extension by zero are specified throughout, so the argument uses no choice axiom even in unbounded dimensions.

F3F4step 1.1step 2.1step 3.1step 4.1step 5.1step 6.1

Depends on

Used by

Dependency tree · two levels

43 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