Group Theory, permutations formula

Click For Summary
SUMMARY

The discussion centers on the proof that the alternating group A_n is simple for n ≥ 5, specifically focusing on the lemma that if N is a normal subgroup of A_n containing a 3-cycle, then N must equal A_n. Participants clarify the derivation of the formula fxf^{-1} = (f(i_1) f(i_2) ... f(i_k)), where f is a permutation in S_n and x is a k-cycle. The key to understanding this transformation lies in recognizing the properties of permutations and cycle notation, particularly how elements are mapped under these operations.

PREREQUISITES
  • Understanding of group theory concepts, specifically alternating groups and normal subgroups.
  • Familiarity with permutation notation and cycle notation in symmetric groups.
  • Knowledge of the properties of permutations, including the identity and inverse functions.
  • Basic mathematical reasoning and proof techniques related to abstract algebra.
NEXT STEPS
  • Study the properties of symmetric groups, particularly S_n and A_n.
  • Learn about the significance of normal subgroups in group theory.
  • Explore cycle notation in depth, including how to manipulate and interpret permutations.
  • Review proofs related to the simplicity of groups, focusing on A_n for n ≥ 5.
USEFUL FOR

Mathematicians, students of abstract algebra, and anyone interested in group theory, particularly those studying permutations and their applications in algebraic structures.

Coto
Messages
307
Reaction score
3
When proving that A_n with n \geq 5 is simple, we require the following lemma:

If N is a normal subgroup of A_n with n \geq 5 and N contains a 3-cycle, then N = A_n.

The proof is actually given for us in the lecture notes, however he utilizes a formula that I'm not sure how he derived:

Let f \in S_n be a permutation and let x = (i_1 i_2 ... i_k) be a k-cycle. Then:

fxf^{-1} = f(i_1 i_2 ... i_k)f^{-1} = ( f(i_1) f(i_2) ... f(i_k) )

where the right side is a cycle. I'm blind to how he gets from left to right.. and we were left with the ubiquitous "it is easy to check that..."

Any help to get started on seeing how this is true would be appreciated. Thanks,
Coto
 
Last edited:
Physics news on Phys.org
Coto said:
Let f \in S_n be a permutation and let x = (i_1 i_2 ... i_k) be a k-cycle. Then:

fxf^{-1} = f(i_1 i_2 ... i_k)f^{-1} = ( f(i_1) f(i_2) ... f(i_k) )

Hi Coto! :smile:

For any number j:

fxf^{-1}(f(i_j)) = fx(i_j) = f(i_j+1);

and that is the definition of ( f(i_1) f(i_2) ... f(i_k) ), isn't it? :smile:
 
Thanks tiny-tim. I must be having a brain-dead day, I'm still having troubles seeing this.

Specifically I get lost in the reasoning from moving left to right. Could you elaborate between each equality, specifically why you've decided to add (f(i_j)) to fxf^{-1}, and why fx(i_j) = f(i_j+1) ?

The definition of the cycle on the right would be all f(i_j) move to f(i_j+1) (j < k)? But I'm having troubles making that connection with your help given above.
 
Coto said:
Specifically I get lost in the reasoning from moving left to right. Could you elaborate between each equality, specifically why you've decided to add (f(i_j)) to fxf^{-1}, and why fx(i_j) = f(i_j+1) ?

Hi Coto! :smile:

ok … I think what you're missing is the basic definition of f{-1}, which of course is that f{-1}f = I, the identity … so in particular f{-1}f (i_j) = (i_j);

so fxf^{-1}(f(i_j)) = fx [ f^{-1}f (i_j)) ] = fx [ (i_j) ] = f [ x(i_j) ] = f(i_j+1). :smile:
 
Thanks again for your time tiny-tim.

Actually I understood where the derivation was coming from in terms of the inverse.. but I seem to be stuck more on why fxf^{-1}(f(i_j)) appears.

1) We are looking for fxf^{-1} so why do we look at fxf^{-1}(f(i_j))? Why do we append the cycle (f(i_j)) to it?

2) we have x(i_j) = (i_1 ... i_k)(i_j) = (i_j+1) ?? I guess I'm lost on this step too. I'm not sure why this is true. If we're considering (i_j) as a "cycle" of one element, then wouldn't x(i_j) = x?

I suppose these may seem basic.. my mind is having troubles wrapping around this.

Thanks again for the help. Sorry for being a bit dense right now.. I'm just not quite seeing it for some reason.
 
Coto said:
1) We are looking for fxf^{-1} so why do we look at fxf^{-1}(f(i_j))? Why do we append the cycle (f(i_j)) to it?

Because we want to prove that fxf^{-1} is the cycle that takes f(i_j) to f(i_j+1). :smile:

AND (f(i_j)) is not a cycle … it's an element, just as i_j is.
we have x(i_j) = (i_1 ... i_k)(i_j) = (i_j+1) ?? I guess I'm lost on this step too. I'm not sure why this is true. If we're considering (i_j) as a "cycle" of one element, then wouldn't x(i_j) = x?

Ah … all is clear now … you're misreading the cycle notation. And you're confusing cycles with elements. AND there's no such thing as a "cycle" of one element … how would you define it?! :wink:

If C = (a b c d …) is the notation for a cycle C, then that means that Ca = b, Cb = c, …

So if C = (i_1 ... i_k), then that means C(i_1) = i_2, C(i_2) = i_3, … and generally C(i_j) = i_j+1.

x is a permutation, just like f, not an element … x operates on the same elements as f does. :smile:
 
Gotcha. I think that actually was my problem. I didn't realize this notation at all. It makes sense now what is going on.

By mentioning (i_j).. it was sometimes used when writing a permutation as a product of disjoint cycles, i.e. (1345)(2) would be the cycle as 1>3>4>5>1 and the invariant 2>2. Superfluous given that we known when using cycle notation that all other elements remain the same, but it seems that it was the source of my confusion when interpreting x(i_j).

Combine that with not understanding the meaning behind Ca = b and you have a confused student! ;)
 

Similar threads

Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
665
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 15 ·
Replies
15
Views
5K
  • · Replies 21 ·
Replies
21
Views
1K
  • · Replies 26 ·
Replies
26
Views
996