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.
Frobenius automizer criterion for p nilpotence
Statement
Let be a finite group, a prime and a Sylow -subgroup (Sylow -subgroups of a finite group). Then the following are equivalent.
(i) has a normal -complement (Normal p complement and p nilpotent group). (ii) For every subgroup with , the automizer is a -group (The normalizer of a subgroup, The centralizer of a subgroup, The quotient group and coset product , A finite -group has order for a prime and some ).
Facts & Assumptions
Given: A finite group , a prime and a Sylow -subgroup .
(ii) implies (i): if the automizer condition (ii) holds, then by P automizer condition implies fusion control the Sylow controls fusion in with respect to , and then by Frobenius normal p complement theorem has a normal -complement (Control of fusion in a sylow p subgroup).
(i) implies (ii): suppose has a normal -complement , let be a subgroup with , and put , and . Then with and a power of , , , and (Normal p complement and p nilpotent group, The normalizer of a subgroup, Normal subgroup: invariance under conjugation, Subgroup, Sylow -subgroups of a finite group).
Commutator inclusions used in step 1.2: if and , then , since for , one has and hence ; and if then likewise, since ; here with (Commutators and the commutator subgroup , Subgroup commutators and the lower central series, Normal subgroup: invariance under conjugation, In a group , and , the order of the last product being essential, The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
Homomorphism and quotient facts: if then is a homomorphism with kernel , so is isomorphic to a subgroup of ; and for subgroups with both normal in the third isomorphism theorem gives ; subgroups and quotients of finite -groups are finite -groups (First isomorphism theorem for groups: , Third isomorphism theorem for groups: , The image of a group homomorphism is a subgroup and its kernel is a normal subgroup, Monoid homomorphism and group homomorphism, The quotient group and coset product , If is finite then ; for finite this equals , Lagrange's theorem: for every subgroup of a finite group , Every subgroup of a finite -group has order a power of , A finite -group has order for a prime and some ).
If then is the exact power of dividing , so and itself is a normal -complement of ; the condition (ii) is then vacuous (Sylow -subgroups of a finite group, A finite -group has order for a prime and some , Lagrange's theorem: for every subgroup of a finite group , Normal p complement and p nilpotent group).
Proof
(ii) implies (i): this is [F1].
(i) implies (ii). Assume that has a normal -complement , retain the notation , , of [F2] for a subgroup with , and note with and . By [F3] applied inside to the normal subgroup and the subgroup , we get ; applying it to the normal subgroup and the subgroup gives . Hence , so every generator of is trivial and ; that is, every element of commutes with every element of , so .
Consequently with and normal in : because and by The centralizer of a normal subgroup is normal. By [F4] the quotient is isomorphic to , a quotient of , and is isomorphic to a subgroup of .
Now is a -group by [F2], so its subgroup is a -group, and the quotient of that -group is a -group by [F4]. As with was arbitrary, (ii) holds.
If then both conditions hold by [F5]. Otherwise step 1.1 gives (ii)(i) and step 3.1 gives (i)(ii), so the two conditions are equivalent. ∎
Depends on
- P automizer condition implies fusion control
- Frobenius normal p complement theorem
- Normal p complement and p nilpotent group
- P local normalizer for normal complement theory
- Control of fusion in a sylow p subgroup
- Sylow $p$-subgroups of a finite group
- The normalizer $N_G(H)=\{g\in G:gHg^{-1}=H\}$ of a subgroup
- The centralizer $C_G(H)$ of a subgroup
- Subgroup
- Normal subgroup: invariance under conjugation
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- Commutators $[g,h]=ghg^{-1}h^{-1}$ and the commutator subgroup $[G,G]$
- The centralizer of a normal subgroup is normal
- $C_G(x)$ and $N_G(H)$ are subgroups of $G$
- 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$
- The image of a group homomorphism is a subgroup and its kernel is a normal subgroup
- 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|$
- Every subgroup of a finite $p$-group has order a power of $p$
- A finite $p$-group has order $p^n$ for a prime $p$ and some $n\in\mathbb N$
- Monoid homomorphism and group homomorphism
- A group homomorphism automatically satisfies $f(e) = e'$ and $f(g^{-1}) = f(g)^{-1}$, and $f(g^{n}) = f(g)^{n}$ for every $n \in \mathbb{Z}$; for monoid homomorphisms preservation of the identity must be assumed
- Sylow I: every finite group has a Sylow $p$-subgroup
- Sylow II: in a finite group every $p$-subgroup lies in a conjugate of any Sylow $p$-subgroup, and the Sylow $p$-subgroups form a single conjugacy class
- Subgroup commutators and the lower central series
- In a group $e^{-1} = e$, $(g^{-1})^{-1} = g$ and $(gh)^{-1} = h^{-1}g^{-1}$, the order of the last product being essential
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
Used by
- Cyclic sylow does not alone imply a normal p complement Counterexample
Dependency tree · two levels
91 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
- David Craven, Finite Group Theory, Lecture 3 (standard reference, not scraped)
- Hans Kurzweil and Bernd Stellmacher, The Theory of Finite Groups, §§7.1–7.2 (standard reference, not scraped)