Math 2.0

Theorem

Solvable signalizer functor theorem

Statement

Given θ,\theta, certain additional, relatively mild, assumptions allow one to prove that the subgroup W=⟨θ(a)∣a∈A,a≠1⟩W= \langle \theta(a) \mid a \in A, a \neq 1\rangle of GG generated by the subgroups θ(a)\theta(a) is in fact a p′p'-subgroup.

The Solvable Signalizer Functor Theorem proved by Glauberman states that this will be the case if θ\theta is solvable and AA has at least three generators. The theorem also states that under these assumptions, WW itself will be solvable.

Several weaker versions of the theorem were proven before Glauberman's proof was published. Gorenstein proved it under the stronger assumption that AA had rank at least 5. David Goldschmidt proved it under the assumption that AA had rank at least 4 or was a 2-group of rank at least 3. Helmut Bender gave a simple proof for 2-groups using the ZJ theorem, and Paul Flavell gave a proof in a similar spirit for all primes. Glauberman gave the definitive result for solvable signalizer functors. Using the classification of finite simple groups, McBride showed that WW is a p′p'-group without the assumption that θ\theta is solvable.

The terminology of completeness is often used in discussions of signalizer functors. Let θ\theta be a signalizer functor as above, and consider the set И of all AA-invariant p′p'-subgroups HH of GG satisfying the following condition:

  • H∩CG(a)⊆θ(a)H\cap C_G(a) \subseteq \theta(a) for all nonidentity a∈A.a \in A.

For example, the subgroups θ(a)\theta(a) belong to И as a result of the balance condition of θ.

The signalizer functor θ\theta is said to be complete if И has a unique maximal element when ordered by containment. In this case, the unique maximal element can be shown to coincide with WW above, and WW is called the completion of θ\theta. If θ\theta is complete, and WW turns out to be solvable, then θ\theta is said to be solvably complete.

Thus, the Solvable Signalizer Functor Theorem can be rephrased by saying that if AA has at least three generators, then every solvable AA-signalizer functor on GG is solvably complete.

Further reading

  1. Wikipedia, page 28206366, revision 1329523233, Signalizer functor, section Solvable signalizer functor theorem. adopted
About this page
Tag17BR0K6N5B
URIm2://17BR0K6N5B
Kindstatement, theorem
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status 17BR0K6N5B.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.