Symmetric group (direct product and decomposition)

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
13 replies · 7K views
Symmetryholic
Messages
18
Reaction score
0
I am looking for a mechanism to find a decomposition of symmetric groups. For finitely generated abelian group G, there is a mechanism to decompose G such that G is isomorphic to a direct sum of cyclic groups.

For symmetric groups, it seems a bit complex for me to find it.

For example,


(1) Is it possible for [tex]S_{n}[/tex] to be decomposed as a direct product of groups?


(2) Is there any mechanism to find an isomorphic group of a direct product of symmetric groups? Let's say,

[tex]G = S_{n-2} \times S_{n-1} \times S_{n}[/tex]

Any isomorphic group of the above G?
 
Physics news on Phys.org
(1) No, you can't decompose the symmetric group into the direct product of two (or more!) of it's proper subgroups.

(2) Sorry, but I don't understand the question.
 
If we cannot decompose symmetric groups, question (2) might reduce to find isomorphic groups of [tex]S_{n}[/tex].

Is there any known group, let's say P, isomorphic to [tex]S_{n}[/tex]? If so, by Caley's theorem, any group G is isomorphic to the subgroup of P. Is that right?
 
I'm not understanding you.

Symmetryholic said:
If we cannot decompose symmetric groups, question (2) might reduce to find isomorphic groups of [tex]S_{n}[/tex].
What do you mean by "isomorphic groups of Sn"? Groups isomorphic to Sn? You can take any set you like of size n! and define a group operation on it to make it isomorphic to Sn.
Is there any known group, let's say P, isomorphic to [tex]S_{n}[/tex]?
Yes, put P = Sn. Or do you mean something different?
If so, by Caley's theorem, any group G is isomorphic to the subgroup of P. Is that right?
No, just pick a group G larger than P. Cayley's theorem states that any finite group G is isomorphic to a subgroup of Sn, where n = |G| (it depends on G!).
 
adriank said:
What do you mean by "isomorphic groups of Sn"? Groups isomorphic to Sn? You can take any set you like of size n! and define a group operation on it to make it isomorphic to Sn.

For instance,http://at.yorku.ca/cgi-bin/bbqa?forum=ask_an_algebraist_2006;task=show_msg;msg=0044.0002"

Like [tex]A_{n+2}[/tex], is there any known group that has a subgroup isomorphic to [tex]S_{n}[/tex]? [tex]A_{n+2}[/tex] is the only group (different from [tex]S_n[/tex] ) I have found so far.

Is there any dihedral group(or variants) of order m > n that has a subgroup isomorphic to [tex]S_{n}[/tex]?
 
Last edited by a moderator:
Right, [tex]A_{2n}[/tex] is trivially isomorphic to [tex]S_n[/tex]. Even more trivially, [tex]S_{n+k}[/tex] has plenty of subgroups isomorphic to [tex]S_n[/tex] for all [tex]k\geq 1[/tex]. Continuing, so does [tex]S_n \times G[/tex] for any group [tex]G[/tex]... etc. You can construct as many as you like which is why I (and probably adriank as well) am confused by this "any known group" phrase.

I don't know then answer to your Dihedral group question off the top of my head. I'll think about it. Assuming you haven't already, see if you can figure out why the symmetric group can't be decomposed :-p
 
rodigee said:
Right, [tex]A_{2n}[/tex] is trivially isomorphic to [tex]S_n[/tex].
Not true: |A2n| = (2n)!/2, while |Sn| = n!. However, An+2 has a subgroup isomorphic to Sn, at least according to the post he linked.

As for the dihedral group question: I write Dn to mean the dihedral group of order 2n. Any subgroup of Dn is either cyclic or isomorphic to Dm, where m divides n.

Every dihedral group has its trivial subgroup isomorphic to S1. Every dihedral group also has a subgroup isomorphic to S2, which is a cyclic group of order 2. For S3, note that S3 is isomorphic to D3, so the dihedral groups that have a subgroup isomorphic to S3 are exactly the ones of the form D3n. Thereafter, no symmetric group is isomorphic to a dihedral group, so there are no more.
 
I meant to say " [tex]A_{2n}[/tex] has a subgroup that is trivially isomorphic to [tex]S_n[/tex]" :redface:
 
Alright, I guess that's true. :)
 
the analog for non abelian groups, of the direct decomposition of abelian ones, is the filtration by subnormal towers, used in galois theory. see the jordan-holder theorem. or the krull schmidt theorem.
 
I was going to list some composition series for the symmetric groups, but I had a feeling that those wouldn't be what he was looking for. I may as well do it anyway...

Here are composition series with the composition factors for the symmetric groups.
[tex]S_1 = \{\varepsilon\}[/tex]
[tex]S_2 \rhd \{\varepsilon\}[/tex]; factors [tex]C_2[/tex]
[tex]S_3 \rhd A_3 \rhd \{\varepsilon\}[/tex]; factors [tex]C_2, C_3[/tex]
[tex]S_4 \rhd A_4 \rhd K \rhd H \rhd \{\varepsilon\}[/tex], where [tex]K = \{\varepsilon, (12)(34), (13)(24), (14)(23)\}[/tex] and [tex]H = \{\varepsilon, (12)(34)\}[/tex]; factors [tex]C_2, C_3, C_2, C_2[/tex]
[tex]S_n \rhd A_n \rhd \{\varepsilon\}, n \ge 5[/tex]; factors [tex]C_2, A_n[/tex]
 
Thanks for all replies.

I have some further questions.

(1) Is it possible for [tex]S_{n}[/tex] (n>=5) to be a product of its proper subgroups such that [tex]S_{n} = HK[/tex]. H and K are proper subgroups of [tex]S_{n}[/tex].
(2) Is it possible for [tex]S_{n}[/tex] to be a finite product of its proper subgroups such that [tex]S_{n} = H_{1}H_{2}..H_{k}[/tex], where [tex]H_{1}H_{2}..H_{k}[/tex] are proper subgroups of [tex]S_{n}[/tex], where n >=5.

----------------------------------------------------------------------
Lemma 1. [tex]S_{n}[/tex] is generated by a=(1 2) and b=(1 2 3 ... n).(http://mathforum.org/library/drmath/view/51685.html")
----------------------------------------------------------------------
My assumption is
If [tex]b \in A_{n}[/tex] for n>=5, it is possible for (1). (Is this correct?)
(It's because [tex]a \in S_{2}[/tex] and [tex]b \in A_{n}[/tex], and both [tex]S_{2}, A_{n}[/tex] are proper subgroups of [tex]S_{n}[/tex] ).
If [tex]b \notin A_{n}[/tex], I have no clue.
 
Last edited by a moderator:
It's possible for any n > 2; take H = {e, (12)} and K = An. In that case, HK = An ∪ (12)An = Sn; this is the union of the even permutations of Sn and the odd permutations of Sn.
 
Thanks, adriank.

Is it possible for [tex]A_{n}[/tex] to be a product of its proper subgroups as well such that [tex]A_{n} = H_{1}H_{2}..H_{k}[/tex], where [tex]H_{1}H_{2}..H_{k}[/tex] are proper subgroups of [tex]A_{n}[/tex], where n >=5 ?

This problem is hard for me as well because I could not find any pattern on proper subgroups of [tex]A_{n}[/tex].