Newsgroups: sci.math
From: ms...@leah.Albany.Edu (Mark Steinberger)
Date: 11 Apr 90 18:21:23 GMT
Local: Wed, Apr 11 1990 2:21 pm
Subject: Re: Sign of a permutation
In article <2...@leah.Albany.Edu> wf...@leah.albany.edu.UUCP (William F. Hammond) writes:
>In article <5...@ucrmath.UCR.EDU> b...@x.UUCP (john baez) writes: The above proof is of course elegant. It also requires some >>Help!!! I'd like a short proof if possible that the >For a permutation in S_n define its sign to be 1 or -1 according to > 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., sophistication of the student, so it may not be the best one if the students haven't been exposed to polynomial rings and groups of units. If the course is concentrating on group theory at the moment, it may 1. Show that every permutation has a unique decomposition as a product 2. Define the sign of a k-cycle to be (-1)^{k-1} (i.e. (-1) to the 3. Define the sign of a product of disjoint cycles to be the product 4. Let sigma be any product of disjoint cycles and let tau be a A proof along these lines is a bit tedious, but totally elementary. It --Mark 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.
| ||||||||||||||