statement proposition
Subgroups of solvable groups are solvable
Statement
Let be a solvable group and let be a subgroup of . Then is solvable.
Remarks
A proof uses the derived series: for each , so implies . More generally, if there is an injective homomorphism from into a solvable group, then is solvable. For example, each subgroup of is solvable.
Explanations
L1 human
Commutators of elements of are also commutators in . So the derived series of stays inside the derived series of . If the larger series reaches the identity, the smaller one does too.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 21 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Binary operation definition
- Group concept
- Commutativity definition
- Commutator of two elements definition
- Conjugate elements definition
- Subgroup definition
- Abelian group definition
- Conjugate subgroup definition
- Left coset definition
- Right coset definition
- Subgroup criterion statement
- Normal subgroup definition
- Intersection of subgroups is a subgroup statement
- Normality via left and right cosets statement
- Subgroup generated by a subset definition
- Quotient group definition
- Commutator subgroup definition
- Subnormal series definition
- Derived series definition
- Solvable group definition
- Subgroups of solvable groups are solvable statement
What depends on this
2 nodes use this node, directly or through other nodes.
Sources
- Web https://en.wikipedia.org/wiki/Solvable_group, Properties