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.
Every finite abelian group is a quotient of for some and
Statement
For every finite abelian group there are positive integers and and a surjective group homomorphism
where denotes the set of -tuples of classes in , with componentwise addition, for the additive group (The congruence class and the quotient set , For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold). Equivalently, for a subgroup (The quotient group and coset product , First isomorphism theorem for groups: ).
Facts & Assumptions
Given: A finite abelian group .
For every finite abelian group there is a unique list with ; the trivial group corresponds to the empty list (Fundamental theorem of finite abelian groups: invariant-factor form, Invariant-factor data for a finite abelian group).
A cyclic group of finite order is isomorphic to (Every cyclic group is isomorphic to or to for its finite order ).
For every natural number , one has exactly when (The congruence class and the quotient set , Congruence modulo an integer: when , including the moduli and , Divisibility in : when for some integer ), addition of classes is represented by addition of representatives, and is an abelian group (For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
For a homomorphism , the rule is an isomorphism (First isomorphism theorem for groups: , The quotient group and coset product ).
Proof
In the case that the invariant-factor list of [L1] is empty, is trivial; take and , so that is a one-element group and the unique map to is a surjective homomorphism.
In the case , put and . Each divides , the list being a divisibility chain by [L1].
For each the rule is a well-defined surjective group homomorphism : if then , hence because , so by [L3]; it respects addition by [L3]; and every class is the image of .
Let and , both with componentwise addition. By [L3] each coordinate and is an abelian group, so and are abelian groups under these coordinatewise operations. Define by . Step 2.1 gives each coordinate map as a well-defined surjective homomorphism, so is a well-defined surjective group homomorphism. Fact [L2] identifies each coordinate group with , and [L1] identifies with up to isomorphism. Composing with that isomorphism gives a surjective homomorphism .
The two cases are exhaustive, the invariant-factor list being empty or not, so such and exist for every finite abelian ; and [L4] turns any such surjection into an isomorphism with its kernel.
Remarks
- Why the invariant-factor form is convenient. The invariant factors form a divisibility chain, so the single modulus works immediately. A primary decomposition also proves the statement: take to be the least common multiple of the finitely many prime-power orders and reduce onto each cyclic factor. The invariant-factor form simply avoids that extra choice of modulus.
Depends on
- Fundamental theorem of finite abelian groups: invariant-factor form
- Invariant-factor data for a finite abelian group
- Every cyclic group is isomorphic to $(\mathbb Z,+)$ or to $(\mathbb Z/n,+)$ for its finite order $n\ge1$
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- Congruence modulo an integer: $a\equiv b\pmod n$ when $n\mid(a-b)$, including the moduli $0$ and $1$
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
Used by
Dependency tree · two levels
38 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
- P. L. Clark, Field Theory (course notes/monograph), Lemma 9.11 (standard reference, not scraped)
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 5 (standard reference, not scraped)