MHB Proving Evenness of m and r in σ ∈ Sn

  • Thread starter Thread starter namzay300
  • Start date Start date
namzay300
Messages
2
Reaction score
0
Suppose σ ∈ Sn and σ = τ12****τm = t1*t2****tr where each τi and tj is a transposition. Then, prove m is even iff r is even.

Note: τ(δ(r1,r2,...,rn) = -δ(r1,r2,...,rn)

Usually like to provide what I have done so far, but I've been racking my brain for awhile and can't come up with much. Any detailed insight would be much appreciated. Thanks!
 
Physics news on Phys.org
namzay300 said:
Suppose σ ∈ Sn and σ = τ12****τm = t1*t2****tr where each τi and tj is a transposition. Then, prove m is even iff r is even.

Note: τ(δ(r1,r2,...,rn) = -δ(r1,r2,...,rn)

Usually like to provide what I have done so far, but I've been racking my brain for awhile and can't come up with much. Any detailed insight would be much appreciated. Thanks!

http://mathhelpboards.com/linear-abstract-algebra-14/symmetric-polynomials-involving-discriminant-poly-17823.html

Are you two taking the same class? (Wink)
 
Deveno said:
http://mathhelpboards.com/linear-abstract-algebra-14/symmetric-polynomials-involving-discriminant-poly-17823.html

Are you two taking the same class? (Wink)

That would be quite a coincidence! I was hoping to receive an answer pertaining to my question though :( If anyone out there can help, that would be great! Thank you.
 
namzay300 said:
That would be quite a coincidence! I was hoping to receive an answer pertaining to my question though :( If anyone out there can help, that would be great! Thank you.

The link I posted was to another thread that essentially covers the same ground, although it may not seem like it.

The strategy is to show that if $\sigma = (i\ j)$ is a transposition, then the action of $\sigma$ on the Vandermonde polynomial $\delta(x_1,\dots,x_n) = \prod\limits_{k < m} (x_k - x_m)$ given by:
$\sigma(\delta(x_1,\dots,x_n)) = \delta(x_{\sigma(1)},\dots,x_{\sigma(n)})$ is equal to $-\delta(x_1,\dots,x_n)$.

So, by extension, if a permutation $\tau$ can be written as an even number of permutations, it leaves the Vandermonde polynomial unchanged, and if it can be written as an odd number of permutations, it changes the sign of the Vandermonde polynomial.

Now if a permutation could be written as both an even number AND an odd number of permutations, we would have:

$\delta(x_1,\dots,x_n) = -\delta(x_1,\dots,x_n)$, a contradiction.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
2
Views
5K
Back
Top