Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Higher Tor over the integers vanishes

Statement

Assume the Axiom of Choice. Every abelian group has a projective resolution of length at most one, and for abelian groups A,B, Tor⁡iZ(A,B)=0 for i≥2.

Separately, without any choice assumption, a supplied projective resolution 0→P1→P0→A→0 satisfies Hi(P∙⊗ZB)=0 for i≥2. This last clause is a calculation for the specified resolution, not an assertion of its existence or of change-of-resolution coherence in ZF.

Proof

Given: abelian groups A,B; AC for the existence and balanced-Tor assertions, or the supplied short resolution for the final conditional clause.

1.1givenconstruct

The canonical free cover ε:Z(A)↠A exists by Every module is a quotient of a free module. The integers are a PID: a nonzero ideal has a least positive integer d by The well-ordering principle, and division with remainder by d from Division with remainder in Z: for a∈Z and b>0 there are unique q,r∈Z with a=qb+r and 0≤r<b shows that every element is a multiple of d; the zero ideal is principal as well.

1.2givenalgebra

For any supplied length-one projective resolution P∙→A, the tensor complex P∙⊗B has zero terms in every degree i≥2. Its homology in those degrees is therefore zero. This proves the conditional choice-free clause and the corresponding right-resolution construction of Tor from a projective resolution of the right module.

2.1step 1.1givenconstruct

Write F=Z(A) and K=ker⁡ε. Under The Axiom of Choice, well-order its standard basis index set A by The well-ordering theorem. For an index a write F≤a and F<a for the spans of the indicated initial segments. Let Ia≤Z be the image of K∩F≤a under the a-coordinate map. The integer calculation of step 1.1 gives Ia=daZ with da>0 if it is nonzero.

3.1step 2.1givenchoose

For every a with Ia≠0, the set of vectors x∈K∩F≤a having a-coordinate da is nonempty. AC chooses one such xa for every such index at once. Each vector has finite support by The free module on a set and its standard basis. These simultaneous lifts and the preceding well-order are the two uses of AC in kernel freeness.

4.1step 2.1step 3.1algebra

Use Transfinite induction on the basis order to prove that K∩F≤a is spanned by the xb with b≤a. For y in that subgroup, if Ia=0 its a-coordinate is zero; otherwise write that coordinate as cda and subtract cxa. The resulting vector lies in K∩F<a. If it is nonzero, its finite support has a greatest index b<a, and the induction hypothesis at b applies. A zero remainder needs no terms. This proves the assertion at least, successor, and limit positions alike. Every nonzero member of K has a greatest support index, so the chosen family spans K.

5.1step 2.1step 3.1step 4.1algebra

In a nonzero finite integer relation among the xa, take the greatest index a with nonzero coefficient ca. Its a-coordinate is cada≠0, since every lower-index vector has zero coordinate there. This contradicts the relation. Thus the family is independent and is a basis of K; the empty family correctly handles K=0.

6.1step 1.1step 5.1givenalgebra

By Free modules are projective, with the exact choice boundary, AC makes both K and F projective. Hence 0→K→F→A→0 is a projective resolution of length at most one. This last use of AC selects preimages of arbitrary basis families in the free-projectivity theorem; the canonical free cover itself used no choice.

7.1step 6.1step 1.2givenalgebra∎

To obtain DC locally, given an entire relation E on a nonempty set X and x0∈X, AC chooses s(x)∈{y:xEy} for every x∈X; The recursion theorem then gives xn+1=s(xn) from the prescribed x0. This proves the exact DC hypothesis of The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain. The short resolutions from step 6.1 (also applied to B) and that DC hypothesis permit The balanced Tor bifunctor to identify the specified-resolution homology with the balanced groups Tor⁡iZ(A,B). Step 1.2 gives their vanishing for all i≥2. This accounts separately for the choice needed by the change-of-resolution interface.

Depends on

Used by

Dependency tree · two levels

54 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