Chapter 12 Algebraic numbers and algebraic integers 12.1 Algebraic numbers Definition 12.1. A number α 2 C is said to be algebraic if it satisfies a polynomial equation n n−1 f(x) = x + a1x + ··· + an = 0 with rational coefficients ai 2 Q. p For example, 2 and i=2 are algebraic. A complex number is said to be transcendental if it is not algebraic. Both e and π are transcendental. It is in general extremely difficult to prove a number transcendental, and there are many open problems in this area, eg it is not known if πe is transcendental. Theorem 12.1. The algebraic numbers form a field Q¯ ⊂ C. Proof. If α satisfies the equation f(x) = 0 then −α satisfies f(−x) = 0, while 1/α satisfies xnf(1=x) = 0 (where n is the degree of f(x)). It follows that −α and 1/α are both algebraic. Thus it is sufficient to show that if α; β are algebraic then so are α + β; αβ. Lemma 12.1. Suppose V ⊂ C is a finite-dimensional vector space over Q, with V 6= 0; and suppose x 2 C. If xV ⊂ V then x 2 Q¯ . Proof. Let e1; : : : ; en be a basis for V . Suppose xe1 = a11e1 + ··· a1nen xe2 = a21e1 + ··· a2nen ··· xen = an1e1 + ··· annen: 12–1 Then det(xI − A) = 0; where 0 1 a11 a12 ··· a1n Ba a ··· a C B 21 22 2nC A = B . C : @ . A an1 an2 ··· ann This is a polynomial equation with coefficients in Q. Hence x 2 Q¯ . Consider the vector space V = hαiβj : 0 ≤ i < m; 0 ≤ j < ni over Q spanned by the mn elements αiβj. Evidently αV ⊂ V; βV ⊂ V: Thus (α + β)V ⊂ V; (αβ)V ⊂ V: Hence α + β and αβ are algebraic. 12.2 Algebraic integers Definition 12.2. A number α 2 C is said to be an algebraic integer if it satisfies a monic polynomial equation n n−1 f(x) = x + a1x + ··· + an = 0 with integral coefficients ai 2 Z. We denote the set of algebraic integers by Z¯. Theorem 12.2. The algebraic integers form a ring Z¯ with Z ⊂ Z¯ ⊂ Q¯ : Proof. Evidently Z ⊂ Z¯; since n 2 Z satisfies the equation x − n = 0: We have to show that α; β 2 Z¯ =) α + β; αβ 2 Z¯: Lemma 12.2. Suppose S ⊂ C is a finitely-generated abelian group, with S 6= 0; and suppose x 2 C. If xS ⊂ S then x 2 Z¯. 12–2 Proof. Let s1; : : : ; sn generate S. Suppose xs1 = a11s1 + ··· a1nsn xs2 = a21s1 + ··· a2nsn ··· xsn = an1s1 + ··· annsn: Then det(xI − A) = 0: This is a monic equation with coefficients in Z. Hence x 2 Z¯. Consider the abelian group S = hαiβj : 0 ≤ i < m; 0 ≤ j < ni generated by the mn elements αiβj. Evidently αS ⊂ S; βS ⊂ S: Thus (α + β)S ⊂ S; (αβ)S ⊂ S: Hence α + β and αβ are algebraic integers. Proposition 12.1. A rational number c 2 Q is an algebraic integer if and only if it is a rational integer: Z¯ \ Q = Z: Proof. Suppose c = m=n, where gcd(m; n) = 1; and suppose c satisfies the equation d d−1 x + a1x + ··· + ad = 0 (ai 2 Z): Then d d−1 d m + a1m n + ··· + adn = 0: Since n divides every term after the first, it follows that n j md. But that is incompatible with gcd(m; n) = 1, unless n = 1, ie c 2 Z. 12.3 Number fields and number rings Suppose F ⊂ C is a field. Then 1 2 F , by definition, and so Q ⊂ F ⊂ C: We can consider F as a vector space over Q. Definition 12.3. An algebraic number field (or simply number field is a subfield F ⊂ C which is a finite-dimensional vector space over Q. The degree of F is the dimension of this vector space: deg F = dimQ F: 12–3 Proposition 12.2. The elements of a number field F are algebraic numbers: Q ⊂ F ⊂ Q¯ : Proof. Suppose deg F = d; and suppose α 2 F . Then the d + 1 numbers 1; α; α2; : : : ; αd are linearly dependent over Q, say 2 d a0 + a1α + a2α + ··· + adα = 0: Thus f(α) = 0; where f(x) is the polynomial 2 d f(x) = a0 + a1x + a2x + ··· + adx 2 Q[x]: Definition 12.4. The algebraic integers in a number field F are said to form an algebraic number ring (or simply number ring). Thus the number ring associated to the number field F is F \ Z¯: Proposition 12.3. The number ring associated to the field of gaussian num- bers is the ring Γ of gaussian integers. Proof. Suppose z = x + iy (x; y 2 Q) is a gaussian number. We have to show that z is an algebraic integer if and only if x; y 2 Z. If m; n 2 Z then m + in 2 Z¯, since m; n; i 2 Z¯ and Z¯ is a ring. Conversely, suppose z = x + iy 2 Z¯: Then z¯ = x − iy 2 Z¯ since z and z¯ satisfy the same polynomials over Q. Hence z +z ¯ = 2x 2 Z¯ \ Q = Z: Similarly −iz = y − ix 2 Z¯ =) 2y 2 Z: Thus m + in z = ; 2 with m; n 2 Z. 12–4 But now N (z) = zz¯ 2 Z¯ \ Q = Z; ie m2 + n2 x2 + y2 = 2 ; 4 Z ie m2 + n2 ≡ 0 mod 4: But m2; n2 ≡ 0 or 1 mod 4. So m2 + n2 ≡ 0 mod 4 =) 2 j m; n =) z 2 Γ: p Example: 2 is an algebraic integer, since it satisfies the equation x2 − 2 = 0: p But 2=2 is not an algebraic integer. For if it were, p ( 2=2)2 = 1=2 would be an algbraic integer (since Z¯ is a ring), which we have just seen is not so. Algebraic number theory is the study of number rings. The first question one might ask is whether a given number ring is a Unique Factorisation Domain. We have seen that the number rings Z and Γ are. But in general number rings are not UFDs. The foundation of algebraic number theory was Dedekind’s amazing dis- covery that unique factorisation could be recovered if one added what Dedekind called ‘ideal numbers’, and what are today called ‘ideals’. However, we are not going into that theory. We shall only be looking at a small number of quadratic number rings which are UFDs. 12.4 Integral closure Recall that any integral domain A can be extended to its field of fractions, which we shall denote by Q(A), since we follows exactly the same process as in creating the field of rational numbers Q from the ring of integers Z. We define Q(A) to be the quotient set X=E, where X is the set of pairs (n; d), with n; d 2 A and d 6= 0, and E is the equivalence relation (n; d) ∼ (n0; d0) () nd0 = n0d: 12–5 We write n=d for the the element of Q(A) represented by the the pair (n; d). We define addition, multiplication and inversion in Q(A) in the obvious way, and it is a trivial matter to verify that these satisfy the axioms for a field. Identifying a 2 A with a=1 2 Q(A) allows us to identify A with a subset of Q(A), so we can regard Q(A) as an extension of A. As an example of the construction we have k[x] ! k(x), where k(x) is the field of rational functions f(x)=g(x), with f(x); g(x) 2 k[x]. If A is already a subring of a field F then we can identify Q(A) with the subfield of F formed by the elements a=d with a; d 2 A. So for example the field of algebraic numbers is the quotient-field of the ring of algebraic integers: Q¯ = Q(Z¯). 12–6.