Solvable group: Difference between revisions
No edit summary |
|||
| Line 1: | Line 1: | ||
==Definition== | ==Definition== | ||
'''Solvable''' is also called '''soluble''' by some people. | |||
===Equivalent definitions in tabular format=== | |||
{| class="sortable" border="1" | |||
! No. !! Shorthand !! A group is termed solvable if ... !! A group <math>G</math> is termed solvable if ... | |||
|- | |||
| 1 || normal series, abelian quotients || there is a [[defining ingredient::normal series]] of finite length starting from the trivial subgroup and ending at the whole group with each successive [[quotient group]] being an [[defining ingredient::abelian group]]. || there exists a series of subgroups <math>\{ e \} = H_0 \le H_1 \le \ldots \le H_n = G</math> such that each <math>H_i</math> is [[normal subgroup|normal]] in <math>G</math> and each <math>H_{i+1}/H_i</math> is [[abelian group|abelian]]. | |||
|- | |||
| 2 || subnormal series, abelian quotients || there is a [[defining ingredient::subnormal series]] of finite length starting from the trivial subgroup and ending at the whole group with each successive [[quotient group]] being an [[abelian group]]. || there exists a series of subgroups:<math>\{ e \}= H_0 \triangleleft H_1 \triangleleft \ldots \triangleleft H_n = G</math> such that each <math>H_i</math> is normal in <math>H_{i+1}</math> and each <math>H_{i+1}/H_i</math> is [[abelian group|abelian]]. | |||
|- | |||
| 3 || derived series finite length || the [[defining ingredient::derived series]] reaches the identity in finitely many steps || the [[derived series]] of <math>G</math>, i.e., the series <math>G^{(n)}</math> where <math>G^{(0)} = G</math> and <math>G^{(i+1)} = [G^{(i)}, G^{(i)}]</math> is the [[defining ingredient::derived subgroup]] of its predecessor, reaches the trivial subgroup in finitely many steps. | |||
|- | |||
| 4 || characteristic series, abelian quotients || there is a [[defining ingredient::characteristic series]] of finite length starting from the trivial subgroup and ending at the whole group with each successive [[quotient group]] being an [[defining ingredient::abelian group]]. || there exists a series of subgroups <math>\{ e \} = H_0 \le H_1 \le \ldots \le H_n = G</math> such that each <math>H_i</math> is [[characteristic subgroup|characteristic]] in <math>G</math> and each <math>H_{i+1}/H_i</math> is [[abelian group|abelian]]. | |||
|- | |||
| 5 || fully invariant series, abelian quotients || there is a [[defining ingredient::fully invariant series]] of finite length starting from the trivial subgroup and ending at the whole group with each successive [[quotient group]] being an [[defining ingredient::abelian group]]. || there exists a series of subgroups <math>\{ e \} = H_0 \le H_1 \le \ldots \le H_n = G</math> such that each <math>H_i</math> is [[fully invariant subgroup|fully invariant]] in <math>G</math> and each <math>H_{i+1}/H_i</math> is [[abelian group|abelian]]. | |||
<math>e = H_0 \le H_1 \le \ldots \le H_n = G</math> | |} | ||
such that each <math>H_i</math> is [[normal subgroup|normal]] in <math>G</math> and each <math> | |||
<math>e = H_0 \triangleleft H_1 \triangleleft \ldots \triangleleft H_n = G</math> | |||
such that each <math> | |||
===Equivalence of definitions=== | ===Equivalence of definitions=== | ||
{{further|[[Equivalence of definitions of solvable group]]}} | {{further|[[Equivalence of definitions of solvable group]]}} | ||
==Examples== | ==Examples== | ||
| Line 65: | Line 32: | ||
* [[Symmetric group:S4|The symmetric group of degree four]] is also solvable. | * [[Symmetric group:S4|The symmetric group of degree four]] is also solvable. | ||
* The [[dihedral group]] of any order is solvable, Further it is nilpotent only when the order is a power of 2. | * The [[dihedral group]] of any order is solvable, Further it is nilpotent only when the order is a power of 2. | ||
{{semibasicdef}} | |||
{{pivotal group property}} | |||
{{finite-at|finite solvable group}} | |||
==Metaproperties== | |||
{| class="sortable" border="1" | |||
! Metaproperty name !! Satisfied? !! Proof !! Statement with symbols | |||
|- | |||
| [[satisfies metaproperty::extension-closed group property]] || Yes || [[solvability is extension-closed]] || Suppose <math>H</math> is a [[normal subgroup]] of <math>G</math> such that both <math>H</math> and the [[quotient group]] <math>G/H</math> are [[solvable group]]s. Then <math>G</math> is a [[solvable group]]. | |||
|- | |||
| [[satisfies metaproperty::quasivarietal group property]] || Yes || [[solvability is quasivarietal]] || subgroup-closed, quotient-closed, and closed under finite direct products (see items below) | |||
|- | |||
| [[satisfies metaproperty::subgroup-closed group property]] || Yes || [[solvability is subgroup-closed]] || If <math>G</math> is solvable, and <math>H \le G</math> is a [[subgroup]], then <math>H</math> is solvable. | |||
|- | |||
| [[satisfies metaproperty::quotient-closed group property]] || Yes || [[solvability is quotient-closed]] || If <math>G</math> is solvable, and <math>H</math> is a [[normal subgroup]] of <math>G</math>, the [[quotient group]] <math>G/H</math> is solvable. | |||
|- | |||
| [[satisfies metaproperty::finite direct product-closed group property]] || Yes || [[solvability is finite direct product-closed]] || If <math>G_1, G_2, \times, G_n</math> are solvable, the [[external direct product]] <math>G_1 \times G_2 \times \dots \times G_n</math> is also solvable. | |||
|- | |||
| [[satisfies metaproperty::finite normal join-closed group property]] || Yes || [[solvability is finite normal join-closed]] || If <math>G</math> is a group and <math>N_1,N_2,\dots,N_r</math> are all [[solvable normal subgroup]]s of <math>G</math>, the [[join of subgroups]] (in this case also the [[product of subgroups]]) <math>N_1N_2\dots N_r</math> is also solvable. | |||
|} | |||
==Relation with other properties== | ==Relation with other properties== | ||
| Line 114: | Line 104: | ||
|} | |} | ||
== | ==Formalisms== | ||
{{group extension operator}} | |||
The group property of being solvable can be obtained in either of these equivalent ways: | |||
* By applying the [[poly operator]] to the group property of being [[abelian group|abelian]] | |||
* By applying the [[finite normal series operator]] to the group property of being [[abelian group|abelian]] | |||
* By applying the [[finite characteristic series operator]] to the group property of being [[abelian group|abelian]] | |||
Note that all these three operators have the same effect in the case of abelian groups, though in general they may not have. | |||
==Testing== | ==Testing== | ||
Revision as of 01:07, 19 June 2011
Definition
Solvable is also called soluble by some people.
Equivalent definitions in tabular format
| No. | Shorthand | A group is termed solvable if ... | A group is termed solvable if ... |
|---|---|---|---|
| 1 | normal series, abelian quotients | there is a normal series of finite length starting from the trivial subgroup and ending at the whole group with each successive quotient group being an abelian group. | there exists a series of subgroups such that each is normal in and each is abelian. |
| 2 | subnormal series, abelian quotients | there is a subnormal series of finite length starting from the trivial subgroup and ending at the whole group with each successive quotient group being an abelian group. | there exists a series of subgroups: such that each is normal in and each is abelian. |
| 3 | derived series finite length | the derived series reaches the identity in finitely many steps | the derived series of , i.e., the series where and is the derived subgroup of its predecessor, reaches the trivial subgroup in finitely many steps. |
| 4 | characteristic series, abelian quotients | there is a characteristic series of finite length starting from the trivial subgroup and ending at the whole group with each successive quotient group being an abelian group. | there exists a series of subgroups such that each is characteristic in and each is abelian. |
| 5 | fully invariant series, abelian quotients | there is a fully invariant series of finite length starting from the trivial subgroup and ending at the whole group with each successive quotient group being an abelian group. | there exists a series of subgroups such that each is fully invariant in and each is abelian. |
Equivalence of definitions
Further information: Equivalence of definitions of solvable group
Examples
VIEW: groups satisfying this property | groups dissatisfying this property
VIEW: Related group property satisfactions | Related group property dissatisfactions
Particular note-worthy examples are given below:
- The symmetric group of degree three is the smallest solvable non-abelian(in fact, non-nilpotent) group
- The symmetric group of degree four is also solvable.
- The dihedral group of any order is solvable, Further it is nilpotent only when the order is a power of 2.
This article is about a standard (though not very rudimentary) definition in group theory. The article text may, however, contain more than just the basic definition
VIEW: Definitions built on this | Facts about this: (facts closely related to Solvable group, all facts related to Solvable group) |Survey articles about this | Survey articles about definitions built on this
VIEW RELATED: Analogues of this | Variations of this | Opposites of this |
View a complete list of semi-basic definitions on this wiki
This article defines a group property that is pivotal (i.e., important) among existing group properties
View a list of pivotal group properties | View a complete list of group properties [SHOW MORE]
The version of this for finite groups is at: finite solvable group
Metaproperties
Relation with other properties
Stronger properties
Weaker properties
| Property | Meaning | Proof of implication | Proof of strictness (reverse implication failure) | Intermediate notions | Comparison |
|---|---|---|---|---|---|
| hypoabelian group | transfinite derived series reaches identity | solvable implies hypoabelian | hypoabelian not implies solvable | |FULL LIST, MORE INFO | |
| imperfect group | no nontrivial perfect quotient group | solvable implies imperfect | imperfect not implies solvable | |FULL LIST, MORE INFO | |
| locally solvable group | every finitely generated subgroup is solvable | ||||
| residually solvable group | every non-identity element has a non-identity image in some solvable quotient |
Conjunction with other properties
| Conjunction | Other component of conjunction | Additional comments |
|---|---|---|
| finite solvable group | finite group | For finite groups, being solvable is equivalent to being polycyclic, and has many other alternative characterizations. |
| solvable T-group | T-group | |
| solvable HN-group | HN-group |
Formalisms
In terms of the group extension operator
This group property can be expressed in terms of the group extension operator and/or group property modifiers that arise from this operator The group property of being solvable can be obtained in either of these equivalent ways:
- By applying the poly operator to the group property of being abelian
- By applying the finite normal series operator to the group property of being abelian
- By applying the finite characteristic series operator to the group property of being abelian
Note that all these three operators have the same effect in the case of abelian groups, though in general they may not have.
Testing
The testing problem
Further information: Solvability testing problem
The problem of testing whether a group is solvable or not reduces to the problem of computing its derived series. This can be done when the group is described by means of a generating set, if the normal closure algorithm can be implemented.
GAP command
This group property can be tested using built-in functionality of Groups, Algorithms, Programming (GAP).
The GAP command for this group property is:IsSolvableGroup
View GAP-testable group properties
To determine whether a group is solvable or not, we cna use the following GAP command:
IsSolvableGroup(group);
where group may be a definition of the group or a name for a group previously defined.
Study of this notion
Mathematical subject classification
Under the Mathematical subject classification, the study of this notion comes under the class: 20F16
The class 20F16 is used for the general theory of solvable groups, while the class 20D10 (coming under 20D which is for finite groups) focusses on finite solvable groups.
Also closely related is 20F19: Generalizations of nilpotent and solvable groups.
References
Textbook references
- Abstract Algebra by David S. Dummit and Richard M. Foote, 10-digit ISBN 0471433349, 13-digit ISBN 978-0471433347, More info, Page 105 (formal definition)
- Topics in Algebra by I. N. Herstein, More info, Page 116 (formal definition, introduced between exercises)
- Algebra by Serge Lang, ISBN 038795385X, More info, Page 18 (definition in paragraph)
- A Course in the Theory of Groups by Derek J. S. Robinson, ISBN 0387944613, More info, Page 121 (formal definition)
- Groups and representations by Jonathan Lazare Alperin and Rowen B. Bell, ISBN 0387945261, More info, Page 95 (definition in paragraph)
- An Introduction to Abstract Algebra by Derek J. S. Robinson, ISBN 3110175444, More info, Page 171 (definition introduced in paragraph)
- A First Course in Abstract Algebra (6th Edition) by John B. Fraleigh, ISBN 0201763907, More info, Page 194, Definition 3.4.16 (formal definition)
- Algebra (Graduate Texts in Mathematics) by Thomas W. Hungerford, ISBN 0387905189, More info, Page 102, Definition 7.9 (formal definition)
- Contemporary Abstract Algeba by Joseph Gallian, ISBN 0618514716, More info, Page 563
- Topics in Algebra by I. N. Herstein, More info, Page 116 (formal definition, introduced between exercises)
External links
Search for "solvable+group" on the World Wide Web:
Scholarly articles: Google Scholar, JSTOR
Books: Google Books, Amazon
This wiki: Internal search, Google site search
Encyclopaedias: Wikipedia (or using Google), Citizendium
Math resource pages:Mathworld, Planetmath, Springer Online Reference Works
Math wikis: Topospaces, Diffgeom, Commalg, Noncommutative
Discussion fora: Mathlinks, Google Groups
The web: Google, Yahoo, Windows Live
Learn more about using the Searchbox OR provide your feedback