MHB Symmetric Polynomials Involving Discriminant Poly

mathjam0990
Messages
28
Reaction score
0
Question: Let τ = (i, j) ∈ Sn with 1 ≤ i < j ≤ n. Prove: δ(rτ(1) , . . . ,rτ(n) ) = −δ(r1, . . . ,rn)

Note: Discriminant Polynomial δ(r1,r2,...,rn) = ∏ (ri - rj) for i<j

I am pretty confused on where to begin. Based on the note, does −δ(r1, . . . ,rn) then = (r1-r2)(r1-r2)·····(r1-rn)(r2-r3)(r2-r4)····(r2-rn)····(rn-1-rn) ?

Also, since τ = (i, j) is a transposition, does that suggest τ(1) = j (because i "goes to" j), then τ(2) = i (because i "goes to" j and j "goes to" i) ? Sorry I feel like I've got this all mixed up. Could anyone provide detailed insight please?

Thanks in advance!
 
Physics news on Phys.org
mathjam0990 said:
Question: Let τ = (i, j) ∈ Sn with 1 ≤ i < j ≤ n. Prove: δ(rτ(1) , . . . ,rτ(n) ) = −δ(r1, . . . ,rn)

Note: Discriminant Polynomial δ(r1,r2,...,rn) = ∏ (ri - rj) for i<j

I am pretty confused on where to begin. Based on the note, does −δ(r1, . . . ,rn) then = (r1-r2)(r1-r2)·····(r1-rn)(r2-r3)(r2-r4)····(r2-rn)····(rn-1-rn) ?

Also, since τ = (i, j) is a transposition, does that suggest τ(1) = j (because i "goes to" j), then τ(2) = i (because i "goes to" j and j "goes to" i) ? Sorry I feel like I've got this all mixed up. Could anyone provide detailed insight please?

Thanks in advance!

Let's just look at an example: take $n = 3$.

Then $\delta(x_1,x_2,x_3) = (x_1-x_2)(x_1-x_3)(x_2-x_3)$.

Suppose we examine the result of $\sigma = (1\ 2)$ applied to $\delta$, that is, we look at:

$(x_{\sigma(1)} - x_{\sigma(2)})(x_{\sigma(1)} - x_{\sigma(3)})(x_{\sigma(2)} - x_{\sigma(3)})$

We have:

$\sigma(1) = 2$
$\sigma(2) = 1$
$\sigma(3) = 3$, so we get:

$(x_2 - x_1)(x_2 - x_3)(x_1 - x_3) = (x_2 - x_1)(x_1 - x_3)(x_2 - x_3) = -\delta(x_1,x_2,x_3)$.

Note the only factor that changed sign in this example is $(x_1 - x_2)$. In general (for higher $n$) what will happen is that $(x_i - x_j)$ will change sign, factors that involve neither $x_i$ nor $x_j$ will remain the same, factors where $i,j < k$ and $k < i,j$ will keep the same sign, so the only factors that will change sign (besides ($x_i - x_j)$) are when $i < k < j$ where the two factors $(x_i - x_k),(x_k - x_j)$ will change sign together.
 
Deveno said:
$(x_2 - x_1)(x_2 - x_3)(x_1 - x_3) = (x_2 - x_1)(x_1 - x_3)(x_2 - x_3) = -\delta(x_1,x_2,x_3)$.

Note the only factor that changed sign in this example is $(x_1 - x_2)$. In general (for higher $n$) what will happen is that $(x_i - x_j)$ will change sign, factors that involve neither $x_i$ nor $x_j$ will remain the same, factors where $i,j < k$ and $k < i,j$ will keep the same sign, so the only factors that will change sign (besides ($x_i - x_j)$) are when $i < k < j$ where the two factors $(x_i - x_k),(x_k - x_j)$ will change sign together.

This is the part I wasn't seeing! Thanks a lot for breaking that down!
 
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...
Back
Top