Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 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.

Universal coefficients in degree two

Statement

Assume the Axiom of Choice and supplied projective and injective resolution data for group (co)homology. For a trivial G-module A, there is a natural exact sequence

0→Ext⁡Z1(Gab,A)→H2(G;A)→Hom⁡(M(G),A)→0.

It admits a splitting after choices; no natural splitting is asserted.

Facts & Assumptions

Given: The choice and resolution hypotheses above. Use the explicit free bar resolution P∙→Z over ZG, and put C∙=Z⊗ZGP∙. The bar-comparison theorem identifies Hom⁡ZG(P∙,A) with the derived cohomology computed from the supplied injective resolution.

[L1]

The cohomological universal-coefficient theorem gives the natural degree-two short exact sequence for a degreewise free integral chain complex (The universal coefficient theorem for cohomology over a PID).

[L2]

This sequence splits after choices of complements, with no natural splitting asserted (The cohomology universal-coefficient sequence splits nonnaturally).

Proof

technique · direct
1.1L1givenalgebra

Each Cn is free abelian on Gn. Because A has trivial G-action, the tensor-Hom adjunction gives a natural isomorphism Hom⁡Z(C∙,A)≅Hom⁡ZG(P∙,A). The latter cochain complex computes H∗(G;A) by The bar cochain complex computes group cohomology, while H∗(C∙) computes integral group homology under the supplied resolution data. Choice permits [L1] to be applied to the free integral complex C∙. In degree two it gives 0→Ext⁡Z1(H1(G;Z),A)→H2(G;A)→Hom⁡Z(H2(G;Z),A)→0.

2.1L2step 1.1algebra∎

Since H1(G;Z)=Gab and H2(G;Z)=M(G), this is the displayed sequence. The splitting qualification follows from [L2].

Depends on

Used by

Dependency tree · two levels

31 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