Let A be a K-algebra admitting a finite basis of n elements. The discriminant of a sequence (x1,…,xn) of n elements of A, with respect to K, denoted by DA/K(x1,…,xn), is the discriminant of the square matrix
(TrA/K(xixj))1≤i≤n,1≤j≤n.
Consider first a basis (ei)1≤i≤n of A over K and write
eiej=k=1∑ncijkekwithcijk∈K.
Then TrA/K(ei)=∑s=1nciss, whence TrA/K(eiej)=∑k,scijkckss and therefore
Now let (xi)1≤i≤n,(xi′)1≤i≤n be two sequences of n elements of A and suppose that there exists a square matrix of order n, M=(mij), with coefficients in K, such that xi=∑j=1nmijxj′ for 1≤i≤n. We write
Then TrA/K(xixj)=∑p,qmipmjqTrA/K(xp′xq′), whence T=M⋅T′⋅tM; the rule of multiplication of determinants therefore gives
detT=detM⋅detT′⋅dettM=(detM)2detT′
whence finally
DA/K(x1,…,xn)=(detM)2DA/K(x1′,…,xn′).
The above formula shows in particular that the discriminants of two bases of A over K differ by the square of an invertible element of K and therefore generate the same (principal) ideal of K. This ideal ΔA/K is called the discriminant ideal of A over K; by formula (32) the discriminant of every sequence of n elements of A which differ only in the order of the terms have the same discriminant, for the determinant of a permutation matrix is equal to ±1.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.