Solvable signalizer functor theorem
Statement
Given certain additional, relatively mild, assumptions allow one to prove that the subgroup of generated by the subgroups is in fact a -subgroup.
The Solvable Signalizer Functor Theorem proved by Glauberman states that this will be the case if is solvable and has at least three generators. The theorem also states that under these assumptions, 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 had rank at least 5. David Goldschmidt proved it under the assumption that 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 is a -group without the assumption that is solvable.
The terminology of completeness is often used in discussions of signalizer functors. Let be a signalizer functor as above, and consider the set И of all -invariant -subgroups of satisfying the following condition:
- for all nonidentity
For example, the subgroups belong to И as a result of the balance condition of θ.
The signalizer functor 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 above, and is called the completion of . If is complete, and turns out to be solvable, then is said to be solvably complete.
Thus, the Solvable Signalizer Functor Theorem can be rephrased by saying that if has at least three generators, then every solvable -signalizer functor on is solvably complete.
Further reading
- Wikipedia, page 28206366, revision 1329523233, Signalizer functor, section Solvable signalizer functor theorem. adopted
About this page
| Tag | 17BR0K6N5B |
|---|---|
| URI | m2://17BR0K6N5B |
| Kind | statement, theorem |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status 17BR0K6N5B. |
| Changed | 4 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.