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.
Burnside normal p complement theorem
Statement
Let be a finite group, a prime and . If , that is, if every element of commutes with every element of the normalizer (The center of a group, The normalizer of a subgroup), then has a normal -complement.
Facts & Assumptions
Given: A finite group , a prime , a Sylow -subgroup with .
Write with ; then and the index is prime to (Sylow -subgroups of a finite group, Sylow I: every finite group has a Sylow -subgroup, Lagrange's theorem: for every subgroup of a finite group ).
As and , every two elements of commute: is abelian (The center of a group, The normalizer of a subgroup).
The transfer of the homomorphism is a homomorphism , explicitly for any transversal, and it agrees with the cycle formula where are the orbit sizes of acting on (Transfer homomorphism for a finite index subgroup, Transfer is a homomorphism, Transfer cycle decomposition formula, Transfer is independent of the transversal).
The orbits of the action of on the finite set partition it, so their sizes satisfy (The orbits of a group action are the equivalence classes of iff for some , and hence partition the acted-on set, Left group actions, transitive actions, and faithful actions).
If is abelian and are conjugate in , then they are conjugate in (Abelian sylow fusion in its normalizer).
If a finite group and a natural number with are given, the power map is a bijection : by Bézout there are with , and , so (The extended Euclidean algorithm: the same descent produces integers with , so Bézout coefficients are computed and not merely shown to exist, The order of every element of a finite group divides the order of the group, If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for , Exponent laws in a group: and for all , and when and commute, Powers : natural exponents in a monoid and integer exponents in a group, with ).
If a finite group has a Sylow -subgroup and an epimorphism , then it has a normal -complement (Equivalent forms of having a normal p complement).
Proof
By [F2] the group is abelian, so the identity map is a homomorphism into an abelian group and the transfer of [F3] is defined; fix a transversal and let be the orbit sizes of on .
For , the cycle formula of [F3] gives , each factor lying in ; also and by [F4].
For each the element equals , so it is a -conjugate of , and both lie in ; by [F5] there is with .
Since commutes with , step 2.1 gives . Hence by [F4], all factors being powers of (Exponent laws in a group: and for all , and when and commute).
The power map is a bijection by [F6], since by [F1]; therefore by step 3.1, and is an epimorphism .
Applying [F7] with and yields that has a normal -complement. ∎
Depends on
- Transfer homomorphism for a finite index subgroup
- Transfer is a homomorphism
- Transfer cycle decomposition formula
- Transfer is independent of the transversal
- Abelian sylow fusion in its normalizer
- Equivalent forms of having a normal p complement
- Normal p complement and p nilpotent group
- Sylow $p$-subgroups of a finite group
- Sylow I: every finite group has a Sylow $p$-subgroup
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The center $Z(G)$ of a group
- The normalizer $N_G(H)=\{g\in G:gHg^{-1}=H\}$ of a subgroup
- An internal semidirect product and a complement to a normal subgroup
- If $\operatorname{ord}(g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$, the powers $g^{0}, \dots, g^{n-1}$ are distinct, and $\langle g \rangle$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$
- The order of every element of a finite group divides the order of the group
- The extended Euclidean algorithm: the same descent produces integers $x, y$ with $ax + by = \gcd(a,b)$, so Bézout coefficients are computed and not merely shown to exist
- Exponent laws in a group: $g^{m+n} = g^{m}g^{n}$ and $(g^{m})^{n} = g^{mn}$ for all $m, n \in \mathbb{Z}$, and $(gh)^{n} = g^{n}h^{n}$ **when $g$ and $h$ commute**
- 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
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- 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
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Left group actions, transitive actions, and faithful actions
- The orbits of a group action are the equivalence classes of $x\sim y$ iff $y=g\cdot x$ for some $g$, and hence partition the acted-on set
- Conjugation $x\mapsto gxg^{-1}$ is an automorphism
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
92 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)