*Note:
These are notes live-tex’d from a graduate course in Algebraic Number Theory taught by Paul Pollack at the University of Georgia in Spring 2021. As such, any errors or inaccuracies are almost certainly my own.
*

dzackgarza@gmail.com

Last updated: 2021-05-30

- \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\)
- \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\)
- \(K\)
- \(U(K), K^{\times}\)
- \([K: {\mathbb{Q}}]\)
- \(K[\alpha]\)
- \(K(\alpha)\)
- \({\mathbb{Z}}_K \mathrel{\vcenter{:}}=\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu \cap K\), the algebraic integers in \(K\).
- \(\operatorname{ff}(K)\)
- \({\mathsf{Ab}}, \mathsf{{\mathbb{Z}}}{\hbox{-}}\mathsf{Mod}\): the category of abelian groups.

See website for notes on books, intro to class.

Youtube Playlist: https://www.youtube.com/playlist?list=PLA0xtXqOUji8fjQysx4k8a6h-hOZ7x5ue

Free copies of textbook: https://www.dropbox.com/sh/rv5j222kn74bjhm/AABZ1qcR1rOnpaBsa5CL3P_Ea?dl=0&lst=

Paul’s description of the course:

This course is an introduction to arithmetic beyond \({\mathbb{Z}}\), specifically arithmetic in the ring of integers in a finite extension of \({\mathbb{Q}}\). Among many other things, we’ll prove three important theorems about these rings:

- Unique factorization into ideals.
- Finiteness of the group of ideal classes.
- Dirichlet’s theorem on the structure of the unit group.

The main motivation: solving **Diophantine equations**, i.e. polynomial equations over \({\mathbb{Z}}\).

Consider \(y^2 = x^3 + x\).

\((x, y) = (0, 0)\) is the only solution.

To see this, write \(y^2 = x(x^2+1)\), which are relatively prime, i.e. no \(D\in {\mathbb{Z}}\) divides both of them. Why? If \(d \bigm|x\) and \(d \bigm|x+1\), then \(d\bigm|(x^2+1) + (-x) = 1\). It’s also the case that both \(x^2+1\) and \(x^2\) are squares (up to a unit), so \(x^2, x^2 + 1\) are consecutive squares in \({\mathbb{Z}}\). But the gaps between squares are increasing: \(1, 2, 4, 9, \cdots\). The only possibilities would be \(x=0, y=1\), but in this case you can conclude \(y=0\).

Consider \(y^2 = x^3-2\).

\((3, \pm 5)\) are the only solutions.

Rewrite \begin{align*} x^3 = y^2+2 &= (y+ \sqrt{-2})(y - \sqrt{-2}) \\ &\in {\mathbb{Z}}[\sqrt{-2}] \mathrel{\vcenter{:}}=\left\{{a+b\sqrt{-2} {~\mathrel{\Big|}~}a,b,\in {\mathbb{Z}}}\right\} \leq {\mathbb{C}} .\end{align*} This is a subring of \({\mathbb{C}}\), and thus at least an integral domain. We want to try the same argument: showing the two factors are relatively prime. A little theory will help here:

\begin{align*} N \alpha \mathrel{\vcenter{:}}=\alpha\mkern 1.5mu\overline{\mkern-1.5mu\alpha \mkern-1.5mu}\mkern 1.5mu&& \text{for } \alpha\in {\mathbb{Z}}[ \sqrt{-2} ] .\end{align*}

Let \(\alpha, \beta \in {\mathbb{Z}}[\sqrt{-2}]\). Then

\(N(\alpha \beta) = N(\alpha) N(\beta)\)

\(N( \alpha) \in {\mathbb{Z}}_{\geq 0}\) and \(N(\alpha) = 0\) if and only if \(\alpha= 0\).

\(N(\alpha) = 1 \iff \alpha\in R^{\times}\)

Missing, see video (10:13 AM).

\(N(\alpha) = a^2 + 2b^2 \geq 0\), so this equals zero if and only if \(\alpha= \beta= 0\)

Write \(1 = \alpha\mkern 1.5mu\overline{\mkern-1.5mu\alpha\mkern-1.5mu}\mkern 1.5mu\) if \(N(\alpha) = 1 \in R^{\times}\). Conversely if \(\alpha\in R^{\times}\) write \(\alpha \beta = 1\), then \begin{align*} 1 = N(1) = N(\alpha \beta) = N(\alpha ) N(\beta ) \in {\mathbb{Z}}_{\geq 0} ,\end{align*} which forces both to be 1.

The two factors \(y \pm \sqrt 2\) are *coprime* in \({\mathbb{Z}}[\sqrt{-2}]\), i.e. every common divisor is a unit.

Suppose \(\delta\bigm|y\pm \sqrt{-2}\), then \(y + \sqrt{-2} = \delta \beta\) for some \(\beta\in {\mathbb{Z}}[\sqrt{-2}]\). Take norms to obtain \(y^2 + 2 = N \delta N \beta\), and in particular

- \(N \delta y^2 +2\)
- \(\delta \bigm|(y+ \sqrt{-2} ) - (y - \sqrt{-2} ) = 2 \sqrt{-2}\) and thus \(N \delta \bigm|N(2 \sqrt{-2} ) = 8\).

In the original equation \(y^2 = x^3-2\), if \(y\) is even then \(x\) is even, and \(x^3 - 2 \equiv 0-2 \pmod 4 \equiv 2\), and so \(y^2 \equiv 2 \pmod 4\). But this can’t happen, so \(y\) is odd, and we’re done: we have \(N \delta\bigm|8\) which is even or 1, but \(N \delta\bigm|y^2 +2\) which is odd, so \(N \delta = 1\).

We can identify the units in this ring: \begin{align*} {\mathbb{Z}}[\sqrt{-2} ]^{\times}= \left\{{ a + b \sqrt{-2} {~\mathrel{\Big|}~}a^2 + 2b^2 = 1}\right\} \end{align*} which forces \(a^2 \leq 1, b^2 \leq 1\) and thus this set is \(\left\{{\pm 1}\right\}\). So we have \(x^3 = ab\) which are relatively primes, so \(a,b\) should also be cubes. We don’t have to worry about units here, since \(\pm 1\) are both cubes. So e.g. we can write \begin{align*} y + \sqrt{-2} = (a + b \sqrt{-2} )^3 = (a^3-6ab^2) + (3a^2b -2b^3) \sqrt{-2} .\end{align*} Comparing coefficients of \(\sqrt{-2}\) yields \begin{align*} 1 = b(3a^2b - 2b^2) \in {\mathbb{Z}}\implies b \bigm|1 ,\end{align*} and thus \(b\in {\mathbb{Z}}^{\times}\), i.e. \(b\in \left\{{\pm 1}\right\}\). By cases:

If \(b=1\), then \(1 = 3a^2 -2 \implies a^2 = 1 \implies a = \pm 1\). So \begin{align*} y = \sqrt{-2} = (\pm 1 + \sqrt{-2} )^3 = \pm 5 + \sqrt{-2} ,\end{align*} which forces \(y=\pm 5\), the solution we already knew.

If \(b = -1\), then \(1 = -(3a^2 - 1)\) which forces \(1=3a^2 \in {\mathbb{Z}}\), so there are no solutions.

Consider \(y^2 = x^3 - 26\). Rewrite this as
\begin{align*}
x^3 = y^2 + 26 = (y + \sqrt{-26} )(y - \sqrt{-26} )
,\end{align*}
then the same lemma goes through with \(2\) replaced by \(26\) everywhere where the RHS factors are still coprime. Setting \(y + \sqrt{-26} = (a + b \sqrt{-26} )^3\) and comparing coefficients, you’ll find \(b=1, a = \pm 3\). This yields \(x=35, y=\pm 207\). But there are more solutions: \((x, y) = (3, \pm 1)\)! The issue is that we used unique factorization when showing that \(ab\) is a square implies \(a\) or \(b\) is a square (say by checking prime factorizations and seeing even exponents). In this ring, we can have \(ab\) a cube with *neither* \(a,b\) a cube, even up to a unit.

When does a ring admit unique factorization? Do you even *need* it?

This will lead to a discussion of things like the **class number**, which measure the failure of unique factorization. In general, the above type of proof will work when the class number is 3!

Today: Ch.2 of the book, “Cast of Characters.” Note that all rings will be commutative and unital in this course.

Last time: looked at factorization in \({\mathbb{Z}}[\sqrt 2], {\mathbb{Z}}[\sqrt{26}]\). Where do rings like this come from?

A **number field** is a subfield \(K \subseteq {\mathbb{C}}\)^{1} such that \([K: {\mathbb{Q}}] < \infty\).

Examples of number fields include

- \({\mathbb{Q}}[\sqrt[3]{2}]\),
- \({\mathbb{Q}}[\sqrt 2, \sqrt[5]{7}]\), or
- \({\mathbb{Q}}(\theta)\) where \(\theta\) is a root of \(x^5 - x - 1\), which one can check is irreducible.

Note that the round vs. square brackets here won’t make a difference, since we’re adjoining *algebraic* numbers.

Let \(K_{/{\mathbb{Q}}}\) be a finite extension, say of degree \(n\mathrel{\vcenter{:}}=[K: {\mathbb{Q}}]\). Then there are \(n\) distinct embeddings^{2} of \(K\) into \({\mathbb{C}}\)

We have \(K_{/{\mathbb{Q}}}\), which is necessarily separable since \(\operatorname{ch}({\mathbb{Q}}) = 0\). By the primitive element theorem, we can write \(K = {\mathbb{Q}}(\theta)\) where \(\theta\) is a root of some degree \(n\) irreducible polynomial \(f(x) \in {\mathbb{Q}}[x]\). Since \({\mathbb{C}}\) is algebraically closed, \(f\) splits completely over \({\mathbb{C}}\) as \begin{align*} f = \prod_{i=1}^n (x- \theta_i) \end{align*} with each \(\theta_i \in {\mathbb{C}}\) distinct since \(f\) was irreducible and we’re in characteristic zero. Then for each \(i\) there is an embedding \(K = {\mathbb{Q}}[\theta]\) given by \begin{align*} \iota_i: {\mathbb{Q}}[\theta] &\hookrightarrow{\mathbb{C}}\\ g(\theta) &\mapsto g(\theta_i) .\end{align*} There are some easy things to check:

- This is well-defined: elements in \(K\) are polynomials in \(\theta\) but they all differ by a multiple of the minimal polynomial of \(\theta\),
- This is an injective homomorphism and thus an embedding, and
- For distinct \(i\) you get distinct embeddings: just look at the image \(\iota_i(\theta)\), these are distinct numbers in \({\mathbb{C}}\).

Let \(K_{/{\mathbb{Q}}}\) be a finite extension of degree \(n = [K : {\mathbb{Q}}]\). We’ll say an embedding \(\sigma:K \to {\mathbb{C}}\) is **real** if \(\sigma(K) \subseteq {\mathbb{R}}\) , otherwise we’ll say the embedding is **nonreal**.

If \(\sigma\) is a nonreal, then \(\mkern 1.5mu\overline{\mkern-1.5mu\sigma\mkern-1.5mu}\mkern 1.5mu\) is a nonreal embedding, so these embeddings come in pairs. As a consequence, the total number of embeddings is given by \(n = r_1 + 2r_2\), where \(r_1\) is the number of real embeddings and \(r_2\) is the number of nonreal embeddings.

Let \(K = {\mathbb{Q}}(\sqrt[3]{2})\). Here \(n=3\) since this is the root of a degree 3 irreducible polynomial. Using the proof we can find the embeddings: factor \begin{align*} x^3 - 2 = (x - \sqrt[3]{2})(x - \omega \sqrt[3]{2}) (x - \omega^2 \sqrt[3]{2}) .\end{align*} where \(\omega = e^{2\pi i / 3}\) is a complex cube root of unity. We can form an embedding by sending \(\sqrt[3]{2} \to \omega^j \sqrt[3]{2}\) for \(j=0,1,2\). The case \(j=0\) sends \(K\) to a subset of \({\mathbb{R}}\) and yields a real embedding, but the other two will be nonreal. So \(r_1 = 1, r_2 = 1\), and we have \(3 = 1 + 2(1)\), which is consistent.

We’ve only been talking about fields, where unique factorization is trivial since there are no primes. There are thus “too many” units in fields when compared to the rings we were considering before, so we’ll restrict to subrings of fields. The question is: where is the arithmetic? Given a number field \(K\), we want a ring \({\mathbb{Z}}_K\) that fits this analogy:

Given \(\alpha\in {\mathbb{C}}\) we say \(\alpha\) is an **algebraic number** if and only if \(\alpha\) is algebraic over \({\mathbb{Q}}\), i.e. the root of some polynomial in \({\mathbb{Q}}[x]\).

We know that if we define \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\mathrel{\vcenter{:}}=\left\{{\alpha\in {\mathbb{C}}{~\mathrel{\Big|}~}\alpha \text{ is algebraic over } {\mathbb{Q}}}\right\}\), we can alternatively describe this as \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu= \left\{{ \alpha\in {\mathbb{C}}{~\mathrel{\Big|}~}[{\mathbb{Q}}(\alpha) : {\mathbb{Q}}] < \infty }\right\}\). This is convenient because it’s easy to see that algebraic numbers are closed under sums and products, just using the ways degrees behave in towers.

\(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\hookrightarrow{\mathbb{C}}\) is a subfield and every number field is a subfield of \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\).

These are still fields, so lets define some interesting subrings.

Define \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\mathrel{\vcenter{:}}=\left\{{ \alpha\in {\mathbb{C}}{~\mathrel{\Big|}~}\alpha\text{ is the root of a monic polynomial }f\in {\mathbb{Z}}[x]}\right\}\).

\(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) is a ring, and in fact a domain since it’s a subring of \({\mathbb{C}}\).

We’ll use an intermediate criterion to prove this:

Let \(\alpha\in {\mathbb{C}}\) and suppose there is a finitely generated \({\mathbb{Z}}{\hbox{-}}\)submodule of \({\mathbb{C}}\) with \(\alpha M \subseteq M \neq 0\). Then \(\alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\), i.e. \(\alpha\) is the root of a monic polynomial with integer coefficients.

Chasing definitions, take \(M\) and choose a finite list of generators \(\beta_1, \beta_2, \cdots, \beta_m\) for \(M\). Then \(\alpha M \subseteq M \implies \alpha \beta_i \in M\) for all \(M\), and each \(\alpha \beta_i\) is a \({\mathbb{Z}}{\hbox{-}}\)linear combination of the \(\beta_i\) . I.e. we have \begin{align*} \alpha \begin{bmatrix} \beta_1 \\ \vdots \\ \beta_n \end{bmatrix} = \begin{bmatrix} a_{11} & a_{12} & \cdots \\ a_{21} & a_{22} & \\ \vdots & &\ddots \end{bmatrix} \begin{bmatrix} \beta_1 \\ \vdots \\ \beta_n \end{bmatrix} \mathrel{\vcenter{:}}= A \vec{\beta} ,\end{align*} where \(A \in \operatorname{Mat}(n\times m, {\mathbb{Z}})\). We can rearrange this to say that \begin{align*} \qty{ \alpha I - A} \begin{bmatrix} \beta_1 \\ \vdots \\ \beta_n \end{bmatrix} = \mathbf{0} .\end{align*} Not all of the \(\beta_i\) can be zero since \(M\neq 0\), and thus \(\alpha I - A\) is singular and has determinant zero, so \(\det(x I - A)\Big|_{x=\alpha} = 0\). We have \begin{align*} x\operatorname{id}- A = \begin{bmatrix} x - a_{1,1} & & & \\ & x - a_{2, 2} & & \\ & & \ddots & \\ & & & x - a_{m, m} \end{bmatrix} ,\end{align*} where the off-diagonal components are constants in \({\mathbb{Z}}\) coming from \(A\). Taking the determinant yields a monic polynomial: the term of leading degree comes from multiplying the diagonal components, and expanding over the remaining minors only yields terms of smaller degree. So \(\det (x I - A) \in {\mathbb{Z}}[x]\) is monic.

We want to show that \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) is a ring, and it’s enough to show that

- \(1\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\), which is true since \(x-1\) is monic.
- It’s closed under addition \((+)\) and multiplication \((\cdot)\).

Note that the first property generalizes to \({\mathbb{Z}}\subseteq \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\), since \(x-n\) is monic for any \(n\in {\mathbb{Z}}\). For the second, let \(\alpha, \beta \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\). Define \(M \mathrel{\vcenter{:}}={\mathbb{Z}}[\alpha, \beta]\), then it’s clear that \((\alpha + \beta)M \subseteq M\) and \((\alpha \beta)M \subseteq M\) since \({\mathbb{Z}}[\alpha, \beta]\) are polynomials in \(\alpha, \beta\) and multiplying by these expression still yields such polynomials. It only remains to check the following:

\(M\) is finitely-generated.

Let \(\alpha\) be a root of \(f \in {\mathbb{Z}}[x]\) and \(\beta\) a root of \(g\), both monic with \(\deg f = n, \deg g = m\). We want to produce a finite generating set for \(M\mathrel{\vcenter{:}}={\mathbb{Z}}[\alpha, \beta]\), and the claim is that the following works: \(\left\{{ \alpha^i \beta^j}\right\} _{\substack{0\leq i < n \\ 0 \leq j < m} }\), i.e. every element of \(M\) is some \({\mathbb{Z}}{\hbox{-}}\)linear combination of these.

Note that this is clearly true if we were to include \(n, m\) in the indices by collecting terms of any polynomial in \(\alpha, \beta\), so the restrictions are nontrivial. It’s enough to show that for any \(0 \leq I, J \in {\mathbb{Z}}\), the term \(\alpha^I \beta^J\) is a \({\mathbb{Z}}{\hbox{-}}\)linear combination of the restricted elements above. Divide by \(f\) and \(g\) to obtain \begin{align*} x^I &= f(x) q(x) + r(x) \\ x^J &= g(x) \tilde q(x) \tilde r(x) \end{align*} where \(r(x) = 0\) or \(\deg r < n\) and similarly for \(\tilde r\), where (importantly) all of these polynomials are in \({\mathbb{Z}}[x]\).

We’re not over a field: \({\mathbb{Z}}[x]\) doesn’t necessarily have a division algorithm, so why is this okay? The division algorithm only requires inverting the leading coefficient, so in general \(R[x]\) admits the usual division algorithm whenever the leading coefficient is in \(R^{\times}\). Now plug \(\alpha\) into the first equation to obtain \(\alpha^I = r(\alpha)\) where \(\deg r < n\), which rewrite \(\alpha^I\) as a sum of lower-degree terms. Similarly writing \(\beta^J = r(\beta)\), we can express \begin{align*} \alpha^I \beta^J = r(\alpha) r(\beta) ,\end{align*} which is what we wanted.

We’ve just filled in another part of the previous picture:

Define \({\mathbb{Z}}_K = \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\cap K\), the **ring of integers** of \(K\). Note that this makes sense since the intersection of rings is again a ring.

Why not just work in \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\)? It doesn’t have the factorization properties we want, e.g. there are no irreducible elements. Consider \(\sqrt 2\), we can factor is into two non-units as \(\sqrt{2} = \sqrt{\sqrt 2} \cdot \sqrt{\sqrt 2}\), noting that \(\sqrt 2\) is not a unit, and it’s easy to check that if \(a\) is not a unit then \(\sqrt a\) is not a unit. So this would yield arbitrarily long factorizations, and a non-Noetherian ring. The following is a reality check, and certainly a property we would want:

\({\mathbb{Z}}_{\mathbb{Q}}= {\mathbb{Z}}\).

\(\subseteq\): Easy, since \({\mathbb{Z}}\subseteq \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) and \({\mathbb{Z}}\subseteq {\mathbb{Q}}\), and is thus in their intersection \({\mathbb{Z}}_{\mathbb{Q}}\) .

\(\supseteq\) : Let \(\alpha\in {\mathbb{Z}}_{\mathbb{Q}}= {\mathbb{Q}}\cap\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) , so \(\alpha\) is a root of \(x^n - a_{n-1}x^{n-1} + \cdots + a_1x + a_0 \in {\mathbb{Z}}[x]\). We know \(\alpha= a/b\) with \(a,b \in {\mathbb{Z}}\), and we can use the rational root test which tells us that \(a\bigm|a_0\) and \(b\bigm|1\), so \(b = \pm 1\) and \(\alpha = a/\pm 1 = \pm a \in {\mathbb{Z}}\) and thus \(\alpha \in {\mathbb{Z}}\).

We’ll want to study \({\mathbb{Z}}_K\) for various number fields \(K\), but we’ll need more groundwork.

Let \(\alpha \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\), then \begin{align*} \alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\iff \min_ \alpha \in {\mathbb{Z}}[x], \end{align*} where \(\min_ \alpha(x)\) is the unique monic irreducible polynomial in \({\mathbb{Q}}[x]\) which vanishes at \(\alpha\).

\(\impliedby\): Trivial, if the minimal polynomial already has integer coefficients, just note that it’s already monic and thus \(\alpha \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) by definition.

\(\implies\): Why should the minimal polynomial have *integer* coefficients? Choose a monic \(f(x) \in {\mathbb{Z}}[x]\) with \(f(\alpha) = 0\), using the fact that \(\alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) , and factor \(f(x) = \prod_{i=1}^n (x- \alpha_i) \in {\mathbb{C}}[x]\). Note that each \(\alpha_i \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) since they are all roots of \(f\) (a monic polynomial in \({\mathbb{Z}}[x]\)). Use the fact that \(\min_ \alpha(x)\) divides every polynomial which vanishes on \(\alpha\) over \({\mathbb{Q}}\), and thus divides \(f\) (noting that this still divides over \({\mathbb{C}}\)). Moreover, every root of \(\min_ \alpha(x)\) is a root of \(f\), and so every such root is some \(\alpha_i\).

Now factor \(\min_ \alpha(x)\) over \({\mathbb{C}}\) to obtain \(\min_ \alpha(x) = \prod_{i=1}^m (x - \beta_i)\) with all of the \(\beta_i \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\). What coefficients appear after multiplying things out? Just sums and products of the \(\beta_i\), so all of the coefficients are in \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) . Thus \(\min_ \alpha(x) \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu[x]\). But the coefficients are also in \({\mathbb{Q}}\) by definition, so the coefficients are in \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\cap{\mathbb{Q}}= {\mathbb{Z}}\) and thus \(\min_ \alpha(x) \in {\mathbb{Z}}[x]\).

\(\sqrt{5}/ 3 \not\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) since \(\min_ \alpha(x) = x^2 - 5/9 \not\in {\mathbb{Z}}[x]\), so this is not an algebraic integer.

- \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) has \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\) as its fraction field, and
- For any number field \(K\), the fraction field of \({\mathbb{Z}}_K\) is \(K\).
- If \(\alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\) then \(d \alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\) for some \(d\in {\mathbb{Z}}^{\geq 0}\)

Moreover, both (a) and (b) follow from (c).

Thus the subring is “big” in the sense that if you allow taking quotients, you recover the entire field. That \(c\implies a,b\): suppose you want to write \(\alpha \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Q}}\mkern-1.5mu}\mkern 1.5mu\) as \(\alpha=p/q\) with \(p,q \in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\). Use \(c\) to produce \(d\alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\), then just take \(d\alpha /d\). The same argument works for \(b\).

Prove the proposition!

Suppose \(\alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{C}}\mkern-1.5mu}\mkern 1.5mu\) and \(\alpha\) is a root of a monic polynomial in \(\mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu [x]\). Then \(\alpha\in \mkern 1.5mu\overline{\mkern-1.5mu{\mathbb{Z}}\mkern-1.5mu}\mkern 1.5mu\).

This says that if a number \(\alpha\) is the root of a monic polynomial whose coefficients are *algebraic* integers, then \(\alpha\) itself is an algebraic integer coefficients. This corresponds to the fact that integral over integral implies integral in commutative algebra.

Prove this! One can use the integrality criterion (slightly challenging), or alternatively Galois theory.

Today: roughly corresponds to chapter 3 in the book. Goal: do all of the big theorems in the setting of quadratic number fields, then redo everything for general number fields.

Simplest case: \({\mathbb{Q}}\), a degree 1 number field, so the next simplest case is degree 2.

A field \(K\) is a **quadratic number field** if and only if \(K\) is a number field and \([K: {\mathbb{Q}}] = 2\).

Some notation: if \(d\in {\mathbb{R}}^{\times}\), then \(\sqrt d\) means the *positive* square root of \(d\) if \(d \geq 0\), and if \(d<0\) this denotes \(i\sqrt{{\left\lvert {d} \right\rvert}}\).

If \(K\) is a quadratic number field, then \(K = {\mathbb{Q}}(\sqrt{d})\) for some squarefree^{3} integer \(d\in {\mathbb{Z}}\). Moreover, this \(d\) is uniquely determined by \(K\), so all quadratic number fields are parameterized by the set of squarefree integers.

**Existence**: Since \([K: {\mathbb{Q}}] = 2\), we have \(K\supsetneq {\mathbb{Q}}\) so pick \(\alpha\in K\setminus{\mathbb{Q}}\) then \(K = {\mathbb{Q}}(\alpha)\). Note that we could also furnish this \(\alpha\) from the primitive element theorem, although this is overkill here. So \(\alpha\) is a root of some degree 2 \(p\in {\mathbb{Q}}[x]\), and by scaling coefficients we can replace this by \(p\in {\mathbb{Z}}[x]\). So write \(p(x) = Ax^2 + Bx + C\), in which case we can always write
\begin{align*}
\alpha = {-B \pm \sqrt{B^2 - 4AC} \over 2A}
\end{align*}
where \(A\neq 0\), since this would imply that \(\alpha\in{\mathbb{Q}}\). Writing \(\Delta\mathrel{\vcenter{:}}= B^2 - 4AC\), we have \(K = {\mathbb{Q}}(\alpha) = {\mathbb{Q}}(\sqrt{\Delta})\). This is close to what we want – it’s \({\mathbb{Q}}\) adjoin some integer – but we’d like that integer to be squarefree.

Now let \(f\in {\mathbb{Z}}^{\geq 0}\) be chosen such that \(f^2 \bigm|\Delta\) and \(f\) is as large as possible, i.e. the largest square factor of \(\Delta\). Writing \(\Delta = f^2 - d\) where \(d\) is whatever remains. Then \(d\) must be squarefree, otherwise if \(d\) had a square factor bigger than 1, say \(d = r^2 d'\), in which case \(f^2 r^2 > f^2\) would be a larger factor of \(\Delta\). So \(d\) is squarefree, and \(\Delta = f \sqrt d\) and thus \({\mathbb{Q}}(\Delta) = {\mathbb{Q}}(\sqrt{d})\).

**Uniqueness**: Well use some extra machinery.

Let \(K\) be a number field with \(K_{/{\mathbb{Q}}}\) Galois. For each \(\alpha\in K\) define \begin{align*} N(\alpha) &\mathrel{\vcenter{:}}=\prod_{\sigma\in \operatorname{Gal}(K_{/{\mathbb{Q}}})} \sigma(\alpha) && \text{the norm} \\ \operatorname{Tr}(\alpha) &\mathrel{\vcenter{:}}=\sum_{\sigma\in \operatorname{Gal}(K_{/{\mathbb{Q}}})} \sigma(\alpha) && \text{the trace} .\end{align*}

Why use these kind of sum at all? Applying any element in the Galois group just permutes the elements. Note that \(N( \alpha), \operatorname{Tr}( \alpha)\) are \(G(K_{/{\mathbb{Q}}}){\hbox{-}}\)invariant, and thus rational numbers in \({\mathbb{Q}}\). The norm is multiplicative, and the trace is additive and in fact \({\mathbb{Q}}{\hbox{-}}\)linear: \(\operatorname{Tr}(a \alpha + b \beta) = a \operatorname{Tr}( \alpha) + b \operatorname{Tr}( \beta)\) for all \(\alpha, \beta\in K\) and all \(a,b \in {\mathbb{Q}}\).

What do the norm and trace look like for a quadratic field? We can write \(K = \left\{{a + b \sqrt d {~\mathrel{\Big|}~}a,b \in {\mathbb{Q}}}\right\}\) and there is a unique (non-identity) element \(g\in \operatorname{Gal}(K_{/{\mathbb{Q}}})\) with \(\sigma(a + b \sqrt d) = a - b \sqrt{d}\). We’ll refer to this automorphism as **conjugation**. We can compute
\begin{align*}
N(a + b \sqrt{d} ) &= a^2 - db^2 \\
\operatorname{Tr}(a + b \sqrt{d} ) &= 2a
.\end{align*}

Returning to the proof, suppose otherwise that \(K = {\mathbb{Q}}(\sqrt{d_1} ) = {\mathbb{Q}}( \sqrt{d_2} )\) with \(d_1\neq d_2\) squarefree integers. Note that they must have the same sign, otherwise one of these extensions would not be a subfield of \({\mathbb{R}}\). We know \(\sqrt{d_1} \in {\mathbb{Q}}( \sqrt{d_2} )\) and thus \(\sqrt{d_1} = a + b \sqrt{d_2}\) for some \(a, b\in {\mathbb{Q}}\).

Taking the trace of both sides, the LHS is zero and the RHS is \(2a\) and we get \(a=0\) and \(\sqrt{d_1} = b \sqrt{d_2}\). Write \(b = u/v\) with \(u,v\in {\mathbb{Q}}\). Squaring both sides yields \(v^2 d_1 = u^2 d_2\). Let \(p\) be a prime dividing \(d_1\); then since \(d_1\) is squarefree there is only one copy of \(p\) occurring in its factorization. Moreover there are an even number of copies of \(p\) coming from \(v^2\), thus forcing \(d_2\) to have an odd power of \(p\). This forces \(p\bigm|d_2\), and since this holds for every prime factor \(p\) of \(d_1\), we get \(d_1 \bigm|d_2\) since \(d_1\) is squarefree. The same argument shows that \(d_2 \bigm|d_1\), so they’re the same up to sign: but the signs must match and we get \(d_1 = d_2\).

Note that this results holds for every squarefree number not equal to 1. If \(K = {\mathbb{Q}}( \sqrt{d} )\), what is the ring of integers \({\mathbb{Z}}_K\)? Some more machinery will help here.

Assume \(K_{/{\mathbb{Q}}}\) is a Galois number field and for \(\alpha\in K\) define the **field polynomial of \(\alpha\)** as
\begin{align*}
\varphi_{\alpha}(x) \mathrel{\vcenter{:}}=\prod_{ \sigma\in \operatorname{Gal}(K_{/{\mathbb{Q}}})} \qty{ x - \sigma(\alpha)}
.\end{align*}

For the same reasons mentioned for the norm/trace, we get \(\varphi_{\alpha} \in {\mathbb{Q}}[x]\), and moreover \(\varphi_{ \alpha } (\alpha) = 0\). When is \(\alpha\in {\mathbb{Z}}_K\)? We have the following criterion:

\begin{align*} \alpha\in {\mathbb{Z}}_K \iff \varphi_{ \alpha } (x) \in {\mathbb{Z}}[x] .\end{align*}

\(\impliedby\): Th