Example (cont d): Function fields in one variable...
|
|
- Helena Garrison
- 5 years ago
- Views:
Transcription
1 Example (cont d): Function fields in one variable... Garrett Practice: consider K a finite extension of k = C(X), and O the integral closure in K of o = C[X]. K = C(X, Y ) for some Y, and can renormalize so Y C[X, Y ] O. O, so For example, for hyperelliptic curves Y 2 = P (X) with P (X) C[X] square-free, have O = C[X, Y ] exactly. Puiseux expansions and field extensions of C((X z)). Introduction to Newton polygons.
2 Garrett Hensel s lemma: With monic F (T ) C[[X]][T ], given α 1 C[[X z]] with F (α 1 ) = 0 mod X z, F (α 1 ) 0 mod X z, the recursion α n+1 = α n F (α n) F (α n ) mod (X z)n+1 gives α = lim n α n C[[X z]] with F (α ) = 0 in C[[X z]], and α is the unique solution congruent to α 1 mod X z. Theorem: All finite field extensions of C((X z)) are by adjoining solutions to Y e = X z for e = 2, 3, 4,.... [Proof below.] This approximates the assertion that, locally, Riemann surfaces are combinations of coverings of the z-plane and power maps w e = z. The proof invites extending Hensel s lemma to cover factorization.
3 Garrett Hensel s Lemma II: Let R be a UFD, and π a prime element in R. Given a R, suppose b 1, c 1 R such that a = b 1 c 1 mod π and Rb 1 + Rc 1 + Rπ = R Then there are b, c in the π-adic completion R π = lim n R/π n such that b = b 1 mod π, c = c 1 mod π, and a = b c (in lim n R/π n = R π ) Remark: Apply this to R = C[[X z]][t ] or R = C[X, T ] and π = X z to talk about field extensions of C((X z)).
4 Garrett Proof: With a = b 1 c 1 mod π, try to adjust b 1, c 1 by multiples of π to make the equation hold mod π 2 : require a = ( b 1 + xπ ) (c 1 + yπ ) mod π 2 Simplify: the π 2 term π 2 xy disappears, and a b 1 c 1 π = xc 1 + yb 1 mod π By hypothesis, expressions xc 1 + yb 1 + zπ with x, y, z R give R, so there exist (non-unique!) x, y to make the equation hold.
5 Garrett Thus, the genuine induction step involves a = b n c n mod π n, and trying to solve for x, y in which gives a = ( b n + xπ n) (c n + yπ n) mod π n+1 a b n c n π n = xc n + yb n mod π Inductively, c n = c 1 mod π and b n = b 1 mod π, so Rb n + Rc n + Rπ = Rc 1 + Rb 1 + Rπ = R and there are x, y satisfying the condition. Induction succeeds. ///
6 Garrett Caution: By Gauss lemma, polynomial rings o[x] over UFDs o are UFDs, but what about o[[x]]? We don t really need the more general case, since we only care about C[[X]] = lim n C[X]/X n, which is completely analogous to Z p, where we recall that the ideals in Z p are just p l Z p. Many fewer than in Z, and all coming from Z. Thus, C[[X]] is a PID, with a unique non-zero prime ideal X C[[X]], and all ideals are of the form X n C[[X]]. Even though o[[x]] is much bigger than o[x], it has many more units, for example. At the same time, UFDs like Z[x, y] are not PIDs, so we have to be careful what we imagine... Maybe proving Z[[X]] and C[[X]][T ] are UFDs is a good exercise.
7 Corollary: (Now z = 0 and X z = X.) Consider Garrett f(x, T ) = T n + a n 1 (X)T n a 1 (X)T + a o (X) with a j (X) C[[X]] and such that the equation f(0, Y ) = (Y w 1 ) ν 1 (Y w 2 ) ν 2... (Y w m ) ν m with w i w j for i j. Then f(x, T ) factors in C[[X]][T ] into m monic-in-t factors, of degrees ν j in T : T n + a n 1 (X)T n a o (X) = f 1 (X, T )... f m (X, T ) with f j (0, T ) = (T w j ) ν j That is, f j (X, T ) = (T w j ) ν j mod X
8 Proof: In Hensel II, take R = C[[X]][T ], π = X, and Garrett b 1 = (T w 1 ) ν 1 c 1 = (T w 2 ) ν 2... (T w m ) ν m An equality of polynomials g(x) = h(x) mod X is equality of complex numbers g(0) = h(0). Since w 1 is distinct from w 2,..., w m, there are r 1, r 2 in the PID C[T ] such that r 1 b 1 + r 2 c 1 = 1, so certainly Rb 1 + Rc 1 + Rπ = R. By Hensel II, f(x, T ) = g(x, T ) h(t, X) (in C[[X]][T ]) and g(x, T ) = (T w 1 ) ν 1 mod X h(x, T ) = (T w 2 ) ν 2... (T w m ) ν m mod X Since 1 + c 1 X +... C[[X]], we can make g, h monic in T. Induction on m. ///
9 Garrett Corollary: Unless f(0, w) = 0 has just a single (distinct) root in C, f(x, T ) has a proper factor in C[[X]][T ]. /// That is, over scalars C[[X]], the irreducible factors of f(x, T ) are (factors of) the groupings-by-distinct-factors mod X. Now consider w 1 = 0, and f(x, T ) = T n mod X. That is, f(x, T ) is of the form f(x, T ) = T n + X a n 1 (X) T n X a o (X) In the simplest case a o (0) 0, Eisenstein s criterion in C[[X]][T ] gives irreducibility of f(x, T ). Let s consider this case.
10 Garrett Extend C[[X]] by adjoining X 1/n. Replacing T by X 1/n T, the polynomial becomes X T n n X n an 1 (X) T n X 1+ 1 n a1 (X) T + Xa o (X) Taking out the common factor of X gives T n + (X 1/n ) n 1 a n 1 (X) T n X 1/n a 1 (X) T + a o (X) Mod X 1/n, this is T n a o (0) = T n + a o (0) mod X 1/n For a o (0) 0, w n + a o (0) = 0 has distinct linear factors in C. By the Hensel paraphrase, f(x, X 1/n T ) factors into linear factors in C[[X 1/n ]][T ]. We re done in this case: the field extension is C((X))(Y ) = C((X 1/n ))
11 Garrett Example: To warm up to Newton polygons and the general case, consider (T X 1/3 ) 3 (T X 1/2 ) 2. Write ord(x a/b ) = a/b. The symmetric functions of roots have ords ord σ 1 = ord(3x 1/3 + 2X 1/2 ) = 1 3 ord σ 2 = ord(3x X X ) = 2 3 ord σ 3 = ord(x X X ) = 1 ord σ 4 = ord(2x X ) = 3 2 ord σ 5 = ord(x ) = 2 That is, the increments in ord σ l are 1 3, 1 3, 1 3, 1 2, 1 2.
12 Garrett Variant: Varying the example, take f(x, T ) = (T z 1 X 1 3 )(T z2 X 1 3 (T z3 X 1 3 (T z4 X 1 2 )(T z5 X 1 2 ) with non-zero z i C. Now we mostly have inequalities for ords: ord σ 1 = ord((z 1 + z 2 + z 3 )X 1/3 + (z 4 + z 5 )X 1/2 ) 1 3 ord σ 2 = ord((z 1 z )X (...)X z 4 z 5 X ) 2 3 ord σ 3 = ord(z 1 z 2 z 3 X (...)X X ) = 1 ord σ 4 = ord(z 1 z 2 z 3 (z 4 + z 5 )X (...)X ) 3 2 ord σ 5 = ord(z 1 z 2 z 3 z 4 z 5 X ) = 2
13 Garrett A stark example of the latter is f(x, T ) = T 5 XT 2 + X 2 The crucial mechanism is that the smallest ord is 1/3, and replacing T by X 1/3 T will distinguish the two sizes of roots: f(x, X 1/3 T ) = X 5 3 T 5 X 5 3 T 2 + X 2 Dividing through by X 5/3 gives T 5 T 2 + X 1 3 Mod X 1 3, this has 3 non-zero factors, and 2 zero factors, so by Hensel II factors properly into cubic and quadratic.
14 Garrett More generally, consider f(x, T ) = (T X 1/e 1 ) ν 1... (T X 1/e m ) ν m (with 1 e e m ) By the ultrametric inequality, ord(σ l ) ord ( sum of ords of the l smallest-ord zeros ) l 1 e 1 for 1 l ν 1 ν 1 e 1 + (l ν 1 ) 1 e 2 for ν 1 l ν 1 + ν 2 ν 1 e 1 + ν 2 e 2 + (l ν 1 ν 2 ) 1 e 3 for ν 1 + ν 2 l ν 1 + ν 2 + ν with equality at l = 0, ν 1, ν 1 + ν 2,..., ν ν m.
15 Garrett Since 1 e e m, the convex hull (downward) of the points (l, ord σ l ) has boundary the polygon of lines connecting the points in R 2 (0, 0) (ν 1, ν 1 e 1 ) = (ν 1, ord σ ν1 ) (ν 1 + ν 2, ν 1 e 1 + ν 2 e 2 ) = (ν 1 + ν 2, ord σ ν1 +ν 2 )... (ν ν m, ν 1 e ν m em ) = (ν ν m, ord σ ν1 +...ν m ) This convex hull is the Newton polygon of the polynomial. For f(x, T ) C[[X]][T ], the ords are in Z. Eisenstein s criterion is the case ν 1 = n, and ord σ n = 1, and all the exponents are 1/n.
16 Garrett The general case was reduced to f(x, T ) = T n a o (X) with an n-fold multiple zero w o at X = 0. Replacing T by T + w o, without loss of generality, this root is 0, so a j (0) = 0 for all j. Replace T by X ρ T with ρ the slope of the first segment from (0, 0) to (l, ord σ l ) on the Newton polygon. That is, disregard any (l, ord σ l ) with l < l lying above that segment. Replacing T by X ρ T and dividing through by X nρ gives T n a n l(x) X lρ T n l +... The Newton polygon says the ord of the coefficient of T j for n j > n l is non-negative, at T n l the ord is 0, and for n l > j it is strictly positive.
17 Garrett That is, mod X, f(0, T ) = T n b n l (0) T n l }{{} non zero Thus, f(0, w) = 0 has l non-zero complex roots, and n l roots 0. Hensel II says that there are degree l factor and degree n l factors in C[[X ρ ]][T ]. Note that C[[X ρ ]] C[[X]], so the argument can be repeated. Induction on degree. ///
Garrett Z p. Few explicit parametrizations of algebraic closures of fields are known: not Q, for sure. But we do also know
Garrett 0-2-20 Examples (cont d): Function fields in one variable... as algebraic parallels to Z and Q. Theorem: All finite field extensions of C((X z)) are by adjoining solutions to Y e = X z for e =
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 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 informationGauss s Theorem. Theorem: Suppose R is a U.F.D.. Then R[x] is a U.F.D. To show this we need to constuct some discrete valuations of R.
Gauss s Theorem Theorem: Suppose R is a U.F.D.. Then R[x] is a U.F.D. To show this we need to constuct some discrete valuations of R. Proposition: Suppose R is a U.F.D. and that π is an irreducible element
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
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 UFD. Therefore
More informationSection IV.23. Factorizations of Polynomials over a Field
IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent
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 informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More informationLocal Parametrization and Puiseux Expansion
Chapter 9 Local Parametrization and Puiseux Expansion Let us first give an example of what we want to do in this section. Example 9.0.1. Consider the plane algebraic curve C A (C) defined by the equation
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 informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationQuadratic reciprocity (after Weil) 1. Standard set-up and Poisson summation
(December 19, 010 Quadratic reciprocity (after Weil Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ I show that over global fields k (characteristic not the quadratic norm residue symbol
More informationHomework 10 M 373K by Mark Lindberg (mal4549)
Homework 10 M 373K by Mark Lindberg (mal4549) 1. Artin, Chapter 11, Exercise 1.1. Prove that 7 + 3 2 and 3 + 5 are algebraic numbers. To do this, we must provide a polynomial with integer coefficients
More informationp-adic fields Chapter 7
Chapter 7 p-adic fields In this chapter, we study completions of number fields, and their ramification (in particular in the Galois case). We then look at extensions of the p-adic numbers Q p and classify
More informationPart IX. Factorization
IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18. PIDs Definition 1 A principal ideal domain (PID) is an integral
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going
More informationAlgebra. Pang-Cheng, Wu. January 22, 2016
Algebra Pang-Cheng, Wu January 22, 2016 Abstract For preparing competitions, one should focus on some techniques and important theorems. This time, I want to talk about a method for solving inequality
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More informationDiscrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:
Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
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 information9. Integral Ring Extensions
80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications
More informationQuadratic reciprocity (after Weil) 1. Standard set-up and Poisson summation
(September 17, 010) Quadratic reciprocity (after Weil) Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ I show that over global fields (characteristic not ) the quadratic norm residue
More informationPolynomial Rings. (Last Updated: December 8, 2017)
Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters
More informationMath 121 Homework 2 Solutions
Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationZEROES OF INTEGER LINEAR RECURRENCES. 1. Introduction. 4 ( )( 2 1) n
ZEROES OF INTEGER LINEAR RECURRENCES DANIEL LITT Consider the integer linear recurrence 1. Introduction x n = x n 1 + 2x n 2 + 3x n 3 with x 0 = x 1 = x 2 = 1. For which n is x n = 0? Answer: x n is never
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 31, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Symbolic Adjunction of Roots When dealing with subfields of C it is easy to
More informationRINGS: SUMMARY OF MATERIAL
RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More information1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism
1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
More informationAlgebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...
Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2
More informationAn Approach to Hensel s Lemma
Irish Math. Soc. Bulletin 47 (2001), 15 21 15 An Approach to Hensel s Lemma gary mcguire Abstract. Hensel s Lemma is an important tool in many ways. One application is in factoring polynomials over Z.
More informationA CONSTRUCTION FOR ABSOLUTE VALUES IN POLYNOMIAL RINGS. than define a second approximation V 0
A CONSTRUCTION FOR ABSOLUTE VALUES IN POLYNOMIAL RINGS by SAUNDERS MacLANE 1. Introduction. An absolute value of a ring is a function b which has some of the formal properties of the ordinary absolute
More informationFields and Galois Theory. Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory.
Fields and Galois Theory Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory. This should be a reasonably logical ordering, so that a result here should
More informationx = π m (a 0 + a 1 π + a 2 π ) where a i R, a 0 = 0, m Z.
ALGEBRAIC NUMBER THEORY LECTURE 7 NOTES Material covered: Local fields, Hensel s lemma. Remark. The non-archimedean topology: Recall that if K is a field with a valuation, then it also is a metric space
More informationChapter 14: Divisibility and factorization
Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter
More informationLecture 6.3: Polynomials and irreducibility
Lecture 6.3: Polynomials and irreducibility Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationAlgebra Ph.D. Preliminary Exam
RETURN THIS COVER SHEET WITH YOUR EXAM AND SOLUTIONS! Algebra Ph.D. Preliminary Exam August 18, 2008 INSTRUCTIONS: 1. Answer each question on a separate page. Turn in a page for each problem even if you
More informationMath 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d
Math 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).
More informationLocal Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments
Chapter 9 Local Fields The definition of global field varies in the literature, but all definitions include our primary source of examples, number fields. The other fields that are of interest in algebraic
More informationCHAPTER 10: POLYNOMIALS (DRAFT)
CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
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 informationGalois Theory, summary
Galois Theory, summary Chapter 11 11.1. UFD, definition. Any two elements have gcd 11.2 PID. Every PID is a UFD. There are UFD s which are not PID s (example F [x, y]). 11.3 ED. Every ED is a PID (and
More informationPage Points Possible Points. Total 200
Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10
More informationFormal groups. Peter Bruin 2 March 2006
Formal groups Peter Bruin 2 March 2006 0. Introduction The topic of formal groups becomes important when we want to deal with reduction of elliptic curves. Let R be a discrete valuation ring with field
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 informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
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 informationMTH310 EXAM 2 REVIEW
MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not
More informationTheorems of Sylvester and Schur
Theorems of Sylvester and Schur T.N. Shorey An old theorem of Sylvester states that a product of consecutive positive integers each exceeding is divisible by a prime greater than. We shall give a proof
More informationAbsolute Values and Completions
Absolute Values and Completions B.Sury This article is in the nature of a survey of the theory of complete fields. It is not exhaustive but serves the purpose of familiarising the readers with the basic
More informationP -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS. Tomislav Pejković
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 20 = 528 2016): 9-18 P -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS Tomislav Pejković Abstract. We study p-adic root separation for quadratic and cubic
More informationOSTROWSKI S THEOREM FOR Q(i)
OSTROWSKI S THEOREM FOR Q(i) KEITH CONRAD We will extend Ostrowki s theorem from Q to the quadratic field Q(i). On Q, every nonarchimedean absolute value is equivalent to the p-adic absolute value for
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationCommutative Algebra and Algebraic Geometry. Robert Friedman
Commutative Algebra and Algebraic Geometry Robert Friedman August 1, 2006 2 Disclaimer: These are rough notes for a course on commutative algebra and algebraic geometry. I would appreciate all suggestions
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 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 informationHypersurfaces and the Weil conjectures
Hypersurfaces and the Weil conjectures Anthony J Scholl University of Cambridge 13 January 2010 1 / 21 Number theory What do number theorists most like to do? (try to) solve Diophantine equations x n +
More informationCDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018
CDM Finite Fields Klaus Sutner Carnegie Mellon University Fall 2018 1 Ideals The Structure theorem Where Are We? 3 We know that every finite field carries two apparently separate structures: additive and
More informationParity of the Number of Irreducible Factors for Composite Polynomials
Parity of the Number of Irreducible Factors for Composite Polynomials Ryul Kim Wolfram Koepf Abstract Various results on parity of the number of irreducible factors of given polynomials over finite fields
More informationPolynomials with nontrivial relations between their roots
ACTA ARITHMETICA LXXXII.3 (1997) Polynomials with nontrivial relations between their roots by John D. Dixon (Ottawa, Ont.) 1. Introduction. Consider an irreducible polynomial f(x) over a field K. We are
More informationProof. The sufficiency has already been noted, so the only issue is necessity. Consider the binomial theorem
Math 676. Some basics concerning absolute values A remarkable unification of congruential and Euclidean-space methods in number theory is achieved through the systematic use of absolute values (and completions
More informationContinuing the pre/review of the simple (!?) case...
Continuing the pre/review of the simple (!?) case... Garrett 09-16-011 1 So far, we have sketched the connection between prime numbers, and zeros of the zeta function, given by Riemann s formula p m
More informationTOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction
TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
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 informationMAT 535 Problem Set 5 Solutions
Final Exam, Tues 5/11, :15pm-4:45pm Spring 010 MAT 535 Problem Set 5 Solutions Selected Problems (1) Exercise 9, p 617 Determine the Galois group of the splitting field E over F = Q of the polynomial f(x)
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationIntegral Bases. 1. Resultants
. Resultants Integral Bases Suppose f and g are polynomials in one or more variables including x) with integer coefficients. Say f = A 0 x m + A x m + + A m, g = B 0 x n + B x n + + B n, with A 0,...,
More informationABSTRACT NEWTON POLYGONS ON P-ADIC NUMBER FIELDS. Jacek Teller. April, 2012
ABSTRACT NEWTON POLYGONS ON P-ADIC NUMBER FIELDS by Jacek Teller April, 2012 Chair: Dr. Zachary Robinson Major Department: Mathematics This thesis offers a clear introduction to p-adic number fields, and
More informationA few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in
A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough
More informationX. Numerical Methods
X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced
More informationHigher Hasse Witt matrices. Masha Vlasenko. June 1, 2016 UAM Poznań
Higher Hasse Witt matrices Masha Vlasenko June 1, 2016 UAM Poznań Motivation: zeta functions and periods X/F q smooth projective variety, q = p a zeta function of X: ( Z(X/F q ; T ) = exp m=1 #X(F q m)
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationSchool of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information
MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon
More informationLocal properties of plane algebraic curves
Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying
More informationGalois Theory Overview/Example Part 1: Extension Fields. Overview:
Galois Theory Overview/Example Part 1: Extension Fields I ll start by outlining very generally the way Galois theory works. Then, I will work through an example that will illustrate the Fundamental Theorem
More informationSTEP Support Programme. Pure STEP 1 Questions
STEP Support Programme Pure STEP 1 Questions 2012 S1 Q4 1 Preparation Find the equation of the tangent to the curve y = x at the point where x = 4. Recall that x means the positive square root. Solve the
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 14.2 Exercise 3. Determine the Galois group of (x 2 2)(x 2 3)(x 2 5). Determine all the subfields
More informationContents Lecture 1 2 Norms 2 Completeness 4 p-adic expansions 5 Exercises to lecture 1 6 Lecture 2 7 Completions 7 p-adic integers 7 Extensions of Q
p-adic ANALYSIS, p-adic ARITHMETIC Contents Lecture 1 2 Norms 2 Completeness 4 p-adic expansions 5 Exercises to lecture 1 6 Lecture 2 7 Completions 7 p-adic integers 7 Extensions of Q p 10 Exercises to
More informationFACTORIZATION OF IDEALS
FACTORIZATION OF IDEALS 1. General strategy Recall the statement of unique factorization of ideals in Dedekind domains: Theorem 1.1. Let A be a Dedekind domain and I a nonzero ideal of A. Then there are
More informationThe Weil bounds. 1 The Statement
The Weil bounds Topics in Finite Fields Fall 013) Rutgers University Swastik Kopparty Last modified: Thursday 16 th February, 017 1 The Statement As we suggested earlier, the original form of the Weil
More informationRemarks on semi-algebraic functions
Remarks on semi-algebraic functions Seiichiro Wakabayashi April 5 2008 the second version on August 30 2010 In this note we shall give some facts and remarks concerning semi-algebraic functions which we
More informationRATIONALITY OF ZETA FUNCTIONS OVER FINITE FIELDS
RATIONALITY OF ZETA FUNCTIONS OVER FINITE FIELDS SUN WOO PARK Abstract. The zeta function of an affine variety over a finite field contains comprehensive information on the number of points of the variety
More information1 Absolute values and discrete valuations
18.785 Number theory I Lecture #1 Fall 2015 09/10/2015 1 Absolute values and discrete valuations 1.1 Introduction At its core, number theory is the study of the ring Z and its fraction field Q. Many questions
More information