Finding permutations of a stabilizer subgroup of An

In summary, the stabilizer in a group is a set of elements that map a specific element in another set to itself. In the example of S3, the stabilizer of element 2 is the set of two permutations that leave 2 unchanged. This is different from mapping every element to 1, as the stabilizer only focuses on one specific element.
  • #1
goalieplayer
1
0
Alright, I understand what a stabilizer is in a group, and I know how to find the permutations of An for any small integer n, but for a stabilizer, since it just maps every element to 1, would all permutations just be (1 2) (1 3) ... (1 n) for An?
 
Physics news on Phys.org
  • #2
I think you may be confused about what the stabilizer is.

Suppose you have
  1. a group G
  2. a set S (this set is not necessarily a group, it is just a bunch of elements)

There need be no connection between the elements of S and the elements of G. That is, S is just a collection of elements that can be entirely distinct from the elements of G.

An action of G on S is a map from [itex]G \times S \rightarrow S[/itex]. (We also place two requirements on the behavior of this map, but just ignore this for the moment). In other words, "G acts on S" means that given any [itex]g \in G[/itex] and any [itex] x \in S[/itex] we can "apply" g to x and get a new element, y, of S. Symbolically, gx = y (though this looks like we are operating g and x using the group operation of G, this is not what we are doing. x is not even in G; it is in S).

The group of Sn of permutations provides a very natural example of all this. Take for instance S3. Here G = S3 and S = {1,2,3}. Given a particular permutation [itex]\sigma \in S_3[/itex], we can talk about what the permutation does to any element of S. Take [itex]\sigma = [/itex] 'the permutation that transposes 1 and 2'. Then [itex]\sigma2 = 1[/itex]. So [itex]\sigma[/itex] "acts" on the element 2 and gives the element 1.

Are there any permutations in [itex]S_3[/itex] which act on 2 and just give 2? Yes, there are two of them:
  1. [itex]\sigma_1[/itex] = 'the permutation that transposes 1 and 3'
  2. [itex]\sigma_2[/itex]= 'the permuation that leaves all the elements fixed' (identity)

The stablilzer of 2 is the set of both these permutations: [itex] Stab(2) = \{\sigma_1, \sigma_2\} [/itex]. In general, the stablilizer of an element [itex] x \in S [/itex] is:
[tex]Stab(x) = \{g \in G | gx = x\}.[/tex]

goalieplayer said:
...since it just maps every element to 1.
Here is where I think you are somewhat confused. The stablilzer does not map every element to 1. The stablilzer of [itex]x \in S[/itex] consists of all the elements of G that send x to x. The stablilzer does not send anything to 1 because there isn't really a 1 in S. 1 is in the group G.
 
Last edited:

Related to Finding permutations of a stabilizer subgroup of An

1. What is a stabilizer subgroup of An?

A stabilizer subgroup of An is a subgroup of the symmetric group An whose elements leave a particular set of objects unchanged. In other words, it is the set of permutations that fix a given set of elements.

2. How do you find permutations of a stabilizer subgroup of An?

To find the permutations of a stabilizer subgroup of An, you first need to identify the elements that need to be fixed. Then, you can use mathematical techniques such as the Orbit-Stabilizer theorem or the Coset enumeration method to determine the permutations that fix those elements.

3. What is the Orbit-Stabilizer theorem?

The Orbit-Stabilizer theorem is a mathematical theorem that relates the size of a group, the size of its stabilizer subgroup, and the size of its orbit. It states that the size of a group is equal to the product of the size of its stabilizer subgroup and the size of its orbit.

4. Can you explain the Coset enumeration method?

The Coset enumeration method is a technique used to find the permutations of a stabilizer subgroup of An. It involves generating the cosets of the subgroup and then checking which permutations of the subgroup are contained in each coset. The permutations that are contained in all cosets are the permutations of the stabilizer subgroup.

5. Why is finding permutations of a stabilizer subgroup of An important?

Finding permutations of a stabilizer subgroup of An is important in various areas of mathematics and computer science, such as group theory, coding theory, and cryptography. It can also help in solving problems related to symmetry and group actions, and has applications in physics, chemistry, and biology.

Similar threads

  • Linear and Abstract Algebra
Replies
7
Views
742
  • Linear and Abstract Algebra
Replies
11
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
23
Views
2K
  • Linear and Abstract Algebra
Replies
15
Views
4K
  • Linear and Abstract Algebra
Replies
7
Views
1K
  • Linear and Abstract Algebra
Replies
18
Views
1K
  • Math Proof Training and Practice
Replies
23
Views
707
  • General Math
Replies
1
Views
763
Back
Top