Let A be an algebra of finite degree n over K. For each x∈A we denote by Lx the linear mapping a↦xa of A into itself. We recall (III, p. 543) that the trace of Lx is called the trace of x relative to A and is written TrA/K(x); likewise the determinant of Lx is called the norm of x relative to A and is denoted by NA/K(x). The discriminant of a sequence (x1,...,xn) of n elements of A is by definition the determinant DA/K(x1,...,xn) of the matrix (TrA/K(xixj))1≤i,j≤n (III, p. 549).
Let K' be an extension of K and let A′=A(K′) be the K'-algebra derived from A by extension of scalars. We have the formulae
(1)
TrA′/K′(1⊗x)=TrA/K(x).1,NA′/K′(1⊗x)=NA/K(x).1
for all x∈A (III, p. 544). For every sequence (x1,...,xn) of elements of A we have
(2)
DA′/K′(1⊗x1,...,1⊗xn)=DA/K(x1,...,xn).1,
as follows from the first formula (1).
2. Norms and traces in etale algebras
Let A be an etale algebra of (finite) degree n over K. By definition there exist then an extension L of K and distinct homomorphisms u1,...,un of A into L with the following properties.
a) every homomorphism of A into L is equal to one of the ui (V, p. 29, Cor.); b) there exists an L-algebra isomorphism u:A(L)→Ln such that
u(1⊗x)=(u1(x),…,un(x))for all x∈A.
Moreover, every algebraically closed extension L of K has the above properties (V, p. 30, Prop. 2).
We fix L,u1,…,un in what follows. Let x∈A; we shall prove the formulae
TrA/K(x)⋅1=i=1∑nui(x),NA/K(x)⋅1=i=1∏nui(x).
Let v be multiplication by l⊗x in A(L); with respect to the basis of A(L) which is the image under u−1 of the canonical basis of Ln, the matrix of the linear mapping v is diagonal, with diagonal elements u1(x),…,un(x). We conclude that
TrA(L)/L(1∘x)⋅1=r=1∑nui(x),whenceTrA/K(x)⋅1=i=1∑nui(x) by (1);
the case of norms is treated similarly.
Further let (x1,…,xn) be a sequence of elements of A, let U be the matrix
(ui(xj))1≤i,j≤n
and let (tij)=′U.U. By the first formula (3) we have
— Let A be a commutative algebra of finite degree over K. Then the following conditions are equivalent: a) The algebra A is etale. b) There exists a basis of A whose discriminant is non-zero. c) For each x=0 in A there exists y in A such that TrA/K(xy)=0. *Further, when these conditions are satisfied, the discriminant of any basis of A is non-zero.
We shall show that when A is assumed etale, the discriminant of A with respect to any basis (x1,…,xn) of A over K is non-zero; this will in particular establish the implication a)⇒b). By (4), with the above notation, it suffices to show that the matrix U is invertible, or equivalently, that the system of linear equations
i=1∑nλiui(xj)=0(for 1≤j≤n)
has only the solution λ1=⋯=A,=0 in L. Now the relation (5) implies ∑i=1nλiui(x)=0 for all x∈A, whence λi=0 for 1≤i≤n, by the theorem on the linear independence of homomorphisms (V, p. 27, Th. 1).
The equivalence of b) and c) is a consequence of the following general lemma:
Lemma 1
Let V be a vector space of finite dimension over K and B a bilinear form on V x V. Let (v1,…,vn)be a basis of V over K andΔ=detB(vi,vj). Then A=0 if and only if, for each x=0 in V there exists y in V such that B(x,y)=0.
We have A=0 if and only if the system of linear equations
i=1∑nλiB(vi,vj)=0(1≤j≤n)
has only the solution A,=⋯=A,=0 in K. If we put x=∑i=1nλivi, the above system is equivalent to B(x,vj)=0 for 1≤j≤n, or also, since (v1,…,vn) is a basis of V over K, to B(x,y)=0 for all y∈V, whence the lemma.
Let us show that condition c) implies that A is reduced. Let x be a nilpotent element of A : for any y∈A the element xy is nilpotent, and so the endomorphism Lxy of the vector space A is nilpotent. Now the following lemma implies that Tr(xy)=0 for all y∈A, whence x=0 under hypothesis c).
Lemma 2
Let V be a vector space of finite dimension over K and u a nilpotent endomorphism of V, then Tr(u)=0.
For each integer n≥0 let Vn be the image of un. Since u is nilpotent, there exists an integer r≥0 such that V0=V,Vr=0 and Vi=Vi+1 for 0≤i<r−1. Let di be the dimension of Vi−1 (for 1≤i≤r). There exists a basis (x1,…,xd) of V such that the vectors xj with d−di<j≤d form a basis of Vi−1 (for 1≤i≤r). We have u(Vi−1)⊂Vi and so the diagonal elements of the matrix of u for the basis (x1,…,xd) are zero. Thus we have Tr(u)=0 and the lemma follows.
Finally let us show that b) implies a). Let (x1,…,xn) be a basis of A over K such that DA/K(x1,…,xn)=0. Let K' be an extension of K, A' the K'-algebra derived from A by extension of scalars and xi′=1⊗xi for 1≤i≤n. By Formula (2) (V, p. 47) we have DA′/K′(x1′,…,xn′)=0. Applying the preceding result to A' we see that A' is reduced, hence the algebra A is etale (V, p. 34, Th. 4).
Corollary
— Let E be an extension of finite degree of K. For E to be separable it is necessary and sufficient that there exist a in E such that TrE/K(a)=0.
The condition is necessary by Prop. 1. Conversely, assume that there exists a∈E such that TrE/K(a)=0. Given x=0 in E, if we put y=ax′, then TrE/K(xy)=0. Now Prop. 1 shows that E is an etale algebra over K, hence a separable extension of K.
3. Norms and traces in extensions of finite degree
The transitivity formulae in algebras (III, p. 548) imply the following proposition in the case of extensions of finite degree.
Proposition 2
— Let F be an extension of finite degree of K and E a subextension of F. Then for every x∈F we have
— Let E be an extension of finite degree n of K and x an element of E, of degree d over K. Write f(X)=Xd+∑i=1daiXd−i for the minimal polynomial of X over K. Then we have
Prop. 3 follows directly from the Cor. of Prop. 2 and the lemma:
Lemma 3
Let R be a commutative ring, f(X)=Xd+∑i=1daiXd−i a monic polynomial of R[X], A the R-algebra R[X]/(f) and x the residue class of X in A. Then TrA/R(x)=−a1 and NA/R(x)=(−1)dad.
By the Cor. (IV, p. 11) the sequence (1,x,...,xd−1) is a basis of A ; further we have
x⋅1=x,x⋅x=x2,…,x⋅xd−2=xd−1,
x⋅xd−1=−ad⋅1−ad−1⋅x−…−a1⋅xd−1
The matrix which expresses the multiplication by x with respect to the basis (1,x,...,xd−1) of A is thus of the following form (we have taken d=5 to fix the ideas):
01000001000001000001−a−a−a3−a2−a1
The trace of this matrix is clearly −a; the determinant may be calculated by expanding by the first row, and we then find
(−1)d−1(−ad)=(−1)dad.
For the rest of this No. we denote by E an extension of finite degree of K and by x an element of E. We shall indicate how to calculate the norm and trace of x in various cases.
a) Case of a separable extension: suppose that E is separable of degree n over K, denote by Ω an algebraic closure of K and by σ1,…,σn the n distinct K-homomorphisms of E into R. By Formula (3) (V, p. 48) we have in R
TrE/K(x)=i=1∑nσi(x),NE/K(x)=i=1∏nσi(x).
b) Case of a p-radical extension: suppose that K is of characteristic p>0 and that the extension E is p-radical; there exists an integer e≥0 such that [E:K]=pe (V, p. 26, Prop. 4). If f is the height of x over K, the minimal polynomial of x over K is Xpf−xpf (V, p. 24, Prop. 1). By Prop. 3 we have NE/K(x)=(xpf)pe/pf, whence
NE/K(x)=xpe=x[E:K]
For the trace we find TrE/K(x)=−pe−fa, where a is the coefficient of Xpf−1 in the polynomial Xpf−xpf; in other words, we have
TrE/K(x)=pe⋅x=[E:K]x={x0if [E:K]=1if [E:K]>1.
c) General case: we can summarize the calculation of norm and trace in the following proposition:
Proposition 4
Let p be the characteristic exponent of K and E an extension of finite degree of K. Let σ1,…,σn be the distinct K-homomorphisms of E into an algebraic closure Ω of K, and let pe=[E:K]i. For each x∈E we have in Ω
Let E, be the relative separable closure of K in E; then Es is a separable extension of degree n of K and σ1,…,σn induce distinct K-homomorphisms of E, into R; further, E is ap-radical extension of E, of degreepe (V, p. 44, Prop. 13 and p. 46). So Prop. 4 follows from the Formulae (6), (7), (13), (14) and (12).