Solvable group

Solvable group
Concepts in group theory
category of groups
subgroups, normal subgroups
group homomorphisms, kernel, image, quotient
direct product, direct sum
semidirect product, wreath product
Types of groups
simple, finite, infinite
discrete, continuous
multiplicative, additive
cyclic, abelian, dihedral
nilpotent, solvable
list of group theory topics
glossary of group theory

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. That is, a solvable group is a group whose derived series terminates in the trivial subgroup.

Historically, the word "solvable" arose from Galois theory and the proof of the general unsolvability of quintic equation. Specifically, a polynomial equation is solvable by radicals if and only if the corresponding Galois group is solvable.

Contents

Definition

A group G is called solvable if it has a subnormal series whose factor groups are all abelian, that is, if there are subgroups \{1\}=G_0\leq G_1\leq\cdots\leq G_k=G such that Gj − 1 is normal in Gj, and Gj / Gj − 1 is an abelian group, for j=1,2,\dots,k.

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

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 {1} 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 H(1). 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 abelian group has finite composition length, and every finite 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

All abelian groups are solvable - the quotient A/B will always be abelian if A is abelian. But non-abelian groups may or may not be solvable.

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

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.

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 proof of Barrington's theorem.

The celebrated 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.

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

Properties

Solvability is closed under a number of operations.

  • 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.[1]
  • The previous property can be expanded into the following property: G is solvable if and only if both N and G/N are solvable.
  • If G is solvable, and H is a subgroup of G, then H is solvable.[2]
  • 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

Burnside's theorem states that if G is a finite group of order

p^a q^b\

where p and q are prime numbers, and a and b are non-negative integers, then G is solvable.

Related concepts

Supersolvable groups

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

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

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).

See also

Notes

  1. ^ Rotman (1995), Theorem 5.16, p. 102
  2. ^ Rotman (1995), Theorem 5.15, p. 102

References

  • Malcev, A. I. (1949), "Generalized nilpotent algebras and their associated groups", Mat. Sbornik N.S. 25 (67): 347–366, MR0032644 
  • Rotman, Joseph J. (1995). An introduction to the theory of groups. Graduate texts in mathematics. 148 (4 ed.). Springer. ISBN 9780387942858. 


External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Group theory — is a mathematical discipline, the part of abstract algebra that studies the algebraic structures known as groups. The development of group theory sprang from three main sources: number theory, theory of algebraic equations, and geometry. The… …   Wikipedia

  • Solvable — In mathematics, solvable usually refers to one of:*a solvable group *a solvable Lie algebra * an exactly solvable model.ee also* solved game * solubility …   Wikipedia

  • Solvable Lie algebra — In mathematics, a Lie algebra g is solvable if its derived series terminates in the zero subalgebra. That is, writing for the derived Lie algebra of g, generated by the set of values [x,y] for x and y in g, the derived series …   Wikipedia

  • Group of Lie type — In mathematics, a group of Lie type G(k) is a (not necessarily finite) group of rational points of a reductive linear algebraic group G with values in the field k. Finite groups of Lie type form the bulk of nonabelian finite simple groups.… …   Wikipedia

  • Group (mathematics) — This article covers basic notions. For advanced topics, see Group theory. The possible manipulations of this Rubik s Cube form a group. In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines …   Wikipedia

  • Group representation — In the mathematical field of representation theory, group representations describe abstract groups in terms of linear transformations of vector spaces; in particular, they can be used to represent group elements as matrices so that the group… …   Wikipedia

  • solvable — solvability, solvableness, n. /sol veuh beuhl/, adj. 1. capable of being solved, as a problem. 2. Math. (of a group) having a normal series of subgroups in which successive quotient groups are Abelian. 3. Archaic. soluble (def. 1). [1640 50;… …   Universalium

  • Finite group — In mathematics, a finite group is a group which has finitely many elements. Some aspects of the theory of finite groups were investigated in great depth in the twentieth century, in particular the local theory, and the theory of solvable groups… …   Wikipedia

  • Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 …   Wikipedia

  • Grigorchuk group — In the mathematical area of group theory, the Grigorchuk group or the first Grigorchuk group is a finitely generated group constructed by Rostislav Grigorchuk that provided the first example of a finitely generated group of intermediate (that is …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”