Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)verified 2026-09-09 (gpt-6-astra)
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 long exact Tor sequence in the right-module variable

Statement

Assume Dependent Choice (DC). For a short exact sequence 0→N′→N→N′′→0 of right R-modules and a left module M with a supplied projective resolution, there is a natural exact sequence ⋯→Tor⁡iR(N′,M)→Tor⁡iR(N,M)→Tor⁡iR(N′′,M)→∂iTor⁡i−1R(N′,M)→⋯ . Its degree-zero tail is Tor⁡1R(N′′,M)→∂1N′⊗RM→N⊗RM→N′′⊗RM→0. The sequence is natural in morphisms of short exact sequences and in maps of left modules equipped with projective resolutions. Tor can be computed using that left resolution, or using the balanced identification whenever resolutions on the other side are supplied.

Proof

Given: the displayed short exact sequence, a projective resolution P∙→M, and The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain for resolution comparisons.

1.1givenconstruct

Each Pj is flat by Projective left and right modules are flat over an arbitrary ring, whose projective-to-flat implication is choice-free and valid over arbitrary rings. Therefore 0→N′⊗RP∙→N⊗RP∙→N′′⊗RP∙→0 is a degreewise short exact sequence of complexes. No horseshoe resolution or commutative-ring tensor theorem is needed.

2.1step 1.1algebra

Apply The long exact sequence in homology to step 1.1. Its homology groups are the left-resolution Tor groups in The balanced Tor bifunctor. The degree-zero identifications of Degree-zero Tor is the tensor product in either construction give the displayed tensor tail; negative homology is zero because the complexes are nonnegative.

3.1step 1.1step 2.1algebra

A morphism of right-module short exact sequences gives a morphism of the complexes in step 1.1. Under DC, a map between left modules lifts to a comparison of their supplied resolutions as in Each resolution-defined Tor construction is covariant in both variables. Tensoring this comparison also gives a morphism of the three complexes. In both cases Naturality of the homology connecting morphism proves the connecting squares commute. The covariance proposition makes the edge homology maps independent of comparison lifts, so replacing P identifies the whole exact sequence canonically.

4.1step 2.1step 3.1algebra∎

The identifications in The Tor balance isomorphism is natural and coherent under a change of resolutions transport these connecting maps to any supplied right-resolution presentations of the same Tor groups. Thus the sequence defines the stated balanced natural sequence, with the boundary defined by step 2.1 and transported coherently.

Remarks

With P∙→M fixed, steps 1.1–2.1 and naturality in the right-module short exact sequence require no choice axiom. DC is used for comparison with arbitrary other supplied resolutions and maps of left modules, not for exactness of the fixed tensor-complex sequence itself.

Depends on

Used by

Dependency tree · two levels

39 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