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.
P residual of a finite group
Definition
Let be a finite group and let be a prime. A normal subgroup is -cofinal when the quotient is a finite -group, that is, when is a power of (The quotient group and coset product , If is finite then ; for finite this equals , A finite -group has order for a prime and some ). The -residual of is
the intersection of all -cofinal normal subgroups of . It is the unique smallest normal subgroup of whose quotient is a -group: it is -cofinal itself, and for every -cofinal .
Why the definition is well posed. The family is a -group is nonempty (, since is the trivial group, of order ), and it is finite, because every member is a subset of the finite set and a finite set has finitely many subsets (The cardinality of a finite set, for finite ). The intersection is a subgroup of by The intersection of a nonempty family of subgroups of is a subgroup of , and a normal subgroup because each is normal (Normal subgroup: invariance under conjugation); it remains to see that it is again -cofinal, and least.
Finite intersections of -cofinal subgroups are -cofinal. Let be -cofinal. The diagonal map , , is a homomorphism of groups (Monoid homomorphism and group homomorphism); its kernel is , and its image is a subgroup of the direct product (First isomorphism theorem for groups: , The image of a group homomorphism is a subgroup and its kernel is a normal subgroup). The direct product has order , a power of (For finite groups and , ), hence is a finite -group, and a subgroup of a finite -group is a finite -group (Every subgroup of a finite -group has order a power of ). By the first isomorphism theorem , so the intersection is -cofinal.
The intersection of all of them is a member. Since is finite, say , the preceding paragraph shows that is -cofinal; in particular is a -group and for every by construction.
Smallest and unique. If has a -group, then , so ; and itself has -group quotient. Hence is the smallest normal subgroup of with -group quotient, and it is the only one with that property, since two such subgroups contain each other.
The construction is the lower -series counterpart of the -core of The p-prime core of a finite group: the -core is the largest normal -subgroup, while the -residual is the smallest normal subgroup with -group quotient. In particular is the kernel of the natural map onto the largest -group quotient of , so every homomorphism from to a finite -group factors through (The quotient group and coset product ).
Depends on
- Normal subgroup: invariance under conjugation
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- A finite $p$-group has order $p^n$ for a prime $p$ and some $n\in\mathbb N$
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- The image of a group homomorphism is a subgroup and its kernel is a normal subgroup
- For finite groups $G$ and $H$, $|G\times H|=|G|\,|H|$
- If $[G:N]$ is finite then $|G/N|=[G:N]$; for finite $G$ this equals $|G|/|N|$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The cardinality $\lvert A\rvert$ of a finite set
- $\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert}$ for finite $A$
- Every subgroup of a finite $p$-group has order a power of $p$
- Monoid homomorphism and group homomorphism
- The intersection of a nonempty family of subgroups of $G$ is a subgroup of $G$
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Every integer $n > 1$ has a prime divisor; indeed the least divisor of $n$ that exceeds $1$ is prime
Used by
Dependency tree · two levels
61 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)