Signalizer functor

In mathematics, a signalizer functor gives the intersections of a potential subgroup of a finite group with the centralizers of nontrivial elements of an abelian group. The signalizer functor theorem gives conditions under which a signalizer functor comes from a subgroup. The idea is to try to construct a p′-subgroup of a finite group G, which has a good chance of being normal in G, by taking as generators certain p′-subgroups of the centralizers of nonidentity elements in one or several given noncyclic elementary abelian p-subgroups of G. The technique has origins in the Feit–Thompson theorem, and was subsequently developed by many people including (Gorenstein 1969) who defined signalizer functors, (Glauberman 1976) who proved the Solvable Signalizer Functor Theorem for solvable groups, and McBride (1982a, 1982b) who proved it for all groups. This theorem is needed to prove the so-called "dichotomy" stating that a given nonabelian finite simple group either has local characteristic two, or is of component type. It thus plays a major role in the classification of finite simple groups.

## Contents

* 1 Definition
* 2 Solvable signalizer functor theorem
* 2.1 Completeness
* 3 Examples of signalizer functors
* 4 Coprime action
* 5 Normal completion
* 6 References

## Definition

Let A be a noncyclic elementary abelian p-subgroup of the finite group G. An A-signalizer functor on G or simply a signalizer functor when A and G are clear is a mapping θ from the set of nonidentity elements of A to the set of A-invariant p′-subgroups of G satisfying the following properties:

* For every nonidentity a∈A, the group θ(a) is contained in CG(a).
* For every nonidentity a,b∈A, we have θ(a)∩CG(b)⊆θ(b).

The second condition above is called the balance condition. If the subgroups θ(a) are all solvable, then the signalizer functor θ itself is said to be solvable.

## Solvable signalizer functor theorem

Given θ, certain additional, relatively mild, assumptions allow one to prove that the subgroup W=⟨θ(a)∣a∈A,a≠1⟩ of G generated by the subgroups θ(a) is in fact a p′-subgroup. The Solvable Signalizer Functor Theorem proved by Glauberman and mentioned above says that this will be the case if θ is solvable and A has at least three generators. The theorem also states that under these assumptions, W itself will be solvable.

Several earlier versions of the theorem were proven: (Gorenstein 1969) proved this under the stronger assumption that A had rank at least 5. Goldschmidt (1972a, 1972b) proved this under the assumption that A had rank at least 4 or was a 2-group of rank at least 3. (Bender 1975) gave a simple proof for 2-groups using the ZJ theorem, and a proof in a similar spirit has been given for all primes by (Flavell 2007). (Glauberman 1976) gave the definitive result for solvable signalizer functors. Using the classification of finite simple groups, McBride (1982a, 1982b) showed that W is a p′-group without the assumption that θ is solvable.

### Completeness

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 A-invariant p′-subgroups H of G satisfying the following condition:

* H∩CG(a)⊆θ(a) for all nonidentity a∈A.

For example, the subgroups θ(a) belong to И by the balance condition. 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 W above, and W is called the completion of θ. If θ is complete, and W 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 A has at least three generators, then every solvable A-signalizer functor on G is solvably[spelling?] complete.

## Examples of signalizer functors

The easiest way to obtain a signalizer functor is to start with an A-invariant p′-subgroup M of G, and define θ(a)=M∩CG(a) for all nonidentity a∈A. In practice, however, one begins with θ and uses it to construct the A-invariant p′-group.

The simplest signalizer functor used in practice is this: θ(a)=Op′(CG(a)).

A few words of caution are needed here. First, note that θ(a) as defined above is indeed an A-invariant p′-subgroup of G because A is abelian. However, some additional assumptions are needed to show that this θ satisfies the balance condition. One sufficient criterion is that for each nonidentity a∈A, the group CG(a) is solvable (or p-solvable or even p-constrained). Verifying the balance condition for this θ under this assumption requires a famous lemma, known as Thompson's P×Q-lemma. (Note, this lemma is also called Thompson's A×B-lemma, but the A in this use must not be confused with the A appearing in the definition of a signalizer functor!)

## Coprime action

To obtain a better understanding of signalizer functors, it is essential to know the following general fact about finite groups:

* Let E be an abelian noncyclic group acting on the finite group X. Assume that the orders of E and X are relatively prime. Then

X=⟨CX(E0)∣E0⊆E, and E/E0 cyclic ⟩

To prove this fact, one uses the Schur–Zassenhaus theorem to show that for each prime q dividing the order of X, the group X has an E-invariant Sylow q-subgroup. This reduces to the case where X is a q-group. Then an argument by induction on the order of X reduces the statement further to the case where X is elementary abelian with E acting irreducibly. This forces the group E/CE(X) to be cyclic, and the result follows. See either of the books (Aschbacher 2000) or (Kurzweil Stellmacher) for details.

This is used in both the proof and applications of the Solvable Signalizer Functor Theorem. To begin, notice that it quickly implies the claim that if θ is complete, then its completion is the group W defined above.

## Normal completion

The completion of a signalizer functor has a "good chance" of being normal in G, according to the top of the article. Here, the coprime action fact will be used to motivate this claim. Let θ be a complete A-signalizer functor on G

Let B be a noncyclic subgroup of A. Then the coprime action fact together with the balance condition imply that W=⟨θ(a)∣a∈A,a≠1⟩=⟨θ(b)∣b∈B,b≠1⟩.

To see this, observe that because θ(a) is B-invariant, we have

θ(a)=⟨θ(a)∩CG(b)∣b∈B,b≠1⟩⊆⟨θ(b)∣b∈B,b≠1⟩.

The equality above uses the coprime action fact, and the containment uses the balance condition. Now, it is often the case that θ satisfies an "equivariance" condition, namely that for each g∈G and nonidentity a∈A

θ(ag)=θ(a)g.

The superscript denotes conjugation by g. For example, the mapping a↦Op′(CG(a)) (which is often a signalizer functor!) satisfies this condition. If θ satisfies equivariance, then the normalizer of B will normalize W. It follows that if G is generated by the normalizers of the noncyclic subgroups of A, then the completion of θ (i.e. W) is normal in G.

## References

* Aschbacher, Michael (2000), Finite Group Theory, Cambridge University Press, ISBN 978-0-521-78675-1
* Bender, Helmut (1975), "Goldschmidt's 2-signalizer functor theorem", Israel Journal of Mathematics 22 (3): 208–213, doi:10.1007/BF02761590, ISSN 0021-2172
* Flavell, Paul (2007), A new proof of the Solvable Signalizer Functor Theorem, archived from the original on 2012-04-14, https://web.archive.org/web/20120414213214/http://for.mat.bham.ac.uk/P.J.Flavell/research/preprints/ssft.pdf
* Goldschmidt, David M. (1972a), "Solvable signalizer functors on finite groups", Journal of Algebra 21: 137–148, doi:10.1016/0021-8693(72)90040-3, ISSN 0021-8693
* Goldschmidt, David M. (1972b), "2-signalizer functors on finite groups", Journal of Algebra 21: 321–340, doi:10.1016/0021-8693(72)90027-0, ISSN 0021-8693
* Glauberman, George (1976), "On solvable signalizer functors in finite groups", Proceedings of the London Mathematical Society, Third Series 33 (1): 1–27, doi:10.1112/plms/s3-33.1.1, ISSN 0024-6115
* Gorenstein, D. (1969), "On the centralizers of involutions in finite groups", Journal of Algebra 11: 243–277, doi:10.1016/0021-8693(69)90056-8, ISSN 0021-8693
* Kurzweil, Hans; Stellmacher, Bernd (2004), The theory of finite groups, Universitext, Berlin, New York: Springer-Verlag, doi:10.1007/b97433, ISBN 978-0-387-40510-0
* McBride, Patrick Paschal (1982a), "Near solvable signalizer functors on finite groups", Journal of Algebra 78 (1): 181–214, doi:10.1016/0021-8693(82)90107-7, ISSN 0021-8693, https://deepblue.lib.umich.edu/bitstream/2027.42/23875/1/0000114.pdf
* McBride, Patrick Paschal (1982b), "Nonsolvable signalizer functors on finite groups", Journal of Algebra 78 (1): 215–238, doi:10.1016/0021-8693(82)90108-9, ISSN 0021-8693

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Signalizer functor. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Signalizer_functor&oldid=212650"