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.
Normal p complements pass to subgroups and p local normalizers
Statement
Let be a finite group, a prime, and suppose has a normal -complement (Normal p complement and p nilpotent group). Then:
- every subgroup has a normal -complement, namely ;
- every quotient by a normal subgroup has a normal -complement, namely ;
- in particular has a normal -complement for every nontrivial -subgroup (P local normalizer for normal complement theory).
Facts & Assumptions
Given: A finite group , a prime , a normal -complement , a subgroup , and a normal subgroup .
, , and is a power of ; equivalently has a normal -subgroup of -power index, and a finite group has a normal -complement exactly when it has such a subgroup (Normal p complement and p nilpotent group, Equivalent forms of having a normal p complement).
If and , then , and , so (Second isomorphism theorem for groups: , If and , then is a subgroup and , Normal subgroup: invariance under conjugation).
Orders divide: if then divides , and ; a group whose order divides a power of is a finite -group (Lagrange's theorem: for every subgroup of a finite group , A finite -group has order for a prime and some , Every subgroup of a finite -group has order a power of ).
If with , then and ; the quotient is the image of under the natural map , and (Third isomorphism theorem for groups: , The quotient group and coset product , If is finite then ; for finite this equals , Second isomorphism theorem for groups: ).
The natural map is an epimorphism with kernel ; hence and divides (First isomorphism theorem for groups: , The image of a group homomorphism is a subgroup and its kernel is a normal subgroup, If is finite then ; for finite this equals , Normal subgroup: invariance under conjugation).
A normalizer of a nontrivial -subgroup is a subgroup of (The normalizer of a subgroup, Subgroup).
Proof
by [F2], and divides by [F3], so .
Moreover by [F2], and , so divides by [F3] and is a power of . Hence is a normal -subgroup of of -power index, i.e. a normal -complement of by [F1].
and by [F4]; and divides , so .
By [F4] and [F5], divides , a power of ; hence is a power of and is a normal -complement of by [F1].
For a nontrivial -subgroup the normalizer is a subgroup of by [F6], so step 1.2 gives that is a normal -complement of ; with steps 1.1 and 1.4 this establishes all three assertions. ∎
Depends on
- Normal p complement and p nilpotent group
- Equivalent forms of having a normal p complement
- P local normalizer for normal complement theory
- Second isomorphism theorem for groups: $H/(H\cap N)\cong HN/N$
- Third isomorphism theorem for groups: $(G/K)/(N/K)\cong G/N$
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- If $H\le G$ and $N\mathrel{\trianglelefteq}G$, then $HN$ is a subgroup and $H\cap N\mathrel{\trianglelefteq}H$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- If $[G:N]$ is finite then $|G/N|=[G:N]$; for finite $G$ this equals $|G|/|N|$
- The image of a group homomorphism is a subgroup and its kernel is a normal subgroup
- Normal subgroup: invariance under conjugation
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- Subgroup
- A finite $p$-group has order $p^n$ for a prime $p$ and some $n\in\mathbb N$
- Every subgroup of a finite $p$-group has order a power of $p$
- The normalizer $N_G(H)=\{g\in G:gHg^{-1}=H\}$ of a subgroup
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)
- Hans Kurzweil and Bernd Stellmacher, The Theory of Finite Groups, §§7.1–7.2 (standard reference, not scraped)