Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)verified 2026-09-09 (codex)
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 left and right projective constructions of Tor are naturally isomorphic

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). For every right R-module N and left R-module M with supplied projective resolutions Q∙→N and P∙→M, there is a natural isomorphism Hi(N⊗RP∙)≅Hi(Q∙⊗RM).

Proof

Given: the first-quadrant double complex Kp,q=Qp⊗RPq with finite direct-sum totalization.

1.1givenconstruct

The augmentations give degreewise surjective chain maps a:Tot⁡K→N⊗RP∙ and b:Tot⁡K→Q∙⊗RM, supported respectively on p=0 and q=0. Their surjectivity and exact augmented fixed-q and fixed-p complexes follow from The augmented fixed-q rows of the tensor double complex are exact and The augmented rows of the tensor double complex are exact, respectively. The differential is dh+dv, with dv=(−1)p(1⊗dP) as in The first-quadrant tensor double complex of two projective resolutions.

2.1step 1.1algebra

The kernel of a is the total of the double complex obtained by replacing K0,q by ker⁡(Q0⊗Pq→N⊗Pq). Every fixed-q horizontal complex is exact. For a total cycle z of degree n≥0, take its largest nonzero q component zp,q. The cycle equation at that q says dhzp,q=0, because the next higher q component is zero. Horizontal exactness gives yp+1,q with dhy=zp,q. Subtracting dy removes that component and introduces only a component at q−1. Repeating terminates at q=0 and expresses z as a boundary. Thus ker⁡a is acyclic, including degree zero; negative degrees are zero. This is the filtration by q, not by p.

2.2step 1.1algebra

The kernel of b is obtained by replacing Kp,0 by ker⁡(Qp⊗P0→Qp⊗M). Its fixed-p vertical complexes are exact, with multiplication of their differentials by (−1)p harmless. Now eliminate a cycle's largest p component by solving dvy=zp,q in bidegree (p,q+1). Subtracting dy leaves only lower p components; finitely many repetitions show that ker⁡b is acyclic. This uses the filtration by p, not by q.

3.1step 2.1step 2.2algebra

The short exact sequences of each kernel, total complex and edge, together with The long exact sequence in homology, make both a and b quasi-isomorphisms. Hence Hi(N⊗RP∙)←Hi(a)Hi(Tot⁡K)→Hi(b)Hi(Q∙⊗RM) gives the asserted isomorphism Hi(b)Hi(a)−1.

4.1step 3.1algebra∎

Under DC, maps of modules lift to maps of their supplied resolutions by Projective comparison maps exist. The resulting tensor double-complex maps commute with a,b, proving naturality of the ratio in step 3.1. Two lifts are chain-homotopic by Projective comparison maps are unique up to chain homotopy. Tensor homotopies in the first factor are hQ⊗1 and in the second factor (−1)p1⊗hP; direct substitution gives the total homotopy equation. Thus induced homology maps are independent of lifts. Taking module identities also gives independence and coherence under change of the supplied resolutions.

Depends on

Used by

Dependency tree · two levels

34 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