Nilpotent implies solvable

From Groupprops
Revision as of 20:13, 7 March 2008 by Vipul (talk | contribs)

This article describes a fact or result that is not basic but it still well-established and standard. The fact may involve terms that are themselves non-basic
View other semi-basic facts in group theory
VIEW FACTS USING THIS: directly | directly or indirectly, upto two steps | directly or indirectly, upto three steps|
VIEW: Survey articles about this

This article gives the statement and possibly, proof, of an implication relation between two group properties. That is, it states that every group satisfying the first group property must also satisfy the second group property
View all group property implications | View all group property non-implications
|

Property "Page" (as page type) with input value "{{{stronger}}}" contains invalid characters or is incomplete and therefore can cause unexpected results during a query or annotation process.Property "Page" (as page type) with input value "{{{weaker}}}" contains invalid characters or is incomplete and therefore can cause unexpected results during a query or annotation process.

Statement

Verbal statement

Any nilpotent group is a solvable group. Further, the solvable length is bounded from above by the nilpotence class.

Property-theoretic statement

The group property of being a nilpotent group is stronger than, or implies, the group property of beign a solvable group.

Definitions used

Nilpotent group

A group is said to be a nilpotent group if its lower central series terminates in finitely many steps at the trivial group. The lower central series is here defined as follows:

G1=[G,G],Gi=[G,Gi1]

here [H,K] is the subgroup generated by all commutators between elements of H and elements of K.

Note: This is the definition of nilpotent group that is convenient for proving this implication. The other definition, in terms of upper central series, is not convenient for our purpose.

Solvable group

A group is said to be a solvable group if its derived series terminate in finitely many steps at the trivial group. The derived series is defined as:

G(1)=[G,G],<math>G(n)=[G(n1),G(n1)

Note: This is the most convenient definition here.

Proof

Lemma for the proof

The crucial fact used in the proof is the following lemma: For any group, the ith member of the derived series is contained in the ith member of the lower central series. We prove this lemma inductively.

Induction base case i=1: Both G(1) and G1 are the same, viz the commutator subgroup of G. Thus G(1)G1.

Induction step: Suppose G(m)Gm. Then we have:

Gm+1=[G,Gm];G(m+1)=[G(m),G(m)]

Now, G(m)G and G(m)Gm (using the induction assumption). Thus, every commutator between G(m) and G(m) is also a commutator between G and Gm. Thus, we have a generating set for [G(m),G(m)] which is a subset of a generating set for [G,Gm].

From this, it follows that [G(m),G(m)] is a subgroup of [G,Gm]. Thus:

G(m+1)Gm+1.

Final proof

We now use the fact that for any group G, G(i)Gi. Suppose G is a nilpotent group. Let c be the nilpotence class of G, viz the length of the lower central series of G, or the smallest c such that Gc is the trivial group. Then, by the lemma:

G(c)Gc

and hence G(c) is trivial. This means that G is solvable. Further, the smallest l such that G(l) is trivial is at most c. So the solvable length is at most equal to the nilpotence class.

Converse

Solvable does not imply nilpotent

Further information: Solvable not implies nilpotent

Solvable length need not equal nilpotence class

The solvable length may be much less than the nilpotence class. The only cases where we are guaranteed that the solvable length equals the nilpotence class are when the nilpotence class equals 1 or 2. We can construct groups of solvable length 2 (also called metabelian groups) with arbitrarily high nilpotence class.

Intermediate properties

Some properties between nilpotent and solvable, for finite groups: