Skip to main content

Welcome to a Grasp lesson

Create a free account to keep studying and create your own study path.

Lesson 3

Integral Bases and Discriminants in Number Fields

Recommended resources

Welcome to our third lesson. In our previous discussion, we introduced the norm and trace, which map elements of a number field back to the rational numbers . We saw how these functions can be understood from the perspectives of linear algebra, polynomial coefficients, and field embeddings. Today, we will use the trace to construct one of the most important invariants of a number field: the discriminant.

This lesson will introduce the concept of an integral basis, which provides a concrete set of "building blocks" for the ring of integers . We will then define the discriminant of the number field, a single integer that encodes fundamental structural information about . Our goal is to understand these definitions and, most importantly, to learn systematic methods for computing the integral basis and the discriminant for a given number field, both by hand and using PARI/GP.

The Discriminant of a Basis

We begin by defining the discriminant for an arbitrary -tuple of elements in a number field of degree . This definition builds directly on the concepts of trace and embeddings from our last lesson.

There are two equivalent and equally important ways to define this.

Definition 1 (via Embeddings): Let be a number field of degree with embeddings . For any elements , their discriminant is:

where is the entry in the -th row and -th column of an matrix. Squaring the determinant ensures the result is independent of how we order the embeddings or the elements.

Definition 2 (via Trace): The discriminant can also be defined using the trace bilinear form, .

The following reading formalizes these definitions and establishes their key properties.

[PDF] Number Fields - University of Cambridge

This section from J. A. Thorne's notes provides the formal definitions of the discriminant and explores its fundamental properties.

In Section 3, "Discriminant and integral bases," please read the following parts: Start with Definition 3.1 which presents the embedding-based definition. Next, read Lemma 3.2 and its proof, which shows the equivalence with the trace-based definition. Read Corollary 3.3. This confirms that if the \alpha_i are algebraic integers, their discriminant is a rational integer. Finally, read Proposition 3.4. This establishes a crucial property: the discriminant is non-zero if and only if the elements form a \mathbb{Q}-basis for the field K.


Integral Basis and the Field Discriminant

Just as a vector space has a basis, a ring of integers has a special kind of basis called an integral basis. Because is a free -module of rank , this means we can find elements that generate all of using only integer coefficients.

Definition: An integral basis for a number field is a set of elements in such that every element can be written uniquely as a -linear combination with .

It is a non-trivial theorem that every number field has an integral basis. With this concept, we can now define the discriminant of the field itself.

Definition: The discriminant of a number field K, denoted (or ), is the discriminant of any integral basis of .

A natural question arises: does the choice of integral basis matter? Fortunately, it does not. If and are two integral bases, they are related by a change-of-basis matrix with integer entries. Since the transformation is invertible, must also have integer entries, which implies that . The relationship between the discriminants of two bases is given by . Since , the discriminant is the same for any integral basis, making a well-defined invariant of the field.


Computing the Discriminant

Finding an integral basis and the discriminant can be challenging. The general strategy involves starting with a simple -basis of algebraic integers and refining it. The most common starting point is a power basis.

For a number field of degree , the set forms a -basis for . If is an algebraic integer, this gives us a subring . The discriminant of this power basis can be computed relatively easily using the minimal polynomial of .

[PDF] Number Fields - University of Cambridge

This proposition provides a powerful formula for computing the discriminant of a power basis.

Please read Proposition 3.10 and its proof. The proposition states that for a power basis generated by \alpha with minimal polynomial f(x), we have: \text{disc}(1, \alpha, \dots, \alpha^{n-1}) = (-1)^{n(n-1)/2}N_{K/\mathbb{Q}}(f'(\alpha)) The expression on the right is also known as the discriminant of the polynomial f(x), denoted \text{disc}(f).

This gives us the discriminant of the subring , but not necessarily the discriminant of the full ring of integers . The two are related by a fundamental formula.

The Index Formula:

Here, is the index of the subgroup in the group (under addition). It measures how "much bigger" is than . This formula is our primary tool. We compute the left side, which is easy. If the result is a square-free integer, then the index must be 1, which means and the power basis is an integral basis. If it is not square-free, we must investigate integers dividing the index.

[PDF] Algebraic Number Theory

This reading, from a course by Anuj Jakhar, explicitly states the index formula and its significance.

Please read the section beginning with Theorem 11 through the end of Corollary 12. Focus on Corollary 12, which presents the index formula in the form discr(f) = [O_K : Z[θ]]^2 d_K.


Examples of Computation

Let's apply this strategy to the most important cases.

Quadratic Fields:

Let be a square-free integer. We start with the simple basis for , where . The minimal polynomial is .
The degree is , so . The derivative is .

Using the multiplicativity of the norm, this is . Wait, , so this should be . Let's recompute using embeddings and :

So, we have . From the index formula, . This implies that the index can only be 1 or 2.

  • Case 1:
    It can be shown that there are no algebraic integers in that are not in . Therefore, the index is 1, is the full ring of integers, is an integral basis, and .

  • Case 2:
    In this case, consider the element . Its minimal polynomial is . Since , is divisible by 4, so this polynomial has integer coefficients. Thus, is an algebraic integer. This element is in but not in . The ring of integers is actually . The integral basis is , and a similar calculation shows that .

These crucial results are summarized here:

[PDF] Algebraic Number Theory

This theorem cleanly summarizes the integral basis and discriminant for all quadratic fields.

Please review Theorem 8, which explicitly states the results for the two cases based on d \pmod 4.

Cubic Field Example: with

Let . This polynomial is irreducible over . Let's compute the discriminant of the power basis . Here , so . The derivative is .

To compute this norm, we need the minimal polynomial of . This is a tedious calculation by hand. A more direct method uses resultants, but we can also follow the worked example provided in the resource.

[PDF] Algebraic Number Theory

This resource contains a fully worked example of finding the discriminant and integral basis for a simple cubic field.

Work through Example 1. It shows that for K = \mathbb{Q}(\theta) where f(\theta) = \theta^3 - \theta + 1 = 0, the discriminant of the power basis is -23.

As you saw, . Since -23 is a square-free integer, the index must be 1. This means , so is an integral basis, and the field discriminant is .


Computation in PARI/GP

Finding integral bases and discriminants by hand quickly becomes difficult. PARI/GP automates this entire process with the nfinit command.

When you execute K = nfinit(poly), PARI/GP performs a complex algorithm (the Round-2 or Round-4 algorithm) to compute the fundamental invariants of the number field defined by poly, including the discriminant and an integral basis. The results are stored in a structure, which we've named K.

You can access the components of this structure with a dot (.).

  • K.disc: The field discriminant .
  • K.zk: The integral basis, given as a vector of polynomials in the generator x.

Let's verify our previous examples.

1. Quadratic Field
Since , we expect and an integral basis .

? K = nfinit(x^2 - 13);
? K.disc
%1 = 13
? K.zk
%2 = [1, 1/2*x + 1/2]

The output matches our prediction. Note that x represents , so 1/2*x + 1/2 is .

2. Quadratic Field
Since , we expect and an integral basis .

? K = nfinit(x^2 - 10);
? K.disc
%3 = 40
? K.zk
%4 = [1, x]

Again, the results match perfectly.

3. Cubic Field with
We found and the integral basis to be .

? K = nfinit(x^3 - x + 1);
? K.disc
%5 = -23
? K.zk
%6 = [1, x, x^2]

PARI/GP confirms our hand calculation.


Conclusion

In this lesson, we have defined two of the most fundamental objects associated with a number field: the integral basis and the field discriminant .

Key takeaways:

  • The discriminant of a basis measures whether the elements are linearly independent and is computed using traces or embeddings.
  • An integral basis is a -basis for the ring of integers .
  • The discriminant of the field, , is the discriminant of any integral basis. It is a well-defined integer invariant of the field.
  • The index formula, , is the essential tool for computing and determining if a power basis is the full ring of integers .
  • The nfinit command in PARI/GP is the practical tool for finding and the integral basis for any given number field.

We have now assembled the basic toolkit for describing number fields. We know what a number field is, what its ring of integers is, and how to compute its most basic invariants. In our next lesson, we will complete this foundational module by exploring how to use the structures created by nfinit to perform arithmetic with elements and set the stage for our main topic: the arithmetic of ideals.