Problem 5 - Algebra

Question

Man schreibe folgende Permutationen ali Prodult von Zyklen und berechno jeweils das. Signum: $$ \left(\begin{array}{llll} 1 & 2 & 3 & 4 \\ 3 & 4 & 1 & 2 \end{array}\right) \in \mathcal{O}_{4} \quad\left(\begin{array}{llllllll} 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ 3 & 1 & 4 & 5 & 2 & 6 & 8 & 7 \end{array}\right) \in \mathcal{S}_{b} $$

Step-by-Step Solution

Answer

The first permutation in cycle notation is \((1\ 3)(2\ 4)\) with a signum of \(1\), and the second permutation in cycle notation is \((1\ 3\ 4\ 5\ 2)(7\ 8)\) with a signum of \(-1\).

Step 1: Permutation 1: Convert to cycle notation

To convert the first permutation to cycle notation, we follow the cycles: 1 → 3 → 1 (cycle 1: (1 3)) 2 → 4 → 2 (cycle 2: (2 4)) Thus the permutation is: \((1\ 3)(2\ 4)\)

Step 2: Permutation 1: Calculate the signum

The signum of a permutation is found by counting the number of transpositions (2-cycles) needed to form the permutation. For permutation 1, we have two 2-cycles. Since 2 is even, the signum is: \(sgn(\pi_1) = (-1)^2 = 1\)

Step 3: Permutation 2: Convert to cycle notation

To convert the second permutation to cycle notation, we follow the cycles: 1 → 3 → 4 → 5 → 2 → 1 (cycle 1: (1 3 4 5 2)) 6 → 6 (cycle 2: not written because it is a 1-cycle) 7 → 8 → 7 (cycle 3: (7 8)) Thus the permutation is: \((1\ 3\ 4\ 5\ 2)(7\ 8)\)

Step 4: Permutation 2: Calculate the signum

For permutation 2, we have a 5-cycle and a 2-cycle. To count the number of transpositions, we can do the following: 1) (1 3 4 5 2) can be decomposed into 4 transpositions: (1 2)(1 5)(1 4)(1 3) 2) (7 8) remains as a single transposition. So, we have a total of 5 transpositions. Since 5 is odd, the signum is: \(sgn(\pi_2) = (-1)^5 = -1\) #Conclusion#: 1) The first permutation in cycle notation is \((1\ 3)(2\ 4)\) and has a signum of \(1\). 2) The second permutation in cycle notation is \((1\ 3\ 4\ 5\ 2)(7\ 8)\) and has a signum of \(-1\).

Key Concepts

Cycle Notation

Understanding how to express permutations using a cycle notation simplifies the examination of their properties. Cycle notation is a systematic way of representing permutations by indicating which elements are mapped to each other in a cycle. In the given example, the permutation \(\begin{array}{llll}1 & 2 & 3 & 4 \3 & 4 & 1 & 2darray}\right)\) is written as \((1 3)(2 4)\).
Each set of numbers within parentheses denotes a cycle; it's a shorthand way of showing the movement of elements. Here, \((1 3)\) means that element 1 maps to 3 and 3 maps back to 1. Likewise, \((2 4)\) depicts the switch between elements 2 and 4. When writing cycles, one-cycle (\((6)\)) are often omitted because they indicate an element that remains unmoved.

Signum of a Permutation

The signum (or sign) of a permutation gives insight into the permutation's nature, particularly its parity—whether it's even or odd. The signum, denoted \(sgn(\pi)\), is calculated as \((-1)^t\) where \(t\) is the number of transpositions (two-element swaps) required to achieve the permutation from an ordered sequence. For instance, two 2-cycles, as seen in permutation \(\((1 3)(2 4)\)\), suggest an even permutation since two transpositions occur, leading to \(sgn(\pi_1) = (-1)^2 = 1\).
An even signum of \(1\) implies an even number of transpositions, while an odd signum of \(-1\) signifies an odd number of transpositions. This property is crucial for understanding symmetric group behavior and proves valuable in more advanced mathematical fields.

Transpositions in Permutations

Transpositions are the fundamental building blocks of permutations, each representing a swap between two elements. For example, the permutation \((1 3 4 5 2)\) can be decomposed into the transpositions \((1 2)(1 5)(1 4)(1 3)\). It's essential to recognize that any permutation can be broken down into a series of transpositions—this is pivotal for calculating the signum.
Furthermore, the process of breaking down cycles into transpositions reinforces the concept of permutations as being composed of simpler exchanges.

Permutation Decomposition

Decomposing permutations into cycles and further transpositions not only simplifies their analysis but also aids in determining permutation properties such as signum. In cycle decomposition, we group elements that directly map onto each other in a sequence until the cycle loops back to the starting element, as shown with \((1 3 4 5 2)\) and \((7 8)\).
This decomposition is essential, especially for complex permutations involving many elements, since it allows us to visualize their structure more clearly. Moreover, expressing complex permutations in terms of cycles and transpositions lays a foundation for problem-solving in algebraic contexts.