Symmetrical Group: Prove Properties & Find Element Count

  • MHB
  • Thread starter qamaz
  • Start date
  • Tags
    Group
In summary, we proved that for any $n \in \mathbb{N}$ and for any permutation $\pi \in S_n$, the sign of $\pi$ is equal to $(-1)^{n-z}$, where $z$ is the number of disjunctive cycles of $\pi$. This result holds for both even and odd values of $n$.
  • #1
qamaz
3
0
$$\text{ Let } n∈ \mathbb{N} \text{ and } S_{n} \text{ symmetrical group on } \underline n\underline .

\text{ Let }
π ∈ S_{n} \text{ and z } \text{ the number of disjunctive Cycles of π. Here will be counted 1 - Cycle }. (a) \text{ Prove that } sgn (π) = (-1)^{n-z}.

(b) \text{ Prove that subset } A_{n}= \{π∈Sn∣sgn(π)=1\} ⊆ S_{n}\text{ is subgroup of } S_{n}.

(c)

\text{ Find number of elements } |A_{n}| \text{ of a subgroup } A_{n} \text{ from (b) }

$$
 
Last edited:
Physics news on Phys.org
  • #2
I’ll just do part (a); the rest I leave to you. Note a few things to start with:

  • Even cycles (cycles of even length) are odd permutations whereas odd cycles (cycles of odd length) are even permutations.
  • Let $l_e$ be the sum of the lengths of the even cycles, and similarly $l_o$ for the odd cycles; let $z_e$ and $z_o$ be the number of even and of odd cycles respectively. Thus $n=l_e+l_o$ and $z=z_e+z_o$. Then note that $l_e$ is always even; on the other hand $l_o$ has the same sign as $z_o$. (If there is an even number of odd cycles, the sum of their lengths is even; if there is an odd number of odd cycles, the sum of their lengths is odd.) Also, the fact that $l_e$ is always even and $n=l_e+l_o$ implies that $n$ and $l_o$ have the same parity (both odd or both even).
  • $\mathrm{sgn}(\pi)$ depends only on $z_e$ and $\mathrm{sgn}(\pi)=\mathrm{sgn}(z_e)$. In other words, $\pi$ is an even permutation if there is an even number of even cycles and it’s an odd permutation if there is an odd number of even cycles. (Make sense? See observation (i) above.)

First, suppose that $n$ is even. Then $l_o$ is even and so $z_o$ is even (observation (ii) above). Hence
$$\mathrm{sgn}(n-z)=\mathrm{sgn}(z)=\mathrm{sgn}(z_e+z_o)=\mathrm{sgn}(z_e)=\mathrm{sgn}(\pi)$$
by observation (iii) above.

Now suppose $n$ is odd. Then $l_o$ is odd and so $z_o$ is odd (observation (ii)) and so $l_o-z_o$ is even. Then
$$\begin{array}{rcl}\mathrm{sgn}(n-z) &=& \mathrm{sgn}([l_e+l_o]-[z_e+z_o]) \\ {} &=& \mathrm{sgn}(z_e)\ \text{(since }l_e\ \text{and}\ l_o-z_o\ \text{are both even)} \\ {} &=& \mathrm{sgn}(\pi)\end{array}$$
again. QED.
 
Last edited:

FAQ: Symmetrical Group: Prove Properties & Find Element Count

What is a symmetrical group?

A symmetrical group, also known as a permutation group, is a mathematical concept used to represent all possible arrangements or permutations of a set of objects. In other words, it is a group of symmetries that can be applied to a set of objects.

How can the properties of a symmetrical group be proven?

The properties of a symmetrical group can be proven through mathematical proofs. These proofs involve using the group axioms, such as closure, associativity, and identity, to show that the group's elements and operations satisfy certain conditions.

What properties does a symmetrical group have?

A symmetrical group has several properties, including closure, associativity, identity, and inverse. It also follows the commutative property, meaning that the order in which operations are performed does not affect the result. Additionally, symmetrical groups are finite, meaning that they have a finite number of elements.

How can the element count of a symmetrical group be determined?

The element count of a symmetrical group can be determined using the formula n!, where n is the number of elements in the group. For example, a symmetrical group with 4 elements would have 4! = 24 elements. This formula is based on the fact that there are n ways to choose the first element, n-1 ways to choose the second element, and so on until only one element is left.

What are some real-world applications of symmetrical groups?

Symmetrical groups have various applications in mathematics and physics. They are used in cryptography, coding theory, and designing experiments with randomized orders. In physics, symmetrical groups are used to represent the symmetries of physical systems, such as molecules and crystals, which can help in understanding their properties and behavior.

Similar threads

Replies
3
Views
2K
Replies
5
Views
1K
Replies
15
Views
2K
Replies
3
Views
2K
Replies
1
Views
1K
Replies
20
Views
2K
Back
Top