Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)verified 2026-09-10 (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.

Positive Tor vanishes when the resolved variable is projective

Statement

If the variable being resolved is projective, its resolution-defined Tor⁡iR vanishes for every i>0.

This holds for every supplied projective resolution, over an arbitrary unital ring, without AC or dependent choice.

Facts & Assumptions

[F1]

Projectivity is the lifting property for surjective module maps (Projective modules and the lifting property); the right-module version uses the same lifting property with right-linear maps.

[L1]

Tensor maps induced by module homomorphisms exist uniquely, and preserve sums, identities and composition: check these identities on elementary tensors using Universal property of the tensor product for balanced maps into abelian groups.

[F2]

The two resolution constructions are the homology of the supplied tensored complexes (Tor from a projective resolution of the left module, Tor from a projective resolution of the right module).

Proof

Given: a projective left module M, a right module N, a supplied projective resolution P∙→M, and an integer i>0.

1.1givenF2

Put K−1=M, let q0:P0→K−1 be the augmentation, and put K0=ker⁡q0. For j≥1, exactness factors the differential as dj=ιj−1qj, where qj:Pj↠Kj−1 is surjective, Kj=ker⁡qj, and ιj:Kj↪Pj is inclusion.

2.1F1step 1.1algebra

If Kj−1 is projective, [F1] applied to its identity gives a section sj:Kj−1→Pj of qj. The map p↦p−sjqj(p) takes values in Kj; write it rj:Pj→Kj. Then rjιj=1 and ιjrj+sjqj=1. A retract of a projective module is projective: for f:Kj→B and a surjection E→B, lift frj:Pj→B and restrict the lift along ιj. Thus Kj is projective.

3.1givenstep 2.1

Starting with the projective K−1=M, repeat step 2.1 through j=i+1. This is a finite succession of existential choices for the fixed integer i, not a simultaneous choice of splittings in all degrees. It needs neither AC nor dependent choice.

4.1L1step 1.1step 2.1step 3.1algebra

Write T(f)=1N⊗f. If z∈N⊗RPi is a cycle, then T(ιi−1)T(qi)z=0. Since T(ri−1)T(ιi−1)=1, it follows that T(qi)z=0. The identity from step 2.1 therefore gives z=T(ιi)T(ri)z.

5.1L1step 1.1step 2.1step 4.1algebra

Set w=T(si+1)T(ri)z∈N⊗RPi+1. Then T(di+1)w=T(ιi)T(qi+1)T(si+1)T(ri)z=T(ιi)T(ri)z=z. Every cycle is a boundary, so Hi(N⊗RP∙)=0.

6.1F1F2L1step 1.1step 2.1step 3.1step 4.1step 5.1∎

For a projective right module N and any supplied right projective resolution Q∙→N, perform the same construction with right-linear maps and apply T(f)=f⊗1M. The identities in steps 4.1 and 5.1 are unchanged and give Hi(Q∙⊗RM)=0. Since i>0 was arbitrary, [F2] gives both claimed vanishings for every supplied resolution, without selecting a family of splittings over all i.

Depends on

Used by

Dependency tree · two levels

13 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