On a Theorem of Dedekind
|
|
- Geoffrey Fowler
- 5 years ago
- Views:
Transcription
1 On a Theorem of Dedekind Sudesh K. Khanduja, Munish Kumar Department of Mathematics, Panjab University, Chandigarh , India. skhand@pu.ac.in, msingla79@yahoo.com Abstract Let K = Q(θ) be an algebraic number field with θ in the ring A K of algebraic integers of K and f(x) be the minimal polynomial of θ over the field Q of rational numbers. For a rational prime p, let f(x) = ḡ 1 (x) e 1...ḡ r (x) er be the factorization of the polynomial f(x) obtained by replacing each coefficient of f(x) modulo p into product of powers of distinct monic irreducible polynomials over Z/pZ. Dedekind proved that if p does not divide [A K : Z[θ]], then the factorization of pa K as a product of powers of distinct prime ideals is given by pa K = p e p e r r, with p i = pa K + g i (θ)a K, and residual degree f(p i /p) = deg ḡ i (x). In this paper we prove that if the factorization of a rational prime p in A K satisfies the above mentioned three properties, then p does not divide [A K : Z[θ]]. Indeed the analogue of the converse is proved for general Dedekind domains. The method of proof leads to a generalization of one more result of Dedekind which characterizes all rational primes p dividing the index of K Subject Classification No: 11Y05, 11S15. Key words and phrases: Factorization of prime ideals, Ramification and extension theory. All correspondence may be addressed to this author. 1
2 1. Introduction. Let K = Q(θ) be an algebraic number field with θ in the ring A K of algebraic integers of K and f(x) be the minimal polynomial of θ over the field Q of rational numbers. The problem of establishing effectively the decomposition of a rational prime p in A K using the decomposition of f(x) modulo p goes back to Kummer. For a rational prime p, let f(x) = ḡ 1 (x) e 1...ḡ r (x) e r be the factorization of the polynomial f(x) obtained by replacing each coefficient of f(x) modulo p into product of powers of distinct irreducible polynomials over Z/pZ with g i (x) monic. In 1878, Dedekind [1] proved that if p does not divide [A K : Z[θ]], then pa K = p e p e r r, where p 1,..., p r are distinct prime ideals of A K, p i = pa K + g i (θ)a K with residual degree f(p i /p) = deg ḡ i (x). Dedekind also characterized those primes p which divide the index of Z[θ] in A K (henceforth referred to as index of θ) for all generating elements θ in A K of the extension K/Q. In this direction, he proved the following theorem (cf. [1], [6, Theorem 4.34]). Theorem A. Let K be an algebraic number field. Let i(k) denote the greatest common divisor of the indices of all generating elements in A K of the extension K/Q. A rational prime p divides i(k) if and only if for some natural number f, the number of prime ideals of A K lying over p with residual degree f, is strictly greater than the number of monic irreducible polynomials of degree f over the field with p elements. It can be easily verified that for a generating element θ of K/Q, a rational prime p does not divide the index of θ if and only if A K Z (p) [θ], Z (p) being the localization of Z at the prime ideal pz. Keeping this in mind, the theorem stated below is a generalization of the result of Dedekind stated in the opening lines of the paper (see [2, Chapter I, Theorem 7.4]). 2
3 Theorem B. Let R be a Dedekind domain with field of fractions K. Let L be a finite separable extension of K and S be the integral closure of R in L. Let f(x) in R[x] be the minimal polynomial of a generating element θ S of L/K. Let p be a non-zero prime ideal of R, R p be the localization of R at p and S p be the integral closure of R p in L. Let f(x) = ḡ 1 (x) e 1...ḡ r (x) e r be the factorization of the polynomial f(x) obtained by replacing each coefficient of f(x) modulo p into powers of distinct irreducible polynomials over R/p with each g i (x) monic. If S p = R p [θ], then ps = e er r, i = ps + g i (θ)s, f( i /p) = deg g i (x) (1) with 1,..., r distinct prime ideals of S. The following question naturally arises. Does the result of Theorem B hold with a hypothesis weaker than S p = R p [θ]? In this paper, it is shown that the answer to the above question is the negative. Indeed we prove Theorem 1.1. Let R, S, p, f(x) and g 1 (x),..., g r (x) be as in Theorem B. If ps = e er r is the factorization of ps into powers of distinct prime ideals of S with i = ps + g i (θ)s and f( i /p) = deg g i (x), then S p = R p [θ]. Let f(x) = ḡ 1 (x) e 1...ḡ r (x) er be as in Theorem B. Then there exists a polynomial M(x) with coefficients in the localization R p of R at the prime ideal p such that f(x) = g 1 (x) e 1...g r (x) e r + π 0 M(x), where π 0 is a prime element of R p. It has been recently proved (as a generalization of the well known Dedekind Criterion stated in [5]) that the condition S p = R p [θ] is the same as saying that for each i, 1 i r, either e i = 1 or ḡ i (x) does not divide M(x) (see [3]). It may be pointed out that as shown in Lemma 2.1, the condition S p = R p [θ] is equivalent to saying that p does not divide N L/K (C θ ), where the conductor C θ of 3
4 R[θ] is defined by C θ = {x R[θ] xs R[θ]}. (2) Using the method of proof of Theorem 1.1, we have extended Theorem A to all Dedekind domains with finite norm property. We shall denote by i S/R the greatest common divisor of the ideals N L/K (C θ ), where θ runs over all generating elements belonging to S of the extension L/K and C θ is as defined by (2). In section 3, the following theorem is proved. Theorem 1.2. Let R be a Dedekind domain with finite norm property having quotient field K and S be the integral closure of R in a finite separable extension L of K. Let p be a non-zero prime ideal of R with factorization e e t t as a product of powers of distinct prime ideals of S. Then p does not divide i S/R if and only if there exist distinct monic irreducible polynomials V 1,..., V t over R/p satisfying deg V i = residual degree of i /p for 1 i t. It may be remarked that in the particular case when K = Q(θ) is an algebraic number field with discriminant d K and f(x) is the minimal polynomial of θ over Q, then as is well known (see [6, Proposition 4.18]) N K/Q (C θ ) = N K/Q(f (θ)) d K Z = [A K : Z[θ]] 2 Z; consequently i AK /Z is the ideal of Z generated by i(k) 2 and hence Theorem 1.2 indeed generalizes Theorem A. We shall apply Theorem 1.2 to obtain the following results, the analogues of which are already known for absolute extensions K/Q (cf. [6, Proposition 4.36]). Theorem 1.3. Let R, S, K, L be as in Theorem 1.2 and p be a non-zero prime ideal of R. If p divides i S/R, then R/p < [L : K]. 4
5 Corollary 1.4. With R, S, K, L as above, assume in addition that L/K is a cubic extension. If p is a prime ideal of R dividing i S/R, then R/p = 2. A prime ideal p of R divides i S/R if and only if ps is a product of three distinct prime ideals of S. 2. Proof of Theorem 1.1. In what follows, R is a Dedekind domain with quotient field K and S the integral closure of R in finite separable extension L of K of degree n, p is a non-zero prime ideal of R and R p, S p are as in Theorem B. The following lemma is already known (cf. [6, Lemma 4.32]). For reader s convenience, we prove it here. Lemma 2.1. Let θ belonging to S be a generating element of L/K and C θ be the conductor of R[θ] defined by (2). The following conditions are equivalent for a non-zero prime ideal p of R. (i) S p = R p [θ]; (ii) p does not divide the ideal N L/K (C θ ); (iii) ps R[θ] = p[θ]. Proof. It is known that S is a finite R-module (cf. [7, Chapter I, p. 45]). Let {u 1,..., u m } be a system of generators of S as an R-module. (i) (ii) Keeping in mind the assumption S p = R p [θ], we can write n 1 u i = a ij θ j, a ij R p, 1 i m, 0 j n 1. j=0 So there exists c R\p such that cu i R[θ] for 1 i m. Hence cs R[θ]. As c belongs to C θ (R\p), it follows that N L/K (C θ ) is not divisible by p, which proves that (i) (ii). (ii) (i) We first show that C θ R p. (3) 5
6 Write C θ = Q a Q as s as a product of powers of distinct prime ideals of S. Let q i denote the prime ideal of R lying below Q i. By our assumption, p does not divide N L/K (C θ ) and thus none of the q i is p. As C θ R contains (and hence divides) q a q as s, it follows that p does not divide C θ R, which proves (3). So we can choose an element c belonging to C θ R which does not belong to p. Recall that {u 1,..., u m } is a system of generators of S as an R-module. By choice, c belongs to C θ \p, therefore the elements cu i R[θ] and thus u i R p [θ] for 1 i m. This proves that S R p [θ] and hence S p = R p [θ] as desired. (iii) (i) Let v p denote the discrete valuation of K with valuation ring R p. Suppose to the contrary that (i) does not hold. Then there exists ξ = a i θ i S, a i n 1 K such that ξ does not belong to R p [θ]. So there exists an index i for which a i does not belong to R p, i.e., min{v p (a i )} < 0. Let b p be such that i v p (b) = min i {v p (a i )} = v p (a j ) (say). n 1 Then bξ = a i bθ i belongs to R p [θ] and v p (a j b) = 0. Choose c R\p such that i=0 n 1 a i bc R for all i, then a j bc R\p. Recall that b p, so bcξ = a i bcθ i ps R[θ] but does not belong to p[θ], which contradicts (iii). This completes the proof of (iii) (i). n 1 (i) (iii) Clearly p[θ] ps R[θ]. To prove equality, let η = a i θ i, a i R be an element of ps R[θ]. By hypothesis S R p [θ], so η pr p [θ]; consequently a i pr p R = p for each i. Proof of Theorem 1.1. In view of the hypothesis i = ps + g i (θ)s, it is clear that if e i > 1, then 2 i does not divide g i (θ)s. In case e i = 1 and 2 i divides g i (θ)s, then on replacing g i (x) by g i (x) + π 0, where π 0 p\p 2, we may assume without loss of generality that 2 i g i (θ)s, 1 i r. 6 i=0 i=0 i=0
7 Suppose to the contrary that S p R p [θ]. Then by Lemma 2.1, p[θ] ps R[θ]. So there exists a polynomial T (x) R[x], deg T (x) n 1, n = [L : K] (4) such that T (θ) ps but T (θ) does not belong to p[θ]. In particular, the polynomial T (x) with coefficients in R/p is non-zero. Set F (x) = g 1 (x) e 1...g r (x) er. It follows from (1) that F (θ) 0(mod ps). (5) Let D(x) denote the g.c.d. of F (x) and T (x). Write D(x) = r ḡ i (x) d i, 0 d i e i. (6) i=1 There exist polynomials A(x), B(x) in R[x] and C(x) p[x] such that A(x)F (x) + B(x)T (x) = D(x) + C(x). Substituting x = θ in the above equation and keeping in mind (5) as well as the fact T (θ) 0(mod ps), we have D(θ) 0(mod ps). (7) It follows from (6) and (7) that r g i (θ) d i 0(mod ps). (8) i=1 Note that for i j, j and g i (θ)s are coprime, for otherwise j divides g i (θ)s+ps = i which is not so. It now follows from (8) and the factorization of ps that e i i divides g i (θ) d i S. As assumed in the opening lines of the proof, 2 i does not divide g i (θ)s. Therefore d i e i for 1 i r, which together with (6) gives, d i = e i and consequently deg D(x) = deg F (x) = n. But D(x) being the g.c.d. of F (x) and 7
8 T (x) has degree not exceeding n 1 by virtue of (4). This contradiction proves that S p = R p [θ]. 3. Proof of Theorems 1.2, 1.3 and Corollary 1.4. Proof of Theorem 1.2. Let n i denote the residual degree of i /p. If a non-zero prime ideal p of R does not divide i S/R, then there exists a generating element θ for the extension L/K such that p does not divide N L/K (C θ ); consequently S p = R p [θ] in view of Lemma 2.1. Theorem B then proves the existence of distinct monic irreducible polynomials over R/p of degrees n 1,..., n t. To prove the converse, suppose there exist distinct monic irreducible polynomials V 1 (x),..., V t (x) over R/p with deg V i = n i. We have to find a generating element θ S, such that p does note divide N L/K (C θ ). Let g i (x) R[x] be a monic polynomial such that ḡ i (x) = V i (x). Since R has finite norm property, the finite field R/p has only one extension S/ i of degree n i. Hence every irreducible polynomial over R/p of degree n i has a root in S/ i. Therefore there exists an element θ i S such that g i (θ i ) 0(mod i ). Since R/p is a perfect field, an irreducible polynomial over R/p cannot have multiple roots, so g i(θ i ) does not belong to i. If g i (θ i ) 2 i for some i, then replacing θ i by θ i + π i with π i i \ 2 i and keeping in mind that g i (θ i + π i ) = g i (θ i ) + π i g i(θ i ) + π2 i 2! g i (θ i ) +..., we see that g i (θ i + π i ) does not belong to 2 i. So it can be assumed without loss of generality that g i (θ i ) does not belong to 2 i. By Chinese Remainder Theorem, there exists ξ S satisfying ξ θ i (mod 2 i ) for 1 i t. Choose η S such that L = K(ξ, η). Let l, m denote the degrees of extensions of K(ξ)/K and L/K(ξ) respectively. Let ξ = ξ (1),..., ξ (l) be the K conjugates of ξ and η = η (1),..., η (m) be the K(ξ) conjugates of η. Choose a non-zero element a of p 2 which is different from ξ(i) ξ (i ) η (j ) η (j) for 1 i i l, 1 j j m; this is possible because R and hence p 2 is infinite. Then ξ (i) + aη (j), 1 i l, 1 j m 8
9 are distinct. Thus θ = ξ + aη has lm distinct K-conjugates. So θ generates the extension L/K and θ ξ θ i (mod 2 i ), 1 i t. It will be shown that p does not divide N L/K (C θ ). Set P i = ps + g i (θ)s, we first prove that i = P i = ps + g i (θ)s. (9) It is clear that i divides P i but 2 i does not divide P i (because g i (θ) does not belong to 2 i ). Moreover for i j we have j does not divide P i, since otherwise we would have g i (θ) 0(mod j ) which would give g i (θ j ) 0(mod j ). But in view of g j (θ j ) 0(mod j ), ḡ i (x) and ḡ j (x) would have a common root in S/ j, which is not possible, since they are relatively prime. As P i divides ps, therefore P i is not divisible by prime ideals different from 1,..., t and so i = P i = ps + g i (θ)s, 1 i t. Set F (x) = g 1 (x) e 1...g t (x) et. Using (9) and proceeding exactly as in the proof of Theorem 1.1, one can show that the assumption S p R p [θ] leads to a contradiction. Thus p does not divide N L/K (C θ ) in view of Lemma 2.1. Proof of Theorem 1.3. Let q, n denote respectively the number of elements of R/p and the degree of the extension L/K. Let r q (m) stand for the number of monic irreducible polynomials of degree m over the finite field R/p. It is known that [4, Chapter VII, Exercise 22] r q (m) = 1 µ(d)q m/d (10) m d m where µ is the Möbius function. Since a finite field has irreducible polynomials of all degrees, the sum µ(d)q m/d on the right hand side of (10) is positive and divisible d m by q, so r q (m) q m. (11) 9
10 Observe that for any k, 1 k n, in view of the fundamental equality (see [6, Theorem 4.1]), there are atmost n/k prime ideals of S dividing p which have residual degree k. Let p be a prime ideal dividing i S/R. So by Theorem 1.2, there exists a number k, 1 k n such that r q (k) is strictly less than the number of prime ideals of S lying over p with residual degree k, which is less than or equal to n/k in view of the above observation. It now follows from (11) that and hence q < n as desired. q k r q(k) < n k Proof of Corollary 1.4. Applying Theorem 1.3, we see that if p divides i S/R, then R/p < 3. Keeping in mind that there are only two linear monic irreducible polynomials over the field of two elements and the fact that a finite field has irreducible polynomials of each degree, the second assertion immediately follows from Theorem 1.2. Acknowledgements. The problem dealt with in the paper originated during discussions with Professor Kaori Ota while the second author was visiting Department of Mathematics, Tsuda College, Tokyo. The authors are highly thankful to Professor Kaori Ota, Chairperson, Department of Mathematics, Tsuda College for constructive suggestions. The financial support and hospitality by this college are gratefully acknowledged. The research of the second author is partially supported by National Board for Higher Mathematics, Department of Atomic Energy, India. References [1] R. Dedekind, Über den Zusammenhang zwischen der Theorie der Ideale und der Theorie der höheren Kongruenzen, Göttingen Abhandlungen, 23 (1878) [2] J. Janusz, Algebraic Number Fields, Volume 7, 2nd ed., (American Mathematical Society, 1996). [3] S. K. Khanduja and M. Kumar, A Generalization of Dedekind Criterion, Communications in Algebra 35(2007) [4] S. Lang, Algebra, 2nd ed., (Addison-Wesley publishing company, Inc., 1984). [5] J. Montes and E. Nart, On a Theorem of Ore, J. Algebra 146(1992) [6] W. Narkiewicz, Elementary and Analytic Theory of Algebraic Numbers, 3nd ed., (Springer-Verlag, Polish Scientific Publishers, 2004). [7] J. Neukirch, Algebraic Number Theory, (Springer-Verlag, Berlin Heidelberg, 1999). 10
Mathematical 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 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 informationA Note on Cyclotomic Integers
To the memory of Alan Thorndike, former professor of physics at the University of Puget Sound and a dear friend, teacher and mentor. A Note on Cyclotomic Integers Nicholas Phat Nguyen 1 Abstract. In this
More informationA study of irreducible polynomials over henselian valued fields via distinguished pairs
A study of irreducible polynomials over henselian valued fields via distinguished pairs Kamal Aghigh, Department of Mathematics, K. N. Toosi University of Technology, Tehran, Iran aghigh@kntu.ac.ir, Anuj
More informationPrime Decomposition. Adam Gamzon. 1 Introduction
Prime Decomposition Adam Gamzon 1 Introduction Let K be a number field, let O K be its ring of integers, and let p Z be a prime. Since every prime of O K lies over a prime in Z, understanding how primes
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 informationPolynomials. Chapter 4
Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationHamburger Beiträge zur Mathematik
Hamburger Beiträge zur Mathematik Nr. 712, November 2017 Remarks on the Polynomial Decomposition Law by Ernst Kleinert Remarks on the Polynomial Decomposition Law Abstract: we first discuss in some detail
More informationSolutions of exercise sheet 6
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1
More informationEXPLICIT INTEGRAL BASIS FOR A FAMILY OF SEXTIC FIELD
Gulf Journal of Mathematics Vol 4, Issue 4 (2016) 217-222 EXPLICIT INTEGRAL BASIS FOR A FAMILY OF SEXTIC FIELD M. SAHMOUDI 1 Abstract. Let L be a sextic number field which is a relative quadratic over
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 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 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 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 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 informationARITHMETIC IN PURE CUBIC FIELDS AFTER DEDEKIND.
ARITHMETIC IN PURE CUBIC FIELDS AFTER DEDEKIND. IAN KIMING We will study the rings of integers and the decomposition of primes in cubic number fields K of type K = Q( 3 d) where d Z. Cubic number fields
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 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 informationLagrange s polynomial
Lagrange s polynomial Nguyen Trung Tuan November 16, 2016 Abstract In this article, I will use Lagrange polynomial to solve some problems from Mathematical Olympiads. Contents 1 Lagrange s interpolation
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 informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationA 4 -SEXTIC FIELDS WITH A POWER BASIS. Daniel Eloff, Blair K. Spearman, and Kenneth S. Williams
A 4 -SEXTIC FIELDS WITH A POWER BASIS Daniel Eloff, Blair K. Spearman, and Kenneth S. Williams Abstract. An infinite family of monogenic sextic fields with Galois group A 4 is exhibited. 1. Introduction.
More informationLECTURE 4: GOING-DOWN THEOREM AND NORMAL RINGS
LECTURE 4: GOING-DOWN THEOREM AND NORMAL RINGS Definition 0.1. Let R be a domain. We say that R is normal (integrally closed) if R equals the integral closure in its fraction field Q(R). Proposition 0.2.
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 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 informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
More informationRamification Theory. 3.1 Discriminant. Chapter 3
Chapter 3 Ramification Theory This chapter introduces ramification theory, which roughly speaking asks the following question: if one takes a prime (ideal) p in the ring of integers O K of a number field
More informationComputation of a Power Integral Basis of a Pure Cubic Number Field
Int. J. Contemp. Math. Sci., Vol. 2, 2007, no. 13, 601-606 Computation of a Power Integral Basis of a Pure Cubic Number Field L houssain EL FADIL Faculté Polydisciplinaire de Ouarzazat Ouarzazat-Morocco
More informationPOWER INTEGRAL BASES IN A PARAMETRIC FAMILY OF TOTALLY REAL CYCLIC QUINTICS
MATHEMATICS OF COMPUTATION Volume 66, Number 220, October 1997, Pages 1689 1696 S 002-718(97)00868- POWER INTEGRAL BASES IN A PARAMETRIC FAMILY OF TOTALLY REAL CYCLIC QUINTICS Abstract. We consider the
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 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 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 informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
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 information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationGalois theory of fields
1 Galois theory of fields This first chapter is both a concise introduction to Galois theory and a warmup for the more advanced theories to follow. We begin with a brisk but reasonably complete account
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 informationEighth Homework Solutions
Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely
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 informationPERFECT POLYNOMIALS OVER F p WITH p + 1 IRREDUCIBLE DIVISORS. 1. Introduction. Let p be a prime number. For a monic polynomial A F p [x] let d
PERFECT POLYNOMIALS OVER F p WITH p + 1 IRREDUCIBLE DIVISORS L. H. GALLARDO and O. RAHAVANDRAINY Abstract. We consider, for a fixed prime number p, monic polynomials in one variable over the finite field
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 informationMathematical Journal of Okayama University
Mathematical Journal of Okayama University Volume 48, Issue 1 2006 Article 1 JANUARY 2006 On Euclidean Algorithm Kaoru Motose Hirosaki University Copyright c 2006 by the authors. Mathematical Journal of
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationHomework 4 Algebra. Joshua Ruiter. February 21, 2018
Homework 4 Algebra Joshua Ruiter February 21, 2018 Chapter V Proposition 0.1 (Exercise 20a). Let F L be a field extension and let x L be transcendental over F. Let K F be an intermediate field satisfying
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 informationA Weil bound free proof of Schur s conjecture
A Weil bound free proof of Schur s conjecture Peter Müller Department of Mathematics University of Florida Gainesville, FL 32611 E-mail: pfm@math.ufl.edu Abstract Let f be a polynomial with coefficients
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 informationAlgebraic Number Theory Notes: Local Fields
Algebraic Number Theory Notes: Local Fields Sam Mundy These notes are meant to serve as quick introduction to local fields, in a way which does not pass through general global fields. Here all topological
More informationAlgebraic Number Theory
TIFR VSRP Programme Project Report Algebraic Number Theory Milind Hegde Under the guidance of Prof. Sandeep Varma July 4, 2015 A C K N O W L E D G M E N T S I would like to express my thanks to TIFR for
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 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 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 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 7.5: Euclidean domains and algebraic integers
Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley
More informationChapter 4. Remember: F will always stand for a field.
Chapter 4 Remember: F will always stand for a field. 4.1 10. Take f(x) = x F [x]. Could there be a polynomial g(x) F [x] such that f(x)g(x) = 1 F? Could f(x) be a unit? 19. Compare with Problem #21(c).
More information8.6 Partial Fraction Decomposition
628 Systems of Equations and Matrices 8.6 Partial Fraction Decomposition This section uses systems of linear equations to rewrite rational functions in a form more palatable to Calculus students. In College
More information1, for s = σ + it where σ, t R and σ > 1
DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,
More information4 Unit Math Homework for Year 12
Yimin Math Centre 4 Unit Math Homework for Year 12 Student Name: Grade: Date: Score: Table of contents 3 Topic 3 Polynomials Part 2 1 3.2 Factorisation of polynomials and fundamental theorem of algebra...........
More informationMINKOWSKI THEORY AND THE CLASS NUMBER
MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationCHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998
CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic
More informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More informationChapter 4. Characters and Gauss sums. 4.1 Characters on finite abelian groups
Chapter 4 Characters and Gauss sums 4.1 Characters on finite abelian groups In what follows, abelian groups are multiplicatively written, and the unit element of an abelian group A is denoted by 1 or 1
More informationCover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/32076 holds various files of this Leiden University dissertation Author: Junjiang Liu Title: On p-adic decomposable form inequalities Issue Date: 2015-03-05
More informationEXTENSIONS OF ABSOLUTE VALUES
CHAPTER III EXTENSIONS OF ABSOLUTE VALUES 1. Norm and Trace Let k be a field and E a vector space of dimension N over k. We write End k (E) for the ring of k linear endomorphisms of E and Aut k (E) = End
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationMathematical Foundations of Cryptography
Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography
More informationMod p Galois representations of solvable image. Hyunsuk Moon and Yuichiro Taguchi
Mod p Galois representations of solvable image Hyunsuk Moon and Yuichiro Taguchi Abstract. It is proved that, for a number field K and a prime number p, there exist only finitely many isomorphism classes
More information7 Orders in Dedekind domains, primes in Galois extensions
18.785 Number theory I Lecture #7 Fall 2015 10/01/2015 7 Orders in Dedekind domains, primes in Galois extensions 7.1 Orders in Dedekind domains Let S/R be an extension of rings. The conductor c of R (in
More information+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4
Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number
More informationAlgebraic number theory
Algebraic number theory F.Beukers February 2011 1 Algebraic Number Theory, a crash course 1.1 Number fields Let K be a field which contains Q. Then K is a Q-vector space. We call K a number field if dim
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
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 informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
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 informationFinite Fields. Mike Reiter
1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements
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 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 informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationChapter 4 Finite Fields
Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number
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 informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
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 informationSolutions for Problem Set 6
Solutions for Problem Set 6 A: Find all subfields of Q(ζ 8 ). SOLUTION. All subfields of K must automatically contain Q. Thus, this problem concerns the intermediate fields for the extension K/Q. In a
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationFurther linear algebra. Chapter II. Polynomials.
Further linear algebra. Chapter II. Polynomials. Andrei Yafaev 1 Definitions. In this chapter we consider a field k. Recall that examples of felds include Q, R, C, F p where p is prime. A polynomial is
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 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 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 informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More informationRANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY
RANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY Christian Ballot Université de Caen, Caen 14032, France e-mail: ballot@math.unicaen.edu Michele Elia Politecnico di Torino, Torino 10129,
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 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 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 informationarxiv: v1 [math.gr] 3 Feb 2019
Galois groups of symmetric sextic trinomials arxiv:1902.00965v1 [math.gr] Feb 2019 Alberto Cavallo Max Planck Institute for Mathematics, Bonn 5111, Germany cavallo@mpim-bonn.mpg.de Abstract We compute
More information