Alphabeta Math
TheoremStatement: 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.

Topological Kunneth short exact sequence for homology

Statement

Assume AC. Let R be a commutative PID and X,Y any spaces. For n0 there is a natural short exact sequence 0p+q=nHp(X;R)RHq(Y;R)×Hn(X×Y;R)γp+q=n1Tor1R(Hp(X;R),Hq(Y;R))0. All indices are nonnegative, and an empty sum is zero. The left map is the singular cross product. Naturality is covariant in maps of both spaces; no choice of a splitting is part of this sequence.

Facts & Assumptions

[F1]

The natural PID Kunneth sequence is exact gives the natural exact sequence for nonnegative arbitrary-rank free PID complexes, with left map [z][w][zw] and canonical Tor quotient β.

[F2]

Singular product chain equivalence by simplex models supplies a natural shuffle equivalence S:C(X;R)RC(Y;R)C(X×Y;R), with explicit inverse and homotopies. Its map on generators is The singular chain cross product on generators.

[F3]

Singular coefficient chains are free on singular simplex sets, as specified in Singular cochain complex with coefficients. AC is assumed as in The Axiom of Choice.

Proof

Given: R,X,Y,n as stated. Put C=C(X;R), D=C(Y;R), V=Hn(CRD), and W=Hn(X×Y;R).

1.1

Both complexes are nonnegative and free in every degree by [F3], with no finite-rank assumption. Their tensor differential is exactly that in [F1] and [F2]. Thus [F1] applies and gives 0KαVβQ0 with the two direct sums in the statement. All tensor-degree diagonals are finite since p,q0.

F1F2F3given
1.2

A chain homotopy changes the image of a cycle by a boundary: if uv=dH+Hd and dz=0, then uzvz=dHz. Hence the inverse and homotopies in [F2] give mutually inverse homology maps s=S:VW and t=T:WV. Put γ=βt. Although a chain inverse was constructed, its homology map is uniquely s1; thus γ is independent of any inverse choices.

F2given
2.1

Define the left arrow as sα. It sends [z][w] to [S(zw)]=[z×w], the singular cross product of [F2]. It is injective because s and α are injective. For xW, γx=0 exactly when txkerβ=imα, exactly when xim(sα). Finally any qQ equals βv for some vV, and γ(sv)=q, proving surjectivity. This verifies the exactness of the actual displayed arrows.

F1F2step 1.1step 1.2
3.1

For maps f:XX and g:YY, naturality of the shuffle gives s(f#g#)=(f×g)s. Multiplying by the inverse maps yields t(f×g)=(f#g#)t. Naturality of α,β in [F1] now gives both squares of the topological sequence. The left square also follows directly from the cycle cross-product formula. No chosen cycle projections appear in these arrows.

F1F2step 1.1step 1.2step 2.1
4.1

At n=0, the Tor sum is empty and the cross product is an isomorphism H0(X;R)RH0(Y;R)H0(X×Y;R). At n=1, the sole Tor index pair is (0,0), as stated. Empty X or Y gives zero complexes and a zero sequence. On the degree-zero class of a pair of point simplices, the cross product is that point in the product, including coefficient 1. AC is inherited from the free PID theorem [F1] for its cycle/boundary and resolution constructions; the shuffle equivalence introduces none. There is no upper-degree or dimension restriction.

F1F2F3step 1.1step 1.2step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

17 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