Namespaces
Variants
Actions

Difference between revisions of "Fitting length"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
m (AUTOMATIC EDIT (latexlist): Replaced 42 formulas out of 42 by TEX code with an average confidence of 2.0 and a minimal confidence of 2.0.)
 
Line 1: Line 1:
 +
<!--This article has been texified automatically. Since there was no Nroff source code for this article,
 +
the semi-automatic procedure described at https://encyclopediaofmath.org/wiki/User:Maximilian_Janisch/latexlist
 +
was used.
 +
If the TeX and formula formatting is correct, please remove this message and the {{TEX|semi-auto}} category.
 +
 +
Out of 42 formulas, 42 were replaced by TEX code.-->
 +
 +
{{TEX|semi-auto}}{{TEX|done}}
 
''nilpotent length''
 
''nilpotent length''
  
The Fitting length, also known as nilpotent length, of a finite [[Solvable group|solvable group]] (cf. also [[Finite group|Finite group]]) provides a measure of how far the group is from being nilpotent. For any finite solvable group <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301201.png" />, the ascending and the descending Fitting chains of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301202.png" /> both have the same number of distinct elements (cf. also [[Fitting chain|Fitting chain]]). The length of the chain (that is, the number of distinct elements in either chain minus one) is called the Fitting length of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301203.png" />. Thus, the trivial group has Fitting length <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301204.png" />, and any non-trivial [[Nilpotent group|nilpotent group]] has Fitting length <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301205.png" />, whereas any finite solvable non-nilpotent group will have Fitting length at least <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301206.png" />; see any standard reference such as [[#References|[a2]]], [[#References|[a3]]], [[#References|[a4]]] for details.
+
The Fitting length, also known as nilpotent length, of a finite [[Solvable group|solvable group]] (cf. also [[Finite group|Finite group]]) provides a measure of how far the group is from being nilpotent. For any finite solvable group $G$, the ascending and the descending Fitting chains of $G$ both have the same number of distinct elements (cf. also [[Fitting chain|Fitting chain]]). The length of the chain (that is, the number of distinct elements in either chain minus one) is called the Fitting length of $G$. Thus, the trivial group has Fitting length $0$, and any non-trivial [[Nilpotent group|nilpotent group]] has Fitting length $1$, whereas any finite solvable non-nilpotent group will have Fitting length at least $2$; see any standard reference such as [[#References|[a2]]], [[#References|[a3]]], [[#References|[a4]]] for details.
  
 
As one measure of the complexity of a solvable group, the Fitting height is related to many other such measures. Thus, it is related to the number of distinct irreducible character degrees, to the derived length, to the number of elements needed to generate the Sylow subgroups of the group, to the derived length of the Sylow subgroups or to their nilpotent class. It is, however, its relationship with fixed points of automorphism groups that is the most striking.
 
As one measure of the complexity of a solvable group, the Fitting height is related to many other such measures. Thus, it is related to the number of distinct irreducible character degrees, to the derived length, to the number of elements needed to generate the Sylow subgroups of the group, to the derived length of the Sylow subgroups or to their nilpotent class. It is, however, its relationship with fixed points of automorphism groups that is the most striking.
  
Frobenius's conjecture, proved by J.G. Thompson [[#References|[a9]]], states that if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301207.png" /> is any finite group admitting an [[Automorphism|automorphism]] <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301208.png" /> such that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f1301209.png" /> has prime order and no element of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012010.png" /> except the identity is fixed by <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012011.png" />, then <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012012.png" /> is nilpotent. This can be extended to the following conjecture. Let <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012013.png" /> be a finite group and let <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012014.png" /> be a group of automorphisms of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012015.png" /> such that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012016.png" /> and no element of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012017.png" /> except the identity is fixed by all the elements of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012018.png" />. Then <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012019.png" /> is solvable and the Fitting length of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012020.png" /> is bounded above by the length of the longest chain of subgroups in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012021.png" />. Denoting by <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012022.png" /> the Fitting length of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012023.png" /> and by <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012024.png" /> the length of the longest chain of subgroups of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012025.png" />, the conjecture states that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012026.png" />. This is known to be true in many cases [[#References|[a6]]] and to be the best possible in all cases [[#References|[a7]]]. Similar bounds can be obtained when the group of automorphism does have some fixed point. For example, [[#References|[a8]]], if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012027.png" /> is a finite solvable group and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012028.png" /> is a solvable group of automorphisms of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012029.png" /> such that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012030.png" />, then <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012031.png" />, where <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012032.png" /> denotes the subgroup of the elements of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012033.png" /> that are fixed under every automorphism in <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012034.png" />. In some cases one can also give bounds when <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012035.png" /> is not solvable, see [[#References|[a5]]], but these bounds are bigger.
+
Frobenius's conjecture, proved by J.G. Thompson [[#References|[a9]]], states that if $G$ is any finite group admitting an [[Automorphism|automorphism]] $\phi$ such that $\phi$ has prime order and no element of $G$ except the identity is fixed by $\phi$, then $G$ is nilpotent. This can be extended to the following conjecture. Let $G$ be a finite group and let $A$ be a group of automorphisms of $G$ such that $( | A | , | G | ) = 1$ and no element of $G$ except the identity is fixed by all the elements of $A$. Then $G$ is solvable and the Fitting length of $G$ is bounded above by the length of the longest chain of subgroups in $A$. Denoting by $h ( G )$ the Fitting length of $G$ and by $\operatorname{l} ( A )$ the length of the longest chain of subgroups of $A$, the conjecture states that $h ( G ) \leq \text{l} ( A )$. This is known to be true in many cases [[#References|[a6]]] and to be the best possible in all cases [[#References|[a7]]]. Similar bounds can be obtained when the group of automorphism does have some fixed point. For example, [[#References|[a8]]], if $G$ is a finite solvable group and $A$ is a solvable group of automorphisms of $G$ such that $( | A | , | G | ) = 1$, then $h ( G ) \leq h ( C _ { G } ( A ) ) + 2 \text{l} ( A )$, where $C _ { G } ( A )$ denotes the subgroup of the elements of $G$ that are fixed under every automorphism in $A$. In some cases one can also give bounds when $A$ is not solvable, see [[#References|[a5]]], but these bounds are bigger.
  
Fixed-point-free automorphisms are closely related to Carter subgroups of solvable groups (cf. also [[Carter subgroup|Carter subgroup]]). In [[#References|[a1]]], E.C. Dade proved that there is an exponential function <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012036.png" /> such that if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012037.png" /> is a finite solvable group and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012038.png" /> is its Carter subgroup, then <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012039.png" />, and conjectured that there actually exists a linear function <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012040.png" /> with the same properties. In [[#References|[a7]]], it is proved that there exits a quadratic function <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012041.png" /> which satisfies the condition whenever <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/f/f130/f130120/f13012042.png" /> is a direct product of elementary Abelian groups.
+
Fixed-point-free automorphisms are closely related to Carter subgroups of solvable groups (cf. also [[Carter subgroup|Carter subgroup]]). In [[#References|[a1]]], E.C. Dade proved that there is an exponential function $f$ such that if $G$ is a finite solvable group and $C$ is its Carter subgroup, then $h ( G ) \leq f ( \text{l} ( C ) )$, and conjectured that there actually exists a linear function $f$ with the same properties. In [[#References|[a7]]], it is proved that there exits a quadratic function $f$ which satisfies the condition whenever $C$ is a direct product of elementary Abelian groups.
  
 
====References====
 
====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  E.C. Dade,  "Carter subgroups and Fitting heights of finite solvable groups"  ''Illinois J. Math.'' , '''13'''  (1969)  pp. 449–514</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign="top">  K. Doerk,  T. Hawkes,  "Finite soluble groups" , de Gruyter  (1992)</TD></TR><TR><TD valign="top">[a3]</TD> <TD valign="top">  B. Huppert,  "Endliche Gruppen I" , Springer  (1967)</TD></TR><TR><TD valign="top">[a4]</TD> <TD valign="top">  B. Huppert,  N. Blackburn,  "Finite Groups II" , Springer  (1982)</TD></TR><TR><TD valign="top">[a5]</TD> <TD valign="top">  H. Kurzweil,  "Auflösbare Gruppen auf denen nicht auflösbare Gruppen operieren"  ''Manuscripta Math.'' , '''41'''  (1983)  pp. 233–305</TD></TR><TR><TD valign="top">[a6]</TD> <TD valign="top">  A. Turull,  "Fixed point free action with some regular orbits"  ''J. Algebra'' , '''194'''  (1997)  pp. 362–377</TD></TR><TR><TD valign="top">[a7]</TD> <TD valign="top">  A. Turull,  "Character theory and length problems" , ''Finite and Locally Finite Groups (Istanbul, 1994)'' , Kluwer Acad. Publ.  (1995)  pp. 377–400</TD></TR><TR><TD valign="top">[a8]</TD> <TD valign="top">  A. Turull,  "Fitting height of groups and of fixed points"  ''J. Algebra'' , '''86'''  (1984)  pp. 555–566</TD></TR><TR><TD valign="top">[a9]</TD> <TD valign="top">  J.G. Thompson,  "Finite groups with fixed-point-free automorphisms of prime order"  ''Proc. Nat. Acad. Sci. USA'' , '''45'''  (1959)  pp. 578–581</TD></TR></table>
+
<table><tr><td valign="top">[a1]</td> <td valign="top">  E.C. Dade,  "Carter subgroups and Fitting heights of finite solvable groups"  ''Illinois J. Math.'' , '''13'''  (1969)  pp. 449–514</td></tr><tr><td valign="top">[a2]</td> <td valign="top">  K. Doerk,  T. Hawkes,  "Finite soluble groups" , de Gruyter  (1992)</td></tr><tr><td valign="top">[a3]</td> <td valign="top">  B. Huppert,  "Endliche Gruppen I" , Springer  (1967)</td></tr><tr><td valign="top">[a4]</td> <td valign="top">  B. Huppert,  N. Blackburn,  "Finite Groups II" , Springer  (1982)</td></tr><tr><td valign="top">[a5]</td> <td valign="top">  H. Kurzweil,  "Auflösbare Gruppen auf denen nicht auflösbare Gruppen operieren"  ''Manuscripta Math.'' , '''41'''  (1983)  pp. 233–305</td></tr><tr><td valign="top">[a6]</td> <td valign="top">  A. Turull,  "Fixed point free action with some regular orbits"  ''J. Algebra'' , '''194'''  (1997)  pp. 362–377</td></tr><tr><td valign="top">[a7]</td> <td valign="top">  A. Turull,  "Character theory and length problems" , ''Finite and Locally Finite Groups (Istanbul, 1994)'' , Kluwer Acad. Publ.  (1995)  pp. 377–400</td></tr><tr><td valign="top">[a8]</td> <td valign="top">  A. Turull,  "Fitting height of groups and of fixed points"  ''J. Algebra'' , '''86'''  (1984)  pp. 555–566</td></tr><tr><td valign="top">[a9]</td> <td valign="top">  J.G. Thompson,  "Finite groups with fixed-point-free automorphisms of prime order"  ''Proc. Nat. Acad. Sci. USA'' , '''45'''  (1959)  pp. 578–581</td></tr></table>

Latest revision as of 17:03, 1 July 2020

nilpotent length

The Fitting length, also known as nilpotent length, of a finite solvable group (cf. also Finite group) provides a measure of how far the group is from being nilpotent. For any finite solvable group $G$, the ascending and the descending Fitting chains of $G$ both have the same number of distinct elements (cf. also Fitting chain). The length of the chain (that is, the number of distinct elements in either chain minus one) is called the Fitting length of $G$. Thus, the trivial group has Fitting length $0$, and any non-trivial nilpotent group has Fitting length $1$, whereas any finite solvable non-nilpotent group will have Fitting length at least $2$; see any standard reference such as [a2], [a3], [a4] for details.

As one measure of the complexity of a solvable group, the Fitting height is related to many other such measures. Thus, it is related to the number of distinct irreducible character degrees, to the derived length, to the number of elements needed to generate the Sylow subgroups of the group, to the derived length of the Sylow subgroups or to their nilpotent class. It is, however, its relationship with fixed points of automorphism groups that is the most striking.

Frobenius's conjecture, proved by J.G. Thompson [a9], states that if $G$ is any finite group admitting an automorphism $\phi$ such that $\phi$ has prime order and no element of $G$ except the identity is fixed by $\phi$, then $G$ is nilpotent. This can be extended to the following conjecture. Let $G$ be a finite group and let $A$ be a group of automorphisms of $G$ such that $( | A | , | G | ) = 1$ and no element of $G$ except the identity is fixed by all the elements of $A$. Then $G$ is solvable and the Fitting length of $G$ is bounded above by the length of the longest chain of subgroups in $A$. Denoting by $h ( G )$ the Fitting length of $G$ and by $\operatorname{l} ( A )$ the length of the longest chain of subgroups of $A$, the conjecture states that $h ( G ) \leq \text{l} ( A )$. This is known to be true in many cases [a6] and to be the best possible in all cases [a7]. Similar bounds can be obtained when the group of automorphism does have some fixed point. For example, [a8], if $G$ is a finite solvable group and $A$ is a solvable group of automorphisms of $G$ such that $( | A | , | G | ) = 1$, then $h ( G ) \leq h ( C _ { G } ( A ) ) + 2 \text{l} ( A )$, where $C _ { G } ( A )$ denotes the subgroup of the elements of $G$ that are fixed under every automorphism in $A$. In some cases one can also give bounds when $A$ is not solvable, see [a5], but these bounds are bigger.

Fixed-point-free automorphisms are closely related to Carter subgroups of solvable groups (cf. also Carter subgroup). In [a1], E.C. Dade proved that there is an exponential function $f$ such that if $G$ is a finite solvable group and $C$ is its Carter subgroup, then $h ( G ) \leq f ( \text{l} ( C ) )$, and conjectured that there actually exists a linear function $f$ with the same properties. In [a7], it is proved that there exits a quadratic function $f$ which satisfies the condition whenever $C$ is a direct product of elementary Abelian groups.

References

[a1] E.C. Dade, "Carter subgroups and Fitting heights of finite solvable groups" Illinois J. Math. , 13 (1969) pp. 449–514
[a2] K. Doerk, T. Hawkes, "Finite soluble groups" , de Gruyter (1992)
[a3] B. Huppert, "Endliche Gruppen I" , Springer (1967)
[a4] B. Huppert, N. Blackburn, "Finite Groups II" , Springer (1982)
[a5] H. Kurzweil, "Auflösbare Gruppen auf denen nicht auflösbare Gruppen operieren" Manuscripta Math. , 41 (1983) pp. 233–305
[a6] A. Turull, "Fixed point free action with some regular orbits" J. Algebra , 194 (1997) pp. 362–377
[a7] A. Turull, "Character theory and length problems" , Finite and Locally Finite Groups (Istanbul, 1994) , Kluwer Acad. Publ. (1995) pp. 377–400
[a8] A. Turull, "Fitting height of groups and of fixed points" J. Algebra , 86 (1984) pp. 555–566
[a9] J.G. Thompson, "Finite groups with fixed-point-free automorphisms of prime order" Proc. Nat. Acad. Sci. USA , 45 (1959) pp. 578–581
How to Cite This Entry:
Fitting length. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Fitting_length&oldid=18767
This article was adapted from an original article by Alexandre Turull (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article