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 p-primary component has the full p-power order and is the unique subgroup of that order
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 .
Facts & Assumptions
Given: The objects and hypotheses in the statement.
Let be an abelian group and a prime. Its -primary component is Thus the identity is included by . In additive notation, . Powers and element orders use def-group-power and def-order-in-a-group. No finiteness or maximality is part of the definition. (The p-primary component of an abelian group).
Let be a finite abelian group and let be a prime dividing . Then contains an element, and hence a subgroup, of order . (Cauchy's theorem for finite abelian groups).
Let be a finite group and . Then Consequently, under the canonical embedding , divides . (Lagrange's theorem: for every subgroup of a finite group ).
Let . If is finite, then the quotient group is finite and In particular, if is finite, then (If is finite then ; for finite this equals ).
Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved. For , the maps and are inverse inclusion-preserving bijections between subgroups with and subgroups ; they preserve normality. (Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved).
Second isomorphism theorem for groups: . If and , then (Second isomorphism theorem for groups: ).
If is abelian and , then is abelian. (Every quotient group of an abelian group is abelian).
Let be a group (def-group) with identity , let , and let powers be as in def-group-power. For all : 1. ; 2. ; 3. ; 4. : any two powers of one element commute; 5. if then . Claim 5 is false in general without its hypothesis: in a group in which and do not commute the equation can fail already at , and a witness is recorded on the companion page. Claims 1 and 3 hold in any monoid (def-semigroup-and-monoid) for exponents in , and so does claim 5 for exponents in under the same commuting hypothesis; only the extension to negative exponents needs inverses. (Exponent laws in a group: and for all , and when and commute).
Proof
If and , commutativity and the power laws give and , so is a subgroup. If a prime divides , Cauchy's theorem in gives an element of order ; the definition of forces . Hence for some .
If , then divides . Cauchy's theorem in this abelian quotient gives a nonidentity coset of order .
Then , so for some and therefore , contradicting the choice of a nonidentity coset. Hence .
If has order , Lagrange applied inside makes every have -power order, so ; equal finite orders give . The case gives the trivial subgroup.
Depends on
The p-primary component of an abelian group
Cauchy's theorem for finite abelian groups
Lagrange's theorem: for every subgroup of a finite group
If is finite then ; for finite this equals
Correspondence theorem: subgroups of correspond to subgroups of containing , with normality preserved
Second isomorphism theorem for groups:
Every quotient group of an abelian group is abelian
Exponent laws in a group: and for all , and when and commute