The Discriminant
Let be a number field of degree over . Let be the embeddings of in . We write for the matrix with in the th row and column, and for the determinant of this matrix. Define the discriminant of by
As with the trace and norm, the discriminant may be generalized by replacing with any number field.
Theorem:
Proof: Recall some basic facts about determinants:
Then the theorem follows from
Corollary: , and if the are integral, then .
Theorem: if and only if are linearly dependent over .
Proof: If the are linearly dependent over then so are the columns of the matrix and its determinant will be zero. Conversely if , then the rows of the matrix are linearly dependent. Suppose the are linearly independent. Then let be rationals, not all zero, such that . Then consider . Note we have for all . The form a basis for over , and since , so do the . But this implies for all , a contradiction since there exist elements of nonzero trace (for example ).
Theorem: Let and let be the conjugates of over . Let be the minimal polynomial of . Then
where the sign is positive if and only if .
Proof: First observe is a Vandermonde determinant, yielding the first equality.
Next we have
where the plus sign holds if and only if . Since has rational coefficients, we have
Then the second equality follows from the fact that for all
(To see this, let . Then by the product rule, , and the roots of are all the roots of except for .)
Let us now apply this theorem to compute for where is an odd prime. We have . Since , we have showing that
Taking norms gives
Since , we have , hence .
Write for where is a degree algebraic integer over and is taken to be .
We now know that for prime . For for general , the expression is more complicated, but it can be readily shown that as follows. Let be the minimal polynomial of . Then Since for some we have . Taking norms gives
and we are done since .