Skip to main content

Norms in quadratic extensions rings

note

This lab was written by Elad Zelingher, all rights reserved to Elad Zelingher.

Let α\alpha be an integer that is not a square. Recall that we defined Z[α]\mathbb{Z}[\sqrt{\alpha}] to be the following subset of the complex numbers

Z[α]={x+yαx,yZ}.\begin{equation*} \mathbb{Z}[\sqrt{\alpha}] = \left\{ x + y \sqrt{\alpha} \mid x,y \in \mathbb{Z} \right\}. \end{equation*}

The set Z[α]\mathbb{Z}[\sqrt{\alpha}] is a ring: by this we mean that:

  • 0,1Z[α]0,1 \in \mathbb{Z}[\sqrt{\alpha}].
  • If two elements belong to Z[α]\mathbb{Z}[\sqrt{\alpha}] then their sum and difference also belong to Z[α]\mathbb{Z}[\sqrt{\alpha}].
  • If two elements belong to Z[α]\mathbb{Z}[\sqrt{\alpha}] then their product also belongs to Z[α]\mathbb{Z}[\sqrt{\alpha}].

An element uZ[α]u \in \mathbb{Z}[\sqrt{\alpha}] is called a unit if there exists uZ[α]u' \in \mathbb{Z}[\sqrt{\alpha}] such that uu=1u u' = 1. In this case we call uu' the inverse of uu.

An element aZ[α]a \in \mathbb{Z}[\sqrt{\alpha}] is called irreducible if aa is not a unit and for every b,cZ[α]b,c \in \mathbb{Z}[\sqrt{\alpha}] such that a=bca = bc we have that either bb or cc is a unit.

We defined the conjugate map σ ⁣:Z[α]Z[α]\sigma \colon \mathbb{Z}[\sqrt{\alpha}] \to \mathbb{Z}[\sqrt{\alpha}] by the rule σ(x+yα)=xyα\sigma\left(x + y \sqrt{\alpha} \right) = x - y \sqrt{\alpha} for any x,yZx,y \in \mathbb{Z}. We also defined the norm map N ⁣:Z[α]Z\mathrm{N} \colon \mathbb{Z}[\sqrt{\alpha}] \to \mathbb{Z} by the rule N(z)=zσ(z)\mathrm{N}(z) = z \sigma(z). Explicitly, N(x+yα)=x2αy2\mathrm{N}\left(x + y \sqrt{\alpha}\right) = x^2 - \alpha y^2. Recall that N(z1z2)=N(z1)N(z2)\mathrm{N}(z_1 z_2) = \mathrm{N}(z_1) \mathrm{N}(z_2).

Problem 1

Recall that we showed that N(z)=±1\mathrm{N}\left(z\right) = \pm 1 for zZ[α]z \in \mathbb{Z}[\sqrt{\alpha}] if and only if zz is a unit. Try to prove this again.

Problem 2

The app QuadraticRingElements allows you to see the elements of Z[α]\mathbb{Z}[\sqrt{\alpha}] in a certain range among with their norm and whether they are irreducible or not. You may sort the elements by their norm or by the absolute value of their norm.

Use the app for different values of alpha such as 1,2,3,5,2,3,5-1,-2,-3,-5,2,3,5 and sort the elements by the absolute value of their norm. Notice that for any norm value there are usually four very similar elements with that norm. Can you explain why?

Problem 3

Use QuadraticRingElements with different values of α\alpha as above. For each of these values consider the elements with the smallest possible norm (in absolute value) that is not ±1\pm 1 or 00. What do these elements have in common? Can you prove this?

Problem 4

Again use QuadraticRingElements with different values of α\alpha as above. Now consider elements that their norm is a prime number (in absolute value). What do these elements have in common? Can you prove this property? Is the converse true?

Problem 5

We will prove soon in class that for every a0a \ne 0 not invertible there exists a decomposition

a=p1p2p,\begin{equation*} a = p_1 p_2 \dots p_{\ell}, \end{equation*}

where p1p_1, \dots, pp_{\ell} are irreducible elements.

We say that Z[α]\mathbb{Z}\left[\sqrt{\alpha}\right] is a unique factorization domain if this decomposition is unique, up to possibly:

  • Replacing pip_i with an associate, that is, with pi=uipip'_i = u_i p_i where uiu_i is a unit.
  • Reordering the pip_is.

Use QuadraticRingFactorization to check if Z[α]\mathbb{Z}[\sqrt{\alpha}] is a unique factorization domain for each α=5,3,2,1,2,3,5\alpha = -5,-3,-2,-1,2,3,5.

Problem 6

For each α\alpha from the previous problem, use QuadraticRingFactorization and select the checkbox to display only prime numbers. What are the possible lengths for a decomposition of a prime number pZp \in \mathbb{Z}? Try to prove this.

Problem 7

Use QuadraticRingElements again for the values above, and sort by the absolute value of the norm. Check for small prime numbers p=2,3,5,7,p = 2,3,5,7,\dots whether there exist an element such that N(z)=±p\mathrm{N}(z) = \pm p. Make two lists, one for the prime numbers pp that are norms (in absolute value), and one for those that are not. Now use QuadraticRingFactorization and look at the decomposition of each pp you tested. Can you find a relation between the decomposition of pp and whether it is a norm (in absolute value) or not? Can you prove this?