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.
The successive quotients p^iG/p^{i+1}G recover the cyclic summand multiplicities of a finite abelian p-group
Statement
Suppose with , and in additive notation write . Define by . Then Consequently, for every , the number of summands of order is , so the elementary divisors are intrinsic. The restriction to is the whole content of the hypothesis : no summand has order , and is not defined.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
An elementary-divisor decomposition of a finite abelian group is an isomorphism where every is a prime power. The unordered multiset of the , counted with multiplicity, is the elementary-divisor data. The cyclic factors and product use thm-classification-of-cyclic-groups and def-external-direct-product-of-groups. The data records factor isomorphism types, not distinguished internal subgroups; the trivial group has empty data. (Elementary-divisor data for a finite abelian group).
Every finite abelian -group is isomorphic to a finite direct product of cyclic groups of prime-power order. The trivial -group is the empty product. (Every finite abelian p-group is a direct product of cyclic p-groups).
Natural exponents, in a monoid. Let be a monoid (def-semigroup-and-monoid) and . By the recursion theorem (thm-recursion), applied with the set , the element and the function from to , there is exactly one function , written , with In particular for every , including , and . Since contains (def-natural-numbers), the exponent is a genuine value of the definition and not a separate convention. Integer exponents, in a group. Let be a group (def-group) and . Write for the embedding of lem-nat-embeds-int, which is injective, preserves addition, multiplication and order, and has as image exactly the nonnegative integers. For define - , the natural power, when and ; - when and . Why this is well defined. The order on is total and antisymmetric (thm-int-ordered-ring, def-int-order), so exactly one of and holds and the two clauses never both apply. In the first clause is nonnegative, so for some , and is unique because is injective. In the second clause gives by compatibility of the order with addition (thm-int-ordered-ring, def-int-operations), so is a positive integer and again for a unique . The inverse is a single determined element by lem-inverse-unique and def-invertible-element. Finally the two readings of , as a natural power and as an integer power, agree by construction, so no ambiguity is introduced. Abbreviation. In an exponent we write for the integer when a natural number is used where an integer is expected; this is unambiguous because is injective and preserves the arithmetic and the order, and because the two readings of agree as just noted. Additive notation. When the group is written additively the same object is written or rather than , with and ; the definitions are identical, only the symbols differ. (Powers : natural exponents in a monoid and integer exponents in a group, with ).
Let be a group and let be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, has the left cosets as its elements (def-coset, def-index), with product Independence of the chosen representatives is proved in thm-coset-multiplication-well-defined-iff-normal, and the group axioms are proved in thm-quotient-group-laws. (The quotient group and coset product ).
Let . If is finite, then the quotient group is finite and In particular, if is finite, then (If is finite then ; for finite this equals ).
If and are finite groups, then their external direct product is finite and has order . (For finite groups and , ).
For every , view as its canonical nonnegative integer and put . Then the left cosets of in are exactly the congruence classes modulo , and coset addition is the published addition of congruence classes. Thus as the same group on the same underlying set. This includes and . (For every , the congruence-class group is the quotient group ).
Proof
On a cyclic factor , the quotient is trivial when and has order when .
Taking direct products componentwise therefore gives with equal to the number of exponents at least .
The number of exponents equal to is the number at least minus the number at least , namely .
Each subgroup and quotient is defined intrinsically, and the sequence terminates at zero, so these differences uniquely recover all summands.
Depends on
- Elementary-divisor data for a finite abelian group
- Every finite abelian p-group is a direct product of cyclic p-groups
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- If $[G:N]$ is finite then $|G/N|=[G:N]$; for finite $G$ this equals $|G|/|N|$
- For finite groups $G$ and $H$, $|G\times H|=|G|\,|H|$
- For every $n\in\mathbb N$, the congruence-class group $(\mathbb Z/n,+)$ is the quotient group $(\mathbb Z,+)/n\mathbb Z$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 97 results over 24 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Keith Conrad, Decomposition of Finite Abelian Groups, §§1-4 (standard reference, not scraped)
- Richard Elman, Lectures on Abstract Algebra, Ch. 14 (standard reference, not scraped)