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 homology universal-coefficient sequence splits nonnaturally

Statement

Assume the Axiom of Choice. For a chain complex C of free abelian groups and an abelian group G, the homological UCT short exact sequence admits a splitting. The splitting is not asserted to be natural in C or G.

Proof

Given: AC, the free abelian groups Cn, and the UCT short exact sequence of The universal coefficient theorem for homology over a PID. Write Zk=ker⁡dk and Bk=im⁡dk+1.

1.1given

By Boundaries and cycles in a free complex over a PID are free under AC, Bn−1 and Bn−2 are free abelian. Choose a basis of Bn−1 and a preimage in Cn of each basis element. AC supplies these choices, which extend to a homomorphism s:Bn−1→Cn with dns=id⁡. Hence Cn=Zn⊕s(Bn−1). The same argument gives Cn−1=Zn−1⊕s′(Bn−2), so the inclusion Zn−1⊗G→Cn−1⊗G is injective.

2.1step 1.1given∎

The free presentation 0→Bn−1→iZn−1→Hn−1(C)→0 identifies T:=ker⁡(i⊗1:Bn−1⊗G→Zn−1⊗G)≅Tor⁡1Z(Hn−1(C),G). For t∈T, the element (s⊗1)(t) is a cycle in Cn⊗G: its differential is the image of (i⊗1)(t)=0 in Cn−1⊗G. Thus σ:T⟶Hn(C⊗G),t⟼[(s⊗1)(t)] is a well-defined homomorphism. The UCT quotient map of the cited theorem first takes a cycle to its Bn−1⊗G component under Cn⊗G=(Zn⊗G)⊕(Bn−1⊗G) and then identifies that component with T. Consequently its composite with σ is the identity on T, giving the asserted splitting. The chosen section s need not be preserved by chain maps, so this construction makes no naturality claim.

Depends on

Used by

Dependency tree · two levels

8 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