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 is finite abelian and is its prime factorisation, then the subgroups form an internal direct product of . Thus For the trivial group, this is the empty product.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
Let be finite abelian and write with . Then is a subgroup of order . It is the unique subgroup of having that order. In particular, if , then . (A p-primary component has the full p-power order and is the unique subgroup of that order).
Let . The following are equivalent: the form an internal direct product of ; every has a unique expression with ; and the multiplication map 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).
Powers are the natural powers of def-group-power and finite products those of def-monoid-finite-product, both taken in the commutative monoid of lem-units-of-z. Call an injective list of primes when every is prime (def-prime) and forces (def-injection-surjection-bijection). Let with and let be an injective list of primes such that every prime divisor of equals for some . Then, with as in def-p-adic-valuation: 1. ; 2. for every prime that is not among ; 3. the exponents are determined by : if and , then for every . Clause 3 needs only injectivity of the list, not the covering hypothesis. (For and any injective list of primes containing every prime divisor of , one has ; the exponents are determined by , and for every prime outside the list).
Let , not both , and put Then contains a positive element, and its least positive element is (def-common-divisor-and-gcd). In particular there are integers with so the equation is solvable in . (Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution).
If and are finite groups, then their external direct product is finite and has order . (For finite groups and , ).
Let be a finite group and . Then Consequently, under the canonical embedding , divides . (Lagrange's theorem: for every subgroup of a finite group ).
Proof
Each has order , and the product of these orders is . Distinct primary components have trivial intersection because an element in both has order dividing powers of two distinct primes.
Multiplication from the external product of the primary components to 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 and coprime to .
The external product has order . Its injective multiplication map therefore has image of order and is surjective.
The internal-direct-product recognition theorem gives the displayed isomorphism. When is trivial the prime list is empty and both sides are the trivial group.
Depends on
- A p-primary component has the full p-power order and is the unique subgroup of that order
- Internal direct products are external direct products, equivalently every element has a unique factorisation
- For $n \ge 1$ and any injective list $p : r \to \mathbb{Z}$ of primes containing every prime divisor of $n$, one has $n = \prod_{i<r} p_i^{\,v_{p_i}(n)}$; the exponents are determined by $n$, and $v_q(n) = 0$ for every prime $q$ outside the list
- Bézout's identity: for integers $a, b$ not both zero, $\gcd(a,b)$ is the least positive element of $\{\, ax + by : x, y \in \mathbb{Z} \,\}$; in particular $ax + by = \gcd(a,b)$ has an integer solution
- For finite groups $G$ and $H$, $|G\times H|=|G|\,|H|$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
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
- 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)