Math Problem Statement

In Exercises 1 through 5, compute the indicated product involving the following permutations in S6:  σ=123456, 314562 τ=123456, 241365 μ=123456, 524316

  1. τσ 2. τ2σ 3. μσ2 4. σ−2τ 5. σ−1τσ In Exercises 6 through 9, compute the expressions shown for the permutations σ, τ and μ defined prior to Exercise 1. 6. |⟨σ⟩| 7. |⟨τ2⟩| 8. σ100 9. μ100 8 only

Solution

To solve Exercise 8, we need to compute σ100\sigma^{100}, where σ\sigma is the permutation σ=(123456314562)\sigma = \begin{pmatrix} 1 & 2 & 3 & 4 & 5 & 6 \\ 3 & 1 & 4 & 5 & 6 & 2 \end{pmatrix}.

Step 1: Express σ\sigma as a product of disjoint cycles

A permutation can be written as a product of disjoint cycles by following how each element maps under the permutation.

  • Start with 1. Under σ\sigma, 131 \mapsto 3, 343 \mapsto 4, 454 \mapsto 5, 565 \mapsto 6, 626 \mapsto 2, and 212 \mapsto 1. Therefore, the cycle representation of σ\sigma is:

σ=(1 3 4 5 6 2)\sigma = (1\ 3\ 4\ 5\ 6\ 2)

This is a 6-cycle permutation.

Step 2: Compute σ100\sigma^{100}

Since σ\sigma is a 6-cycle, the order of σ\sigma is 6. This means σ6=id\sigma^6 = \text{id}, where id\text{id} is the identity permutation.

To compute σ100\sigma^{100}, notice that:

100mod6=4100 \mod 6 = 4

Thus, σ100=σ4\sigma^{100} = \sigma^4.

Step 3: Compute σ4\sigma^4

Now we need to compute σ4\sigma^4. We already know σ=(1 3 4 5 6 2)\sigma = (1\ 3\ 4\ 5\ 6\ 2), so we can apply the cycle four times.

  • After one application of σ\sigma: 131 \mapsto 3
  • After two applications of σ\sigma: 141 \mapsto 4
  • After three applications of σ\sigma: 151 \mapsto 5
  • After four applications of σ\sigma: 161 \mapsto 6

Thus, σ4\sigma^4 is the permutation:

σ4=(123456651234)\sigma^4 = \begin{pmatrix} 1 & 2 & 3 & 4 & 5 & 6 \\ 6 & 5 & 1 & 2 & 3 & 4 \end{pmatrix}

In cycle notation, this is:

σ4=(1 6 4 2 5 3)\sigma^4 = (1\ 6\ 4\ 2\ 5\ 3)

Final Answer:

σ100=(1 6 4 2 5 3)\sigma^{100} = (1\ 6\ 4\ 2\ 5\ 3)

Let me know if you want more details on this, and here are five related questions:

  1. How do you calculate the inverse of a permutation in cycle notation?
  2. What is the order of a permutation, and how is it related to the cycle structure?
  3. How do you compute powers of a permutation efficiently?
  4. What is the significance of the identity permutation in permutation groups?
  5. Can you find the cycle notation for μ\mu?

Tip: Always reduce powers of permutations by their order (modulo the length of their cycles) to simplify the calculation.

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Permutation groups
Cycle notation
Modular arithmetic
Group theory

Formulas

Permutation composition
Cycle decomposition
Modular reduction: n mod k

Theorems

Order of a permutation in cycle notation
Lagrange's Theorem (for permutation order)

Suitable Grade Level

Undergraduate (Intro to Abstract Algebra or Group Theory)