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.

Hyper-Tor spectral sequence

Statement

For a right R-module M, a bounded-below chain complex K of left R-modules and supplied projective Cartan–Eilenberg data P→K, there is a strongly convergent spectral sequence Ep,q2=Tor⁡pR(M,HqK)⟹Hp+q(M⊗RLK). Here the derived tensor is represented by M⊗RTot⁡P, p is resolution degree, and dr has degree (−r,r−1). For Kq=0 below b, translate q by b; its target filtration is finite in each degree. Naturality and independence require DC or supplied projective comparisons and homotopies.

Facts & Assumptions

Given: M,K,P,b and the comparison qualification above.

[F1]

The Künneth theorem states the projective homological Cartan–Eilenberg grid clauses and supplies naturality and resolution independence under DC or corresponding supplied projective comparisons and homotopies (Kunneth Tor spectral sequence).

[F2]

Tor by a supplied projective resolution of a left module is the homology after tensoring with the right module (Tor from a projective resolution of the left module).

[F3]

The row filtration computes horizontal homology first and has a finite image-filtration abutment (The row filtration spectral sequence of a first quadrant double complex).

Proof

1.1F1F3

Form the double complex M⊗RPq,p and filter by resolution degree p. For every p, the horizontal complex P∗,p is split into its homology and contractible identity disks. Tensoring preserves those split identities, so its horizontal homology is canonically M⊗RHq(P∗,p). This identification comes from tensors of cycles and is independent of the splittings used to verify it.

2.1F1F2F3step 1.1

The vertical complex Hq(P∗,p), augmented to HqK, is a projective resolution. The differential on the first page is its induced signed resolution differential. Taking its degree-p homology gives Tor⁡pR(M,HqK) by F2. To verify the target model directly, filter the augmented total Tot⁡P→K by original complex degree. Its first page is K in resolution degree zero and zero in higher resolution degrees because the augmented term columns in F1 are exact. Finite diagonals therefore make the augmentation a quasi-isomorphism. Each total term is a finite biproduct of projectives and hence projective, so this bounded-below total is the displayed supplied projective model for M⊗RLK.

3.1F1F2F3step 2.1∎

F3 supplies strong convergence and the image filtration, with F−1=0 and Fn−b=Hn in total degree n≥b. If n<b the target is zero; for n=b there is one possible quotient. Under DC or the corresponding supplied projective comparisons and homotopies, F1's naturality and resolution-independence assertion applies to this one-factor specialization; tensoring a comparison or homotopy with M preserves its equations and the resolution-degree filtration. Hence the sequence is independent from E2 onward and on the target under exactly the stated qualification. For a stalk K this reduces to the ordinary Tor construction in F2, and zero M gives zero throughout.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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