Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (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 homological universal-coefficient Tor obstruction map

Statement

Assume the Axiom of Choice. Let C be a chain complex of free right R-modules over a PID and G a left R-module. The cycle-boundary sequences induce a natural map Hn(C⊗RG)→Tor⁡1R(Hn−1C,G).

Proof

Given: AC, C, G and n as above. Write Bj=im⁡dj+1 and Zj=ker⁡dj.

1.1given

AC is used in Boundaries and cycles in a free complex over a PID are free to make Bj and Zj free, hence flat, even for infinitely generated Cj. Thus 0→Bn−1→Zn−1→Hn−1C→0 is a supplied free resolution of length one. Tensoring it with G identifies Tor⁡1R(Hn−1C,G) with T:=ker⁡(Bn−1⊗RG→Zn−1⊗RG). AC also implies the DC premise used for comparison of supplied resolutions in The balanced Tor bifunctor, so this kernel represents the stated balanced Tor group naturally.

2.1step 1.1

Corestrict dn:Cn↠Bn−1 before tensoring. Let dˉn⊗1:Cn⊗G→Bn−1⊗G denote the resulting surjection. If c∈Cn⊗G is a cycle, then the composite of dˉn⊗1 with Bn−1⊗G→Zn−1⊗G→Cn−1⊗G is zero. The last arrow is injective: tensor 0→Zn−1→Cn−1→Bn−2→0 and use flatness of Bn−2. Hence (dˉn⊗1)c∈T. If c=(dn+1⊗1)b, then dˉndn+1=0, so this element is zero. We obtain a homomorphism on homology.

3.1step 1.1step 2.1∎

A chain map f:C→C′ restricts to maps of the corresponding B and Z modules; together with a coefficient map G→G′ (over the same ring), these maps commute with the corestricted differentials and the inclusions defining T. Thus the cycle formula commutes with them. Naturality of the free-resolution kernel identification with Tor follows from the comparison and coherence built into The balanced Tor bifunctor. The map is surjective as well: Cn⊗G↠Bn−1⊗G is surjective by right exactness, and any lift of an element of T is a cycle since Zn−1⊗G↪Cn−1⊗G. Surjectivity is recorded to identify the obstruction map used by the universal-coefficient exact sequence, though no splitting is claimed here.

Depends on

Used by

Dependency tree · two levels

13 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