Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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.

The Kunneth Tor map

Statement

Assume the Axiom of Choice. Let R be a PID and C,D complexes of free R-modules with finite diagonals. For every n∈Z, the cycle-boundary presentations induce a natural surjection πn:Hn(C⊗RD)⟶⨁p+q=n−1Tor⁡1R(HpC,HqD).

Facts & Assumptions

Given: The stated ring, complexes, Choice hypothesis, and degree n; all tensor complexes use the direct sum and Koszul differential.

[A1]

The Axiom of Choice is The Axiom of Choice. It supplies the arbitrary bases and projective splittings in [F2]. It also implies The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain: for a serial relation on a set X, choose one successor for every x∈X, then iterate that fixed successor function from any prescribed starting point. This DC consequence licenses the comparison naturality in [F4] used in step 5.1.

[F3]

A short exact sequence of complexes gives a long exact homology sequence The long exact sequence in homology, naturally in its maps The long exact homology sequence is natural.

[F4]

Under the DC consequence of [A1], Tor can be computed naturally from a supplied projective resolution of its first variable: The balanced Tor bifunctor.

Proof

technique · direct
1.1F1F2givenconstruct

Let Z and A be the complexes with zero differential and Zp=ZpC, Ap=Bp−1C. Inclusion and the corestriction of dC give 0→Z→C→ρA→0. This is a sequence of chain complexes because dC vanishes on cycles and ρdC=0. Each degree sequence splits by [F2]. Tensoring with D and taking direct-sum total complexes therefore gives a short exact sequence 0→X=Z⊗D→T=C⊗D→r=ρ⊗1Y=A⊗D→0.

2.1F2step 1.1algebra

Since Zp and Ap are free, tensoring with either is a direct sum of copies and commutes with homology. Thus HnX=⨁p+q=nZpC⊗HqD and HnY=⨁p+q=nBp−1C⊗HqD. The differential on a fixed p summand is (−1)pdD, which has the same cycles and boundaries as dD.

3.1F1F3step 1.1step 2.1construct

The connecting map ∂n:HnY→Hn−1X is the direct sum of the maps induced by Bp−1C↪Zp−1C. Indeed, represent a summand by a finite sum of b⊗y with y a cycle in D, and lift b to c∈Cp with dCc=b. Then dT(c⊗y)=b⊗y, with no second term. This is the defining connecting-map calculation, so its sign is positive.

4.1F1F2F4step 3.1algebra

The free presentation 0→Bp−1C→Zp−1C→Hp−1C→0 is a length-one projective resolution. Hence [F4] identifies ker⁡(Bp−1C⊗HqD→Zp−1C⊗HqD) with Tor⁡1R(Hp−1C,HqD). Therefore ker⁡∂n is exactly the displayed Tor sum after reindexing p−1.

5.1A1F3F4step 1.1step 4.1algebra∎

By [F3], Hn(r) has image ker⁡∂n. Define πn as Hn(r) corestricted to this kernel and followed by the identification in step 4.1. It is well defined on homology and surjective. A pair of chain maps induces maps of the sequence in step 1.1 and of the free presentations in step 4.1, so [F3] and the comparison naturality in [F4], licensed by [A1], prove naturality of πn. Empty sums and zero modules cause no exception.

Depends on

Used by

Dependency tree · two levels

35 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