Frobenius group

A Frobenius group is a finite transitive permutation group in which a nonidentity element fixes at most one point. Abstractly, it has a point stabilizer that meets each distinct conjugate trivially. Frobenius's kernel theorem says that the fixed-point-free elements together with the identity form a normal subgroup, so every Frobenius group splits as a semidirect product of its kernel and a complement. Thompson's deeper theorem says that the kernel is nilpotent. ^{[@isaacs2008]}

Permutation definition

Fix $\alpha\in\Omega$ and put $H=G_\alpha$ . Transitivity makes all point stabilizers conjugate to $$H$$ , and the fixed-point condition is equivalent to

H\cap H^g=1\qquad(g\notin H).

Such a subgroup $$H$$ is called a Frobenius complement.

Frobenius kernel

Define

K=\{1\}\cup\{g\in G\mid g\text{ fixes no point of }\Omega\}.

The set is visibly conjugacy-invariant, but closure under multiplication is far from evident.

Frobenius's original proof used character theory; transfer and local normal-complement methods give alternatives. The basic count is already informative. Distinct nonidentity point stabilizers are disjoint, so if $$n=|G:H|$$ , the conjugates of $$H$$ account for $$n(|H|-1)$$ nonidentity elements. The number of elements not conjugate to a nonidentity member of $$H$$ is therefore

\[ |G|-n(|H|-1)=n=|G:H|. \]

The hard part of the theorem is proving that these $$n$$ elements are closed under multiplication. Once that is known, their subgroup has order $$n$$ , meets $$H$$ trivially, and complements $$H$$ .

Fixed-point-free action

In $G=N\rtimes H$ , conjugation by the complement satisfies

C_N(h)=1\qquad(1\neq h\in H).

Conversely, if a finite group $$H$$ acts fixed-point-freely on a nontrivial finite group $$N$$ , then $N\rtimes H$ is a Frobenius group.

Nilpotence of the kernel

This does not follow from elementary orbit counting. Isaacs separates the proof into two stages: a solvable Frobenius kernel is nilpotent; Thompson's normal $$p$$ -complement criterion then eliminates a minimal nonsolvable counterexample. ^{[@isaacs2008]}

Architecture of the proof

The fixed-point-free action gives $$(|N|,|H|)=1$$ and descends to every $$H$$ -invariant quotient. If $$N$$ is solvable, choose a minimal $$H$$ -invariant normal subgroup $$M$$ , which is elementary abelian. Induction makes $$N/M$$ nilpotent, and coprime action together with the Fitting subgroup lifts its Sylow components to $$N$$ .

For the general case suppose $$N$$ is a minimal counterexample. For each odd prime $$p$$ and $P\in\operatorname{Syl}_p(N)$ , Thompson's normal $$p$$ -complement theorem converts local information about normalizers of characteristic subgroups of $$P$$ into a normal $$p$$ -complement in $$N$$ . Chapter 7 uses the Thompson subgroup $$J(P)$$ and $$Z(P)$$ to compress all required characteristic-subgroup tests to two local control subgroups. Prime by prime, normal Sylow structure is forced, contradicting the assumed nonnilpotence.

This proof pattern became a model for finite local analysis: minimal counterexamples, characteristic $$p$$ -subgroups, and normal-complement criteria turn a global problem into local ones.

Restrictions on complements

A finite Frobenius complement $$H$$ is highly constrained:

every subgroup of order $$pq$$ , where the primes may coincide, is cyclic;
each Sylow subgroup is cyclic or generalized quaternion;
if $$|H|$$ is odd, both $$H'$$ and $$H/H'$$ are cyclic and have coprime orders;
$$H$$ contains no elementary abelian subgroup of order greater than $$p$$ ;
every subgroup of $$H$$ is itself a Frobenius complement on $$N$$ .

Examples

A centralizer recognition criterion

The condition says that no nontrivial coset in $$G/N$$ has a fixed point on $$N$$ . Coprimeness and normal-complement arguments produce a complement, after which the same centralizer condition verifies the trivial-intersection criterion for its conjugates.

This article follows the proof chain in Isaacs, Chapters 6 and 7, carefully separating the permutation definition, existence of the kernel, and Thompson's nilpotence theorem. Complement restrictions and examples are integrated from the same source; history and terminology were cross-checked against the original papers and the cited public encyclopedia revision. ^{[@isaacs2008]} ^{[@frobenius1901]} ^{[@thompson1959]} ^{[@wikipedia-frobenius]}