Gauss: the Last Entry Frans Oort
|
|
|
- Patricia Holmes
- 9 years ago
- Views:
Transcription
1 Gauss: the Last Entry Frans Oort
2 (1) Introduction. Carl Friedrich Gauss ( ) kept a mathematical diary (from 1796). The last entry he wrote was on 7 July A remarkable short statement. We present one of the shortest examples of a statement with a visionary impact: we discuss this expectation by Gauss. His idea preludes developments only started more than a century later. I have two goals: explain the visionary insight by Gauss and show the connection with 20-th century mathematics, with an emphasis on the flow of mathematics : early ideas becoming a theory once understood; this we will see in the sequence: Tagebuch Gauss The Riemann hypothesis in positive characteristic the Weil conjectures.
3 In this talk I will explain the diary note by Gauss. We give a short proof, using methods, developed by Hasse, Weil and many others. Of course this is history upside down: instead of seeing the Last Entry as a prelude to modern developments, we give a 20-th century proof of this 19-th century statement. We will discuss also: Lemniscate transcendental functions Weierstrass functions Koebe / Poincaré uniformization of algebraic curves over C.
4 The last entry Gauss wrote in his notebook was on 7 July A remarkable short statement. Here is the text: Observatio per inductionem facta gravissima theoriam residuorum biquadraticorum cum functionibus lemniscaticis elegantissime nectens. Puta, si a + bi est numerus primus, a 1 + bi per 2 + 2i divisibilis, multitudo omnium solutionum congruentiae 1 = xx + yy + xxyy (mod a + bi) inclusis x =, y = ±i, x = ±i, y = fit = (a 1) 2 + bb.
5 The text of the Tagebuch was rediscovered in 1897 and edited and published by Felix Klein (Math. Annalen 1903). In the collected works by Gauss, in Volume X 1 (1917) we find a facsimile of the original text. A most important observation made by induction which connects the theory of biquadratic residues most elegantly with the lemniscatic functions. Suppose, if a + bi is a prime number, a 1 + bi divisible by 2 + 2i, then the number of all solutions of the congruence 1 = xx + yy + xxyy (mod a + bi) including x =, y = ±i; x = ±i, y =, equals (a 1) 2 + bb.
6 Remarks. In the original we see that Gauss indeed used the notation xx, as was usual in his time. In his Disquisitiones Arithmeticae for example we often see that x 2 and x x are used in the same formula. The terminology Tagebuch used, with subtitle Notizenjournal, is perhaps better translated by Notebook in this case. In the period we see 146 entries, and, for example, the Last Entry is the only one in Gauss wrote down discoveries made. The first entry on 30 March 1796 is his famous result that a regular 17-gon can be constructed by ruler and compass. André Weil remarks that per inductionem could be understood as, and translated by emperically. The word induction in our context does not stand for mathematical induction.
7 (2) We phrase the prediction by Gauss in other terms. We write F p = Z/p for (the set, the ring) the field of integers modulo a prime number p. Suppose p 1 (mod 4). Once p is fixed we write N = # ( {(x, y) (F p ) 2 1 = x 2 + y 2 + x 2 y 2 } ) + 4. A prime number p with p 1 (mod 4) can be written as a sum of two squares of integers (as Fermat proved). These integers are unique up to sign and up to permutation. Suppose we write p = a 2 + b 2, with b even and a 1 b (mod 4). In this case Gauss predicted for every p 1 (mod 4). N = (a 1) 2 + b 2
8 (3) Some history. Herglotz gave in 1921 the first proof for this expectation by Gauss. We will see the attempt and precise formulation of Gauss of this problem as the pre-history and a prelude of the Riemann hypothesis in positive characteristic as developed by E. Artin, F. K. Schmidt, Hasse, Deuring, Weil and many others.
9 (4) Some examples. For p = 5 we obtain a = 1, and b = ±2 and N = 8. Indeed, (x = ±1, y = ±1) are the only solutions for Y 2 = X (X 1)(X + 1) (see Proposition 2(a) for an explanation). p = 5 = ( 1) , N = 8. For p = 13 we have (+3) 2 + (2) 2 = 13 and indeed (+3 1) = 8 is the number of F 13 -rational points as can be computed easily; p = 13 = (+3) , N = 8. For p = 17 there are the 12 solutions: the point 0, the three 2-torsion points, and x = 4, 5, 7, 10, 12, 13; the points (x = 4, y = ±3) and (x = 13, y = ±5) we will encounter below as (x = e, y = 1 + e) with e 2 = 1; p = 17 = (+1) , N = 16.
10 (5) This curve considered by Gauss. We see in the statement by Gauss four points at infinity. Here is his explanation. Consider the projective curve C = Z( Z 4 + X 2 Z 2 + Y 2 Z 2 + X 2 Y 2 ) P 2 K over a field K of characteristic not equal to 2. For Z = 0 we have points P 2 = [x = 0 : y = 1 : z = 0] and P 1 = [x = 1 : y = 0 : z = 0]. Around P 2 we can use a local chart given by Y = 1, and Z( Z 4 + X 2 Z 2 + Z 2 + X 2 ); we see that the tangent cone is given by Z(Z 2 + X 2 ) (the lowest degree part); hence we have a ordinary double point, rational over the base field K and the tangents to the two branches are conjugate if 1 is not a square in K, respectively given by X = ±ez with e 2 = 1 in L. This is what Gauss meant by x =, y = ±i. Analogously for P 2 and y =, x = ±i.
11 Explanation. Any algebraic curve (an absolutely reduced, absolutely irreducible scheme of dimension one) C over a field K is birationally equivalent over K to a non-singular, projective curve C, and C is uniquely determined by C. The affine curve Z( 1 + X 2 + Y 2 + X 2 Y 2 ) A 2 K, over a field K of characteristic not equal to 2 determines uniquely a curve, denoted by E K in this note. This general fact will not be used: we will construct explicit equations for E K (over any field considered) and for E L over a field with an element e L satisfying e 2 = 1.
12 In the present case, we write C P 2 K as above (the projective closure of the curve given by Gauss), E for the normalization. We have a morphism h : E C defined over K. On E we have a set S of 4 geometric points, rational over any field L K in which 1 is a square, such that the induced morphism E \ S Z( 1 + X 2 + Y 2 + X 2 Y 2 ) A 2 K is an isomorphism.
13 (6) A normal form, 1. Proposition 1. Suppose K is a field of characteristic not equal to 2. (a). The elliptic curve E can be given by T 2 = 1 X 4. (b). The elliptic curve E can be given by U 2 = V 3 + 4V. (c). There is a subgroup Z/4 E(K).
14 (7) The case p 3 (mod 4) (not mentioned by Gauss). Theorem 2. The elliptic curve E over F p with p 3 (mod 4) has: # (E(F p )) = p + 1. Proof. The elliptic curve E can be given by the equation Y 2 = X 3 + 4X. We define E by the equation Y 2 = X 3 + 4X. We see: # (E(K)) + # (E (K)) = 2p + 2; E = K E. Indeed, any x P 1 (K) giving a 2-torsion point contributes +1 to both terms; any possible (x, ±y) with y 0 contributes +2 to exactly one of the terms (we use the fact that 1 is not a square in F p in this case). The substitution X X shows the second claim. Hence # (E(K)) = (2p + 2)/2.
15 (8) A normal form, 2. Proposition 3. Suppose L is a field of characteristic not equal to 2. Suppose there is an element e L with e 2 = 1. (a). The elliptic curve E L can be given by Y 2 = X (X 1)(X + 1). (b). There is a subgroup (Z/4 Z/2) E(L). Note: x = e gives e(e 1)(e + 1) = (e 1) 2. We will study this in case either L = Q( 1) or L = F p with p 1 (mod 4) (as Gauss did in his Last Entry).
16 (9) An aside: a historical line, uniformization of algebraic curves. We work over C. (a) The circle given by X 2 + Y 2 = 1 can be parametrized by X = sin(z), and Y = cosin(z) (a uniformization by complex functions). However, as any conic is a rational curve it can also be parametrized by rational functions, in this case as ( t2 1 2t t )2 + ( t )2 = 1.
17 (b) The quartic equation given by Gauss in his Last Entry originates in the theory of the lemniscate functions. At the time of Gauss it was known that the curve given by x 2 + y 2 + x 2 y 2 = 1 can be uniformed by the lemniscate functions t (x = cl(t), y = sl(t)). In the notation of Gauss: x = sinlemn u, y = coslemn u. These functions are analogous of the usual sine and cosine functions, with the circle replaced by the lemniscate of Bernouilli. However for this curve (of genus one) there is no rational parametrization.
18 (c) Abel, Jacobi and Weierstrass proved that this parametrization of this particular elliptic curve can be generalized to any elliptic curve (a curve of genus one) in a parametrization by transcendental functions: write an equation for the curve in a special form, and show that x = (z), y = ( / z)( (z)) satisfies this differential equation. (d) Such a uniformization for elliptic curves was generalized by Koebe and Poincaré (1907) to curves of arbitrary genus at least two (mapping the Poincaré upper half plane onto the set of complex point of the curve considered, again by transcendental functions).
19 In the 20-th century we observe the problem that arithmetic properties are difficult to read off from transcendental functions. How do we determine rational points (say over a number field) on a given algebraic curve (e.g. as we like to do in FLT)? (e) The great breakthrough was in the Shimura-Taniyama-Weil conjecture: elliptic curves over Q are rationally parametrized (not by P 1, but) by modular curves (and these curves we know very well). We see the genesis of mathematics, the developments from the roots to final theory (uniformizations of algebraic curves).
20 We come to a proof of the expectation by Gauss in his Last Entry : Let a + bi be a prime element in Z[i] such that a 1 + bi is divisible by 2 + 2i; then #(E(F p )) = (a 1) 2 + b 2. We conclude that a 2 + b 2 = p, a (rational) prime number with p 1 (mod 4).
21 A version of he claim by Gauss: N = N(p) := #{(x, y) F p y 2 = X (X + 1)(X 1)} + 1; p = a 2 + b 2, a, b Z; we see that b is even, and a is odd and a 1 b (mod 4). Claim by Gauss: N = (a 1) 2 + b 2. We write π = a + bi, and see N = Norm(π 1). Reminder, examples: p = 5, and π = 1 + 2i; N(5) = 8; p = 13, and π = 3 + 2i; N(13) = 8; p = 17, and π = i; N(17) = 16; p = 29, and π = 5 + 2i; N(29) = 32; etc. We discuss a proof given in 20-th century language and notation.
22 (10) An aside: a historical line, from Gauss into the 20-th century. We work over a finite field. (a) The Last Entry by Gauss, giving a (possible) interpretation of the number of rational points as the norm of an endomorphism. (b) The Riemann Hypothesis for the zeros of the zeta function. (c) The PhD thesis (1921, 1924) by Emil Artin, where a characteristic p analog of RH is launched, with many proofs, and checking the prh in 40 different cases.
23 (d) Proofs by Hasse of prh for elliptic curves (1933, 1934, 1936). (e) Proofs by F. K. Schmidt, Deuring and many others trying to understand the zeta function of an algebraic curve over a finite field. (f) Proofs by Weil of the prh for curves of arbitrary genus and for abelian varieties (1940, 1941, 1948). Algebraic geometry over an arbitrary field had to be described in great generality.
24 (g) Weil gives an interpretation of the prh as an analogue of the Fixed Point Theorem of Lefschetz, formulation of the Weil conjectures. (h) Foundations of algebraic geometry necessary for proving the Weil conjectures (Weil 1946, Serre, 1955, Grothendieck 1958). Proofs of many aspects of the Weil conjectures (Grothendieck and many others). (i) Proof of prh in full generality by Deligne (1974). (j) Standard conjectures (Grothendieck), still wide open.
25 A comment. Gauss considered solutions of this equation modulo p. Only much later E Fp was considered as an independent mathematical object, not necessarily a set of modulo p solutions of a characteristic zero polynomial. In the beginning as the set of valuations of a function field, as in the PhD-thesis by Emil Artin, 1921/1924. For elliptic curves this was an accessible concept, but for curves of higher genus (leave alone for varieties of higher dimensions) this was cumbersome. A next step was to consider instead a geometric object over a finite field; a whole now aspect of (arithmetic) algebraic geometry had to be developed before we could proceed. Each of these new insights was not easily derived; however, as a reward we now have a rich theory, and a thorough understanding of the impact of ideas as in the Last Entry of Gauss.
26 (11) Frobenius maps and formulas. We recall some theory developed by Emil Artin, F.K. Schmidt, Hasse, Deuring, Weil and many others, now well-known, and later incorporated in the general theory concerning the Riemann Hypothesis in positive characteristic. For simplicity we only discuss the case of the ground field F p.
27 Easy, but crucial observation. Let F p k. The map x x p is a field homomorphism k k. Moreover the set of fixed points is: F p = {x k x p = x}. This simple-minded fact, via a geometric interpretation of higher dimensional analogues, is the basis of our proof (and of the proof of the Riemann Hypothesis in positive characteristic for curves and for abelian varieties).
28 The Frobenius morphism. For a variety V over the field F p we construct a morphism Frob V = F : V V, defined by raising all coordinates to the power p. Note that if (x) is a zero of f = a α X α, then indeed (x p ) is a zero of a p αx α, because a p α = a α, f (x) p = ( a α x α ) p = a p α(x α ) p = f (x p ). This morphism was considered by Hasse in (Side remark. An analogous morphism can be defined for any variety over F q for any q = p n.)
29 Easy fact: the set invariants of Frob V : V V is exactly V (F p ), the set of F p -rational points on V. A little warning. The morphism π : V V induces a bijection π(k) : V (k) V (k) for every algebraically closed field k F p ; however (in case the dimension of V is at least one) π : V V is not an isomorphism. We illustrate this in one example. Let V = A 1 F p, the affine line. The morphism Frob V : V V on points is given by x x p ; on coordinate rings it is given by K[T ] K[S] with T p S. We see this is not an isomorphism. However note that V (x) = x if and only if x A 1 F p (F p ) = F p. Moreover not that for any perfect field Ω F p (e.g. a finite field, or an algebraically closed field) we obtain a bijection Frob(Ω) : Ω = V (Ω) Ω = V (Ω), injective because y p = z p implies (y z) p = 0 hence y = z; surjective because p z z.
30 We are going to apply this to our elliptic curve E. We write π = Frob E. Using addition on E we can write, and see Ker(π 1 : E E) = E(F p ). It turns to that we can consider π End(E) as a complex number. (For specialists: End(E) is a characteristic zero domain.) A small argument shows that Norm(π 1) = #(E(F p )) =: N. (For specialists: π 1 is separable, hence all fixed points have multiplicity one.)
31 Moreover for the complex conjugate π we have π π = p. Write β := π + π, the trace of π. We see that π is a zero of T 2 β T + p; π = p; N = Norm(π 1) = (π 1)(π 1) = 1 β + p. Crucial observation by André Weil. Stare at the equality #(E(F p )) = 1 Trace(π) + p, where #(E(F p )) is the number of fixed points of π : E E. What is the interpretation (and possible generalization) of this?
32 The statements usually indicated by the Riemann hypothesis in positive characteristic I tend to indicate by prh, in order to distinguish this from the classical Riemann hypothesis RH. For any elliptic curve C over a finite field F q one can define its zeta function (as can be done for more general curves, and more general varieties over a finite field). As E. Artin and F. K. Schmidt showed, for an elliptic curve over F q we have Z(E, T ) = (1 ρt )(1 ρt ) (1 T )(1 qt ). As is usual, the (complex) variable s is defined by T = q s. The theorem proved by Hasse is ρ = q = ρ ; this translates into s = 1 2 (prh), and we see the analogy with the classical RH, which explains the terminology prh.
33 A comment. Gauss considered solutions of this equation modulo p. Only much later E Fp was considered as an independent mathematical object, not necessarily a set of modulo p solutions of a characteristic zero polynomial. In the beginning as the set of valuations of a function field, as in the PhD-thesis by Emil Artin, 1921/1924. For elliptic curves this was an accessible concept, but for curves of higher genus (leave alone for varieties of higher dimensions) this was cumbersome. A next step was to consider instead a geometric object over a finite field; a whole now aspect of (arithmetic) algebraic geometry had to be developed before we could proceed. Each of these new insights was not easily derived; however, as a reward we now have a rich theory, and a thorough understanding of the impact of ideas as in the Last Entry of Gauss.
34 (12) A proof for the statement by Gauss in his Last Entry. We have p = a 2 + b 2, where 2 + 2i divides a 1 + bi. Hence 8 divides (a 1) 2 + b 2. We conclude: p 1 (mod 4), with a odd and b even; the sign of a is determined by a 1 b (mod 4), explicitly, p 1 (mod 8) then a 1 (mod 4) p 5 (mod 8) then a 3 (mod 4); proof: 8 divides (a 1) 2 + b 2 = a 2 2a b 2 = p + 1 2a; either p 1 (mod 8) and 2a 2 (mod 8) or p 5 (mod 8) and 2a 6 (mod 8).
35 Expectation / Theorem (Gauss 1841, Herglotz 1921). # (E(F p )) = Norm(π 1) = (a 1) 2 + b 2. Proof (assuming our knowledge for π End(E)). We know π π = p and Norm(π 1) = #(E(F p )) =: N and Hence N = 1 Trace(π) + p. N = 1 2a + a 2 + b 2 = (a 1) 2 + b 2.
36 Thank you for this opportunity to talk to you, and thank you for your attention.
11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a
PYTHAGOREAN 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
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM
ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give
Math 231b Lecture 35. G. Quick
Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by
SECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
Alex, I will take congruent numbers for one million dollars please
Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 [email protected] One of the most alluring aspectives of number theory
How To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
FACTORING AFTER DEDEKIND
FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
FIBER PRODUCTS AND ZARISKI SHEAVES
FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also
ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE
Illinois Journal of Mathematics Volume 46, Number 1, Spring 2002, Pages 145 153 S 0019-2082 ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE J. HUISMAN Abstract. Let C be a
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION CHRISTIAN ROBENHAGEN RAVNSHØJ Abstract. Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication.
EXERCISES FOR THE COURSE MATH 570, FALL 2010
EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime
Galois representations with open image
Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group
Math 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao [email protected]
Integer Polynomials June 9, 007 Yufei Zhao [email protected] We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
ALGEBRA HW 5 CLAY SHONKWILER
ALGEBRA HW 5 CLAY SHONKWILER 510.5 Let F = Q(i). Prove that x 3 and x 3 3 are irreducible over F. Proof. If x 3 is reducible over F then, since it is a polynomial of degree 3, it must reduce into a product
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document
Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
SOLVING POLYNOMIAL EQUATIONS BY RADICALS
SOLVING POLYNOMIAL EQUATIONS BY RADICALS Lee Si Ying 1 and Zhang De-Qi 2 1 Raffles Girls School (Secondary), 20 Anderson Road, Singapore 259978 2 Department of Mathematics, National University of Singapore,
Recent work on Serre s conjectures
Recent work on Serre s conjectures Kenneth A. Ribet University of California, Berkeley June 4, 2005 Canadian Math Society Summer Meeting This talk concerns a new chapter in a story that began in the late
Factoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
Prime numbers and prime polynomials. Paul Pollack Dartmouth College
Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)
Prime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
Algebraic and Transcendental Numbers
Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)
SINTESI DELLA TESI. Enriques-Kodaira classification of Complex Algebraic Surfaces
Università degli Studi Roma Tre Facoltà di Scienze Matematiche, Fisiche e Naturali Corso di Laurea Magistrale in Matematica SINTESI DELLA TESI Enriques-Kodaira classification of Complex Algebraic Surfaces
MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
OSTROWSKI FOR NUMBER FIELDS
OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for
Group Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
GROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
The Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
Chapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16
INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16 RAVI VAKIL Contents 1. Valuation rings (and non-singular points of curves) 1 1.1. Completions 2 1.2. A big result from commutative algebra 3 Problem sets back.
Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms
The five fundamental operations of mathematics: addition, subtraction, multiplication, division, and modular forms UC Berkeley Trinity University March 31, 2008 This talk is about counting, and it s about
On the largest prime factor of x 2 1
On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical
Galois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
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 called a quadratic field and it has degree 2 over Q. Similarly,
Polynomial Operations and Factoring
Algebra 1, Quarter 4, Unit 4.1 Polynomial Operations and Factoring Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned Identify terms, coefficients, and degree of polynomials.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
Primality - Factorization
Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
QUADRATIC RECIPROCITY IN CHARACTERISTIC 2
QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets
Row Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
Introduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
Section 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
Just the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
Lecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves
Notes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
MATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
Trigonometric Functions and Equations
Contents Trigonometric Functions and Equations Lesson 1 Reasoning with Trigonometric Functions Investigations 1 Proving Trigonometric Identities... 271 2 Sum and Difference Identities... 276 3 Extending
Math 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
Chapter 7. Permutation Groups
Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral
I. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
A New Generic Digital Signature Algorithm
Groups Complex. Cryptol.? (????), 1 16 DOI 10.1515/GCC.????.??? de Gruyter???? A New Generic Digital Signature Algorithm Jennifer Seberry, Vinhbuu To and Dongvu Tonien Abstract. In this paper, we study
Integer roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B
Introduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
Prentice Hall Algebra 2 2011 Correlated to: Colorado P-12 Academic Standards for High School Mathematics, Adopted 12/2009
Content Area: Mathematics Grade Level Expectations: High School Standard: Number Sense, Properties, and Operations Understand the structure and properties of our number system. At their most basic level
Indiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
Factoring & Primality
Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount
NOTES ON CATEGORIES AND FUNCTORS
NOTES ON CATEGORIES AND FUNCTORS These notes collect basic definitions and facts about categories and functors that have been mentioned in the Homological Algebra course. For further reading about category
it is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
Applications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
UNIVERSITY OF PUNE, PUNE 411007. BOARD OF STUDIES IN MATHEMATICS SYLLABUS
UNIVERSITY OF PUNE, PUNE 411007. BOARD OF STUDIES IN MATHEMATICS SYLLABUS F.Y.B.Sc (MATHEMATICS) PAPER 1 ALGEBRA AND GEOMETRY FIRST TERM 1) Sets (4 Lectures) 1.1 Power set of a set, Product of two sets.
Our Primitive Roots. Chris Lyons
Our Primitive Roots Chris Lyons Abstract When n is not divisible by 2 or 5, the decimal expansion of the number /n is an infinite repetition of some finite sequence of r digits. For instance, when n =
Generic Polynomials of Degree Three
Generic Polynomials of Degree Three Benjamin C. Wallace April 2012 1 Introduction In the nineteenth century, the mathematician Évariste Galois discovered an elegant solution to the fundamental problem
88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
The van Hoeij Algorithm for Factoring Polynomials
The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial
RESEARCH STATEMENT AMANDA KNECHT
RESEARCH STATEMENT AMANDA KNECHT 1. Introduction A variety X over a field K is the vanishing set of a finite number of polynomials whose coefficients are elements of K: X := {(x 1,..., x n ) K n : f i
THE CONGRUENT NUMBER PROBLEM
THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
Copyrighted Material. Chapter 1 DEGREE OF A CURVE
Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two
Unique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
Georgia Department of Education Kathy Cox, State Superintendent of Schools 7/19/2005 All Rights Reserved 1
Accelerated Mathematics 3 This is a course in precalculus and statistics, designed to prepare students to take AB or BC Advanced Placement Calculus. It includes rational, circular trigonometric, and inverse
. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9
Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a
Cyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
FINITE FIELDS KEITH CONRAD
FINITE FIELDS KEITH CONRAD This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and F p interchangeably
Estimated Pre Calculus Pacing Timeline
Estimated Pre Calculus Pacing Timeline 2010-2011 School Year The timeframes listed on this calendar are estimates based on a fifty-minute class period. You may need to adjust some of them from time to
UNIVERSITY GRADUATE STUDIES PROGRAM SILLIMAN UNIVERSITY DUMAGUETE CITY. Master of Science in Mathematics
1 UNIVERSITY GRADUATE STUDIES PROGRAM SILLIMAN UNIVERSITY DUMAGUETE CITY Master of Science in Mathematics Introduction The Master of Science in Mathematics (MS Math) program is intended for students who
SMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
The Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
