Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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 Gj<rCpejG\cong\prod_{j<r}C_{p^{e_j}} with ej1e_j\ge1, and in additive notation write piG={pig:gG}p^iG=\{p^ig:g\in G\}. Define did_i by piG/pi+1G=pdi|p^iG/p^{i+1}G|=p^{d_i}. Then di={j:eji+1}.d_i=|\{j:e_j\ge i+1\}|. Consequently, for every k1k\ge1, the number of summands of order pkp^k is dk1dkd_{k-1}-d_k, so the elementary divisors are intrinsic. The restriction to k1k\ge1 is the whole content of the hypothesis ej1e_j\ge1: no summand has order p0=1p^0=1, and d1d_{-1} is not defined.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

An elementary-divisor decomposition of a finite abelian group GG is an isomorphism GCq0××Cqr1,G\cong C_{q_0}\times\cdots\times C_{q_{r-1}}, where every qi>1q_i>1 is a prime power. The unordered multiset of the qiq_i, 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 pp-group is isomorphic to a finite direct product of cyclic groups of prime-power order. The trivial pp-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)(M,\cdot,e) be a monoid (def-semigroup-and-monoid) and gMg \in M. By the recursion theorem (thm-recursion), applied with the set MM, the element ee and the function xxgx \mapsto x \cdot g from MM to MM, there is exactly one function NM\mathbb{N} \to M, written ngnn \mapsto g^{n}, with g0=e,gσ(n)=gng(nN).g^{0} = e, \qquad g^{\sigma(n)} = g^{n} \cdot g \quad (n \in \mathbb{N}). In particular g0=eg^{0} = e for every gg, including g=eg = e, and g1=gσ(0)=eg=gg^{1} = g^{\sigma(0)} = e \cdot g = g. Since N\mathbb{N} contains 00 (def-natural-numbers), the exponent 00 is a genuine value of the definition and not a separate convention. Integer exponents, in a group. Let GG be a group (def-group) and gGg \in G. Write ι:NZ\iota : \mathbb{N} \to \mathbb{Z} for the embedding k=[(k,0)]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 xZx \in \mathbb{Z} define - gx:=gkg^{x} := g^{k}, the natural power, when 0x0 \le x and x=kx = k; - gx:=(gk)1g^{x} := (g^{k})^{-1} when x<0x < 0 and x=k-x = k. Why this is well defined. The order on Z\mathbb{Z} is total and antisymmetric (thm-int-ordered-ring, def-int-order), so exactly one of 0x0 \le x and x<0x < 0 holds and the two clauses never both apply. In the first clause xx is nonnegative, so x=kx = k for some kNk \in \mathbb{N}, and kk is unique because ι\iota is injective. In the second clause x<0x < 0 gives 0=x+(x)<0+(x)=x0 = x + (-x) < 0 + (-x) = -x by compatibility of the order with addition (thm-int-ordered-ring, def-int-operations), so x-x is a positive integer and again x=k-x = k for a unique kk. The inverse (gk)1(g^{k})^{-1} is a single determined element by lem-inverse-unique and def-invertible-element. Finally the two readings of gkg^{k}, as a natural power and as an integer power, agree by construction, so no ambiguity is introduced. Abbreviation. In an exponent we write kk for the integer kk when a natural number kk is used where an integer is expected; this is unambiguous because ι\iota is injective and preserves the arithmetic and the order, and because the two readings of gkg^{k} agree as just noted. Additive notation. When the group is written additively the same object is written ngn g or ngn \cdot g rather than gng^{n}, with 0g=00 g = 0 and σ(n)g=ng+g\sigma(n) g = n g + g; the definitions are identical, only the symbols differ. (Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e).

[L4]

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

[L5]

Let NGN\mathrel{\trianglelefteq}G. If [G:N][G:N] is finite, then the quotient group G/NG/N is finite and G/N=[G:N].|G/N|=[G:N]. In particular, if GG is finite, then G/N=GN.|G/N|=\frac{|G|}{|N|}. (If [G:N][G:N] is finite then G/N=[G:N]|G/N|=[G:N]; for finite GG this equals G/N|G|/|N|).

[L6]

If GG and HH are finite groups, then their external direct product is finite and has order G×H=GH|G\times H|=|G|\,|H|. (For finite groups GG and HH, G×H=GH|G\times H|=|G|\,|H|).

[L7]

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

Proof

technique · direct
1.1

On a cyclic factor CpeC_{p^e}, the quotient piCpe/pi+1Cpep^iC_{p^e}/p^{i+1}C_{p^e} is trivial when iei\ge e and has order pp when i<ei<e.

givenL1L2L3L4L5L6L7
2.1

Taking direct products componentwise therefore gives piG/pi+1G=pdi|p^iG/p^{i+1}G|=p^{d_i} with did_i equal to the number of exponents at least i+1i+1.

step 1.1
3.1

The number of exponents equal to kk is the number at least kk minus the number at least k+1k+1, namely dk1dkd_{k-1}-d_k.

step 2.1
4.1

Each subgroup piGp^iG and quotient piG/pi+1Gp^iG/p^{i+1}G 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 · 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