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

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

Statement

If GG is finite abelian and G=i<rpiai|G|=\prod_{i<r}p_i^{a_i} is its prime factorisation, then the subgroups G(pi)G(p_i) form an internal direct product of GG. Thus Gi<rG(pi).G\cong\prod_{i<r}G(p_i). For the trivial group, this is the empty product.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let GG be finite abelian and write G=pam|G|=p^a m with pmp\nmid m. Then G(p)G(p) is a subgroup of order pap^a. It is the unique subgroup of GG having that order. In particular, if pGp\nmid |G|, then G(p)={e}G(p)=\{e\}. (A p-primary component has the full p-power order and is the unique subgroup of that order).

[L2]

Let N0,,Nr1GN_0,\ldots,N_{r-1}\trianglelefteq G. The following are equivalent: the NiN_i form an internal direct product of GG; every gGg\in G has a unique expression g=n0nr1g=n_0\cdots n_{r-1} with niNin_i\in N_i; and the multiplication map μ:i<rNiG\mu:\prod_{i<r}N_i\to 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)(\mathbb{Z},\cdot,1) of lem-units-of-z. Call p:rZp : r \to \mathbb{Z} an injective list of primes when every pip_i is prime (def-prime) and pi=pjp_i = p_j forces i=ji = j (def-injection-surjection-bijection). Let nZn \in \mathbb{Z} with n1n \ge 1 and let p:rZp : r \to \mathbb{Z} be an injective list of primes such that every prime divisor of nn equals pip_i for some i<ri < r. Then, with vqv_q as in def-p-adic-valuation: 1. n  =  i<rpivpi(n)\displaystyle n \;=\; \prod_{i<r} p_i^{\,v_{p_i}(n)}; 2. vq(n)=0v_q(n) = 0 for every prime qq that is not among p0,,pr1p_0,\dots,p_{r-1}; 3. the exponents are determined by nn: if e:rNe : r \to \mathbb{N} and n=i<rpiein = \prod_{i<r} p_i^{\,e_i}, then ej=vpj(n)e_j = v_{p_j}(n) for every j<rj < r. Clause 3 needs only injectivity of the list, not the covering hypothesis. (For n1n \ge 1 and any injective list p:rZp : r \to \mathbb{Z} of primes containing every prime divisor of nn, one has n=i<rpivpi(n)n = \prod_{i<r} p_i^{\,v_{p_i}(n)}; the exponents are determined by nn, and vq(n)=0v_q(n) = 0 for every prime qq outside the list).

[L4]

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

[L5]

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

[L6]

Let GG be a finite group and HGH\le G. Then G=[G:H]H.|G|=[G:H]\,|H|. Consequently, under the canonical embedding ι:NZ\iota:\mathbb N\to\mathbb Z, H|H| divides G|G|. (Lagrange's theorem: G=[G:H]H|G|=[G:H]|H| for every subgroup HH of a finite group GG).

Proof

technique · direct
1.1

Each G(pi)G(p_i) has order piaip_i^{a_i}, and the product of these orders is G|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 GG 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 pip_i and coprime to pip_i.

step 1.1
3.1

The external product has order ipiai=G\prod_i p_i^{a_i}=|G|. Its injective multiplication map therefore has image of order G|G| and is surjective.

step 2.1
4.1

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

step 3.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 139 results over 25 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