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 ${\displaystyle p'}$-subgroup of a finite group ${\displaystyle G}$, which has a good chance of being normal in ${\displaystyle G}$, by taking as generators certain ${\displaystyle p'}$-subgroups of the centralizers of nonidentity elements in one or several given noncyclic elementary abelian ${\displaystyle p}$-subgroups of ${\displaystyle 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.

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 ${\displaystyle a\in A}$, the group ${\displaystyle \theta (a)}$ is contained in ${\displaystyle C_{G}(a).}$
• For every nonidentity ${\displaystyle a,b\in A}$, we have ${\displaystyle \theta (a)\cap C_{G}(b)\subseteq \theta (b).}$

The second condition above is called the balance condition. If the subgroups ${\displaystyle \theta (a)}$ are all solvable, then the signalizer functor ${\displaystyle \theta }$ itself is said to be solvable.

Solvable signalizer functor theorem

Given ${\displaystyle \theta ,}$ certain additional, relatively mild, assumptions allow one to prove that the subgroup ${\displaystyle W=\langle \theta (a)\mid a\in A,a\neq 1\rangle }$ of ${\displaystyle G}$ generated by the subgroups ${\displaystyle \theta (a)}$ is in fact a ${\displaystyle p'}$-subgroup. The Solvable Signalizer Functor Theorem proved by Glauberman and mentioned above says that this will be the case if ${\displaystyle \theta }$ is solvable and ${\displaystyle A}$ has at least three generators. The theorem also states that under these assumptions, ${\displaystyle W}$ itself will be solvable.

Several earlier versions of the theorem were proven: Gorenstein (1969) proved this under the stronger assumption that ${\displaystyle A}$ had rank at least 5. Goldschmidt (1972a, 1972b) proved this under the assumption that ${\displaystyle 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 ${\displaystyle W}$ is a ${\displaystyle p'}$-group without the assumption that ${\displaystyle \theta }$ is solvable.

Completeness

The terminology of completeness is often used in discussions of signalizer functors. Let ${\displaystyle \theta }$ be a signalizer functor as above, and consider the set И of all ${\displaystyle A}$-invariant ${\displaystyle p'}$-subgroups ${\displaystyle H}$ of ${\displaystyle G}$ satisfying the following condition:

• ${\displaystyle H\cap C_{G}(a)\subseteq \theta (a)}$ for all nonidentity ${\displaystyle a\in A.}$

For example, the subgroups ${\displaystyle \theta (a)}$ belong to И by the balance condition. The signalizer functor ${\displaystyle \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 ${\displaystyle W}$ above, and ${\displaystyle W}$ is called the completion of ${\displaystyle \theta }$. If ${\displaystyle \theta }$ is complete, and ${\displaystyle W}$ turns out to be solvable, then ${\displaystyle \theta }$ is said to be solvably complete.

Thus, the Solvable Signalizer Functor Theorem can be rephrased by saying that if ${\displaystyle A}$ has at least three generators, then every solvable ${\displaystyle A}$-signalizer functor on ${\displaystyle G}$ is solvably^[spelling?] complete.

Examples of signalizer functors

The easiest way to obtain a signalizer functor is to start with an ${\displaystyle A}$-invariant ${\displaystyle p'}$-subgroup ${\displaystyle M}$ of ${\displaystyle G,}$ and define ${\displaystyle \theta (a)=M\cap C_{G}(a)}$ for all nonidentity ${\displaystyle a\in A.}$ In practice, however, one begins with ${\displaystyle \theta }$ and uses it to construct the ${\displaystyle A}$-invariant ${\displaystyle p'}$-group.

The simplest signalizer functor used in practice is this: ${\displaystyle \theta (a)=O_{p'}(C_{G}(a)).}$

A few words of caution are needed here. First, note that ${\displaystyle \theta (a)}$ as defined above is indeed an ${\displaystyle A}$-invariant ${\displaystyle p'}$-subgroup of ${\displaystyle G}$ because ${\displaystyle A}$ is abelian. However, some additional assumptions are needed to show that this ${\displaystyle \theta }$ satisfies the balance condition. One sufficient criterion is that for each nonidentity ${\displaystyle a\in A,}$ the group ${\displaystyle C_{G}(a)}$ is solvable (or ${\displaystyle p}$-solvable or even ${\displaystyle p}$-constrained). Verifying the balance condition for this ${\displaystyle \theta }$ under this assumption requires a famous lemma, known as Thompson's ${\displaystyle P\times Q}$-lemma. (Note, this lemma is also called Thompson's $$Zdroj:https://en.wikipedia.org?pojem=Signalizer_functor
Text je dostupný za podmienok Creative Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších podmienok. Podrobnejšie informácie nájdete na stránke Podmienky použitia.