Let n be a positive integer. For every permutation σ∈Sn let φσ be the automorphism of the A-algebra A[X1,…,Xn] which maps Xi to Xσ(i) for 1≤i≤n. It is clear that σ↦φσ is a homomorphism of Sn into the group of automorphisms of A[X1,…,Xn]. We shall put σf=φσ(f) for σ∈Sn and f∈A[X1,…,Xn]. The polynomial f is said to be symmetric if σf=f for all σ∈Sn ; the symmetric polynomials form a unital graded subalgebra of A[X1,…,Xn] ; we shall denote it by A[X1,…,Xn]sym in the rest of this paragraph. For every positive integer k we denote by Pk the set of k-element subsets of the set {1,2,…,n} and put
(1)
sk=H∈Pk∑i∈H∏Xi.
When we wish to specify the integer n we shall write sk,n instead of sk. We have in particular
and sk=0 for k>n. It is clear that sk is a homogeneous symmetric polynomial of degree k ; we shall call it the elementary symmetric polynomial of degree k. In the ring A[X1,…,Xn,U,V] we have the relation
(2)
i=1∏n(U+VXi)=k=0∑nUn−kVksk;
by appropriate substitutions we deduce the relations
(3)
i=1∏n(1+TXi)=k=0∑nskTk,
(4)
i=1∏n(X−Xi)=k=0∑n(−1)n−ksn−kXk.
Theorem 1
— Let us put E=A[X1,…,Xn] and S=A[X1,…,Xn]sym.
a) The A-algebra S of symmetric polynomials is generated by s1,…,sn.
b) The elements s1,…,sn of E are algebraically independent over A (IV, p. 4).
c) The family of monomials Xν=X1ν(1)…Xnν(n) such that 0≤ν(i)<i for 1≤i≤n is a basis of the S-module E. In particular, E is a free S-module of rank n!.
We shall prove the theorem by induction on n, the case n=0 being trivial. Let us write B=A[Xn] and denote by sk′ the elementary symmetric polynomial of degree k in X1,…,Xn−1; we thus have B[X1,…,Xn−1]=A[X1,…,Xn]. If we replace n by n−1 and A by B in the statement of Th. 1, we can formulate the induction hypothesis as follows:
(A) The B-algebra S′ of polynomials f∈A[X1,…,Xn] invariant under all permutations of X1,…,Xn−1 is generated by s1′,…,sn−1′.
(B) The elements s1′,…,sn−1′, of E are algebraically independent over B.
(C) The family of monomials X1ν(1)…Xn−1ν(n−1) such that 0≤ν(i)<i for 1≤i≤n−1 is a basis of the S′-module E.
We have the obvious relation
(5)
sk=sk′+sk−1′Xn(1≤k≤n−1),
from which we obtain by induction on k
(6)
sk′=(−1)kXnk+i=1∑k(−1)k−isiXnk−i(1≤k≤n−1).
We have S⊂S′, hence s1,…,sn belong to S′; by (A) and formula (6) the B-algebra S′ is therefore generated by s1,…,sn−1′.
By (B) there exists an endomorphism μ of the B-algebra S′ such that
By (5), we have u(sk)=u(sk′)+u(sk−1′)Xn, whence u(sk)=sk′ by an easy calculation. Let P∈B[Y1,…,Yn−1]; then from P(s1,…,sn−1)=0 we deduce
0=u(P(s1,…,sn−1))=P(s1′,…,sn−1′),
whence P=0 by (B). It follows that the B-algebra S′ is generated by the algebraically independent elements s1,…,sn−1. This property may be reformulated as follows: (D) The A-algebra S′ is generated by the algebraically independent elements s1,…,sn−1,Xn.
We can thus identify S' with the polynomial ring C[Xn], where C is the sub-A-algebra of E generated by s1,...,sn−1.
To prove a), let f∈S be a homogeneous symmetric polynomial of degree m. We have f∈S′=C[Xn], so there exists an element g=P(s1,...,sn−1) of C, homogeneous of degree m in X1,...,Xn, such that f−g is divisible by Xn. Since f−g is symmetric, each of its terms is also divisible by X1,...,Xn−1, hence f−g is divisible by sn=X1...Xn. In other words, there exists h∈S such that f=g+hsn, whence degh<m. By induction on m it follows that f belongs to
C[sn]E=A[s1,...,sn−1,sn]E.
Thus we have shown that the A-algebra S is generated by s1,...,sn.
Next we prove b). If we substitute X, for X in (4), we find
(−1)n+1sn=Xnn+k=1∑n−1(−1)n−ksn−kXnk;
in other words, (−1)n+1sn is a monic polynomial in X, of degree n and with coefficients in C. By IV, p. 11 we thus have the following property : (E) The C-algebra homomorphism φ of C[T] into C[Xn]=S′ which maps T to sn is injective, and S′ is a free module over the image of φ, with basis (1,Xn,...,Xnn−1).
The elements s1,...,sn−1 of C are algebraically independent over A, by (D); thus the injectivity of φ means that s1,...,sn−1,sn are algebraically independent over A, whence b).
To prove c), the image of φ equals C[sn]E=S, hence by (E), S′ is a free module over S on the basis (1,X1,...,Xnn−1). Now the assertion c) follows from the induction hypothesis (C) and Prop. 25 of II, p. 222. This completes the proof.
Let f be a symmetric polynomial in X1,...,Xn, homogeneous of degree m. By Th. 1 (IV, p. 62) there exists a polynomial Q∈A[Y1,...,Yn] such that f=Q(s1,...,sn). The preceding proof provides a means of explicit calculation of Q, by a double induction on n and m. For as we have seen, there exists a polynomial P∈A[Y1,...,Yn−1] and a polynomial h symmetric in X1,...,Xn which is homogeneous of degree m−n, such that
f=P(s1,...,sn−1)+snh.
For every polynomial u∈A[X1,...,Xn] we put
u′(X1,...,Xn−1)=u(X1,...,Xn−1,0)
Then s1′,...,sn−1′ are the elementary symmetric polynomials in X1,...,Xn−1 and formula (8) implies
f′=P(s1′,...,sn−1′)
The determination of P is thus reduced to a calculation of symmetric polynomials in n−1 indeterminates, and h is obtained from (8).
2) Again let n=3 and put p=X13+X23+X33. We have p(X1,0,0)=X13=s1(X1,0,0)3. Writing q=p−s13, we obtain
q=−3f−6X1X2X3=−3s1s2+3s3
and finally
p=s13−3s1s2+3s3.
Let S1,...,Sn be indeterminates. We shall equip the polynomial algebra A[S1,...,Sn] with the graduation of type N for which Sk is of weight k for 1≤k≤n (IV, p. 3), and we equip A[X1,...,Xn] with the usual graduation. For 1≤k≤n the elementary symmetric polynomial sk,n in X1,...,Xn is homogeneous of degree k. By Th. 1 (IV, p. 62) the mapping g↦g(s1,n,...,sn,n) is thus an isomorphism of graded algebras
φn:A[S1,...,Sn]→A[X1,...,Xn]sym
Let m be an integer such that 0≤m≤n. For every integer k such that 1≤k≤m we have
sk,m(X1,...,Xm)=sk,n(X1,...,Xm,0,...,0)
by definition (IV, p. 61, formula (1)) of sk. Hence the diagram
(where j denotes the canonical inclusion and p the homomorphism
g↦g(X1,…,Xm,0,…,0)
is commutative.
Proposition 1
For every pair of positive integers k, n, let Sk(n) be the A-module consisting of all symmetric polynomials in X1,…,Xn, which are homogeneous of degree k. If the integer m satisfies 0≤k≤m≤n, then the mapping f↦f(X1,…,Xm,0,…,0) is an isomorphism of Sk(n) onto Sk(m).
By the commutativity of the diagram (10) it is enough to show that every isobaric polynomial of weight k in S1,…,Sn depends only on S1,…,Sm under the hypotheses 0≤k≤m≤n. Now the weight of a monomial S1α(1)⋯Snα(n) is equal to the integer α(1)+2α(2)+…+nα(n); since the integers α(1),…,α(n) are positive, the relation
α(1)+2α(2)+⋯+nα(n)=k≤n
implies α(j)=0 for k<j≤n, whence the assertion.
Example 3
By example 2 of IV, p. 64 and Prop. 1 above we thus have
i=1∑nXi3=s1,n3−3s1,ns2,n+3s3,n
for every integer n≥3. The commutativity of the diagram (10) moreover gives the formulae
X13+X23=s1,23−3s1,2s2,2,
X13=s1,13.
Remark
— Let n and k be two positive integers. We denote by Δk,n the set of elements of length k in Nn and further equip A, , with the order relation, written a≤β, induced by the lexicographic order on Nn (Set Theory, III, p. 157), and define an action of the group Sn on Nn by (σa)(i)=a(σ−1(i)) for σ∈Sn,a∈Nn and l≤i≤n. Moreover, we denote by Dk the set of elements a=(α(1),…,α(k)) of Nk such that
α(1)≥α(2)≥⋯≥α(k),α(1)+⋯+α(k)=k.
Suppose that k≤n and let us identify Nk with a subset of Nn by the mapping (a(1),…,a(k))↦(a(1),…,a(k),0,…,0). Then Dk consists of the elements a of Δk,n such that σa≤a for all σ∈Sn. It follows that every orbit of the group Sn in A, , contains a unique element of Dk. For every a∈Dk let O(a) be the orbit of a in Δk,n under the operation of Sn; put
M(α)=β∈O(α)∑Xβ.
It follows from Lemma 1 of IV, p. 47, that the family (M(α))α∈Dk is a basis of the A-module Sk(n).
For each α∈Dk put
(12)S(α)=i=1∏ksiα(i)−α(i+1)(where it is understood that a(k+1)=0);
since we have ∑i=1ki⋅(a(i)−a(i+1))=∑i=1ka(i)=k, the symmetric polynomial S(α) is homogeneous of degree k. It follows directly from Th. 1 (IV, p. 62) that the family (S(α))α∈Dk is a basis of the A-module Sk(n).
Let α,β be in Dk, and let cαβ be the coefficient of the monomial Xβ in the polynomial S(α) defined by (12) in the case A=Z and k=n. This is then a positive integer, independent of the ring A and of the integer n. By formula (9) (IV, p. 64) we then have
(13)S(α)=β∈Dk∑cαβ⋅M(β)(α∈Dk).
It may be shown (cf. IV, p. 101, Exercise 13) that the matrix C=(cαβ)α,β∈Dk is such that cαα=1 and cαβ=0 for α<β; generalizing the terminology introduced in II, p. 351, we shall say that C belongs to the lower total triangular group. The same is true of the matrix D inverse to C. The values of the matrices C and D when 2≤k≤5, are given in the table (IV, p. 103-105).
Suppose now that n<k and let us identify Nn with a subset of Nk by the mapping (a(1),…,a(n))↦(a(1),…,a(n),0,…,0). For every a in Dk∩Nn we again denote by O(α) the orbit of a in Δk,n under the operation of Sn and define M(α) by (11). Further we define S(α) by (12), then the families (M(a))a∈Dk∩Nn and (S(a))a∈Dk∩Nn are bases of the A-module Sk(n). By formula (9) of IV, p. 64, we have a formula analogous to (13) where Dk is replaced by Dk∩Nn, with the same integers cαβ.
Example 4
By Example 3 of IV, p. 65, we have
M(3,0,0)=S(3,0,0)−3S(2,1,0)+3S(1,1,1)
for every integer n≥3, and so
M(3,0)=S(3,0)−3S(2,1)
for n=2.
2. Symmetric rational fractions
Let K be a commutative field and X1,X2,…,Xn indeterminates. For every σ∈Sn we have defined in No. 1 (IV, p. 61) an automorphism φσ of K[X1,X2,…,Xn]. This automorphism has a unique extension ψσ to the field K(X1,…,Xn), and σ↦ψσ is an injective homomorphism of Sn into the automorphism group of K(X1,…,Xn). For each f∈K(X1,…,Xn) we have (ψσf)(X1,…,Xn)=f(Xσ(1),…,Xσ(n)). The rational fractions f such that ψσ(f)=f for all σ∈Sn are called symmetric rational fractions. The set of all symmetric rational fractions in X1,…,Xn is a subfield of K(X1,…,Xn).
Proposition 2
— The field of symmetric rational fractions in X1,…,Xn is the field of fractions of the ring of symmetric polynomials in X1,…,Xn..
Let f∈K(X1,…,Xn) be a symmetric rational fraction, and let u1,v1 be two elements of K[X1,…,Xn] such that f=v1u1. We put v=∏σ∈Snψσ(v1)∈K[X1,…,Xn] and u=fv∈K[X1,…,Xn]; then v is symmetric, hence u is symmetric, because f is, and f=vu, whence the result.
Corollary
— *Let s1,s2,…,sn be the elementary symmetric polynomials in X1,…,Xn. For every rational fraction g∈K(S1,S2,…,Sn) the sequence (s1,s2,…,sn) is substitutable in g and the mapping g↦g(s1,s2,…,sn) is an isomorphism of K(S1,S2,…,Sn) onto the field of symmetric rational fractions in X1,…,Xn.
This follows from Prop. 2 and Th. 1 of IV, p. 62.
3. Symmetric formal power series
Let I be a set, X=(Xi)i∈I a family of indeterminates and A[[X]] the algebra of formal power series in the Xi. For every permutation a∈SI there exists a unique continuous automorphism φa of the algebra A[[X]] which maps Xi to Xa(i) for each i∈I (IV, p. 28, Prop. 4); it is clear that σ↦φσ is a homomorphism of SI into the group of continuous automorphisms of the algebra A[[X]]. Let f∈A[[X]] be a formal power series; we put af=φa(f) and we shall say that the formal power series f is symmetric if σf=f for each σ∈SI. The symmetric formal power series form a closed subalgebra of A[[X]] which is denoted by A[[X]]sym and is equipped with the topology induced by that of A[[X]].
Let T be an indeterminate. In the ring of formal power series A[[X,T]] the family (XiT)i∈I is summable, hence the family (1+XiT)i∈I, is multipliable (IV, p. 27, Prop. 2); moreover we have
i∈I∏(1+XiT)=1+k≥1∑skTk,
where the formal power series sk∈A[[X]] is defined by
sk=H∈Pk∑(i∈H∏Xi)(k≥1)
(we denote by Pk the set of all k-element subsets of I). In particular we have s1=∑i∈IXi. When I is finite with n elements we have sk=0 for k>n; more precisely, when I={1,…,n} then the formal power series sk is nothing other than the elementary symmetric polynomial of degree k in X1,…,Xn.
Let S=(Sk)k≥1 be a sequence of indeterminates. Since the formal power series sk is of order ≥k, and belongs to A[[X]]sym, conditions a) and b) of Prop. 4 of IV, p. 28 are satisfied with E=A[[X]]sym; there exists thus a unique continuous A-algebra homomorphism
φI:A[[S]]→A[[X]]sym
such that φI(Sk)=sk for each integer k≥1.
Theorem 2. — a)If I is a finite set of n elements, then φI induces a bicontinuous isomorphism of A[[S1,…,Sn]] onto A[[X]]sym.
b)If I is infinite, φI is a bicontinuous isomorphism of A[[S]] onto A[[X]]sym.
In case a) we put B=A[[S1,…,Sn]] and equip this algebra with the topology induced by that of A[[S]]; we also denote by ψI the restriction of φI to B. In case b) we put B=A[[S]] and ψI=φI. We shall equip the polynomial algebra A[S] with the graduation of type N for which Sk is of weight k for every integer k≥1.
Lemma 1. — Let J be a finite subset of I, r an integer such that Card J≥r and fa symmetric formal power series which is homogeneous of degree r in the Xi (i∈I). Let fˉ be the formal power series obtained by substituting 0 for Xi for each i in I−J. If fˉ=0, then we have f=0.
Let us put f=∑∣α∣=raαXα (where ∣α∣ is the length ∑i∈Iαi of the multiindex a=(αi)i∈I). If a is a multiindex of length r, and J′ is the support of a (the set of i∈I such that αi=0), then Card J′≤r, hence there exists a permutation σ∈SI such that σ(J′)⊂J. Put βi=ασ−1(i) for i∈I, then the monomial Xβ=∏i∈IXσ(i)αi depends only on the indeterminates Xj (j∈J), whence aβ=0 by the hypothesis f=0. Since f is symmetric, we have aα=aβ and since α was arbitrary, we conclude that f=0.
Lemma 2
Let f be a symmetric formal power series of degree r in the Xi(i∈I). There exists a unique polynomial P∈B∩A[S], isobaric of weight r, such that f=ψ1(P).
The case when I is finite follows from Th. 1 (IV, p. 62).
Assume that I is infinite and choose a finite subset J of I, containing r elements. We keep the notation of Lemma 1; we remark that every isobaric polynomial of weight r in the Sn(n≥1) depends only on S1,…,Sr and that s1,…,sr are the elementary symmetric polynomials in the r indeterminates Xj(j∈J). If P is an isobaric polynomial of weight r in the Sn and h=f−ψ1(P), then h=f−P(s1,…,Sr) and Lemma 1 shows the relation f=ψ1(P) to be equivalent to f=P(s1,…,sr). By Th. 1 (IV, p. 62) there exists a unique polynomial P∈A[S], isobaric of weight r and such that f=P(s1,…,sr), whence the result.
Lemma 3
For every integer m≥0 let cm be the ideal of the algebra A[[X]]sym consisting of all symmetric formal power series of order ≥m. The sequence (cm)m≥0 is a fundamental system of neighbourhoods of 0 in A[[X]]sym.
The lemma clearly holds when I is finite, so let us assume that I is infinite. For every finite subset J of I, consisting of m elements, denote by J~ the set of elements of N(1) of length <m and with support in J. Further denote by aJ′ the set of formal power series containing no term aXα with a∈J~. Since J~ is a finite subset of N(1) and every finite subset of N(1) is contained in a set of the form J~, the family (aJ′) is a base of neighbourhoods of 0 in A[[X]] (IV, p. 26). Now Lemma 1 implies the relation aJ′∩A[[X]]sym=cm for every subset J with m elements, and this proves Lemma 3.
Since there are only a finite number of monomials of a given weight in the Sk, every formal power series f∈B may be written in a unique way as f=∑r≥0Pr, where Pr is an isobaric polynomial of weight r in B∩A[S]. For every integer m≥0 let bm be the ideal of B consisting of all formal power series of the above type such that Pr=0 for 0≤r<m. The sequence (bm)m≥0 is a base of neighbourhoods of 0 in B.
With the above notation ψ1(Pr) is a symmetric formal power series in the Xi, homogeneous of degree r, and so this is the homogeneous component of degree r of ψ1(f). Lemma 2 shows that ψ1 is an algebra homomorphism of B onto A[[X]]sym, mapping bm to cm for every integer m≥0; now Lemma 3 shows ψ1 to be bicontinuous, and this completes the proof of Theorem 2.
4. Sums of powers
We again write X=(Xi)i∈I for a family of indeterminates. The symmetric formal power series sk are defined as before by
sk=H∈Pk∑i∈H∏Xi(k≥1),
where Pk is the set of all k-element subsets of I. We also write
pk=i∈I∑Xik(k≥1)
This is a symmetric formal power series which is homogeneous of degree k.
Lemma 4 (« Newton's relations »). — For every integer d≥1 we have
pd=k=1∑d−1(−1)k−1skpd−k+(−1)d+1dsd
Let us define a continuous derivation A in A[[X]] by A(u)=∑n≥0nun, where for every u in A[[X]], un is the homogeneous component of degree n of u. By (16) and Prop. 2 of IV, p. 27 we have
1+k≥1∑sk=i∈I∏(1+Xi)
By Prop. 9 of IV, p. 34 we thus have
(k≥1∑ksk)⋅(1+k≥1∑sk)−1=i∈I∑Δ(Xi)/(1+Xi).
We have A(Xi)=Xi and Xi/(1+Xi)=∑k≥1(−1)kXik. The right-hand side of (20) is thus equal to ∑k≥1(−1)k−1pk. Hence by (20) we have
k≥1∑ksk=(1+k≥1∑sk)⋅(k≥1∑(−1)k−1pk)
and now Lemma 4 follows by a comparison of homogeneous components of degree d.
Remark
— With the notation of the above proof we have
Δu=i∈I∑Xi⋅Di(u)
(IV, p. 33, Cor. 1). In other words, Euler's relation (IV, p. 8, Prop 6) extends to formal power series : if u∈A[X] is homogeneous of degree n, then
(21)
n⋅u=i∈I∑Xi⋅Di(u).
When I is finite, consisting of n elements, we have sk=0 for k>n. Then Newton's relations may be written
The first n of the above relations hold for any I ; we find for example
p1=s1,p2=s12−2s2,p3=s13−3s1s2+3s3.
More generally, let S=(Sn)n≥1 be a family of indeterminates. Let us define the polynomials Pd∈Z[S1,…,Sd] recursively by P1=S1 and
Pd=k=1∑d−1(−1)k−1SkPd−k+(−1)d+1dSd(d≥2).
Then we have the « universal formulae » pd=Pd(s1,…,sd) holding over any ring A and family X of indeterminates. Let P=(Pk)k≥1 be a sequence of indeterminates. Since pk is homogeneous of degree k in A[[X]], there exists precisely one continuous A-algebra homomorphism
λI:A[[P]]→A[[X]]sym
such that λI(Pk)=pk for every integer k≥1(IV, p. 28). If we assign to Pk the weight k, then λI transforms an isobaric polynomial of weight n in the Pk into a formal power series which is homogeneous of degree n in the Xi.
Proposition 3
— a) If I is a finite set with n elements and n!⋅1 is invertible in A, then λI induces a bicontinuous isomorphism of A[[P1,…,Pn]] onto A[[X]]sym.b) If I is infinite and A is a Q-algebra, then λI is a bicontinuous isomorphism of A[[P]] onto A[[X]]sym. We shall treat the case a) only, the case b) being quite similar.
By Th. 2 (IV, p. 68) we can identify A[[X]]sym with the algebra of formal power series A[[S1,…,Sn]], with Sk corresponding to sk. By Lemma 4 of IV, p. 70, there exist formal power series g1,…,gs of order ≥2 in the indeterminates s1,…,sn such that
pk=(−1)k+1ksk+gk(s1,…,ss)(1≤k≤n).
Since k!.1 is invertible in A, Lemma 2 of IV, p. 35 proves the existence of an automorphism T of the topological A-algebra A[[X]]sym which maps sk to pk for l≤k≤n. Now Prop. 3, a) is an immediate consequence.
Corollary
— *Let ξ1,…,ξn,η1,…,ηn be elements of A and suppose that A is an integral domain.
a) If sk(ξ1,…,ξn)=sk(η1,…,ηn) for 1≤k≤n, then there exists a permutation σ∈Sn such that ηi=ξσ(i) for 1≤i≤n.
b) Suppose that n!.1=0 in A and
ξ1k+⋯+ξnk=η1k+⋯+ηnk
for 1≤k≤n. Then there exists a permutation σ∈Sn such that ηi=ξσ(i) for 1≤i≤n.
Under the hypotheses a) we have ∏i=1n(X−ξi)=∏i=1n(X−ηi). If we substitute ηn for X, we find that ∏i=1n(ηn−ξi)=0 and since A is an integral domain, there is an integer σ(n) such that lsσ(n)≤n and ηn=ξσ(n). Now the assertion a) follows easily by induction because A[X] is an integral domain.
Under the hypotheses of b) there exist by Prop. 3 polynomials Π1,…,Πn in n indeterminates, with coefficients in the field of fractions of A such that sk=Πk(p1,…,pn) for 1≤k≤n. Now the relation (23) implies
sk(ξ1,…,ξn)=sk(η1,…,ηn)
for 1≤k≤n and so b) follows from a).
5. Symmetric functions in the roots of a polynomial
Consider a monic polynomial of degree n, with coefficients in A:
f=Xn+a1Xn−1+⋯+an−1X+an.
We define an associative, commutative and unital A-algebra Ef with the generators x1,…,x, and relations
i1<…<ik∑xi1…xik=(−1)kak(1≤k≤n).
More precisely, we have
Ef=A[X1,...,Xn]/a
where the ideal a is generated by the polynomials sk+(−1)k+1ak for 1≤k≤n, and xi is the residue class of Xi mod a for 1≤i∈n. The relation (24) is also equivalent to f(X)=∏i=1n(X−xi). When there is any risk of ambiguity, we write x1,f,...,xn,f in place of x1,...,xn.
Proposition 4
Let B be a commutative ring, ρ a homomorphism of A into B and ξ1,...,5, elements of B. Suppose that the relation ρf(X)=∏i=1n(X−ξi) holds in B[X]. Then there exists one and only one ring homomorphism u:Ef→B such that ρ(a)=u(a.1) for all a∈A and u(xi)=ξi for 1≤i≤n.
We consider B as associative, commutative and unital A-algebra by means of ρ. Then the relation ρf(X)=∏i=1n(X−ξi) may also be written in the form
i1<...<ik∑ξi1...ξik=(−1)kak.1(1≤k≤n)
in B. Since the relations (24) define a presentation of Ef, Prop. 4 follows.
Prop. 4 justifies the name « universal decomposition algebra of f » for Ef. The relation f(X)=∏i=1n(X−xi,f) is called the « universal decomposition of f ». Let σ∈Sn be a permutation ; since f(X)=∏i=1n(X−xσ(i),f), there exists an automorphism tσ of the A-algebra Ef characterized by tσ(xi,f)=xσ(i),f for 1≤i≤n. We have tστ=tσ∘tτ for σ,τ in Sn, and hence obtain an action of the group G, an the A-algebra Ef.
Proposition 5
In the universal decomposition algebra Ef the family of monomials x1ν(1)...xnν(n) such that 0≤ν(i)<i for 1≤i≤n is a basis of the A-module Ef. In particular Ef is a free A-module of rank n!.
Write B=A[X1,...,Xn] and C=A[X1,...,Xn]sym. By Th. 1 (IV, p. 62) we have C=A[s1,...,sn] and s1,...,sn are algebraically independent over A. The polynomials without constant term in s1,...,sn form an ideal C+ in C, supplementary to A and generated by s1,...,sn. Let c be the ideal of C generated by s1+a1,s2−a2,...,sn+(−1)n+1an. There exists an A-algebra automorphism of C which maps sk to sk+(−1)k+1ak for 1≤k≤n, and hence maps C+ onto c ; therefore we have C=A⊕c. Moreover Th. 1, c) of IV, p. 62 shows that
B=ν∈S⨁CXν
where S is the set of all ν∈Nn such that 0≤ν(i)<i for 1≤i≤n. The ideal a of B is generated by c, whence a=Bc=⨁ν∈Sc⋅Xν. Since C=A⊕c, we find
B=a⊕ν∈S⨁AXν,
whence Prop. 5, because Ef=B/a.
Corollary
— *The canonical homomorphism of A into the universal decomposition algebra of the monic polynomial f∈A[X] is injective.
For the unit element of Ef forms part of a basis of the A-module Ef.
Proposition 6
— *Let f∈A[X] be a monic polynomial of degree n, and let P be a symmetric polynomial in X1,...,Xn with coefficients in A. Then there exists precisely one element a of A with the following property: (FS) For any ring homomorphism ρ:A→B and decomposition 0f(X)=∏i=1n(X−ξi) in B[X] we have ρ(a)=P(ξ1,...,ξn).
Write f=Xn+∑k=1nakXn−k, then by Th. 1, IV, p. 62 there exists a polynomial Π in n indeterminates with coefficients in A, such that P=Π(s1,...,sn). Put a=Π(−a1,a2,...,(−1)nan). Under the hypothesis (FS) we have
This proves the existence of an element a satisfying (FS). The uniqueness of a follows from the Cor. to Prop. 5, because we have a⋅1=P(x1,f,...,xn,f) in the universal decomposition algebra Ef.
With the notation of Prop. 6 one sometimes writes a=P∗(f). Here are some examples.
Examples. — 1) If P=sk, then P∗(f)=(−1)kak. \ 2) Let g be a polynomial in A[X] and put
P(X1,...,Xn)=g(X1)...g(Xn).
Then P∗(f) is just the resultant res(f,g), by Cor. 1 of IV, p. 80. 3) Put A(X1,...,Xn)=∏i<j(Xi−Xj)2, then Δ∗(f) is just the discriminant of the monic polynomial f (IV, p. 82, formula (46)). \*
4) Put P(X1,…,Xn)=X1k+…+Xnk; moreover, define the algebra E=A[X]/(f) and write x for the image of X in E. We recall that the A-module E is free, with basis (1,x,…,xn−1) (IV, p. 11, Cor.). Let us show
TrE/A(xk)=P∗(f)
Put πk=TrE/A(xk) for every integer k≥1. Bearing in mind Newton's relations (IV, p. 70) we need only establish the relations
(which we shall also call « Newton's relations »). The relation (27) is clear, because the left-hand side is the trace of
xk−n(xn+a1xn−1+⋯+an−1x+an)=0.
Suppose that 1≤k≤n and put
y=xk+a1xk−1+⋯+ak−1x+ak⋅1;
let M=(mij) be the matrix of the linear mapping u↦yu in E relative to the basis (x′)0,…,n. We easily obtain the relations
mii=akfor 0≤i<n−kmii=0for n−k≤i<n,
whence
TrE/A(y)=i=0∑n−1mii=(n−k)ak.
Moreover we have
TrE/A(y)=πk+a1πk−1+⋯+ak−1π1+nak,
whence formula (26) follows.
6. The resultant
In this No. we assume as given two positive integers p,q and two polynomials f,g in A[X] of the form
fg=tpXp+tp−1Xp−1+⋯+t0=uqXq+uq−1Xq−1+⋯+u0
such that degf≤p,degg≤q. For every integer n≥0 we denote by S, the sub-A-module of A[X] consisting of all polynomials of degree <n; it has the family (X′)0≤i<n as basis, and hence is of rank n.
and we denote by M(f,g,p,q) the matrix of φ with respect to the bases B1 and B2. This is a square matrix of order p+q, indexed by the set {0,1,...,p+q−1}. Its elements aij are given by the rules: a) aij=tp−i+j for 0≤j≤q−1, b) aij=uj−i for q≤j≤p+q−1, where tk is taken to be 0 if k∈/(0,p) and uk=0 if k∈/(0,q).
With the above notation the determinant of the matrix M(f,g,p,q) is called the resultant of the pair (f,g) for the degrees p and q, or simply the resultant of f and g if p=degf and q=degg.
The resultant is denoted by resp,q(f,g) or simply res(f,g) when p=degf, q=degg.
Example 1
Given Λ,μ in Λ, we have the formulae
resp,0(f,λ)=λp,res0,q(μ,g)=μq
resp,1(f,λ)=λptp,res1,q(μ,g)=(−1)qμquq,
whose proof is immediate.
Example 2
When p=q=1, we have
res1,1(t1X+t0,u1X+u0)=t1u0−t0u1
Remark 1
The matrix M(g,f,q,p) is obtained from M(f,g,p,q) by pq transpositions of columns, whence
resq,p(g,f)=(−1)pqresp,q(f,g)
Remark 2
Let ρ:A→B be a ring homomorphism. Def. / implies directly the formula
resp,q(ρf,ρg)=ρ(resp,q(f,g)).
Remark 3
Given λ,μ in A, we have
resp,q(λf,μg)=λqμpresp,q(f,g).
(28)
Remark 4
Suppose that p+q≥1. By III, p. 532, formula (28), the image of φ contains the constant polynomial resp,q(f,g). Hence there exist a pair of polynomials (u,v), with u∈Sq,v∈Sp such that
resp,q(f,g)=uf+vg,
whence
resp,q(f,g)∈A∩(f,g).
This pair (u,v) is unique when resp,q(f,g) is cancellable in A: for then φ is injective (III, p. 524, Prop. 3).
Remark 5
Suppose that p≥q, and let h∈A[X] be a polynomial of degree ≤p−q. Let us show that
resp,q(f,g)=resp,q(f+gh,g).
(29) For if we write ω(u,v)=(u,uh+v) for (u,v)∈Sq×Sp, then w is an automorphism of the A-module Sq×Sp and we have
ω−1(u,v)=(u,−uh+v).
The matrix of w with respect to the basis B1 is lower triangular and its diagonal elements are equal to 1. On the other hand, φ∘w maps (u,v) to u(f+gh)+vg. Now formula (29) means that the matrices representing φ and φ∘w have the same determinant and this follows from the relation detw=1.
Assume that f is monic of degree p; put E=A[X]/(f) and denote by x the canonical image of X in E. We know (IV, p. 11) that E is a free A-module with basis (1,x,…,xp−1). We can thus define the norm NE/A(u) of any element u of E (III, p. 543, Def. 2).
Proposition 7
— Assume that f is monic of degree p; with the above notations we have¹
resp,q(f,g)=NE/A(g(x)).
(30)
¹ The resultant resp,q(f,g) is thus independent of q when f is monic of degree p. We then denote it simply by res(f,g).
Let us define an A-linear mapping 0 of Sq×Sp into Sp+q by θ(u,v)=uf+v. Then 0 maps the basis B1 of Sq×Ss into the sequence
(fXq−1,…,fX,f,Xp−1,…,X,1)
of elements of Sp+q; hence the matrix M, of 0 with respect to the bases B1,B2 is lower triangular and its diagonal elements are equal to 1, whence detM=1.
It follows that θ is bijective and resp,q(f,g) is equal to the determinant of the endomorphism φ′=φ∘θ−1 of Sp−q. Explicitly, we have
φ′(uf+v)=uf+vg
for any pair (u,v) in Sq×Ss. Now we have A[X]=Sp+q+(f) and fSq=Ss∩(f), hence the canonical injection of Sp−s into A[X] defines by the passage to quotients an isomorphism γ of Sp+q/fSq onto E. Let ψ be the multiplication by g(x) in E. Formula (31) shows that φ′ induces the identity on fSq and γ−1ψγ on Sp+q/fSq. We thus have detφ′=detψ, whence (30) follows, because detφ′=resp,q(f,g) and detψ=NE/A(g(x)), by definition.
Corollary 1
— Let f∈A[X] be a monic polynomial; for every polynomial g∈A[X] the following conditions are equivalent: (i) res(f,g) is invertible in A; (ii) there exist polynomials u,v in A[X] such that uf+vg=1; (iii) g(x) is invertible in the algebra A[X]/(f). The equivalence of (i) and (iii) follows from Prop. 3 of III, p. 545 and Prop. 7; that of (ii) and (iii) follows trivially.
Corollary 2
— Suppose that A is a field and let f,g∈A[X], then the following conditions are equivalent when f,g are non-zero: (i) res(f,g)=0; (ii) the polynomials f and g are relatively prime in A[X]; \* (iii) for any extension L of A the polynomials f and g have no common root in L. \
We can reduce at once to the case where f is monic (IV, p. 77, remark 3). The equivalence of (i) and (ii) is just a translation of Cor. 1, by Def. 1 of IV, p. 12; the equivalence of (ii) and (iii) is just Cor. 7 of IV, p. 13.
Corollary 3
— For every λ∈A we have
resp,1(f,λ−X)=f(λ),res1,q(X−λ,g)=g(λ).
When f(X)=X−λ, the algebra E is equal to A and we have x=A; the second formula (32) now follows from Prop. 7 (IV, p. 77). By remarks 1 and 3 (IV, p. 76, 77) we conclude
Suppose now that f and g are monic. We denote by F the A-algebra A[X,Y]/(f(X),g(Y)) and denote by x (resp. y) the canonical image of X (resp. Y) in F.
Proposition 8
— Suppose that f and g are monic of degrees p and q respectively. With the above notation, the A-module F is free with basis (xiyj)0≤i<p,0≤j<q and we have
res(f,g)=NF/A(x−y).
Put E=A[X]/(f) and E′=A[Y]/(g). By II, p. 253, Cor. 1, the homomorphism σ of E@E′ into F derived from the canonical homomorphism A[X]⊗A[Y]→A[X,Y] is bijective; this proves the assertion about the basis of F. We now identify E with its image in F under σ. Then the E-algebra homomorphism of E[Y]/(g(Y)) into F which maps Y to y is an isomorphism.
By the transitivity of the norm (III, p. 546) we have
NF/A(x−y)=NE/A(NF/E(x−y)).
By Prop. 7 (IV, p. 77), NF/E(x−y) is the resultant of the polynomials g(Y) and x − Y in E[Y], hence equal to g(x) (IV, p. 78, Cor. 3). By formula (34) and Prop. 7 (IV, p. 77) we thus have
NF/A(x−y)=NE/A(g(x))=res(f,g)
Proposition 9
— Let p1 and q1 be positive integers and f1,g1 polynomials in A[X] such that degf1≤p1,degg1≤q1; then we have
We have resp,q(f,g)=(−1)pqresq,p(g,f) (IV, p. 76); so it is enough to prove (35). Likewise, Remark 3 (loc. cit.) shows that if formula (35) is established for a polynomial f, then it holds for all polynomials of the form Af, where A∈A. Finally, when f is monic of degree p, formula (35) follows from Prop. 7 (IV, p. 77) by the formula NE/A(ab)=NE/A(a)⋅NE/A(b). In all we conclude that (35) holds when the coefficient tp of Xp in f is invertible.
Lemma 5
Let t be an element of A. There exists a commutative ring C containing A as subring, a subring B of C containing A, an element τ of B invertible in C and a ring homomorphism p:B→A such that p(τ)=t and the restriction of p to A is equal to Id.
It suffices to take for B the algebra A(N) of the monoid N, that is, the polynomial algebra A[τ] in one indeterminate τ, for C the algebra A(Z) of the group Z and for p the homomorphism P↦P(t) of A(τ) into A.
With the notation of Lemma 5, where we have taken t = t_p, let us put
F=τXp+tp−1Xp−1+⋯+t1X+t0
in B[X]. The coefficient of Xp in F is invertible in C; if we consider F, g, g1 as polynomials of C[X] we thus have
resp,q+q1(F,gg1)=resp,q(F,g)⋅resp,q1(F,g1)
by what has been said. The resultants are unchanged if we consider F, g and g1 as polynomials in B[X]. Since ρF=f, ρg=g, ρg1=g1, formula (35) follows from (38) and Remark 2 (IV, p. 77).
Corollary 1
— (i) Let λ,α1,…,αp be elements of A and suppose that f(X)=λ(X−α1)…(X−αp). We have
resp,q(f,g)=λqg(α1)…g(αp).
(ii) Let μ,β1,…,βq be elements of A and suppose further that g(X)=μ(X−β1)…(X−βq). Then we have
resp,q(f,g)=λqμp1≤i≤p1≤j≤q∏(αi−βj).
Assertion (i) follows directly from the formulae (28), (32) and (36). Now Assertion (ii) follows from (i).
Corollary 2
— For every integer r≥0 we have
resp,q+r(f,g)=tpr⋅resp,q(f,g).
Bearing in mind Example 1 (IV, p. 76) we need only take q1=r,g1=1 in (35).
Assume that f is monic, and let ρ:A→B be a ring homomorphism and ξ1,…,ξp elements of B such that we have the decomposition
ρf(X)=(X−ξ1)…(X−ξp)
By Remark 2 (IV, p. 77) and Cor. 1 above we have
ρ(res(f,g))=g(ξ1)…g(ξp)
This remark applies in particular to the universal decomposition off (IV, p. 73) and since ρ is then injective, this provides a means of calculating res(f,g).
Arguing as for Prop. 9 (IV, p. 79) we see that it is enough to prove the formula when a is invertible. There exists then a decomposition of the form
aX2+bX+c=a(X−x)(X−y)
in B[X], where B is an appropriate ring containing A as subring. By Cor. 1 above, the required resultant is equal to
R=a2(a′x2+b′x+c′)(a′y2+b′y+c′).
Now we have
ax+ay=−b,axy=c
by (43), whence (ax)2+(ay)2=b2−2ac.
By (44) we have
R=a′2(axy)2+ab′2(axy)+a2c′2+a′b′(axy)(ax+ay)+
+a′c′((ax)2+(ay)2)+ab′c′(ax+ay)
=a′2c2+ab′2c+a2c′2−a′b′cb+a′c′(b2−2ac)−ab′c′b
=(ac′−ca′)2+(ab′−a′b)(b′c−c′b),
from which the desired result follows.
7. The discriminant
Definition 2
Let f be a monic polynomial of A[X] of degree m, and denote by E the A-algebra A[X]/(f) and by x the canonical image of X in E. We define the discriminant of f, written dis(f), as the discriminant DE/A(1,x,…,xm−1) of the basis (1,x,…,xm−1) of the A-algebra E.
For every positive integer k we write ρk=TrE/A(xk). By III, p. 549, Def. 2 amounts to the formula
dis(f)=det(pi+j)0≤i,j<m
*Examples. — 1) If f is a monic polynomial of degree 0 or 1, we have dis(f)=1, by (45). 2) Let f(X)=X2+αX+β be a monic polynomial of degree 2. Newton's relations may be written in the form (IV, p. 75)
p0=2p1+α=0p2+αp1+2β=0,
whence p1=−a, p2=a2−2p. It follows that we have
dis(f)=det(2−a−αα2−2p)=α2−4β
Let B be a commutative ring, ρ a homomorphism from A to B and ξ1,…,ξm elements of B such that
ρf(X)=(X−ξ1)⋯(X−ξm).
Let us write M for the matrix (ρ(pi+j))0≤i,j<m and D for the Van der Monde matrix (ξij+1)0≤i,j<m. By Example 4 of IV, p. 75 we have
ρ(pk)=ξ1k+⋯+ξmk,
whence M=′D.D; by III, p. 532 we have D=∏i>j(ξi−ξj) and detM=(detD)2, that is
ρ(dis(f))=i<j∏(ξi−ξj)2
Moreover (on writing D for the derivation dXd) we have
By Cor. 1 of IV, p. 80 applied to the universal decomposition of f, we finally obtain
res(f,Df)=res(Df,f)=(−1)m(m−1)/2dis(f).
Proposition 10
Let m≥1. There exists a unique polynomial A∈Z[A1,…,Am] with the following property : for any commutative ring A and monic polynomial f=Xm+∑i=1maiXm−i in A[X] we have
dis(f)=Δ(a1,…,am).
Moreover A is of degree ≤2m−2 and if we assign weight i to Ai then A is isobaric of weight m(m−1). a) Uniqueness of A : if A satisfies (48), we have in particular A=dis(F), where F is the polynomial Xm+∑i=1mAiXm−i with coefficients in Z[A1,…,Am]. b) Existence of A : let s1,…,sm be the elementary symmetric polynomials in the indeterminates X1,…,Xm. There exists a polynomial A∈Z[A1,…,Am], isobaric of weight m(m−1), such that
Δ(−s1,s2,…,(−1)msm)=i<j∏(Xi−Xj)2;
for the right-hand side is a symmetric polynomial P, homogeneous of degree m(m − 1) in Z[X1,...,Xm] (IV, p. 62, Th. 1). Now formula (46) means that dis(f) = P (f ), in the notation of IV, p. 74, and (48) follows directly from this.
c) Degree of A : the relation (47) and the definition of the resultant (IV, p. 76) imply the formula
In these formulae it is understood that Ai=1 and Ai=0 for i<0 or i>m. Now (50) shows at once that A is of degree ≤2m−2, as we had to prove.
Prop. 10 allows us to extend the definition of the discriminant to non-monic polynomials. Let m≥1 be an integer, then there exists a unique homogeneous polynomial of degree 2m−2, Δ~ say, in Z[A0,A1,...,Am] such that
Δ(A1,...,Ar)=Δ~(1,A1,...,Ar)
for, since A is of degree ≤2m−2, the rational fraction
A02m−2Δ(A1/A0,...,Am/A0)
belongs to the subring Z[A0,A1,...,Am] of Q(A0,A1,...,Am). If Ai has weight i for 0≤i≤m, then Δ~ is isobaric of weight m(m−1). Iff is a polynomial of degree ≤m, say
f=a0Xm+a1Xm−1+⋯+am−1X+am,
we shall put
dism(f)=Δ~(a0,a1,...,ar).
When m=degf, we shall simply write dis(f) for dism(f); if f is monic, dis(f) agrees with the discriminant defined in Def. 2, by (48), (51) and (52).
Proposition 11
— Let f in A[X] be of degree ≤m.
(i) Ifρ:A→B is a ring homomorphism, we have dism(ρf)=ρ(dism(f)).
(ii) Let λ,α1,...,ar be elements of A. Iff=X(X−α1)...(X−ar); then we have
dism(f)=λ2m−2i<j∏(αi−αj)2.
(iii) Let a0 be the coefficient of Xm in f; then we have
for every polynomial f∈A[X] of degree ≤m. Assertion (ii) now follows from formulae (46) and (55).
When f is monic of degree m, we have a0=1 and Assertion (iii) is reduced to formula (47). Bearing in mind (55) and the relation
resm,n(λf,μg)=λnμmresm,n(f,g),
(IV, p. 77), we can pass from there to the case where a0 is invertible in A. Now the general case follows by Prop. 11, (i) and Lemma 5 (IV, p. 79).
Corollary 1
— Let g∈A[X] and let n be a positive integer such that degg≤n. We have
dism+n(fg)=dism(f)⋅disn(g)⋅resm,n(f,g)2.
By reasoning as before we are reduced to the case where f and g are monic of degrees m and n respectively. Now put B=Ef⊗Eg, where Ef (resp. Eg) is the universal decomposition algebra of f (resp. g) (IV, p. 73). Then A is a subring of B, and in B[X] we have the decompositions
f=i=1∏m(X−αi),g=j=1∏n(X−βj).
Hence we have
fg=k=1∏m+n(X−γk),
with γi=αi for 1≤i≤m and γm+j=βj for 1≤j≤n. We have the obvious identity
On squaring this relation we obtain (57), by (40) and (46).
Corollary 2
— If a0 is the coefficient of Xm in f, we have
dism+1(f)=a02dism(f)
This follows from Cor. 1 on taking n=1,g=1, by the formula resm,1(f,1)=a0 (IV, p. 76, Example 1).
Corollary 3
— Let A be a field, and let f be a non-constant polynomial in A[X]. For f and Df to be relatively prime, it is necessary and sufficient that dis(f)=0. This follows from Prop. 11, (iii) and Cor. 2 of IV, p. 78.
Remark
Adouble application of Cor. 2 above shows that we have dism(f)=0 for every polynomial f of degree ≤m−2.
Example 3
Let m=2. By Example2 (IV, p. 81) we have Δ(A1,A2)=A12−4A2, whence Δ~(A0,A1,A2)=A12−4A0A2. In other words, we have
dis2(a0X2+a1X+a2)=a12−4a0a2.
Example 4
Consider the polynomial
F=A0X3+3A1X2+3A2X+A,
with coefficients in Q[A0,A1,A2,A3]. We have
DF=3(A0X2+2A1X+A2),
F−1/3X⋅DF=A1X2+2A2X+A3.
By the formulae (54) (IV, p. 84) and (29) (IV, p. 77) we have