Norms in quadratic extensions rings
This lab was written by Elad Zelingher, all rights reserved to Elad Zelingher.
Let be an integer that is not a square. Recall that we defined to be the following subset of the complex numbers
The set is a ring: by this we mean that:
- .
- If two elements belong to then their sum and difference also belong to .
- If two elements belong to then their product also belongs to .
An element is called a unit if there exists such that . In this case we call the inverse of .
An element is called irreducible if is not a unit and for every such that we have that either or is a unit.
We defined the conjugate map by the rule for any . We also defined the norm map by the rule . Explicitly, . Recall that .
Problem 1
Recall that we showed that for if and only if is a unit. Try to prove this again.
Problem 2
The app QuadraticRingElements allows you to see the elements of 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 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 as above. For each of these values consider the elements with the smallest possible norm (in absolute value) that is not or . What do these elements have in common? Can you prove this?
Problem 4
Again use QuadraticRingElements with different values of 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 not invertible there exists a decomposition
where , , are irreducible elements.
We say that is a unique factorization domain if this decomposition is unique, up to possibly:
- Replacing with an associate, that is, with where is a unit.
- Reordering the s.
Use QuadraticRingFactorization to check if is a unique factorization domain for each .
Problem 6
For each 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 ? 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 whether there exist an element such that . Make two lists, one for the prime numbers that are norms (in absolute value), and one for those that are not. Now use QuadraticRingFactorization and look at the decomposition of each you tested. Can you find a relation between the decomposition of and whether it is a norm (in absolute value) or not? Can you prove this?