How Do You Find the Permutation 'a' in S8 for a Given Conjugation?

The one I've outlined above is just one example.In summary, to find an a \in S_{8} such that a^{-1}xa = (5,6)(1,3), you need to define a to map certain numbers to specific outputs in order to ensure that a^{-1}xa maps the remaining numbers to the correct outputs. There are multiple possible solutions to this problem.
  • #1
gotmilk04
45
0

Homework Statement


Let x=(1,2)(3,4) [tex]\in S_{8}[/tex].
Find an a [tex]\in S_{8}[/tex] such that a-1xa=(5,6)(1,3)


Homework Equations





The Attempt at a Solution


I have no idea how you go about finding the a. Help please.
 
Physics news on Phys.org
  • #2


First, notice that [itex]x[/itex] does not have any effect on 5,6,7,8. Therefore, whichever inputs are mapped by [itex]a[/itex] to these numbers will be mapped back where they started by [itex]a^{-1}[/itex]. You want [itex]a^{-1}xa[/itex] to leave 2,4,7,8 where they are, so you could for example define

[tex]a(2) = 5[/tex]
[tex]a(4) = 6[/tex]
[tex]a(7) = 7[/tex]
[tex]a(8) = 8[/tex]

Now let's look at the remaining numbers. Suppose we arbitrarily choose

[tex]a(1) = 1[/tex]

Then [itex]x[/itex] maps 1 to 2, so [itex]xa[/itex] maps 1 to 2. We want [itex]a^{-1}xa[/itex] to map 1 to 3, therefore [itex]a^{-1}[/itex] must map 2 to 3:

[tex]a^{-1}(2) = 3[/tex]

and thus

[tex]a(3) = 2[/tex]

Thus far we have defined [itex]a[/itex] for six of the inputs, and it's easy to verify that [itex]a^{-1}xa[/itex] sends these six inputs to the right outputs. So now you have to define [itex]a[/itex] for the remaining two inputs (5 and 6). I'll let you take it from here.

Note that there are many possible solutions to this problem.
 

FAQ: How Do You Find the Permutation 'a' in S8 for a Given Conjugation?

What is a permutation?

A permutation is a way of arranging a set of items in a specific order. It is a mathematical concept that involves rearranging the elements of a set in all possible ways.

What is the problem with permutations?

The problem with permutations is that as the number of items in a set increases, the number of possible arrangements also increases exponentially. This can make it very difficult and time-consuming to calculate all possible permutations, especially for larger sets.

How is the problem with permutations relevant in science?

In science, permutations are often used in experimental design, where researchers need to test all possible combinations of variables. The large number of possible permutations can make it challenging to design experiments that are both thorough and efficient.

Are there any techniques to overcome the problem with permutations?

Yes, there are various techniques that can be used to overcome the problem with permutations, such as random sampling and statistical methods. These techniques can help reduce the number of permutations that need to be tested while still providing reliable results.

Can the problem with permutations be solved completely?

No, the problem with permutations cannot be solved completely. As the number of items in a set increases, the number of permutations also increases exponentially, making it impossible to calculate and test all possible arrangements. However, there are techniques that can help mitigate this problem and make it more manageable.

Similar threads

Replies
3
Views
2K
Replies
11
Views
2K
Replies
1
Views
1K
Replies
3
Views
2K
Replies
2
Views
2K
Replies
1
Views
2K
Back
Top