Group Theory, permutations formula

In summary, the lemma states that 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 given for us in the lecture notes, however he utilizes a formula that I am not sure how he derived.
  • #1
Coto
307
3
When proving that [tex]A_n[/tex] with [tex]n \geq 5[/tex] is simple, we require the following lemma:

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

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 [tex]f \in S_n[/tex] be a permutation and let [tex]x = (i_1 i_2 ... i_k)[/tex] be a k-cycle. Then:

[tex] fxf^{-1} = f(i_1 i_2 ... i_k)f^{-1} = ( f(i_1) f(i_2) ... f(i_k) ) [/tex]

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
  • #2
Coto said:
Let [tex]f \in S_n[/tex] be a permutation and let [tex]x = (i_1 i_2 ... i_k)[/tex] be a k-cycle. Then:

[tex] fxf^{-1} = f(i_1 i_2 ... i_k)f^{-1} = ( f(i_1) f(i_2) ... f(i_k) ) [/tex]

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:
 
  • #3
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.
 
  • #4
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:
 
  • #5
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.
 
  • #6
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:
 
  • #7
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! ;)
 

1. What is Group Theory?

Group Theory is a mathematical concept that studies the structure and properties of groups, which are sets of elements that can be combined together in certain ways to form new elements. It is a fundamental area of algebra and has many applications in various fields such as physics, chemistry, and computer science.

2. What is a permutation?

A permutation is a rearrangement of a set of objects in a specific order. In mathematics, it is often represented as a sequence of numbers or symbols. For example, the permutation of the letters "ABC" could be "BAC" or "CBA".

3. What is the permutation formula?

The permutation formula is used to calculate the number of possible arrangements of a set of objects. It is given by the formula: n! / (n-r)!, where n is the total number of objects and r is the number of objects being arranged.

4. How is Group Theory related to permutations?

Group Theory is closely related to permutations as it provides a framework for studying the properties of permutations. In fact, permutations can be seen as a type of group, where the elements are the different arrangements of objects and the operation is composition.

5. What are some practical applications of Group Theory and permutations?

Group Theory and permutations have many practical applications in various fields such as cryptography, coding theory, and quantum mechanics. In cryptography, they are used to design secure encryption algorithms. In coding theory, they are used to design error-correcting codes. In quantum mechanics, they are used to describe the symmetries of physical systems.

Similar threads

Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
255
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
15
Views
4K
  • Math Proof Training and Practice
2
Replies
61
Views
6K
  • Calculus and Beyond Homework Help
Replies
6
Views
3K
Replies
2
Views
977
  • Linear and Abstract Algebra
Replies
3
Views
896
  • Linear and Abstract Algebra
Replies
1
Views
2K
Back
Top