How can I show that if alpha is any permutation then: alpha (i1,i2,....ir) alpha -1 = (alpha(i1) alpha(i2)....alpha(ir)) Thank for any help.
Follow Math Help Forum on Facebook and Google+
Originally Posted by thomas_donald How can I show that if alpha is any permutation then: alpha (i1,i2,....ir) alpha -1 = (alpha(i1) alpha(i2)....alpha(ir)) Thank for any help. Let and . To show that you need to show that for all . If for then and is the same thing. If then while , the same value. This is Mine 12,6th Post!!!
Thanks You! Thank You! Thank You!
Maybe I am asking a basic question but what is the difference between: and ? This is a HM problem and I am not clear what the question is
Originally Posted by thomas_donald Maybe I am asking a basic question but what is the difference between: and ? This is a HM problem and I am not clear what the question is What do you mean the difference? We proved they are the same.
I understand why but I am not clear why is the same thing.Could you show it in more details? Or, is it possible to get an example?
Originally Posted by thomas_donald I understand why but I am not clear why is the same thing.Could you show it in more details? Or, is it possible to get an example? If then .
Thanks ! Now I get it slowly and surely.
View Tag Cloud