Alphabeta Math
TheoremStatement: 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 universal coefficient theorem for homology over a PID

Statement

Assume the Axiom of Choice. Let R be a PID, C a chain complex of free right R-modules, and G a left R-module. Then naturally in C,G, 0→Hn(C)⊗RG→Hn(C⊗RG)→Tor⁡1R(Hn−1(C),G)→0 is exact.

Proof

Given: the Axiom of Choice and the two cycle-boundary short exact sequences of the free PID-complex C.

1.1given

The cycle and boundary modules are free, hence flat. Since Bn−1C is flat, tensoring 0→ZnC→Cn→Bn−1C→0 remains exact. The differential on Cn⊗G factors as the resulting surjection Cn⊗G↠Bn−1C⊗G followed by the map Bn−1C⊗G→Zn−1C⊗G↪Cn−1⊗G. The last inclusion stays injective because Bn−2C is flat.

2.1step 1.1algebra

Tensoring BnC→ZnC→Hn(C)→0 gives Hn(C)⊗G=coker⁡(BnC⊗G→ZnC⊗G). By step 1.1, ZnC⊗G embeds in Cn⊗G, and the image of BnC⊗G there is exactly the boundary group. Thus the edge map [z]⊗g↦[z⊗g] injects Hn(C)⊗G into Hn(C⊗G).

3.1step 1.1step 2.1algebra∎

The remaining quotient maps by dn⊗1 onto ker⁡(Bn−1C⊗G→Zn−1C⊗G). The free presentation 0→Bn−1C→Zn−1C→Hn−1C→0 identifies this kernel with Tor⁡1R(Hn−1C,G). All maps come from the natural cycle, boundary and tensor maps, so the sequence is natural in C and G.

Depends on

Used by

Dependency tree · two levels

10 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