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

Tor one of a cyclic abelian group detects n-torsion

Statement

Assume AC (The Axiom of Choice), and use the supplied-resolution conventions of The balanced Tor bifunctor. For every abelian group M and integer n≥1, Tor⁡1Z(Z/n,M)≅{m∈M:nm=0}, naturally in M. The right resolution of Z/n is explicitly provided below; comparison with a left resolution uses that resolution as supplied data, not an unproved assertion that DC constructs resolutions.

Without any choice axiom, the same formula holds for the homology of the specific two-term right resolution below. Choice is used only to invoke the published comparison and balance results for arbitrary supplied resolutions.

Facts & Assumptions

[F1]

Projectivity is the lifting property for surjections (Projective modules and the lifting property), and resolutions are exact augmented complexes of projectives (Projective resolutions in an abelian category).

[L1]

Tensor maps and their identities follow on elementary tensors from Universal property of the tensor product for balanced maps into abelian groups.

[L2]

Under DC, supplied right resolutions give the same homology functor up to canonical comparison, and the balance isomorphisms identify this with any supplied left resolution (Each resolution-defined Tor construction is covariant in both variables, The Tor balance isomorphism is natural and coherent under a change of resolutions, The balanced Tor bifunctor).

[F2]

The right-resolution construction is Tor from a projective resolution of the right module.

[L3]

Iteration of a self-map of a set from a specified starting point exists by The recursion theorem.

Proof

Given: an abelian group M and an integer n≥1; AC is assumed for the balanced comparison clause only.

1.1givenF1construct

Let Q1=Q0=Z, with d1(k)=nk, zero terms above degree one, and augmentation the quotient map to Z/n. Multiplication by n is injective and its image is the augmentation kernel. The module Z is projective without choice: to lift a map Z→B through E↠B, choose one preimage of the image of 1 and extend by integer multiplication. The zero module is projective by its unique map. Thus Q is a projective resolution, also when n=1.

1.2givenL3construct

AC supplies DC as follows. For any nonempty set X with an entire relation and specified start a, apply AC to the family of its nonempty successor sets to obtain a successor function s:X→X. Iterate s from a using [L3]. The resulting sequence is precisely the chain required by The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain. This is the use of AC; it is not an appeal to a later choice theorem.

2.1L1step 1.1algebra

The maps Z⊗ZM→M, k⊗m↦km, and M→Z⊗ZM, m↦1⊗m, are inverse: the first descends by balance and the composites are identities because k⊗m=1⊗km. Under these maps d1⊗1 is multiplication by n. Hence Q⊗M is 0→M→nM→0 in degrees one and zero.

3.1F2step 2.1algebra

There are no degree-two boundaries, so H1(Q⊗M)=ker⁡(n:M→M)={m:nm=0}. For a homomorphism v:M→M′, the map 1Q⊗v is v in both degrees and induces its restriction on these kernels. This proves the calculation and its naturality without choice; for n=1 the kernel is zero.

4.1L2step 3.1step 1.2∎

Apply [L2] using the DC supplied in step 1.2. The right-resolution calculation in step 3.1 agrees canonically with that from any other supplied right resolution and, when a left resolution of M is supplied, with the left-resolution calculation. Naturality and coherence of these identifications transport the explicit natural kernel map. Thus the displayed balanced-Tor formula holds under the stated conventions without assuming any unprovided resolution-existence theorem.

Depends on

Used by

Dependency tree · two levels

40 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