Google Groups Home
Help | Sign in
Message from discussion Sign of a permutation
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
William F. Hammond  
View profile
 More options Apr 11 1990, 12:04 pm
Newsgroups: sci.math
From: wf...@leah.Albany.Edu (William F. Hammond)
Date: 11 Apr 90 16:04:27 GMT
Local: Wed, Apr 11 1990 12:04 pm
Subject: Re: Sign of a permutation

In article <5...@ucrmath.UCR.EDU> b...@x.UUCP (john baez) writes:

>Help!!!  I'd like a short proof if possible that the
>sign of a permutation is really well-defined, i.e.,
>that any element which is a product of an even number of
>interchanges is not the product of an odd number.
> . . .
>And can you do it by tomorrow morning????

>No, this is not a homework problem!!!!!!!!
>I'M TEACHING THE COURSE.

For a permutation in S_n define its sign to be 1 or -1 according to
what effect that permutation has on the polynomial

          product for 1 <= i < j <=n  of (x_i - x_j)

It is then obvious that the sign defined this way is a character, i.e.,
a homomorphism from  S_n  to the multiplicative group {1, -1}, that
assigns the value -1 to any transposition and, therefore, "counts mod 2"
the number of transpositions in any factorization of a permutation.
                                  -- Bill


    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.

Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2008 Google