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 p-prime core of a finite group
Definition
Let be a finite group (Group and abelian group, The cardinality of a finite set) and let be a prime (Prime and composite integers: is prime when and its only positive divisors are and ).
-element terminology. An element of finite order is a -element when is a power of , and a -element when (The order of a finite group and the order of an element, with when no positive power of is the identity, A finite -group has order for a prime and some ). A subgroup is a -subgroup when is a power of , and a -subgroup when ; the trivial subgroup is both. The terminology is used without further comment throughout the normal-complement material of this page.
The -core. Call a subgroup of a normal -subgroup when and (Normal subgroup: invariance under conjugation). The -core of is
the subgroup generated by all normal -subgroups of (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups). It is the unique largest normal -subgroup of : it is normal in , its order is prime to , and every normal -subgroup of is contained in it.
Why the definition is well posed. The family is nonempty (, since ) and finite: every member is a subset of the finite set , and has finitely many subsets (The cardinality of a finite set, for finite ). Write .
Products stay in the family. If , then is a subgroup of (If and , then is a subgroup and ), it is normal because for every (Normal subgroup: invariance under conjugation, Conjugation is an automorphism), and its order divides : by the second isomorphism theorem , so (Second isomorphism theorem for groups: , Lagrange's theorem: for every subgroup of a finite group ). A divisor of the -number is again prime to : if the prime divided it would divide and hence, by Euclid's lemma, one of , (Euclid's lemma: if is prime and then or , Divisibility is reflexive and transitive on , and is linear: if and then for all integers ; also implies , and ). So .
The generated subgroup is a member. By the product closure just proved, belongs to , by finite induction. This subgroup contains each (insert identities in all other factors), hence contains by the defining minimality of the generated subgroup (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups). Conversely every factor lies in that generated subgroup, so their product does too. Thus ; in particular , because is itself a member of the family and contains every member.
Largest and unique. As a member of , is a normal -subgroup of , and it contains every by construction; a normal -subgroup is by definition a member of . Hence is the largest normal -subgroup, and it is the only one with that property, since two normal -subgroups each contain the other.
Depends on
- Normal subgroup: invariance under conjugation
- A finite $p$-group has order $p^n$ for a prime $p$ and some $n\in\mathbb N$
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- Subgroup
- If $H\le G$ and $N\mathrel{\trianglelefteq}G$, then $HN$ is a subgroup and $H\cap N\mathrel{\trianglelefteq}H$
- Second isomorphism theorem for groups: $H/(H\cap N)\cong HN/N$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- The cardinality $\lvert A\rvert$ of a finite set
- $\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert}$ for finite $A$
- Euclid's lemma: if $p$ is prime and $p \mid ab$ then $p \mid a$ or $p \mid b$
- Divisibility is reflexive and transitive on $\mathbb{Z}$, and is linear: if $d \mid a$ and $d \mid b$ then $d \mid ax + by$ for all integers $x, y$; also $d \mid a$ implies $d \mid ac$, $-d \mid a$ and $d \mid -a$
- Conjugation $x\mapsto gxg^{-1}$ is an automorphism
Used by
Dependency tree · two levels
63 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
- Paul Flavell, An Introduction to Transfer and Fusion in Finite Groups, §§2–5 (standard reference, not scraped)
- Hans Kurzweil and Bernd Stellmacher, The Theory of Finite Groups, §§7.1–7.2 (standard reference, not scraped)