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 two cyclic abelian groups is cyclic of gcd order

Statement

Assume AC (The Axiom of Choice). For positive integers m,n, Tor⁡1Z(Z/m,Z/n)≅Z/gcd⁡(m,n). AC is inherited only by the balanced-Tor comparison in Tor one of a cyclic abelian group detects n-torsion. The two-term resolution kernel calculation and the isomorphism below are choice-free.

Facts & Assumptions

[L1]

The preceding cyclic-Tor theorem identifies balanced Tor with the multiplication kernel under AC, and gives the fixed-resolution calculation without choice (Tor one of a cyclic abelian group detects n-torsion).

[L2]

Dividing a linear congruence by the positive gcd gives an equivalent congruence with coprime coefficient and modulus (If n≥1, d=gcd⁡(a,n) and d∣b, then ax≡b(modn) reduces to a congruence with coprime coefficient modulo n/d).

Proof

Given: positive integers m,n and AC for the balanced interpretation.

1.1givenL1

By [L1] with M=Z/n, the balanced Tor group is canonically the kernel of multiplication by m on Z/n. Both cyclic modules have the explicit two-term projective resolutions supplied by [L1], so its supplied-resolution hypotheses are met. AC is used here through its comparison clause, not in the following arithmetic.

2.1L2L3step 1.1algebra

Put g=gcd⁡(m,n), m=ga, n=gb, with g,b>0. By [L2], gcd⁡(a,b)=1 and mx≡0(modn) is equivalent to b∣ax. By [L3] choose integers u,v with ua+vb=1. If b∣ax, then x=uax+vbx is divisible by b; the converse is immediate. Hence the kernel in step 1.1 consists precisely of the multiples of b modulo n=gb.

3.1step 1.1step 2.1algebra∎

The map Z/g→Z/n, [t]g↦[bt]n, is well defined and additive since bg=n. Its image is the kernel from step 2.1. It is injective because gb∣bt holds exactly when g∣t, by cancellation of the nonzero integer b. Thus it is an isomorphism onto that kernel, including g=1 when both groups in this identification are trivial. Composing with step 1.1 proves the claim.

Depends on

Used by

Dependency tree · two levels

33 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