Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11
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 G≅∏j<rCpej with ej≥1, and in additive notation write piG={pig:g∈G}. Define di by ∣piG/pi+1G∣=pdi. Then di=∣{j:ej≥i+1}∣. Consequently, for every k≥1, the number of summands of order pk is dk−1−dk, so the elementary divisors are intrinsic. The restriction to k≥1 is the whole content of the hypothesis ej≥1: no summand has order p0=1, and d−1 is not defined.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

An elementary-divisor decomposition of a finite abelian group G is an isomorphism G≅Cq0×⋯×Cqr−1, where every qi>1 is a prime power. The unordered multiset of the qi, 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).

[L2]

Every finite abelian p-group is isomorphic to a finite direct product of cyclic groups of prime-power order. The trivial p-group is the empty product. (Every finite abelian p-group is a direct product of cyclic p-groups).

[L3]

Natural exponents, in a monoid. Let (M,⋅,e) be a monoid (def-semigroup-and-monoid) and g∈M. By the recursion theorem (thm-recursion), applied with the set M, the element e and the function x↦x⋅g from M to M, there is exactly one function N→M, written n↦gn, with g0=e,gσ(n)=gn⋅g(n∈N). In particular g0=e for every g, including g=e, and g1=gσ(0)=e⋅g=g. Since N contains 0 (def-natural-numbers), the exponent 0 is a genuine value of the definition and not a separate convention. Integer exponents, in a group. Let G be a group (def-group) and g∈G. Write ι:N→Z for the embedding k=[(k,0)] of lem-nat-embeds-int, which is injective, preserves addition, multiplication and order, and has as image exactly the nonnegative integers. For x∈Z define - gx:=gk, the natural power, when 0≤x and x=k; - gx:=(gk)−1 when x<0 and −x=k. Why this is well defined. The order on Z is total and antisymmetric (thm-int-ordered-ring, def-int-order), so exactly one of 0≤x and x<0 holds and the two clauses never both apply. In the first clause x is nonnegative, so x=k for some k∈N, and k is unique because ι is injective. In the second clause x<0 gives 0=x+(−x)<0+(−x)=−x by compatibility of the order with addition (thm-int-ordered-ring, def-int-operations), so −x is a positive integer and again −x=k for a unique k. The inverse (gk)−1 is a single determined element by lem-inverse-unique and def-invertible-element. Finally the two readings of gk, as a natural power and as an integer power, agree by construction, so no ambiguity is introduced. Abbreviation. In an exponent we write k for the integer k when a natural number k 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 gk agree as just noted. Additive notation. When the group is written additively the same object is written ng or n⋅g rather than gn, with 0g=0 and σ(n)g=ng+g; the definitions are identical, only the symbols differ. (Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e).

[L4]

Let G be a group and let N⊴G be a normal subgroup (def-normal-subgroup). The quotient group, or factor group, G/N has the left cosets G/N:={gN:g∈G} as its elements (def-coset, def-index), with product (gN)(hN):=ghN. 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 G/N and coset product (gN)(hN)=ghN).

[L5]

Let N⊴G. If [G:N] is finite, then the quotient group G/N is finite and ∣G/N∣=[G:N]. In particular, if G is finite, then ∣G/N∣=∣G∣∣N∣. (If [G:N] is finite then ∣G/N∣=[G:N]; for finite G this equals ∣G∣/∣N∣).

[L6]

If G and H are finite groups, then their external direct product is finite and has order ∣G×H∣=∣G∣ ∣H∣. (For finite groups G and H, ∣G×H∣=∣G∣ ∣H∣).

[L7]

For every n∈N, view n as its canonical nonnegative integer and put nZ:={nk:k∈Z}. Then the left cosets of nZ in (Z,+) are exactly the congruence classes modulo n, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+) as the same group on the same underlying set. This includes n=0 and n=1. (For every n∈N, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

Proof

technique · direct
1.1

On a cyclic factor Cpe, the quotient piCpe/pi+1Cpe is trivial when i≥e and has order p when i<e.

givenL1L2L3L4L5L6L7
2.1

Taking direct products componentwise therefore gives ∣piG/pi+1G∣=pdi with di equal to the number of exponents at least i+1.

step 1.1
3.1

The number of exponents equal to k is the number at least k minus the number at least k+1, namely dk−1−dk.

step 2.1
4.1

Each subgroup piG and quotient piG/pi+1G is defined intrinsically, and the sequence terminates at zero, so these differences uniquely recover all summands.

step 3.1∎

Depends on

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