Algebra Question regarding adjacent transposition

  • Thread starter Thread starter sunnyday11
  • Start date Start date
  • Tags Tags
    Algebra
sunnyday11
Messages
14
Reaction score
0

Homework Statement



Prove that any transposition is a product of an odd number of adjacent transposition.

Homework Equations





The Attempt at a Solution



Let x=(i,j) Define gap(x) = j-i
By induction on gap:
If gap(x)=1 then already adjacent.
Suppose k= j-i
(i,j)=(i,i+1)(i+1,j)(i,i+1)
gap(i+1,j)=k-1
...

I don't really know how to complete the proof.
The gap is defined as the modulus of the value j-i in all cases above.

Thank you very much!
 
Physics news on Phys.org
So gap(i+1,j)=k-1. What does the induction hypothesis tell you?
 
By induction k-1 is odd.
So, gap(i,j)=(i,i+1) (odd number of adjacent transpositions) (i,i+1) = 1+ odd# + 1 = odd #

Thank you so much, but do you know how can I put this in a more formal presentation?
 
I think your proof is already quite formal. I don't see much way to improve it...
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top