Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-23 (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 cohomological universal-coefficient extension map

Statement

Assume the Axiom of Choice and the supplied balanced-Ext resolution hypotheses of The balanced Ext bifunctor. For a free R-complex over a PID, the cycle-boundary sequences induce a natural map Ext⁡R1(Hn−1C,G)→HnHom⁡R(C,G).

Proof

Given: AC, the supplied balanced-Ext data, a free PID-complex C, an R-module G, and the cycle-boundary sequence 0→Bn−1C→Zn−1C→Hn−1C→0.

1.1given

AC makes Bn−1C and Zn−1C free by Boundaries and cycles in a free complex over a PID are free, hence projective by Free modules are projective, with the exact choice boundary. The displayed short exact sequence is therefore a length-one projective resolution of Hn−1C. By Ext can be computed from any projective resolution of the first variable, using AC to meet its DC premise and the supplied balanced-Ext data, its degree-one cohomology identifies Ext⁡R1(Hn−1C,G) with Hom⁡R(Bn−1C,G) modulo restrictions of maps Zn−1C→G.

2.1step 1.1construct

For ψ:Bn−1C→G, define the degree-n cochain ψdn:Cn→G. It is a cocycle because dndn+1=0. If ψ changes by g∣Bn−1C for g:Zn−1C→G, projectivity of Bn−2C splits Cn−1↠Bn−2C, giving a projection πn−1:Cn−1→Zn−1C. Then (g∣B)dn=(gπn−1)dn is a coboundary, since πn−1dn=dn. Thus [ψ]↦[ψdn] descends from the quotient in step 1.1 to the claimed cohomology group.

3.1step 1.1step 2.1algebra∎

For a chain map u:C→D, the pullback of ψdnD equals (ψ un−1∣Bn−1C)dnC because u commutes with differentials. This is the map induced on the two projective presentations. Postcomposition with a coefficient map G→G′ also commutes exactly with the construction. Hence the resulting map is natural in the complex and in G; the projection used in step 2.1 establishes descent but is absent from the map itself.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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