Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 coefficient spectral sequence

Statement

Let C be a bounded-below chain complex of projective left R-modules and M a left R-module. Supply a projective Cartan–Eilenberg grid for C: its augmented vertical complexes on terms, horizontal cycles, horizontal boundaries, and horizontal homology are named projective resolutions, and its two horizontal structure sequences are split exact in every bidegree. Let PqHqC denote the supplied homology-object resolution in degree q. Then E2p,q=ExtPqp(HqC,M)Hp+q(HomR(C,M)) is strongly convergent with a finite decreasing filtration by resolution degree. Here Hom(C,M)n=Hom(Cn,M) and δf=fdC. The page differential has degree (r,1r). If Cq=0 for q<b, translate q by b; the original target degree remains p+q. Naturality and resolution-independent notation require DC or the supplied comparisons and homotopies of the hypercohomology theorems. Under that resolution-independent convention one may suppress Pq and write the page as ExtRp(HqC,M).

Facts & Assumptions

Given: The ring, modules, projective complex and supplied data above.

[F1]

Opposite abelian categories are abelian (The opposite of an abelian category is abelian).

[F2]

The two hypercohomology sequences have termwise-derived first page and derived-cohomology second page, with finite convergence (First hypercohomology spectral sequence, Second hypercohomology spectral sequence).

[F3]

Projective-model Ext is the cohomology of Hom of the projective resolution into the second argument (Ext via a projective resolution of the first variable).

[F4]

The Hom cochain convention is degree n equal to Hom from Cn, with precomposition differential (The Hom cochain complex of a chain complex).

Proof

1.1

Regard Cq as a cochain complex in (R-Mod)op, keeping the index q. The supplied projective Cartan–Eilenberg grid becomes injective Cartan–Eilenberg data there; cycles and boundaries exchange their kernel/cokernel descriptions and the homology object becomes the same cohomology object. The functor HomR(,M) from this opposite category to abelian groups is additive and left exact: a map on a quotient is exactly a map vanishing on the submodule. On the homology object in degree q, F3 identifies its relative derived objects with ExtPqp(HqC,M). Apply F2.

F1F2F3
2.1

The horizontal-first sequence therefore has second page ExtPqp(HqC,M). In the other sequence the first page is the relative Ext computed from the supplied term resolution of Cq. For p>0 it vanishes: because Cq is projective, the first epimorphism in that resolution splits, its kernel is a projective summand, and the next epimorphism splits in turn. For each fixed degree this finite induction splits all short exact sequences needed to calculate that degree; Hom sends them to split exact sequences. In degree zero the kernel identification gives HomR(Cq,M). Thus the other sequence collapses after its cochain differential to the cohomology in F4.

F2F3F4step 1.1
3.1

The one-row collapse identifies the common total target with Hn(Hom(C,M)). The second sequence retains its resolution-degree filtration, with endpoints zero and nb+1 in degree nb. F2 gives strong convergence and the stated bidegree and comparison naturality. At n=b there is a single possible quotient; for C=0 with zero data everything is zero. The finite splitting argument in step 2.1 introduces no additional choice beyond the supplied data; global comparison conventions remain those of F2.

F2F4step 2.1

Depends on

Used by

Dependency tree · two levels

20 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