example of non-permutable subgroup
Example 1.
There are groups (even finitely generated) with subnormal subgroups
which are
not permutable.
Proof.
Let D8 be the dihedral group of order 8. The classic presentation
is
D8=⟨a,b:a4=b2=1,bab=a-1⟩. |
As the group is nilpotent we know every subgroup
is subnormal; however, not every subgroup is permutable. In particular, observe that for two general subgroups H and K of D8, it may be possible that HK is not a subgroup. In this situation we find our counterexample.
⟨b⟩⟨ab⟩={1,b,ab,bab}={1,b,ab,a-1}. |
Yet
⟨ab⟩⟨b⟩={1,ab,b,abb}={1,b,ab,a}. |
More generally, in any dihedral group
D2n=⟨a,b:an=b2=1,bab=a-1⟩, |
for n>2, then
⟨b⟩⟨ab⟩≠⟨ab⟩⟨b⟩ |
and both are subnormal whenever n=2i. ∎
However, we do observe the competing observation that the group generated by ⟨b⟩ and ⟨ab⟩ is the same as the group generated by ⟨ab⟩ and ⟨b⟩, namely D8. Indeed in any group with subgroups H and K, ⟨H,K⟩=⟨K,H⟩ so the condition of permutability is one which must be tested as complexes (sets HK), not as subgroups. This is a consequence of the following general result:
Claim 1.
HK=KH if and only if HK=⟨H,K⟩.
Proof.
We will show that every element in ⟨H,K⟩ can be written in
the form hk for some h∈H and k∈K. To see this first note
every element in ⟨H,K⟩ is a word over elements in H and in
K. If the word involves only elements in H or only elements in K then
we are done. Now for induction suppose all words of length m in ⟨H,K⟩ can be expressed in the form hk for some h∈H and k∈K.
Then given a word of length m+1 we have either h′w for h′∈H and w
a word of length m, in which case we are done, or k′w for some k′∈K
and w a word of length m. Then by induction w=hk form some h∈H and
k∈K. Hence k′w=k′hk. Then k′h∈KH=HK so there exists h′∈H and k′′ such that . Thus is of the
desired format. Hence so
.
For the converse suppose . Then .
This means for every and there exists and
such that . Thus
Thus and . ∎
This helps illustrate how permutability is such a useful condition in the study of subgroup lattices (one of Ore’s main research interests). For these are the subgroups whose complexes are also subgroups. Thus we can relate the order of to the order of and and many other combinatorial relations.
Title | example of non-permutable subgroup |
---|---|
Canonical name | ExampleOfNonpermutableSubgroup |
Date of creation | 2013-03-22 16:15:56 |
Last modified on | 2013-03-22 16:15:56 |
Owner | Algeboy (12884) |
Last modified by | Algeboy (12884) |
Numerical id | 10 |
Author | Algeboy (12884) |
Entry type | Example |
Classification | msc 20E07 |