Solvable group

Group with subnormal series where all factors are abelian

Algebraic structure → Group theory
Group theory

Basic notions

* Subgroup
* Normal subgroup
* Group action

* Quotient group
* (Semi-)direct product
* Direct sum
* Free product
* Wreath product

Group homomorphisms

* kernel
* image

* simple
* finite
* infinite
* continuous
* multiplicative
* additive
* cyclic
* abelian
* dihedral
* nilpotent
* solvable

* Glossary of group theory
* List of group theory topics

Finite groups

* Cyclic group Zn
* Symmetric group Sn
* Alternating group An

* Dihedral group Dn
* Quaternion group Q

* Cauchy's theorem
* Lagrange's theorem

* Sylow theorems
* Hall's theorem

* p-group
* Elementary abelian group

* Frobenius group

* Schur multiplier

Classification of finite simple groups

* cyclic
* alternating
* Lie type
* sporadic

* Discrete groups
* Lattices

* Integers ( Z {\displaystyle \mathbb {Z} } )
* Free group

Modular groups

* PSL(2,  Z {\displaystyle \mathbb {Z} } )
* SL(2,  Z {\displaystyle \mathbb {Z} } )

* Arithmetic group
* Lattice
* Hyperbolic group

Topological and Lie groups

* Solenoid
* Circle

* General linear GL(n)

* Special linear SL(n)

* Orthogonal O(n)

* Euclidean E(n)

* Special orthogonal SO(n)

* Unitary U(n)

* Special unitary SU(n)

* Symplectic Sp(n)

* G2
* F4
* E6
* E7
* E8

* Lorentz
* Poincaré
* Conformal

* Diffeomorphism
* Loop

Infinite dimensional Lie group

* O(∞)
* SU(∞)
* Sp(∞)

Algebraic groups

* Linear algebraic group

* Reductive group

* Abelian variety

* Elliptic curve

* v
* t
* e

In mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminates in the trivial subgroup.

## Motivation

[edit]

Historically, the word "solvable" arose from Galois theory and the proof of the general unsolvability of quintic equations. Specifically, a polynomial equation is solvable in radicals if and only if the corresponding Galois group is solvable[1] (note this theorem holds only in characteristic 0). This means associated to a polynomial  f ∈ F [ x ] {\displaystyle f\in F[x]} there is a tower of field extensions

> F = F 0 ⊆ F 1 ⊆ F 2 ⊆ ⋯ ⊆ F m = K {\displaystyle F=F_{0}\subseteq F_{1}\subseteq F_{2}\subseteq \cdots \subseteq F_{m}=K}

such that

1. F i = F i − 1 [ α i ] {\displaystyle F_{i}=F_{i-1}[\alpha _{i}]} where  α i m i ∈ F i − 1 {\displaystyle \alpha _{i}^{m_{i}}\in F_{i-1}} , so  α i {\displaystyle \alpha _{i}} is a solution to the equation  x m i − a {\displaystyle x^{m_{i}}-a} where  a ∈ F i − 1 {\displaystyle a\in F_{i-1}}
2. F m {\displaystyle F_{m}} contains a splitting field for  f ( x ) {\displaystyle f(x)}

### Example

[edit]

The smallest Galois field extension of  Q {\displaystyle \mathbb {Q} } containing the element

> a = 2 + 3 5 {\displaystyle a={\sqrt[{5}]{{\sqrt {2}}+{\sqrt {3}}}}}

gives a solvable group. The associated field extensions

> Q ⊆ Q ( 2 ) ⊆ Q ( 2 , 3 ) ⊆ Q ( 2 , 3 ) ( e 2 i π / 5 ) ⊆ Q ( 2 , 3 ) ( e 2 i π / 5 , a ) {\displaystyle \mathbb {Q} \subseteq \mathbb {Q} ({\sqrt {2}})\subseteq \mathbb {Q} ({\sqrt {2}},{\sqrt {3}})\subseteq \mathbb {Q} ({\sqrt {2}},{\sqrt {3}})\left(e^{2i\pi /5}\right)\subseteq \mathbb {Q} ({\sqrt {2}},{\sqrt {3}})\left(e^{2i\pi /5},a\right)}

give a solvable group of Galois extensions containing the following composition factors (where  1 {\displaystyle 1} is the identity permutation).

* A u t ( Q ( 2 ) / Q ) ≅ Z / 2 {\displaystyle \mathrm {Aut} \left(\mathbb {Q({\sqrt {2}})} \right/\mathbb {Q} )\cong \mathbb {Z} /2} with group action  f ( ± 2 ) = ∓ 2 ,   f 2 = 1 {\displaystyle f\left(\pm {\sqrt {2}}\right)=\mp {\sqrt {2}},\ f^{2}=1} , and minimal polynomial x 2 − 2 {\displaystyle x^{2}-2}
* A u t ( Q ( 2 , 3 ) / Q ( 2 ) ) ≅ Z / 2 {\displaystyle \mathrm {Aut} \left(\mathbb {Q({\sqrt {2}},{\sqrt {3}})} \right/\mathbb {Q({\sqrt {2}})} )\cong \mathbb {Z} /2} with group action  g ( ± 3 ) = ∓ 3 ,   g 2 = 1 {\displaystyle g\left(\pm {\sqrt {3}}\right)=\mp {\sqrt {3}},\ g^{2}=1} , and minimal polynomial  x 2 − 3 {\displaystyle x^{2}-3}
* A u t ( Q ( 2 , 3 ) ( e 2 i π / 5 ) / Q ( 2 , 3 ) ) ≅ Z / 4 {\displaystyle \mathrm {Aut} \left(\mathbb {Q} ({\sqrt {2}},{\sqrt {3}})\left(e^{2i\pi /5}\right)/\mathbb {Q} ({\sqrt {2}},{\sqrt {3}})\right)\cong \mathbb {Z} /4} with group action  h n ( e 2 i m π / 5 ) = e 2 ( n + 1 ) m i π / 5 ,   0 ≤ n ≤ 3 ,   h 4 = 1 {\displaystyle h^{n}\left(e^{2im\pi /5}\right)=e^{2(n+1)mi\pi /5},\ 0\leq n\leq 3,\ h^{4}=1} , and minimal polynomial  x 4 + x 3 + x 2 + x + 1 = ( x 5 − 1 ) / ( x − 1 ) {\displaystyle x^{4}+x^{3}+x^{2}+x+1=(x^{5}-1)/(x-1)} containing the 5th roots of unity excluding  1 {\displaystyle 1}
* A u t ( Q ( 2 , 3 ) ( e 2 i π / 5 , a ) / Q ( 2 , 3 ) ( e 2 i π / 5 ) ) ≅ Z / 5 {\displaystyle \mathrm {Aut} \left(\mathbb {Q} ({\sqrt {2}},{\sqrt {3}})\left(e^{2i\pi /5},a\right)/\mathbb {Q} ({\sqrt {2}},{\sqrt {3}})\left(e^{2i\pi /5}\right)\right)\cong \mathbb {Z} /5} with group action  j l ( a ) = e 2 l i π / 5 a ,   j 5 = 1 {\displaystyle j^{l}(a)=e^{2li\pi /5}a,\ j^{5}=1} , and minimal polynomial  x 5 − ( 2 + 3 ) {\displaystyle x^{5}-\left({\sqrt {2}}+{\sqrt {3}}\right)}

Each of the defining group actions (for example,  f g h 3 j 4 {\displaystyle fgh^{3}j^{4}} ) changes a single extension while keeping all of the other extensions fixed. The 80 group actions are the set  { f a g b h n j l ,   0 ≤ a , b ≤ 1 ,   0 ≤ n ≤ 3 ,   0 ≤ l ≤ 4 } {\displaystyle \\{f^{a}g^{b}h^{n}j^{l},\ 0\leq a,b\leq 1,\ 0\leq n\leq 3,\ 0\leq l\leq 4\\}} .

This group is not abelian. For example,  h j ( a ) = h ( e 2 i π / 5 a ) = e 4 i π / 5 a {\displaystyle hj(a)=h(e^{2i\pi /5}a)=e^{4i\pi /5}a} , whilst  j h ( a ) = j ( a ) = e 2 i π / 5 a {\displaystyle jh(a)=j(a)=e^{2i\pi /5}a} , and in fact,  j h = h j 3 {\displaystyle jh=hj^{3}} .

It is isomorphic to  ( Z 5 ⋊ φ Z 4 ) × ( Z 2 × Z 2 ) {\displaystyle (\mathbb {Z} _{5}\rtimes _{\varphi }\mathbb {Z} _{4})\times (\mathbb {Z} _{2}\times \mathbb {Z} _{2})} , where  φ h ( j ) = h j h − 1 = j 2 {\displaystyle \varphi _{h}(j)=hjh^{-1}=j^{2}} , defined using the semidirect product and direct product of the cyclic groups.  Z 4 {\displaystyle \mathbb {Z} _{4}} is not a normal subgroup.

## Definition

[edit]

A group G is called solvable if it has a subnormal series whose factor groups (quotient groups) are all abelian, that is, if there are subgroups

1 = G 0 ◃ G 1 ◃ ⋯ ◃ G k = G {\displaystyle 1=G_{0}\triangleleft G_{1}\triangleleft \cdots \triangleleft G_{k}=G}

meaning that Gj−1 is normal in Gj, such that Gj /Gj−1 is an abelian group, for j = 1, 2, ..., k.

Or equivalently, if its derived series, the descending normal series

G ▹ G ( 1 ) ▹ G ( 2 ) ▹ ⋯ , {\displaystyle G\triangleright G^{(1)}\triangleright G^{(2)}\triangleright \cdots ,}

where every subgroup is the commutator subgroup of the previous one, eventually reaches the trivial subgroup of G. These two definitions are equivalent, since for every group H and every normal subgroup N of H, the quotient H/N is abelian if and only if N includes the commutator subgroup of H. The least n such that G(n) = 1 is called the derived length of the solvable group G.

For finite groups, an equivalent definition is that a solvable group is a group with a composition series all of whose factors are cyclic groups of prime order. This is equivalent because a finite group has finite composition length, and every simple abelian group is cyclic of prime order. The Jordan–Hölder theorem guarantees that if one composition series has this property, then all composition series will have this property as well. For the Galois group of a polynomial, these cyclic groups correspond to nth roots (radicals) over some field. The equivalence does not necessarily hold for infinite groups: for example, since every nontrivial subgroup of the group Z of integers under addition is isomorphic to Z itself, it has no composition series, but the normal series {0, Z}, with its only factor group isomorphic to Z, proves that it is in fact solvable.

## Examples

[edit]

### Abelian groups

[edit]

The basic example of solvable groups are abelian groups. They are trivially solvable since a subnormal series is formed by just the group itself and the trivial group. But non-abelian groups may or may not be solvable.

### Nilpotent groups

[edit]

More generally, all nilpotent groups are solvable. In particular, finite p-groups are solvable, as all finite p-groups are nilpotent.

#### Quaternion groups

[edit]

In particular, the quaternion group is a solvable group given by the group extension

> 1 → Z / 2 → Q → Z / 2 × Z / 2 → 1 {\displaystyle 1\to \mathbb {Z} /2\to Q\to \mathbb {Z} /2\times \mathbb {Z} /2\to 1}

where the kernel  Z / 2 {\displaystyle \mathbb {Z} /2} is the subgroup generated by  − 1 {\displaystyle -1} .

### Group extensions

[edit]

Group extensions form the prototypical examples of solvable groups. That is, if  G {\displaystyle G} and  G ′ {\displaystyle G'} are solvable groups, then any extension

> 1 → G → G ″ → G ′ → 1 {\displaystyle 1\to G\to G''\to G'\to 1}

defines a solvable group  G ″ {\displaystyle G''} . In fact, all solvable groups can be formed from such group extensions.

### Non-abelian group which is non-nilpotent

[edit]

A small example of a solvable, non-nilpotent group is the symmetric group S3. In fact, as the smallest simple non-abelian group is A5, (the alternating group of degree 5) it follows that every group with order less than 60 is solvable.

### Finite groups of odd order

[edit]

The Feit–Thompson theorem states that every finite group of odd order is solvable. In particular this implies that if a finite group is simple, it is either a prime cyclic or of even order.

### Non-example

[edit]

The group S5 is not solvable — it has a composition series {E, A5, S5} (and the Jordan–Hölder theorem states that every other composition series is equivalent to that one), giving factor groups isomorphic to A5 and C2; and A5 is not abelian. Generalizing this argument, coupled with the fact that An is a normal, maximal, non-abelian simple subgroup of Sn for n > 4, we see that Sn is not solvable for n > 4\. This is a key step in the proof that for every n > 4 there are polynomials of degree n which are not solvable by radicals (Abel–Ruffini theorem). This property is also used in complexity theory in the proof of Barrington's theorem.

### Subgroups of GL2

[edit]

Consider the subgroups

> B = { [ ∗ ∗ 0 ∗ ] } ,  U = { [ 1 ∗ 0 1 ] } {\displaystyle B=\left\\{{\begin{bmatrix}*&*\\\0&*\end{bmatrix}}\right\\}{\text{, }}U=\left\\{{\begin{bmatrix}1&*\\\0&1\end{bmatrix}}\right\\}} of  G L 2 ( F ) {\displaystyle GL_{2}(\mathbb {F} )}

for some field  F {\displaystyle \mathbb {F} } . Then, the group quotient  B / U {\displaystyle B/U} can be found by taking arbitrary elements in  B , U {\displaystyle B,U} , multiplying them together, and figuring out what structure this gives. So

> [ a b 0 c ] ⋅ [ 1 d 0 1 ] = [ a a d + b 0 c ] {\displaystyle {\begin{bmatrix}a&b\\\0&c\end{bmatrix}}\cdot {\begin{bmatrix}1&d\\\0&1\end{bmatrix}}={\begin{bmatrix}a&ad+b\\\0&c\end{bmatrix}}}

Note the determinant condition on  G L 2 {\displaystyle GL_{2}} implies  a c ≠ 0 {\displaystyle ac\neq 0} , hence  F × × F × ⊂ B {\displaystyle \mathbb {F} ^{\times }\times \mathbb {F} ^{\times }\subset B} is a subgroup (which are the matrices where  b = 0 {\displaystyle b=0} ). For fixed  a , b {\displaystyle a,b} , the linear equation  a d + b = 0 {\displaystyle ad+b=0} implies  d = − b / a {\displaystyle d=-b/a} , which is an arbitrary element in  F {\displaystyle \mathbb {F} } since  b ∈ F {\displaystyle b\in \mathbb {F} } . Since we can take any matrix in  B {\displaystyle B} and multiply it by the matrix

> [ 1 d 0 1 ] {\displaystyle {\begin{bmatrix}1&d\\\0&1\end{bmatrix}}}

with  d = − b / a {\displaystyle d=-b/a} , we can get a diagonal matrix in  B {\displaystyle B} . This shows the quotient group  B / U ≅ F × × F × {\displaystyle B/U\cong \mathbb {F} ^{\times }\times \mathbb {F} ^{\times }} .

#### Remark

[edit]

Notice that this description gives the decomposition of  B {\displaystyle B} as  F ⋊ ( F × × F × ) {\displaystyle \mathbb {F} \rtimes (\mathbb {F} ^{\times }\times \mathbb {F} ^{\times })} where  ( a , c ) {\displaystyle (a,c)} acts on  b {\displaystyle b} by  ( a , c ) ( b ) = a b {\displaystyle (a,c)(b)=ab} . This implies  ( a , c ) ( b + b ′ ) = ( a , c ) ( b ) + ( a , c ) ( b ′ ) = a b + a b ′ {\displaystyle (a,c)(b+b')=(a,c)(b)+(a,c)(b')=ab+ab'} . Also, a matrix of the form

> [ a b 0 c ] {\displaystyle {\begin{bmatrix}a&b\\\0&c\end{bmatrix}}}

corresponds to the element  ( b ) × ( a , c ) {\displaystyle (b)\times (a,c)} in the group.

### Borel subgroups

[edit]

For a linear algebraic group G {\displaystyle G} , a Borel subgroup is defined as a subgroup which is closed, connected, and solvable in  G {\displaystyle G} , and is a maximal possible subgroup with these properties (note the first two are topological properties). For example, in  G L n {\displaystyle GL_{n}} and  S L n {\displaystyle SL_{n}} the groups of upper-triangular, or lower-triangular matrices are two of the Borel subgroups. The example given above, the subgroup  B {\displaystyle B} in  G L 2 {\displaystyle GL_{2}} , is a Borel subgroup.

#### Borel subgroup in GL3

[edit]

In  G L 3 {\displaystyle GL_{3}} there are the subgroups

> B = { [ ∗ ∗ ∗ 0 ∗ ∗ 0 0 ∗ ] } ,   U 1 = { [ 1 ∗ ∗ 0 1 ∗ 0 0 1 ] } {\displaystyle B=\left\\{{\begin{bmatrix}*&*&*\\\0&*&*\\\0&0&*\end{bmatrix}}\right\\},{\text{ }}U_{1}=\left\\{{\begin{bmatrix}1&*&*\\\0&1&*\\\0&0&1\end{bmatrix}}\right\\}}

Notice  B / U 1 ≅ F × × F × × F × {\displaystyle B/U_{1}\cong \mathbb {F} ^{\times }\times \mathbb {F} ^{\times }\times \mathbb {F} ^{\times }} , hence the Borel group has the form

> U ⋊ ( F × × F × × F × ) {\displaystyle U\rtimes (\mathbb {F} ^{\times }\times \mathbb {F} ^{\times }\times \mathbb {F} ^{\times })}

#### Borel subgroup in product of simple linear algebraic groups

[edit]

In the product group  G L n × G L m {\displaystyle GL_{n}\times GL_{m}} the Borel subgroup can be represented by matrices of the form

> [ T 0 0 S ] {\displaystyle {\begin{bmatrix}T&0\\\0&S\end{bmatrix}}}

where  T {\displaystyle T} is an  n × n {\displaystyle n\times n} upper triangular matrix and  S {\displaystyle S} is a  m × m {\displaystyle m\times m} upper triangular matrix.

### Z-groups

[edit]

Any finite group whose p-Sylow subgroups are cyclic is a semidirect product of two cyclic groups, in particular solvable. Such groups are called Z-groups.

## OEIS values

[edit]

Numbers of solvable groups with order n are (start with n = 0)

0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 12, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, ... (sequence A201733 in the OEIS)

Orders of non-solvable groups are

60, 120, 168, 180, 240, 300, 336, 360, 420, 480, 504, 540, 600, 660, 672, 720, 780, 840, 900, 960, 1008, 1020, 1080, 1092, 1140, 1176, 1200, 1260, 1320, 1344, 1380, 1440, 1500, ... (sequence A056866 in the OEIS)

## Properties

[edit]

Solvability is closed under a number of operations.

* If G is solvable, and H is a subgroup of G, then H is solvable.[2]
* If G is solvable, and there is a homomorphism from G onto H, then H is solvable; equivalently (by the first isomorphism theorem), if G is solvable, and N is a normal subgroup of G, then G/N is solvable.[3]
* The previous properties can be expanded into the following "three for the price of two" property: G is solvable if and only if both N and G/N are solvable.
* In particular, if G and H are solvable, the direct product G × H is solvable.

Solvability is closed under group extension:

* If H and G/H are solvable, then so is G; in particular, if N and H are solvable, their semidirect product is also solvable.

It is also closed under wreath product:

* If G and H are solvable, and X is a G-set, then the wreath product of G and H with respect to X is also solvable.

For any positive integer N, the solvable groups of derived length at most N form a subvariety of the variety of groups, as they are closed under the taking of homomorphic images, subalgebras, and (direct) products. The direct product of a sequence of solvable groups with unbounded derived length is not solvable, so the class of all solvable groups is not a variety.

## Burnside's theorem

[edit]

Main article: Burnside's theorem

Burnside's theorem states that if G is a finite group of order paqb where p and q are prime numbers, and a and b are non-negative integers, then G is solvable.

## Related concepts

[edit]

### Supersolvable groups

[edit]

Main article: supersolvable group

As a strengthening of solvability, a group G is called supersolvable (or supersoluble) if it has an invariant normal series whose factors are all cyclic. Since a normal series has finite length by definition, uncountable groups are not supersolvable. In fact, all supersolvable groups are finitely generated, and an abelian group is supersolvable if and only if it is finitely generated. The alternating group A4 is an example of a finite solvable group that is not supersolvable.

If we restrict ourselves to finitely generated groups, we can consider the following arrangement of classes of groups:

cyclic < abelian < nilpotent < supersolvable < polycyclic < solvable < finitely generated group.

### Virtually solvable groups

[edit]

A group G is called virtually solvable if it has a solvable subgroup of finite index. This is similar to virtually abelian. Clearly all solvable groups are virtually solvable, since one can just choose the group itself, which has index 1.

### Hypoabelian

[edit]

A solvable group is one whose derived series reaches the trivial subgroup at a finite stage. For an infinite group, the finite derived series may not stabilize, but the transfinite derived series always stabilizes. A group whose transfinite derived series reaches the trivial group is called a hypoabelian group, and every solvable group is a hypoabelian group. The first ordinal α such that G(α) = G(α+1) is called the (transfinite) derived length of the group G, and it has been shown that every ordinal is the derived length of some group (Malcev 1949).

### p-solvable

[edit]

A finite group is p-solvable for some prime p if every factor in the composition series is a p-group or has order prime to p. A finite group is solvable iff it is p-solvable for every p. [4]

## See also

[edit]

* Prosolvable group

## Notes

[edit]

1. ^ Milne. Field Theory (PDF). p. 45.
2. ^ Rotman (1995), Theorem 5.15, p. 102, at Google Books
3. ^ Rotman (1995), Theorem 5.16, p. 102, at Google Books
4. ^ "p-solvable-groups". Group props wiki.

## References

[edit]

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Solvable group" – news · newspapers · books · scholar · JSTOR (January 2008) (Learn how and when to remove this message)

|

* Malcev, A. I. (1949), "Generalized nilpotent algebras and their associated groups", Mat. Sbornik, New Series, 25 (67): 347–366, MR 0032644
* Rotman, Joseph J. (1995), An Introduction to the Theory of Groups, Graduate Texts in Mathematics, vol. 148 (4 ed.), Springer, ISBN 978-0-387-94285-8

## External links

[edit]

* OEIS sequence A056866 (Orders of non-solvable groups)
* Solvable groups as iterated extensions

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template
*[OEIS]: On-Line Encyclopedia of Integer Sequences