Proving Permutation Inverses: (1 2 3) = (4 5 6)

  • Thread starter Thread starter Justabeginner
  • Start date Start date
  • Tags Tags
    Permutation
Click For Summary
SUMMARY

The discussion centers on proving the existence of a permutation σ such that σ * (1 2 3) * σ⁻¹ = (4 5 6). Participants confirm that since both permutations are of the same order, such a σ exists. A key hint provided is that σ can be constructed using disjoint transpositions, specifically (1 4)(2 5)(3 6). The conversation emphasizes the importance of understanding cycle notation and the operations of permutations in abstract algebra.

PREREQUISITES
  • Understanding of permutation notation and cycle representation
  • Familiarity with the concept of disjoint transpositions
  • Knowledge of group theory, specifically the properties of permutations
  • Ability to perform operations involving conjugation of permutations
NEXT STEPS
  • Study the properties of cyclic permutations in abstract algebra
  • Learn about the process of constructing permutations from disjoint cycles
  • Explore the concept of conjugation in group theory
  • Review examples of proving the existence of permutations with specific properties
USEFUL FOR

Students of abstract algebra, mathematicians interested in group theory, and anyone seeking to understand the manipulation of permutations and their applications in mathematical proofs.

  • #61
jbunniii said:
Yes, that's correct. Note that this solution changes the cycle (1 2 3) to (4 5 6), and it changes the singleton cycles (4), (5), (6) to (1), (2), (3) respectively. In other words, writing out the full cycle notation including singletons:
##\sigma##(1 2 3)(4)(5)(6)##\sigma^{-1}## = (4 5 6)(1)(2)(3)

There are five other solutions in which (4), (5), and (6) are mapped to different arrangements of (1), (2), and (3), for example:
##\sigma##(1 2 3)(4)(5)(6)##\sigma^{-1}## = (4 5 6)(1)(3)(2)

The right hand side (4 5 6)(1)(3)(2) is the same permutation as (4 5 6)(1)(2)(3), since disjoint cycles commute, but we obtain it using a different ##\sigma##.

If you're bored, you can try to find the other solutions. :biggrin: For example, to transform
(1 2 3)(4)(5)(6) to
(4 5 6)(1)(3)(2),

##\sigma## needs to map as follows:
##1 \mapsto 4##
##4 \mapsto 1##
##2 \mapsto 5##
##5 \mapsto 3##
##3 \mapsto 6##
##6 \mapsto 2##
and therefore ##\sigma## = (1 4)(2 5 3 6) is another solution to the problem.

I did not know about singletons; thank you for that information!
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K