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 , 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
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).
Dividing a linear congruence by the positive gcd gives an equivalent congruence with coprime coefficient and modulus (If , and , then reduces to a congruence with coprime coefficient modulo ).
Coprime integers admit an integer linear combination equal to one (Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution).
Proof
Given: positive integers and AC for the balanced interpretation.
By [L1] with , the balanced Tor group is canonically the kernel of multiplication by on . 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.
Put , , , with . By [L2], and is equivalent to . By [L3] choose integers with . If , then is divisible by ; the converse is immediate. Hence the kernel in step 1.1 consists precisely of the multiples of modulo .
The map , , is well defined and additive since . Its image is the kernel from step 2.1. It is injective because holds exactly when , by cancellation of the nonzero integer . Thus it is an isomorphism onto that kernel, including when both groups in this identification are trivial. Composing with step 1.1 proves the claim.
Depends on
- Tor one of a cyclic abelian group detects n-torsion
- The Axiom of Choice
- If $n\ge1$, $d=\gcd(a,n)$ and $d\mid b$, then $ax\equiv b\pmod n$ reduces to a congruence with coprime coefficient modulo $n/d$
- Bézout's identity: for integers $a, b$ not both zero, $\gcd(a,b)$ is the least positive element of $\{\, ax + by : x, y \in \mathbb{Z} \,\}$; in particular $ax + by = \gcd(a,b)$ has an integer solution
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
- Charles A. Weibel, An Introduction to Homological Algebra (standard reference, not scraped)