Alphabeta Math
TheoremStatement: 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.

A finite abelian group is the internal direct product of its primary components

Statement

If G is finite abelian and ∣G∣=∏i<rpiai is its prime factorisation, then the subgroups G(pi) form an internal direct product of G. Thus G≅∏i<rG(pi). For the trivial group, this is the empty product.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let G be finite abelian and write ∣G∣=pam with p∤m. Then G(p) is a subgroup of order pa. It is the unique subgroup of G having that order. In particular, if p∤∣G∣, then G(p)={e}. (A p-primary component has the full p-power order and is the unique subgroup of that order).

[L2]

Let N0,…,Nr−1⊴G. The following are equivalent: the Ni form an internal direct product of G; every g∈G has a unique expression g=n0⋯nr−1 with ni∈Ni; and the multiplication map μ:∏i<rNi→G is an isomorphism. These statements include the empty family and the one-factor case. (Internal direct products are external direct products, equivalently every element has a unique factorisation).

[L3]

Powers are the natural powers of def-group-power and finite products those of def-monoid-finite-product, both taken in the commutative monoid (Z,⋅,1) of lem-units-of-z. Call p:r→Z an injective list of primes when every pi is prime (def-prime) and pi=pj forces i=j (def-injection-surjection-bijection). Let n∈Z with n≥1 and let p:r→Z be an injective list of primes such that every prime divisor of n equals pi for some i<r. Then, with vq as in def-p-adic-valuation: 1. n  =  ∏i<rpi vpi(n); 2. vq(n)=0 for every prime q that is not among p0,…,pr−1; 3. the exponents are determined by n: if e:r→N and n=∏i<rpi ei, then ej=vpj(n) for every j<r. Clause 3 needs only injectivity of the list, not the covering hypothesis. (For n≥1 and any injective list p:r→Z of primes containing every prime divisor of n, one has n=∏i<rpi vpi(n); the exponents are determined by n, and vq(n)=0 for every prime q outside the list).

[L4]

Let a,b∈Z, not both 0, and put I  :=  { ax+by  :  x,y∈Z }. Then I contains a positive element, and its least positive element is gcd⁡(a,b) (def-common-divisor-and-gcd). In particular there are integers x0,y0 with ax0+by0  =  gcd⁡(a,b), so the equation ax+by=gcd⁡(a,b) is solvable in Z. (Bézout's identity: for integers a,b not both zero, gcd⁡(a,b) is the least positive element of { ax+by:x,y∈Z }; in particular ax+by=gcd⁡(a,b) has an integer solution).

[L5]

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∣).

[L6]

Let G be a finite group and H≤G. Then ∣G∣=[G:H] ∣H∣. Consequently, under the canonical embedding ι:N→Z, ∣H∣ divides ∣G∣. (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

Proof

technique · direct
1.1

Each G(pi) has order piai, and the product of these orders is ∣G∣. Distinct primary components have trivial intersection because an element in both has order dividing powers of two distinct primes.

givenL1L2L3L4L5L6
2.1

Multiplication from the external product of the primary components to G is injective: a tuple in its kernel would place each component in the intersection with the product of the others, whose order is both a power of pi and coprime to pi.

step 1.1
3.1

The external product has order ∏ipiai=∣G∣. Its injective multiplication map therefore has image of order ∣G∣ and is surjective.

step 2.1
4.1

The internal-direct-product recognition theorem gives the displayed isomorphism. When G is trivial the prime list is empty and both sides are the trivial group.

step 3.1∎

Depends on

Used by

Dependency tree · two levels

59 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