Given order for every element in a symmetric group

In summary, to compute the order of each element in the symmetric group ##S_4##, one can decompose the group and take one representative from each conjugacy class. Alternatively, one can write out each element's cycle decomposition.
  • #1
Mr Davis 97
1,462
44
Compute the order of each of the elements in the symmetric group ##S_4##.

Is the best way to do this just to write out each element's cycle decomposition, or is there a more efficient way?
 
Physics news on Phys.org
  • #2
Since the order of the elements are the same within each conjugacy class, I would just take one representative of each conjugacy class. But yes, I would do it by looking at the cycles of that representative.
 
  • Like
Likes Mr Davis 97
  • #3
Mr Davis 97 said:
Compute the order of each of the elements in the symmetric group ##S_4##.

Is the best way to do this just to write out each element's cycle decomposition, or is there a more efficient way?
You can decompose the group:
$$S_4 \cong A_4 \rtimes \mathbb{Z}_2 \cong (V_4 \rtimes \mathbb{Z_3}) \rtimes \mathbb{Z}_2 \cong (\mathbb{Z}_2^2 \rtimes \mathbb{Z_3}) \rtimes \mathbb{Z}_2$$
 

1. What is a symmetric group?

A symmetric group is a mathematical group that consists of all possible permutations of a finite set. In other words, it is a group of symmetries that can be applied to a set without changing its structure.

2. How do you determine the order of a symmetric group?

The order of a symmetric group is equal to the number of elements in the group, which can be calculated using a formula: n!, where n is the number of elements in the set. For example, the order of a symmetric group with 4 elements would be 4! = 24.

3. What is the significance of the order in a symmetric group?

The order of a symmetric group is important because it determines the number of possible permutations or symmetries that can be applied to a set. It also helps in understanding the structure and properties of the group.

4. Can the order of a symmetric group be infinite?

No, the order of a symmetric group can only be finite since it consists of a finite set. However, the order can be very large depending on the number of elements in the set.

5. How is the order of a symmetric group related to its subgroups?

The order of a symmetric group is always divisible by the order of its subgroups. In fact, the order of a subgroup must be a divisor of the order of the symmetric group. This relationship is known as Lagrange's theorem.

Similar threads

  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
1K
  • Linear and Abstract Algebra
2
Replies
38
Views
2K
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
7
Views
1K
Replies
2
Views
979
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
16
Views
2K
  • Linear and Abstract Algebra
Replies
4
Views
2K
  • Linear and Abstract Algebra
Replies
7
Views
1K
Back
Top