Sean Li Math 7370 Notes Spring 2013 Algebraic Number Theory Lecture 2 1/23/13 Remarks about Hasse Minkowski

ski Theorem. (Continued from previous lecture.) Theorem: Let f be a quadratic form over Q. Then f = 0 has a nonzero solution in Q if and only if it has a nonzero solutions in R and Qp for all prime p. One direction of proof () is trivial. Corollary. f = a, a Q, a = 0, has a solution in Q if and only if it has a solution in R and Qp for all prime p. Result from Matrices. Given a quadratic form f over any eld with characteristic not equal to 2, one can diagonalize f . That is, f=
i,j

aij xi xj =
i

2 bi y i ,

the yi s are linear combinations of the xi s, and the matrix is invertible. Nontrivial solution if not positive or negative denite. There exist algorithms for R and for each Qp , but cannot check all p in a nite time. However, the theory reduces the checking to a nite set of ps. Theory of elliptic curves for special cases with cubic polynomials. Integer equations (contd). Which p satisfy p = a2 + qb2 ? Consider p = a2 + b2 . Possible if and only if p 1 (mod 4). One direction is easy (): a square is congruent to 0 or 1 (mod 4). For the other direction, we use Gaussian integers. Gaussian integers. The ring Z[i] = {a + bi|a, b Z} is called the ring of Gaussian integers. Suppose we have unique factorization into primes (UFD). Then suppose p 1 (mod 4). We want to show p = a2 + b2 for some a, b Z. In fact, a and b are unique. Then p 1 (mod 4) implies F = (Z /p Z) has an element divisible by 4. p Theorem. F is always a cyclic group. (Every nite subgroup of F , where F is a eld, is p cyclic.) Also single generator.

There exists an element x F of order 4, then in Fp , x4 = 1, so then x2 = 1. Then there p exists x Z such that x2 + 1 0 (mod p), so that x2 + 1 = mp. Proof to be completed next lecture.

Page 2