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 , for .
Separately, without any choice assumption, a supplied projective resolution satisfies for . 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 ; AC for the existence and balanced-Tor assertions, or the supplied short resolution for the final conditional clause.
The canonical free cover exists by Every module is a quotient of a free module. The integers are a PID: a nonzero ideal has a least positive integer by The well-ordering principle, and division with remainder by from Division with remainder in : for and there are unique with and shows that every element is a multiple of ; the zero ideal is principal as well.
For any supplied length-one projective resolution , the tensor complex has zero terms in every degree . 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.
Write and . Under The Axiom of Choice, well-order its standard basis index set by The well-ordering theorem. For an index write and for the spans of the indicated initial segments. Let be the image of under the -coordinate map. The integer calculation of step 1.1 gives with if it is nonzero.
For every with , the set of vectors having -coordinate is nonempty. AC chooses one such 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.
Use Transfinite induction on the basis order to prove that is spanned by the with . For in that subgroup, if its -coordinate is zero; otherwise write that coordinate as and subtract . The resulting vector lies in . If it is nonzero, its finite support has a greatest index , and the induction hypothesis at applies. A zero remainder needs no terms. This proves the assertion at least, successor, and limit positions alike. Every nonzero member of has a greatest support index, so the chosen family spans .
In a nonzero finite integer relation among the , take the greatest index with nonzero coefficient . Its -coordinate is , since every lower-index vector has zero coordinate there. This contradicts the relation. Thus the family is independent and is a basis of ; the empty family correctly handles .
By Free modules are projective, with the exact choice boundary, AC makes both and projective. Hence 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.
To obtain DC locally, given an entire relation on a nonempty set and , AC chooses for every ; The recursion theorem then gives from the prescribed . This proves the exact DC hypothesis of The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain. The short resolutions from step 6.1 (also applied to ) and that DC hypothesis permit The balanced Tor bifunctor to identify the specified-resolution homology with the balanced groups . Step 1.2 gives their vanishing for all . This accounts separately for the choice needed by the change-of-resolution interface.
Depends on
- The balanced Tor bifunctor
- Tor from a projective resolution of the right module
- Every module is a quotient of a free module
- The free module on a set and its standard basis
- The well-ordering theorem
- Transfinite induction
- Free modules are projective, with the exact choice boundary
- Division with remainder in $\mathbb{Z}$: for $a \in \mathbb{Z}$ and $b > 0$ there are unique $q, r \in \mathbb{Z}$ with $a = qb + r$ and $0 \le r < b$
- The well-ordering principle
- The Axiom of Choice
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The recursion theorem
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
- Charles A. Weibel, An Introduction to Homological Algebra (standard reference, not scraped)