Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 map and diagonal approximation

Definition

Let X,Y be spaces and R a commutative unital ring, allowing R=0. Use ordinary, unnormalized singular chains, with the coefficient convention in Singular cochain complex with coefficients. Put Fn(X,Y;R)=p+q=nCp(X;R)RCq(Y;R),d(ab)=ab+(1)pab(aCp(X;R)). Negative chain degrees and the boundary of a vertex are zero. For a simplex σ:ΔnX×Y, write x=prXσ and y=prYσ. The Alexander–Whitney map is the linear map AWn:Cn(X×Y;R)Fn(X,Y;R),AWn(σ)=p=0nx[0,,p]y[p,,n]. Here x[i0,,ik] means restriction along the affine face with that ordered vertex list. The formula gives a finite chain for each generator and extends uniquely linearly; it does not require choosing representatives or fillings. Projections and the diagonal are continuous in the binary product topology. With the postcomposition maps of The induced singular chain map of a continuous map, the diagonal approximation is DX=AWΔ#:C(X;R)F(X,X;R),Δ(x)=(x,x).

For completeness, the formula is a chain map. In dAW(σ), the first-factor faces at cut p1 have signs (1)i, 0ip; the second-factor faces at cut pn1 have signs (1)j, pjn. The first-factor term deleting its last vertex at cut p is (1)px[0,,p1]y[p,,n]. It cancels the second-factor term deleting its first vertex at cut p1, whose sign is (1)p1. All remaining first-factor terms have i<p; they are precisely the cuts of the face of σ omitting i in which the omitted vertex lies before the cut. All remaining second-factor terms have j>p and are precisely those with the omitted vertex after the cut. Each has the sign of that face in σ. This exhausts AW(σ) and proves dAW=AW. In degree zero both sides are zero, as required. The same face calculation shows that postcomposition commutes with ; hence DX is also a chain map.

For continuous f:XX and g:YY, face restriction commutes with postcomposition, term by term, giving AW(f×g)#=(f#g#)AW,DXf#=(f#f#)DX. In degree zero AW sends (x,y) to xy, preserving the augmentation that assigns 1 to each vertex. If a factor is empty, both complexes are zero; the same holds over the zero ring. For one-point factors the formula still uses all higher singular simplices: degenerate simplices have not been discarded. The cancellation also applies to these simplices because it is an identity of face maps. Only finite sums and specified maps were used. No AC is assumed, and the arbitrary-product nonemptiness clause of the product definition is not used.

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