Permutation as a Product of Transposition

Click For Summary
Every permutation in S_n for n>1 can be expressed as a product of two cycles. To prove this, one can start by writing the permutation as a product of cycles and then demonstrate how each cycle can be represented as a product of transpositions. An example provided is the cycle (1234), which can be expressed as (14)(13)(12). The confusion arises around the derivation of the formula for transpositions, specifically the sequence (a_1, a_k)(a_1, a_k-1)...(a_1, a_2). Clarification on this derivation is sought to solidify understanding of the theorem.
liger123
Messages
2
Reaction score
0
hi guys.. can you help me prove this theorem?
Every permutation S_n where n>1 is a product of 2 cycles..
i got a little confused with some books' proof..thnx
 
Physics news on Phys.org
Can you show some work you've done on this?

The proof that comes to mind for me is to write each permutation as a product of cycles (you know how to do this, right?), and then you can explicitly describe how each cycle is a product of transpositions. For example, (1234) = (14)(13)(12).
 
Yes, the thing that i don't understand is how the formula was derived. this is the formula
(a_1, a_k) (a_1, a_k-1) ... (a_1, a_2).
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
Replies
8
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
5K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
530
  • · Replies 3 ·
Replies
3
Views
5K