Quaternions and the four-square theorem

Transcription

1 Quaternions and the four-square theorem Background on Hamilton s Quaternions We have the complex numbers C = {a + b i : a, b R} an their integral analogue, [i] = {a + bi : a, b R}, the Gaussian integers, and we can draw a subring diagram accordingly. C R [i] A higher dimensional, but analogous, scenario was discovered by the Irish mathematician Wm. Rowan Hamilton in 1843 whilst crossing Dublin s Broom Bridge on his way into town. Definition 1. The Hamilton Quaternions are given by where and they are a ring. H = {a + bi + cj + dk : a, b, c, d R} i = j = k = 1 ij = k = ji jk = i = kj ki = j = ik, We would like these to have have an integer analogue, and one possibility is [i, j, k] = {a + bi + cj + dk : a, b, c, d }. Note that sum, difference, or product of things in [i, j, k] return things in [i, j, k]. We could extend our subring lattice accordingly. H C R [i, j, k] [i] 1

2 Examples: We have 1 + i + j + k [i, j, k] and clearly the sum and difference (1 + i + j + k) + (1 + i + j + k) = + i + j + k, (1 + i + j + k) (1 + i + j + k) = 0, are in [i, j, k], but a bit more work shows the product (1 + i + j + k)(1 + i + j + k) = 1 + i + j + k + i 1 + ij + ik + j + ji 1 + jk + k + ki + kj 1 = + i + j + k is also in [i, j, k]. So from our theorem yesterday, we know [i, j, k] is a subring of H. The point 1 + i + j + k can be thought of as the point one unit out in each dimension in R 4. We can t visualize fully this (damn human brains), but it might help to think about it in three dimensions. Recall, the distance of point a + bi + cj + dk from the origin is just (a 0) + (b 0) + (c 0) + (d 0) = a + b + c + d. Definition. We define a norm on [i, j, k] by norm(a + bi + cj + dk) = a + b + c + d, noting that this is just the square of the distance of a point from the origin. This is multiplicative, that is norm(q 1 q ) = norm(q 1 )norm(q )

3 Examples: We can use this norm to determine when a integer in [i, j, k] is prime. Since norm( + i + j + k) = 16 we know it can be decomposed. On the other hand, norm( + i + j + k) = 7, and so it can t be decomposed. More generally, for β [i, j, k], we have For q 1, q [i, j, k], we have norm(βq 1 βq ) = norm(β(q 1 q )) = norm(β)norm(q 1 q ) This means multiplying [i, j, k] by β has the effect of stretching every distance by a factor of norm(β) (note, this is a real number value). This also means all angles are unchanged. So in particular, βi, βj, βk are all still perpendicular, and just shifted away from the origin. This means multiplication by β sends a cube in [i, j, k] gets sent to a cube in [i, j, k], possibly just stretching out the sides and rotating. 3

4 Division in the quaternions To begin, we recall the division algorithm in the integers. We would like something similar to exist in the quaternions. The Division Algorithm. For any a, b there exists unique integers r and q with 0 r < b such that a = bq + r. Suppose α, β [i, j, k], and we want to write α = βµ + ρ, where 0 ρ < β Then we would want to compute the remainder ρ = α µβ which is the distance from α to the nearest corner in the multiplication by β grid. But if α is at the center of a cube, then ( α = µ i + j + k ) β, which may still be an element of [i, j, k]. And consequently, ( ( 1 norm(α βµ) = norm β + i + j + k )) ( 1 = norm(β) ) = norm(β). 4 Suppose we include all of the center points into the grid, this would be achieved by including into the quaternion integers. 1 + i + j + k Definition 3. The most practical integer analogue inside H is the Hurwitz integers which are the set [ ] 1 + i + j + k, i, j, k = {a + b 1 + i + j + k + ci + dj + ek : a, b, c, d, e }. The are a ring, clearly an additive group, and now we know they also have the division algorithm! 4

5 An element in here is called a Hurwitz prime if it is not the product of two smaller ring elements. Note that every Hurwitz integer can be expressed as a+bi+cj+dk where a, b, c, d. H R C [i] [ ] 1+i+j+k i, j, k Examples: Primality can still be checked using norms, for example ( norm i + j + k ) ( 7 = norm + i + j + k ) = = 5 4 = 13, so this is a Hurwitz prime! Using the quaternions to prove the four square theorem Definition 4. Any complex number a + bi C has a conjugate a + bi = a bi, and similarly, any a + bi + cj + dk H has a conjugate a + bi + cj + dk = a bi cj dk. The conjugate satisfies some properties, among them r = r for r R. q 1 q = q q 1. q 1 q 1 = norm(q 1 ). Theorem 1. If p is an ordinary prime but not a Hurwitz prime then where a, b, c, d. p = a + b + c + d 5

6 Proof. Suppose that p is an ordinary prime but not a Hurwitz prime, so p has a nontrivial Hurwitz integer factorization p = (a + bi + cj + dk)γ where a, b, c, d and γ a Hurwitz integer. Then conjugating both sides But now, p = p = (a + bi + cj + dk)γ = γ(a bi cj dk). p = pp = (a + bi + cj + dk)γγ(a bi cj dk) = (a + bi + cj + dk)(a + bi + cj + dk)γγ = (a + b + c + d )γγ. But since p is prime, it must follow that p = a + b + c + d. Theorem. If p is an ordinary prime but not a Hurwitz prime then where a, b, c, d. p = a + b + c + d Proof. If (a + bi + cj + dk) is a Hurwitz integer, then where a, b, c, d are even integers and (a + bi + cj + dk) = ω + a + b i + c j + d k ω = ±1 ± i ± j ± k. Notice that norm(ω) = 1, so in particular ωω = 1. We know p = a + b + c + d where a, b, c, d are half integers from Theorem 1. But now p = (a + bi + cj + dk)(a + bi + cj + dk) = (a + bi + cj + dk)(a bi cj dk) = (ω + a + b i + c j + d k)(ω a b i c j d k) = (ω + a + b i + c j + d k)ωω(ω a b i c j d k) = (ω + a + b i + c j + d k)ω(ω + a + b i + c j + d k)ω But focus on the first component for a moment, (ω + a + b i + c j + d k)ω = 1 + ω(a + b i + c j + d k) where A, B, C, D. But consequently, = A + Bi + Cj + Dk p = (A + Bi + Cj + Dk)(A + Bi + Cj + Dk) = A + B + C + D. 6

7 If every odd prime p is the sum of 4 squares, then our work is done, since a product of a sum of four squares is again a sum of four squares (a + b + c + d )(e + f + g + h ) = (l + m + s + t ). This was shown by Euler in Notice that was 100 years before Hamilton! Lemma 1. If p is an odd prime then there are integers m and l such that p divides 1 + m + l. Proof. Let p = n + 1 where n. Then for any m, l {1,..., n}, we have m + l < p and so m l mod p (m + l)(m l) 0 mod p m = l. This means there are n + 1 incongruent choices for l mod p, and n + 1 incongruent choices of 1 m mod p. But there are only n + 1 equivalence classes mod p, so for some choice of m, l we must have l 1 m mod p, in other words, p 1 + m + l. Theorem 3. Every natural number is the sum of four squares. Proof. Suppose p is an odd prime, so p = n+1. Then Lemma 1 (a classical result of Lagrange) shows that p 1 + l + m for some integers l and m. This means that p m and p l. But 1 + l + m = (1 + li + mj)(1 li mj). But now p must divide (1 + li + mj) or (1 li mj). But 1 p + i p + j p and 1 p i p j p are both not Hurwitz integers, and hence aren t Hurwitz primes. Therefore p is the sum of 4 squares. Now the claim follows from Euler s identity. 7