![]() | (1.1) |
Existence Given equation 1.1, D(F) can alternatively be specified as

Because any σ ∈ Sn is bijective and because (xi - xj)2 = ((-1)(xj - xi))2 = (-1)2(xj - xi)2 = (xj - xi)2, then

In other words, D(F) is symmetric. Thus there indeed exists a polynomial d ∈ ℤ[x1,…,xn] such that d(s1,…,sn) = D(F) since every symmetric polynomial in ℤ[x1,…,xn] is contained in ℤ[s1,…,sn].
Uniqueness There cannot exist two distinct d1,d2 ∈ ℤ[x1,…,xn] such that d1(s1,…,sn) = d2(s1,…,sn) = D(F) because their existence would contradict the algebraic independence of s1,…,sn [Lan02, p. 192] since it would imply d = d1 - d2 has d(s1,…,sn) = 0.
Degree n = 2 To find an explicit formula for disc(f) where f(t) is a monic polynomial of degree two, we need to find d(z1,z2) ∈ ℤ[z1,z2] such that d(s1,s2) = (x1 - x2)2. Because of the existence/uniqueness proven above, we can find such a polynomial and there will be only one. So because s1 = x1 + x2, s2 = x1x2 for n = 2 and because

then we can deduce that d(z1,z2) = z12 - 4z2. Hence for any f(t) = t2 + at + b

Degree n = 3 To find an explicit formula for disc(f) where f(t) is a monic polynomial of degree three, we need to find d(z1,z2,z3) ∈ ℤ[z1,z2,z3] such that d(s1,s2,s3) = (x1 - x2)2(x1 - x3)2(x2 - x3)2. Again, because of the existence/uniqueness proven above, we can find such a polynomial and there will be only one.
We first notice that d(s1,s2,s3) will be a homogeneous polynomial of degree six in x1,x2,x3. Therefore, since s1 = x1 + x2 + x3, s2 = x1x2 + x1x3 + x2x3, and s3 = x1x2x3,

for some integers α1,α2,α3,α4,α5,α6,α7. We will find these values by analyzing the following expansion
![]() | (1.2) |
From this equation, it is immediately apparent that α6 = α7 = 0 since s2s14 and s16 would produce monomials containing x1 raised to a degree higher than 4, but there is no such monomial in the polynomial of equation 1.2. Now, given the expansions


In the same vein, we evaluate the coefficients for the monomials x13x22x3 to get

x14x2x3 to get

x13x33 to get

and finally x14x32 to get

Solving the above five equations we obtain α1 = -27, α2 = 18, α3 = -4, α4 = -4, and α5 = 1, which in turn informs us that

Hence for any f(t) = t3 + at2 + bt + c


It’s clear that in order to obtain the appropriate values of p2, p3, and p4, a1 = b1 = c1 = 1 since none of the other clauses in the above equations will be able to account for the xi2, xi3, and xi4 in each of p1, p2, and p3. Hence, in determining the formula for pi, our approach will be to start with s1i ordered lexicographically and find the coefficient of the leftmost clause that isn’t in pi and then subtract the product of that coefficient with the appropriate clause on the right hand side of the equations above. We will know which are appropriate by looking at the lexicographical first term of each of the clauses:
| Clause | First Term, Lexicographically |
| s12 | x12 |
| s2 | x1x2 |
| s13 | x13 |
| s1s2 | x12x2 |
| s3 | x1x2x3 |
| s14 | x14 |
| s12s2 | x13x2 |
| s22 | x12x22 |
| s4 | x1x2x3x4 |
where these terms have been generated for n = 4.
So for the case of p2 we start with

in which the first term x12 should remain since it is in p2, but we need to get rid of the second term 2x1x2. Through use of Table 2.1, this implies that a2 = -2 so that we are left with s12 - 2s2 = x12 + x22 + x32 + x42, and thus the formula for p2.
For the case of p3 we start with s13 = x14 + 3x12x2 +
, leaving off the, currently unimportant, terms after the first
two. Again through use of Table 2.1, the coefficient of 3 in the second term informs us that b2 = -3 so that we are left with
s13 - 3s2s1 = x13 + x23 - 3x1x2x3 +
, which finally informs us that b3 = 3, leaving us with p3’s formula:
s13 - 3s2s1 + 3s2.
Finally, by following the same procedure regarding p4, we have

(xσ(1),…,xσ(n)) for
x1,…,xn ∈ M. With this definition 

⊗xn) =
for each σ ∈ Sn and therefore by defining the action of Sn on ⊗RnM
by having σ act on x ∈⊗RnM by (i∘fσ)(x) where i : Mn →⊗RnM is the normal R-multilinear inclusion map, we obtain
the desired R-linear permutation action, since i ∘fσ satisfies the axioms of a group action, being that i and fσ are
each homomorphisms. Note that we omit the use of σ ⋅ x or x ⋅ σ notation in light of the next part of this
problem.
= i∘fσ
=
for each x1,…,xn ∈ M. For repetitious use later, we point
out that φτσ = φτ ∘ φσ for all τ,σ ∈ Sn according to
![]() | (3.3) |
for each x = ∑
ixi = ∑
ixi1 ⊗
⊗ xin ∈⊗RnM. With equation 3.3 in hand we see that if we were to attempt to make
this action a left action then

and if we were to do so as a right action then

for each x ∈⊗RnM, implying not only that this action is a left action, but that it is not are right action.
SR∙(M) for free R-module M with rank(M) = n Let
= {v1,…,vn} be a set of free generators on M and Y = {y1,…,yn}. We will use ∙ to denote the tensor operation in
Sk(M). Define α : Mk → Rk[y1,…,yn] and β : Y → Sk(M) by

to 1 and all other elements of
to zero. With the
product in its definition and because each factor in that product is the sum of linear maps, α is a symmetric k-multilinear
map. Therefore, we have that two results:
Pictorially we have the following commutative diagram.
![M k Sk (M )
ααββ- Rk [y ,⋅⋅⋅,y ] Y
1 n](homework0334x.png)
Now, let’s denote
j times ∈ Sk(M) by x∙j so that x∙j = xj ∙
j-1 times since each element of Sk(M)
is symmetric. Thus for the generators of Sk(M) and Rk[y1,
,yn]

and

which implies that α and β are inverses of each other. Hence Sk(M) is isomorphic to Rk[y1,
,yn].

and therefore

Hence we can compute the character of ρk of any sirj ∈ D2n
