FERMAT S LAST THEOREM FOR REGULAR PRIMES KEITH CONRAD
|
|
- Kelly Strickland
- 5 years ago
- Views:
Transcription
1 FERMAT S LAST THEOREM FOR REGULAR PRIMES KEITH CONRAD For a prime p, we call p regular when the class number h p = h(q(ζ p )) of the pth cyclotomic field is not divisible by p. For instance, all primes p 19 have h p = 1, so they are regular. Since h 23 = 3, 23 is regular. All primes less then 100 are regular except for 37, 59, and 67: h 37 = 37, h 59 = , and h 67 = It is known that there are infinitely many irregular primes, and heuristics and tables suggest around 61% of primes should be regular [6, p. 63]. The significance of a prime p being regular is that if the pth power of an ideal a in Z[ζ p ] is principal, then a is itself principal. Indeed, if a p is principal, then it is trivial in the class group of Q(ζ p ). Since p doesn t divide h p, this means a is trivial in the class group, so a is a principal ideal. The concept of regular prime was introduced by Kummer in his work on Fermat s Last Theorem (FLT). He proved the following result. Theorem 1. For a regular prime p 3, the equation x p + y p = z p does not have a solution in positive integers x, y, z. To see how much of an advance this was on Fermat s problem compared to work preceding Kummer, see [4]. Since p is a fixed prime, we henceforth write ζ p simply as ζ. The complex conjugate of an element α in Q(ζ) is written as α. Since complex conjugation is an automorphism of this field, whose Galois group over Q is abelian, σ(α) = σ(α) for any α in Q(ζ) and any σ in Gal(Q(ζ)/Q). We start with some lemmas valid in the pth cyclotomic field for any prime p. Lemma 1. In Z[ζ], the numbers 1 ζ, 1 ζ 2,..., 1 ζ are all associates and 1 + ζ is a unit. Also p = u(1 ζ) for some unit u and (1 ζ) is the only prime ideal in Z[ζ] dividing p. Proof. For 1 j p 1, (1 ζ j )/(1 ζ) = 1 + ζ + + ζ j 1 lies in Z[ζ]. Writing 1 jj mod p, we see the reciprocal (1 ζ)/(1 ζ j ) = (1 ζ jj )/(1 ζ j ) lies in Z[ζ j ] = Z[ζ]. So 1 ζ j is a unit multiple of 1 ζ. In particular, taking j = 2 shows 1 + ζ is a unit. Setting X = 1 in the equation 1 + X + + X = j=1 (X ζj ) gives p = (1 ζ j ) = j=1 j=1 1 ζ j 1 ζ (1 ζ) = u(1 ζ), where u is a unit. Taking norms, p = N(1 ζ), so (1 ζ) has prime norm and thus is a prime ideal. Since (p) = (1 ζ), (1 ζ) is the only prime ideal factor of p. Lemma 2. For v Z[ζ], v/v is a root of unity. Proof. For σ Gal(Q(ζ)/Q), σ(v) = σv, so v/v and all of its Q-conjugates have absolute value 1. Therefore, by a theorem of Kronecker, v/v is a root of unity [6, Lemma 1.6]. 1
2 2 KEITH CONRAD The roots of unity in Z[ζ] are ±ζ j, and in fact one can show in the preceding lemma that v/v is a power of ζ (i.e., no minus sign), but we won t need that more precise statement. (For a proof, see [6, p. 4].) The proof of Fermat s Last Theorem for a given exponent p has traditionally been divided into two cases, based on whether the proposed solution (x, y, z) has p not dividing any of x, y, z or p dividing one of them. These cases are respectively called Case I and Case II. Experience shows Case II is much harder to treat than Case I using cyclotomic methods. From now on, p is a regular prime. Case I: Suppose x p + y p = z p where x, y, z are nonzero integers with p not dividing any of x, y, or z. We may of course assume x, y, and z are pairwise relatively prime. We will derive a contradiction when p is regular. In Z[ζ], factor Fermat s equation as (1) z p = x p + y p = (x + ζ j y). Let s show the factors on the right side generate relatively prime ideals. For 0 j < j p 1, any common ideal factor d of (x + ζ j y) and (x + ζ j y) is a factor of the difference j=0 x + ζ j y x ζ j y = ζ j y(1 ζ j j ) = vy(1 ζ) for some unit v. (Here we use Lemma 1.) Since y(1 ζ) divides yp, we have d (yp). We also know, by (1), that d divides (z) p. Since yp and z p are relatively prime integers, we conclude d is the unit ideal, so the ideals (x + ζ j y) are relatively prime. The product of these ideals is the pth power (z) p, so unique ideal factorization implies each factor is a pth power. Taking j = 1, (x + ζy) = a p for some ideal a. Therefore a p is trivial in the class group of Q(ζ). Assuming p is regular, we deduce that a is trivial in the class group, so a is principal, say a = (t) with t Z[ζ]. Thus x + ζy = ut p for some unit u in Z[ζ]. (If we assumed Z[ζ] is a UFD, this deduction would ve been immediate from knowing the numbers x + ζ j y are pairwise relatively prime: their product is a pth power so each one is a pth power, up to unit multiple. We can get this conclusion from the weaker assumption that h p is not divisible by p rather than that h p = 1.) Writing t = b 0 + b 1 ζ + + b ζ p 2, with b j in Z, we get (2) t p b 0 + b b p 2 mod pz[ζ], so t p t p mod pz[ζ]. By Lemma 2, u/u = ±ζ j for some j between 0 and p 1. If u/u = ζ j then Thus x + ζy = ut p = ζ j ut p ζ j ut p mod pz[ζ] ζ j (x + ζy) mod pz[ζ]. (3) u/u = ζ j = x + yζ yζ j 1 xζ j 0 mod pz[ζ].
3 Similarly, FERMAT S LAST THEOREM FOR REGULAR PRIMES 3 (4) u/u = ζ j = x + yζ + yζ j 1 + xζ j 0 mod pz[ζ]. We want to show neither of these congruences can hold when 0 j p 1 and x and y are integers prime to p. Since x and y are nonzero mod p, these congruences appear to show linear dependence over Z/(p) among some powers of ζ in Z[ζ]/(p). However, in Z[ζ]/(p) the powers 1, ζ,..., ζ p 2 are linearly independent over Z/(p) since Z[ζ]/(p) = Z[X]/(p, Φ p (X)) = (Z/(p))[X]/Φ p (X) = (Z/(p))[X]/(X 1), and {1, X,..., X p 2 } is a basis of the last ring, over Z/(p). For those j p 1 such that 1, ζ, ζ j 1, ζ j are distinct powers in the set {1, ζ,..., ζ p 2 }, i.e., as long as 0, 1, j 1, j are distinct integers with j p 2, (3) and (4) both yield a contradiction. So when 3 j p 2, there is a contradiction in Case I. The rest of the proof is an accounting exercise in handling the remaining cases j = 0, 1, 2, and p 1. First of all, we may take p 5, since the equation x 3 + y 3 = z 3 has no solutions in integers prime to 3. (Even the congruence x 3 + y 3 z 3 mod 9 has no solutions in numbers prime to 3, since the cubes of units mod 9 are ±1.) Can j = p 1? If so, then the left side of the congruence in (3) becomes x(1 ζ ) + y(ζ ζ p 2 ) = 2x + (x + y)ζ + x(ζ ζ p 3 ) + (x y)ζ p 2, which contradicts linear independence of 1, ζ,..., ζ p 2 mod p over Z/(p) by looking at the coefficient of, say, ζ 2. There is a similar contradiction in (4) if j = p 1. Can j = 0? If so, then (3) becomes y(ζ ζ 1 ) 0 mod pz[ζ]. Since y is not divisible by p, we can divide by it and get ζ mod p, which contradicts linear independence of 1 and ζ 2 mod p since p 5. Similarly, (4) with j = 0 implies 2xζ + yζ 2 + y 0 mod p, so again we get a contradiction. Setting j = 2 in (3) or (4) leads to contradictions of linear independence as well. We now are left with the case j = 1. In this case (4) implies (x + y)(1 + ζ) 0 mod p, so x + y 0 mod pz. (Here we use Lemma 1.) Thus z p = x p + y p (x + y) p 0 mod p, so p divides z. That violates the condition of Case I. The only remaining case is j = 1 in (3). To summarize, we have shown that if x p + y p = z p and x, y, z are not divisible by p, then x + ζy = ut p where u/u = ζ. Setting j = 1 in (3) yields (5) x(1 ζ) + y(ζ 1) 0 mod p. Writing p = u(1 ζ), (5) implies x y mod (1 ζ) p 2. Since p 2 1 and x and y are in Z, this forces x y mod pz. Running through the proof with y and z interchanged, we get x z mod pz, so 0 = x p + y p z p 3x p mod p. Since p 3 and x is prime to p, we have a contradiction. This settles Case I for p a regular prime. Although we used congruences to prove the nonsolvability of x p + y p = z p in integers prime to p (when p is regular), there often are solutions to x p + y p z p mod p m for large m and x, y, z all prime to p. For instance, mod 49 and from this one can
4 4 KEITH CONRAD solve x 7 + y 7 z 7 mod 7 m in numbers prime to 7, for every m. So it is rather hard to try proving nonsolvability of Fermat s equation with odd prime exponent using congruences in Z. (This is why many crank proofs of FLT, based on elementary number theory, are doomed to failure.) What we used in the above proof were congruences in Z[ζ], not in Z. We now pass to Case II. Our treatement is taken largely from [5, pp ]. Case II. Assume Fermat s equation has a solution in nonzero integers x, y, z with at least one number divisible by p. Since p is odd, we may write the equation in the symmetric form x p + y p + z p = 0. If p divides two of x, y, or z, then it divides the third as well. So removing the highest common factor of p from the three numbers, we can assume p divides only one of the numbers, say p z. Writing z = p r z 0, with z 0 prime to p and r 1, Fermat s equation reads (6) x p + y p + w(1 ζ) pr() z p 0 = 0. for some unit w in Z[ζ] and p not dividing xyz 0. Since (1 ζ) is the only prime over p in Z[ζ] and x, y, z 0 are in Z, saying xyz 0 is not divisible by p in Z is equivalent to saying xyz 0 is not divisible by (1 ζ) in Z[ζ]. We now suitably generalize the form of (6), thereby making it easier to prove a stronger result. Theorem 2. For any regular prime p 3, there do not exist α, β, γ in Z[ζ], all nonzero, such that (7) α p + β p + ε(1 ζ) pn γ p = 0, where ε Z[ζ], n 1, and (1 ζ) does not divide αβγ. In particular, (6) and Theorem 2 show Fermat s Last Theorem for exponent p has no solution in Case II when p is regular. The need for allowing a unit coefficient ε other than 1 is already evident in how Theorem 2 is applied to Case II of FLT. Proof. By (7), we have the ideal equation (8) (α + ζ j β) = (1 ζ) pn (γ) p. j=0 Since γ is nonzero, the left side is nonzero, so α + β, α + ζβ,..., α + ζ β are all nonzero. Unlike Case I, the factors on the left side will not be relatively prime ideals. The plan of the proof is to analyze the ideal factorization of each term on the left and then use the regularity hypothesis to prove certain ideals are principal. We will work often with congruences in Z[ζ]/(1 ζ) and Z[ζ]/(1 ζ) 2. Note Z[ζ]/(1 ζ) = Z/(p) and (for p 3) Z[ζ]/(1 ζ) 2 = (Z/(p))[X]/(1 X) 2. For any number δ(1 ζ) considered modulo (1 ζ) 2, δ only matters modulo 1 ζ, so there are p multiples of 1 ζ in Z[ζ]/(1 ζ) 2. Because α + ζ j β α + β mod (1 ζ) and the prime (1 ζ) divides some factor on the left side of (8), it divides all factors on the left side. We want to show some α + ζ j 0 β is divisible by 1 ζ twice, i.e., α + ζ j 0 β 0 mod (1 ζ) 2. Assume, to the contrary, that 1 ζ divides each factor on the left side of (8) exactly once. (That is, assume n = 1.) Then each of the p factors on the left side of (8) reduces to a nonzero multiple of 1 ζ mod (1 ζ) 2. (Convince yourself of this.) However, there are p 1 distinct nonzero multiples of 1 ζ modulo (1 ζ) 2, so we must have α + ζ j β α + ζ j β mod (1 ζ) 2
5 FERMAT S LAST THEOREM FOR REGULAR PRIMES 5 for some 0 j < j p 1. Therefore (1 ζ j j )β 0 mod (1 ζ) 2. Since 1 ζ j j is a unit multiple of 1 ζ, this congruence forces 1 ζ to divide β. But that violates the hypothesis of the theorem. Thus n 2 and some α + ζ j 0 β is 0 mod (1 ζ) 2. By the previous paragraph, j 0 is unique. Replacing β with ζ j 0 β in the statement of the theorem, we may assume that j 0 = 0, so α + β 0 mod (1 ζ) 2 and α + ζ j β 0 mod (1 ζ) 2 for 1 j p 1. Since αβ 0 mod 1 ζ, the common divisor of any two factors on the left side of (8) is precisely d(1 ζ), where d = (α, β). Note (1 ζ)d is independent of j, so it must appear as a pth power on the left side of (8). The complementary divisor of (1 ζ)d in (α + ζ j β) must be a pth power by considering the right side of (8) and unique factorization of ideals. Therefore (α + ζ j β) = d(1 ζ)c p j, (α + β) = d(1 ζ)np () c p 0, where 1 j p 1 and (1 ζ) does not divide any of c 0, c 1,..., c. Taking ratios, we see that c p j c p 0 is a principal fractional ideal. Since p is regular, c j c 1 0 is a principal fractional ideal, so c j c 1 0 = t j Z[ζ], where t j Q(ζ) is prime to 1 ζ. The equation of ideals (α + ζ j β)(α + β) 1 = (t j ) p (1 ζ) p(n 1) can be written as an elementwise equation (9) p j α + ζ j β α + β = ε j t (1 ζ) p(n 1), where 1 j p 1 and ε j Z[ζ]. Now consider, out of nowhere (!), the elementwise equation ζ(α + ζβ) + (α + ζβ) (1 + ζ)(α + β) = 0. Note ζ = ζ. Dividing by α + β 0 and using (9), Clearing denominators, ζε t p (1 ζ) p(n 1) + ε 1 t p 1 (1 + ζ) = 0. (1 ζ) p(n 1) (10) ζε t p + ε 1t p 1 (1 + ζ)(1 ζ)p(n 1) = 0. Write t j = x j /y j for some x j, y j Z[ζ]. Since t j is prime to 1 ζ and 1 ζ generates a prime ideal, x j and y j are each divisible by the same power of 1 ζ. We can remove this factor from both x j and y j and thus assume x j and y j are prime to 1 ζ. Feeding the formulas t 1 = x 1 /y 1 and t = x /y into (10) and then clearing denominators, ζε c p + ε 1c p 1 (1 + ζ)(1 ζ)p(n 1) c p 0 = 0 where c 0, c 1, c Z[ζ] are prime to (1 ζ). Dividing by the (unit) coefficient of c p, (11) c p + ε 1 ζε c p ζ ζε (1 ζ) p(n 1) c p 0 = 0. This equation is very similar to (7), with n replaced by n 1. Note, for instance, the coefficient of (1 ζ) p(n 1) c p 0 is a unit in Z[ζ] and c 0, c 1, c are prime to (1 ζ). Comparing (7) and (11), note the coefficient of β p is 1 while the coefficient of c p 1 is surely not 1. If the coefficient of c p 1 were a pth power (necessarily the pth power of another unit,
6 6 KEITH CONRAD since the coefficient is itself a unit), then we could absorb the coefficient into c p 1 and obtain an equation just like that in the statement of the theorem, with n replaced by n 1. To show the coefficient of c p 1 is a pth power, consider (11) modulo p: c p + ε 1 c p 1 0 mod pz[ζ]. ζε Since c p 1 and cp are congruent to rational integers mod pz[ζ] (see (2)), and also c 1 is prime to 1 ζ, we can invert c 1 modulo pz[ζ] to get ε 1 ζε rational integer mod pz[ζ]. Now we invoke a deep fact. Kummer s Lemma: Let p is regular and u be a unit in Z[ζ]. If there is some m Z such that u m mod pz[ζ], then u is the pth power of a unit in Z[ζ]. For proofs of Kummer s Lemma, see [1, p. 377] or [6, Theorem 5.36]. Somewhere in any proof of Kummer s Lemma, one has to make a connection between units in Z[ζ] and the class number h p. Two connections, which each serve as the basis for a proof of Kummer s Lemma, are the facts that 1) adjoining the pth root of a unit to Q(ζ) is an abelian unramified extension, whose degree over Q(ζ) must divide h p by class field theory, and 2) the index of the group of real cyclotomic units in Q(ζ) as a subgroup of all real units is equal to the plus part of h p [6, Theorem 8.2]. Thanks to Kummer s Lemma, we can replace the coefficient of c p 1 in (11) with 1, obtaining c p + cp 1 + ε (1 ζ) p(n 1) c p 0 = 0. This has the same form and conditions as the original equation, but n 1 is replaced with n 1. Since we showed that in fact n 2, we have n 1 1, so we have a contradiction by descent. The greatest difference between our proofs of Case I and Case II is the use of Kummer s Lemma in Case II, which amounts to using subtle relations between the class number and the unit group of the pth cyclotomic field. We could afford to be largely ignorant about Z[ζ] in the proof of Case I for regular primes, and the proof was much simpler. Even if p is not regular, Case I continues to be easier than Case II. That is, it is much easier to show (when using cyclotomic methods) that there isn t a solution to x p + y p = z p with p not dividing xyz than with p dividing xyz. For example, a theorem of Wieferich [3, p. 221] says that if x p + y p = z p and p doesn t divide any of x, y, z, then 2 1 mod p 2. The only primes less than satisfying this congruence are 1093 and Mirimanoff proved that also 3 1 mod p 2 if Case I has a solution, and neither 1093 nor 3511 satisfies this congruence. So that settles Case I for all odd primes below In fact, it has been shown [6, p. 181] that a counterexample to Fermat in Case I for exponent p implies q 1 mod p 2 for all primes q 89, and that settles Case I for p < Kummer originally thought he proved a much stronger result than Fermat s Last Theorem for regular primes. He believed he had shown for regular p that the equation α p + β p = γ p has no solution in nonzero α, β, γ coming from the ring Z[ζ], not only from the ring Z. However, in the course of his proof he assumed α, β, and γ are pairwise relatively prime. Since Z[ζ] is usually not a UFD, this kind of assumption makes no sense. Nevertheless, Kummer s proof was basically sound and Hilbert patched it up. For a proof of this more general result, see [2, Chap. 11] or [4, V.3]. As in the treatment above, there are two cases: when none of α, β, γ is divisible by 1 ζ and when one of them is divisible by 1 ζ. (Even
7 FERMAT S LAST THEOREM FOR REGULAR PRIMES 7 if Z[ζ] is not a UFD, 1 ζ does generate a prime ideal, so divisibility by 1 ζ behaves nicely.) The second case of this argument is basically identical to the proof we gave of Case II above. Exercises 1. Find a regular prime p 3 and an integer m 1 for which the congruence x p + y p z p mod (1 ζ p ) m has no solutions x, y, z Z[ζ p ] which are all prime to 1 ζ p. 2. Prove Z[ζ p ]/(1 ζ p ) 2 = (Z/(p))[X]/(1 X) 2 for p 3 and not for p = Let K be a number field, with p 1,..., p r distinct primes of O K. For α K with ord pj (α) = 0 for all j, prove α = x/y where x, y O K are both prime to all the p j. Prove this first in the easier case when all the p j are principal, and then when they need not be principal. (Hint: Thinking of primes as points and the multiplicity of a prime as an order of vanishing, the proof of Prop. 2(2) on p. 40 of Fulton s Algebraic Curves may provide some inspiration.) References [1] Borevich, Z. I. and I. R. Shafarevich. Number Theory, Academic Press, New York, [2] Grosswald, E., Topics from the Theory of Numbers, Macmillan, New York, [3] Ireland, K. and M. Rosen, A Classical Introduction to Modern Number Theory, 2nd ed., Springer Verlag, New York, [4] Ribenboim, P., 13 Lectures on Fermat s Last Theorem, Springer Verlag, New York, [5] van der Poorten, A., Notes on Fermat s Last Theorem, J. Wiley & Sons, New York, [6] Washington, L. An Introduction to Cyclotomic Fields, 2nd ed., Springer-Verlag, New York, 1997.
KUMMER S LEMMA KEITH CONRAD
KUMMER S LEMMA KEITH CONRAD Let p be an odd prime and ζ ζ p be a primitive pth root of unity In the ring Z[ζ], the pth power of every element is congruent to a rational integer mod p, since (c 0 + c 1
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More informationProblem 1. Characterizing Dedekind domains (64 points)
18.785 Number Theory I Fall 2017 Problem Set #2 Description These problems are related to the material covered in Lectures 3 5. Your solutions are to be written up in latex (you can use the latex source
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 FERMAT S LAST THEOREM MTHD6024B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised
More informationIDEAL CLASSES AND THE KRONECKER BOUND
IDEAL CLASSES AND THE KRONECKER BOUND KEITH CONRAD 1. Introduction Let A be a domain with fraction field F. A fractional A-ideal is a nonzero A-submodule a F such that da A for some nonzero d A. These
More informationA BRIEF INTRODUCTION TO LOCAL FIELDS
A BRIEF INTRODUCTION TO LOCAL FIELDS TOM WESTON The purpose of these notes is to give a survey of the basic Galois theory of local fields and number fields. We cover much of the same material as [2, Chapters
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationCYCLOTOMIC FIELDS CARL ERICKSON
CYCLOTOMIC FIELDS CARL ERICKSON Cyclotomic fields are an interesting laboratory for algebraic number theory because they are connected to fundamental problems - Fermat s Last Theorem for example - and
More informationSome algebraic number theory and the reciprocity map
Some algebraic number theory and the reciprocity map Ervin Thiagalingam September 28, 2015 Motivation In Weinstein s paper, the main problem is to find a rule (reciprocity law) for when an irreducible
More informationD-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.
D-MAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the n-th cyclotomic polynomial
More informationSolutions 13 Paul Garrett garrett/
(March 1, 005) Solutions 13 Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [13.1] Determine the degree of Q( 65 + 56i) over Q, where i = 1. We show that 65 + 56i is not a suare in
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationTHE P-ADIC NUMBERS AND FINITE FIELD EXTENSIONS OF Q p
THE P-ADIC NUMBERS AND FINITE FIELD EXTENSIONS OF Q p EVAN TURNER Abstract. This paper will focus on the p-adic numbers and their properties. First, we will examine the p-adic norm and look at some of
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationCYCLOTOMIC EXTENSIONS
CYCLOTOMIC EXTENSIONS KEITH CONRAD 1. Introduction For a positive integer n, an nth root of unity in a field is a solution to z n = 1, or equivalently is a root of T n 1. There are at most n different
More informationClass groups and Galois representations
and Galois representations UC Berkeley ENS February 15, 2008 For the J. Herbrand centennaire, I will revisit a subject that I studied when I first came to Paris as a mathematician, in 1975 1976. At the
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationLemma 1.1. The field K embeds as a subfield of Q(ζ D ).
Math 248A. Quadratic characters associated to quadratic fields The aim of this handout is to describe the quadratic Dirichlet character naturally associated to a quadratic field, and to express it in terms
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationTHE ARTIN-SCHREIER THEOREM KEITH CONRAD
THE ARTIN-SCHREIER THEOREM KEITH CONRAD 1. Introduction The algebraic closure of R is C, which is a finite extension. Are there other fields which are not algebraically closed but have an algebraic closure
More informationp-class Groups of Cyclic Number Fields of Odd Prime Degree
International Journal of Algebra, Vol. 10, 2016, no. 9, 429-435 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.6753 p-class Groups of Cyclic Number Fields of Odd Prime Degree Jose Valter
More informationPrimes, Polynomials, Progressions. B.Sury Indian Statistical Institute Bangalore NISER Bhubaneshwar February 15, 2016
Indian Statistical Institute Bangalore NISER Bhubaneshwar February 15, 2016 Primes and polynomials It is unknown if there exist infinitely many prime numbers of the form n 2 + 1. Primes and polynomials
More informationAN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS
AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply
More informationFINITE-ORDER AUTOMORPHISMS OF A CERTAIN TORUS
FINITE-ORDER AUTOMORPHISMS OF A CERTAIN TORUS BRIAN CONRAD 1. Introduction A classical result of Higman [H], [S, Exer. 6.3], asserts that the roots of unity in the group ring Z[Γ] of a finite commutative
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationALGEBRA PH.D. QUALIFYING EXAM SOLUTIONS October 20, 2011
ALGEBRA PH.D. QUALIFYING EXAM SOLUTIONS October 20, 2011 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved
More informationHomework 4 Solutions
Homework 4 Solutions November 11, 2016 You were asked to do problems 3,4,7,9,10 in Chapter 7 of Lang. Problem 3. Let A be an integral domain, integrally closed in its field of fractions K. Let L be a finite
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationALGEBRAIC NUMBER THEORY - COURSE NOTES
ALGEBRAIC NUMBER THEORY - COURSE NOTES STEVE DONNELLY Housekeeping (1) There ll be a final exam (3 hours or so) on the whole semester (representation theory and algebraic number theory) weighted towards
More informationGALOIS THEORY AT WORK: CONCRETE EXAMPLES
GALOIS THEORY AT WORK: CONCRETE EXAMPLES KEITH CONRAD 1. Examples Example 1.1. The field extension Q(, 3)/Q is Galois of degree 4, so its Galois group has order 4. The elements of the Galois group are
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationMath 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More information1 First Theme: Sums of Squares
I will try to organize the work of this semester around several classical questions. The first is, When is a prime p the sum of two squares? The question was raised by Fermat who gave the correct answer
More informationThe Kronecker-Weber Theorem
The Kronecker-Weber Theorem Lucas Culler Introduction The Kronecker-Weber theorem is one of the earliest known results in class field theory. It says: Theorem. (Kronecker-Weber-Hilbert) Every abelian extension
More informationORDERS OF ELEMENTS IN A GROUP
ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since
More informationGalois theory (Part II)( ) Example Sheet 1
Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that
More informationQUADRATIC RINGS PETE L. CLARK
QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q,
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationIRREDUCIBILITY TESTS IN F p [T ]
IRREDUCIBILITY TESTS IN F p [T ] KEITH CONRAD 1. Introduction Let F p = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(t ) F p [T ] is irreducible that are
More informationMath Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem. Spring 2013
Math 847 - Topics in Algebra Course Notes: A Proof of Fermat s Last Theorem Spring 013 January 6, 013 Chapter 1 Background and History 1.1 Pythagorean triples Consider Pythagorean triples (x, y, z) so
More information(January 14, 2009) a primitive fifth root of unity, so have order divisible by 5.) Recall the isomorphisms
(January 14, 009) [1.1] Prove that a prime p such that p = 1 mod 3 factors properly as p = ab in Z[ω], where ω is a primitive cube root of unity. (Hint: If p were prime in Z[ω], then Z[ω]/p would be a
More informationRational Points on Conics, and Local-Global Relations in Number Theory
Rational Points on Conics, and Local-Global Relations in Number Theory Joseph Lipman Purdue University Department of Mathematics lipman@math.purdue.edu http://www.math.purdue.edu/ lipman November 26, 2007
More informationDirichlet Characters. Chapter 4
Chapter 4 Dirichlet Characters In this chapter we develop a systematic theory for computing with Dirichlet characters, which are extremely important to computations with modular forms for (at least) two
More informationIdeals: Definitions & Examples
Ideals: Definitions & Examples Defn: An ideal I of a commutative ring R is a subset of R such that for a, b I and r R we have a + b, a b, ra I Examples: All ideals of Z have form nz = (n) = {..., n, 0,
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationON GALOIS GROUPS OF ABELIAN EXTENSIONS OVER MAXIMAL CYCLOTOMIC FIELDS. Mamoru Asada. Introduction
ON GALOIS GROUPS OF ABELIAN ETENSIONS OVER MAIMAL CYCLOTOMIC FIELDS Mamoru Asada Introduction Let k 0 be a finite algebraic number field in a fixed algebraic closure Ω and ζ n denote a primitive n-th root
More informationNew Restrictions on Possible Orders of Circulant Hadamard Matrices
New Restrictions on Possible Orders of Circulant Hadamard Matrices Ka Hin Leung Department of Mathematics National University of Singapore Kent Ridge, Singapore 119260 Republic of Singapore Bernhard Schmidt
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More informationContest Number Theory
Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,
More information(January 14, 2009) q n 1 q d 1. D = q n = q + d
(January 14, 2009) [10.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)
More informationCYCLICITY OF (Z/(p))
CYCLICITY OF (Z/(p)) KEITH CONRAD 1. Introduction For each prime p, the group (Z/(p)) is cyclic. We will give seven proofs of this fundamental result. A common feature of the proofs that (Z/(p)) is cyclic
More informationGALOIS THEORY. Contents
GALOIS THEORY MARIUS VAN DER PUT & JAAP TOP Contents 1. Basic definitions 1 1.1. Exercises 2 2. Solving polynomial equations 2 2.1. Exercises 4 3. Galois extensions and examples 4 3.1. Exercises. 6 4.
More informationON THE EQUATION X n 1 = BZ n. 1. Introduction
ON THE EQUATION X n 1 = BZ n PREDA MIHĂILESCU Abstract. We consider the Diophantine equation X n 1 = BZ n ; here B Z is understood as a parameter. We give new conditions for existence of solutions to this
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationIDEAL CLASS GROUPS OF CYCLOTOMIC NUMBER FIELDS I
IDEA CASS GROUPS OF CYCOTOMIC NUMBER FIEDS I FRANZ EMMERMEYER Abstract. Following Hasse s example, various authors have been deriving divisibility properties of minus class numbers of cyclotomic fields
More informationGALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationSOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A.
SOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A. 1. Introduction Today we are going to have a look at one of the simplest functions in
More informationdisc f R 3 (X) in K[X] G f in K irreducible S 4 = in K irreducible A 4 in K reducible D 4 or Z/4Z = in K reducible V Table 1
GALOIS GROUPS OF CUBICS AND QUARTICS IN ALL CHARACTERISTICS KEITH CONRAD 1. Introduction Treatments of Galois groups of cubic and quartic polynomials usually avoid fields of characteristic 2. Here we will
More informationALGEBRA PH.D. QUALIFYING EXAM September 27, 2008
ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/25833 holds various files of this Leiden University dissertation Author: Palenstijn, Willem Jan Title: Radicals in Arithmetic Issue Date: 2014-05-22 Chapter
More informationTHE GAUSSIAN INTEGERS
THE GAUSSIAN INTEGERS KEITH CONRAD Since the work of Gauss, number theorists have been interested in analogues of Z where concepts from arithmetic can also be developed. The example we will look at in
More informationIRREDUCIBILITY TESTS IN Q[T ]
IRREDUCIBILITY TESTS IN Q[T ] KEITH CONRAD 1. Introduction For a general field F there is no simple way to determine if an arbitrary polynomial in F [T ] is irreducible. Here we will focus on the case
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More informationA Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes.
A Harvard Sampler Evan Chen February 23, 2014 I crashed a few math classes at Harvard on February 21, 2014. Here are notes from the classes. 1 MATH 123: Algebra II In this lecture we will make two assumptions.
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationCHAPTER V Fermat s last theorem
5.1 Introduction. CHAPTER V Fermat s last theorem We discuss elementary methods approaches to Fermat s last theorem, in which the game is we do not use complex numbers. In this chapter we use methods available
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationMATH 361: NUMBER THEORY TENTH LECTURE
MATH 361: NUMBER THEORY TENTH LECTURE The subject of this lecture is finite fields. 1. Root Fields Let k be any field, and let f(x) k[x] be irreducible and have positive degree. We want to construct a
More informationIdeal class groups of cyclotomic number fields I
ACTA ARITHMETICA XXII.4 (1995) Ideal class groups of cyclotomic number fields I by Franz emmermeyer (Heidelberg) 1. Notation. et K be number fields; we will use the following notation: O K is the ring
More informationLARGE PRIME NUMBERS (32, 42; 4) (32, 24; 2) (32, 20; 1) ( 105, 20; 0).
LARGE PRIME NUMBERS 1. Fast Modular Exponentiation Given positive integers a, e, and n, the following algorithm quickly computes the reduced power a e % n. (Here x % n denotes the element of {0,, n 1}
More informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
More informationThese warmup exercises do not need to be written up or turned in.
18.785 Number Theory Fall 2017 Problem Set #3 Description These problems are related to the material in Lectures 5 7. Your solutions should be written up in latex and submitted as a pdf-file via e-mail
More informationFebruary 1, 2005 INTRODUCTION TO p-adic NUMBERS. 1. p-adic Expansions
February 1, 2005 INTRODUCTION TO p-adic NUMBERS JASON PRESZLER 1. p-adic Expansions The study of p-adic numbers originated in the work of Kummer, but Hensel was the first to truly begin developing the
More informationarxiv: v1 [math.nt] 2 Jul 2009
About certain prime numbers Diana Savin Ovidius University, Constanţa, Romania arxiv:0907.0315v1 [math.nt] 2 Jul 2009 ABSTRACT We give a necessary condition for the existence of solutions of the Diophantine
More informationSOLUTION TO MATH 797N, PROBLEM SET #1.
SOLUTION TO MATH 797N, PROBLEM SET #1. SIMAN WONG Comments: As Silverman points on p. 461,... it is hoped that this book will lead the student on into the realm of active mathematics, and the benefits
More informationLecture 2. The Euclidean Algorithm and Numbers in Other Bases
Lecture 2. The Euclidean Algorithm and Numbers in Other Bases At the end of Lecture 1, we gave formulas for the greatest common divisor GCD (a, b), and the least common multiple LCM (a, b) of two integers
More informationSOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have
Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationGalois Theory TCU Graduate Student Seminar George Gilbert October 2015
Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s
More informationThe Kronecker-Weber Theorem
The Kronecker-Weber Theorem November 30, 2007 Let us begin with the local statement. Theorem 1 Let K/Q p be an abelian extension. Then K is contained in a cyclotomic extension of Q p. Proof: We give the
More informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationON 3-CLASS GROUPS OF CERTAIN PURE CUBIC FIELDS. Frank Gerth III
Bull. Austral. ath. Soc. Vol. 72 (2005) [471 476] 11r16, 11r29 ON 3-CLASS GROUPS OF CERTAIN PURE CUBIC FIELDS Frank Gerth III Recently Calegari and Emerton made a conjecture about the 3-class groups of
More informationTHE MILLER RABIN TEST
THE MILLER RABIN TEST KEITH CONRAD 1. Introduction The Miller Rabin test is the most widely used probabilistic primality test. For odd composite n > 1 at least 75% of numbers from to 1 to n 1 are witnesses
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More information