Commutative Algebra seminar talk
|
|
- Edwin Sullivan
- 7 years ago
- Views:
Transcription
1 Commutative Algebra seminar talk Reeve Garrett May 22, Ultrafilters Definition 1.1 Given an infinite set W, a collection U of subsets of W which does not contain the empty set and is closed under finite intersection is called a filter. If U is a filter such that for all D W we have either D U or D c U, then we say U is an ultrafilter. Ultrafilters are precisely the maximal filters. We now fix an infinite set W and an arbitrary ultrafilter U for our discussion. Observation 1.2 Our definition has two easy consequences: (1) If D U and E D is arbitrary, then E U: indeed, if not, then E c U, meaning = D E c U, a contradiction. (2) If A B U, then A U or B U: indeed, if A / U and B / U, then A c U and B c U, so (A B) c = A c B c U, so = (A B) (A B) c U, a contradiction. Example 1.3 Take an ultrafilter U containing a finite set {a 1,..., a n }. Then, by repeatedly applying (2) above, we see that {a i } U for some i. Moreover, by (1), U is precisely defined to be all subsets of W containing a i. Thus, it makes sense to call such an ultrafilter principal. In most commutative algebra settings, we are not interested in principal ultrafilters because we like to operate under the assumption that ultrafilter sets and cofinite sets are big. In fact, an ultrafilter is nonprincipal if and only if it contains all cofinite sets (and thus, necessarily, all ultrafilter sets are infinite). Henceforth, in this section and all remaining sections, we will abide by the convention that any ultrafilter considered is nonprincipal, unless otherwise noted. Remark 1.4 Ultrafilters provide us with a decision procedure on the collection of subsets of W : those in U are large, and those not in U are small. More precisely, defining a nonprincipal ultrafilter U is equivalent to defining a finitely (but not countably) additive measure m on W taking values in {0, 1}, where m(a) = 1 if and only if A U and m(a) = 0 if and only if A / U. In this case, we may say that if a property holds for an ultrafilter set, then it holds almost everywhere. To conclude this section, we state and prove a simple but important lemma. Lemma 1.5 [1, Corollary A.2] Given an infinite set W and an infinite subset V of W, there exists a nonprincipal ultrafilter F on W such that V F. Proof. If V is cofinite, then use any ultrafilter containing the cofinite subsets (which is necessarily nonprincipal), which we apply Zorn s lemma to construct. If not, then clearly we can construct the filter F of all subsets of W containing V and apply Zorn s lemma to the family of all filters containing F. 2 The Ultrafilter Topology on the Spectrum of a Commutative Ring Let R be a commutative ring. Recall from algebraic geometry that for an ideal I of R we set V (I) := {P Spec(R) : I P } and that V (a) is shorthand for V (ar). 1
2 Definition 2.1 Let C Spec(R) and U be an ultrafilter on C. Set P U := {a R : V (a) C U}. We call P U an ultrafilter limit point of C. Theorem 2.2 P U is a prime ideal. Proof. Let a, b R be such that ab P U. Then, V (ab) C U. However, from [5, Lemma II.2.1], we know that V (ab) = V (a) V (b), so we have (V (a) C) (V (b) C) U. Thus, by our observation in Section 1, V (a) C U and V (b) C U, meaning a P U or b P U, as desired. If U is a principal ultrafilter on C, then there is a prime P C such that U is all subsets of C containing P, and thus P U = P C. So, we have another instance in which principal ultrafilters seem to prohibit interesting behavior from occurring; in this case, our so-called limit points don t really close up anything! Passing to nonprincipal ultrafilters, however, it is possible that a set C may not contain all its ultrafilter limit points, which motivates us to form a topology, since we know it won t be trivial to consider. Definition/Theorem 2.3 Let R and C be as above. We say that C is ultrafilter closed if it contains all its ultrafilter limit points. In fact, the ultrafilter closed sets of R form the closed sets of a topology on Spec(R), the ultrafilter topology on Spec(R). Proof. We wish to show the following: (i) Given ultrafilter closed subsets C 1,..., C n of Spec(R), C := C 1 C n is also ultrafilter closed. (ii) Given {C λ : λ Λ} a collection of ultrafilter closed subsets of Spec(R), then D := λ Λ C λ is also ultrafilter closed. To prove (i), let U be an ultrafilter on C. We wish to show P U C. By our observation in Section 1, we have that for some i, C i U. Without loss of generality, suppose C 1 U. Then, the collection U 1 := {C 1 B : B U} is an ultrafilter on C 1, as one easily sees, and the ultrafilter limit point it defines for C 1, denoted P U1, is precisely P U. Indeed, suppose d P U1, which by definition means V (d) C 1 U 1. Then, since C 1 U and therefore every set in U 1 also lies in U, V (d) C 1 U. However, since supersets of ultrafilter sets are ultrafilter sets, we see V (d) C U. This means d P U, as desired. The reverse containment is even easier: if d P U, then V (d) C U, so by definition of U 1 we have V (d) C 1 = (V (d) C) C 1 U 1, meaning d P U1. Thus, we have P U = P U1 C 1 C, and since U was arbitrary, we have that C is ultrafilter closed, as desired, proving (i). To prove (ii), let U be an ultrafilter on D, and let P U be the ultrafilter prime associated to U. For each λ Λ, define an ultrafilter U λ := {B C λ : B D U} on C λ. Then, by a routine adaption of our argument showing that P U1 = P U above, we see that P U = P Uλ for each λ, meaning (since each C λ is closed) P U C λ for each λ, so P U D, as desired. Thus, (ii) is proven. Definition 2.4 The patch topology is the smallest topology on Spec(R) for which the sets V (I) and D(a) := Spec(R) \ V (a) are closed for I any ideal of R and any a R. Definition 2.5 The constructible topology is the topology for which the collection {C Spec(R) : C = ϕ 1 (Spec(S)) for some ring homomorphism ϕ : R S where S is a commutative ring} comprises all closed sets. Theorem 2.6 The patch topology, constructible topology, and ultrafilter topology on Spec(R) all coincide. The equivalence of the patch and ultrafilter topologies is proven by Loper and Fontana in [4], and the equivalence of the constructible and ultrafilter topologies is proven in [2]. Remark 2.7 The patch (and therefore constructible and ultrafilter) topology makes Spec(R) a compact, Hausdorff, and totally disconnected space. It is also apparent that this topology is finer than the Zariski topology. 2
3 3 The ultrafilter topology on the Zariski-Riemann space of valuation rings In this section, let K be a field, let A be a ring contained in K, and let Zar(K A) denote the set of valuation domains containing A with quotient field K. We may define a topology on Zar(K A) by declaring its basic open sets to be of the form U(x 1,..., x n ) := {V Zar(K A) : x 1,..., x n V }, where x 1,..., x n K. With this topology, Zar(K A) is called the Zariski-Riemann space of A with respect to K. Also, suppose that Zar(K A) = {V i : i Ω} and that U is an ultrafilter on Ω. Notation 3.1 For d K, define B(d) := {i Ω : d V i }. Define V U := {d K : B(d) U}. Theorem 3.2 V U is a valuation ring, possibly K. Proof. Let x K. If x V U, we re done. If not, then B(x) = {i Ω : x V i } / U. Since U is an ultrafilter and each V i is a valuation ring with quotient field K, we then have Ω \ B(x) = {i Ω : x / V i } = {i Ω : x 1 V i } U, which means x 1 V U, as desired, thus proving V U is a valuation ring. Theorem 3.3 Let C U and consider U C := {B C : B U}. Then, if we index C by its elements, U C is an ultrafilter on C. Moreover, V UC = V U. Like in the previous section, we call V U an ultrafilter limit point, and if C Zar(K) contains all its ultrafilter limit points, then we say C is ultrafilter closed. Also, the ultrafilter closed sets form a topology which we call the ultrafilter topology. In the same spirit as the previous section, it is indeed true that the ultrafilter topology coincides with a yet-to-be-defined constructible topology, which we will define now. Definition 3.4 Let X be a topological space, and set K = {U : U X open and quasicompact}. Let K be the smallest subcollection of the power set of X containing K and closed with respect to finite unions, finite intersections, and complementation. The constructible topology on X is the topology on X with K its basis for open sets. We denote X with the constructible topology by X const. Recall that a spectral space is a topological space that is homeomorphic to the prime spectrum of a ring equipped with the Zariski topology. Suppose X is a spectral space. Then, K is a basis for the topology on X and is closed under finite intersections. Moreover, the constructible topology on X is the coarsest topology for which K is a collection of clopen sets, and X const is a compact, Hausdorff space. Theorem 3.5 [2, Corollary 3.6] Zar(K A) is a spectral space; it is homeomorphic to Spec(Kr(K A)), where Kr(K A) := {V (T ) : (V, M V ) Zar(K A)}, T is an indeterminate, and V (T ) denotes the trivial extension of V Zar(K A) to K(T ), i.e. V (T ) := V [T ] MV [T ]. For context, these ideas were developed for and principally applied to the problem of expressing integrally closed domains as intersections of valuation overrings, which sheds some insight on their structure. We now state one positive result in this direction. Proposition 3.6 [2, Proposition 4.1] Let {V i : i Ω} and {W j : j Λ} be two collections in Zar(K A). Suppose both collections have the same closure in the constructible topology. Then, i Ω V i = j Λ W j, i.e. the two intersections represent the same integrally closed domain. Moreover, these considerations have some applications to the theory of Kronecker function rings and semi-star operations. First, recall that a vacant domain is a domain with a unique Kronecker function ring. Among other more technical results in [2], we have the following. Corollary 3.7 [2, Corollary 4.11] Let A be an integrally closed domain with quotient field K. If each representation of A (i.e. collection of valuation overrings of A that when intersected yield A) is dense in Zar(K A) with the constructible topology, then A is a vacant domain. Of course, star operations and Kronecker function rings are intricately related, so one might expect that some star operation can be related to a given representation. Indeed, in [2, Theorem 4.13], it is proven that some subsets of Zar(K A) determine finite-type e.a.b. semistar operations. 3
4 4 Ultraproducts and their Applications Definition 4.1 Let W be an infinite set, F be an ultrafilter on W, and {O w } w W be a collection of sets indexed by W. Define an equivalence relation on w W O w as follows: (a w ) w W (b w ) w W if and only if {w : a w = b w } F. In general, depending on the reference, the equivalence classes constructed here are denoted by either [(a w ) w W ] or ulim w a w, and the set of these equivalence classes is called the ultraproduct of the O w and is denoted by either ulim w O w, F O w, or O. In general, if the O w have algebraic structure that their Cartesian product naturally inherits componentwise, then ulim w O w naturally inherits the same algebraic structure. Moreover, if each O w is totally ordered, then ulim w O w is too (see [1, Lemma A3]), and the ultraproduct of fields is a field ([1, Lemma A3]). Example 4.2 In valuation theory, one is generally interested in families (K (w), v (w), Γ (w) ) (w W ) and the resulting trio which we ll denote by (K, v, Γ ), where K and Γ are ultraproducts and v : K Γ is defined by v ([a (w) ]) = [v (w) (a (w) )]. Perhaps unsurprisingly in light of the observations about the ultraproducts in question that we just made, v is indeed a valuation. We call this trio the ultraproduct of the given valued fields. Moreover, the residue field for the valuation ring corresponding to v is isomorphic to the ultraproduct of the residue fields of the v (w). We now collect a few basic facts about ultraproducts of valued fields that we ll use later. The proofs are available in Appendix A of [1]. Theorem 4.3 [1, Theorem A.4] Let all notation be as defined in the above example. Then, (i) for a fixed prime p, char K = p if and only if {s char K (s) = p} F; similarly for the residue fields; (ii) K is C 2 (d) if and only if {s K (s) is C 2 (d)} F; (iii) if all K (s) are Henselian, then so is K ; (iv) for a fixed prime p, if all K (s) are p-adically closed, then so is K. A few terms in the above theorem are heretofore undefined, so we define them now. Definition 4.4 A field K is p-adically closed if K is a Henselian valued field such that (i) its residue field is F p, (ii) its value group is discrete (i.e. a direct sum of copies of Z) with v(p) as minimal positive element (which forces char K = 0), and (iii) to every m 2 and every a K there exists b K and ν such that 0 ν m 1 and v(a) = v(p ν ) + mv(b). Definition 4.5 Let K be a field and i and d be positive integers. K is said to have the C i (d)-property if every homogeneous polynomial f with coefficients in K in more than d i variables and of total degree d has a nontrivial root in K. For example, all finite fields are C 1 (d) for every d, and if a field k is C i (d) for every d, then its field of formal Laurent series k((x)) is C i+1 (d) for all d. Moreover, each p-adic field Q p is C 2 (2) and C 2 (3), as proved by D.J. Lewis in This led Emil Artin to form the conjecture that Q p is C 2 (d) for all positive integers d. It turns out that this conjecture is false; however, in 1965, Ax and Kochen showed that this conjecture is almost true, in a sense made precise by introducing an ultrafilter on an appropriate set. Before we sketch the proof, we need a theorem. Theorem 4.6 [1, Theorem 6.1.1] Suppose (K 1, v 1 ) and (K 2, v 2 ) are Henselian fields with the same residue field k of characteristic zero and same value group Γ and that both K 1 and K 2 are ℵ 1 -saturated (this is a model-theoretic concept with a very technical definition that we will not need to refer to in this presentation, so we will not define it in this presentation). Examples of such fields include F p ((X)) and Q p for any prime numbers p and ultraproducts of them, as well as subfields of ℵ 1 -saturated fields. Let F be a subfield of K 1, and let σ : F K 2 be a value-preserving embedding, i.e. v 2 (σ(x)) = v 1 (x) for all x F and σ(x) = x for all x O v1 F, where O v1 denotes the valuation ring in K corresponding to v 1. Assume that (i) F is countable and Henselian with respect to v 1 F and that (ii) Γ/v 1 (F ) is torsion-free. Then, for a 1,..., a m K 1 there exists a value-preserving extension σ : F K 2 of σ such that F (a 1,..., a m ) F and F again satisfies (i) and (ii). 4
5 Partial Solution to Artin s Conjecture. Fix d N, denote by P the set of all prime natural numbers, and suppose the set A d := {p P : Q p is not C 2 (d)} is infinite. We hope to derive a contradiction from this. Since A d is infinite, by the lemma we concluded Section 1 with, there exists a non-principal ultrafilter F on the power set of P such that A d F. Moreover, since Q p and F p ((X)) are Henselian fields with respect to their usual valuations, the ultraproducts K = F Q p and L = F F p((x)) are both Henselian fields with respect to their canonical valuations v and w, respectively. Moreover, they have the same residue field k = F F p, which has characteristic zero, and they have the same value group Γ = F Z, which has infinite rank. Since A d F and Q p is not C 2 (d) for every p A d, we get from [1, Theorem A.4] that K is not C 2 (d). However, since P F and F p ((X)) is C 2 (d) for every p P, we have that L is C 2 (d) by the same theorem. Since the residue fields of K and L have characteristic 0, the identity isomorphism of their prime subfields δ : Q Q is clearly value-preserving, since v Q and w Q are trivial. Moreover, with these valuations, Q is a Henselian subfield of both K and L. Let h 1 = N i=1 c ix αi K [X 1,..., X d2 +1] be homogeneous of degree d and suppose that h 1 has no nontrivial zero in K. By [1, Theorem 6.1.1], the isomorphism δ can be extended to a subfield F 1 Q(c 1,..., c N ), say to δ 1 : F 1 F 2 L such that δ 1 is still value-preserving. Since L is C 2 (d), the image of h 1 under δ 1 has a nontrivial zero in L, say the tuple (x 1,..., x d2 +1). Once again, by [1, Theorem 6.1.1], the isomorphism δ 1 1 can be extended to an embedding δ 2 : F 2 (x 1,..., x d2 +1) K. But this means that the tuple (δ 2 (x 1 ),..., δ 2 (x d2 +1)) is a nontrivial zero of h 1 in K, which contradicts the finding that K is not C 2 (d), which followed from the assumption that A d was infinite. References [1] A.J. Engler and A. Prestel, Valued Fields. Springer Monographs in Mathematics. [2] C.A. Finocchiaro, M. Fontana, K.A. Loper, The constructible topology on spaces of valuation domains. Transactions of the AMS, Volume 365, Number 12, December 2013, p [3] C.A. Finocchiaro, M. Fontana, K.A. Loper, Ultrafilter and constructible topologies on spaces of valuation domains. Communications in Algebra, Volume 41, Issue 5, 2013, p [4] M. Fontana and K.A. Loper, The Patch Topology and Ultrafilter Topology on the Prime Spectrum of a Commutative Ring. [5] R. Hartshorne, Algebraic Geometry. Springer Graduate Texts in Mathematics. [6] K.A. Loper and F. Tartarone, A classification of the integrally closed rings of polynomials containing Z[X]. Journal of Commutative Algebra, Volume 1, Number 1, Spring [7] H. Schoutens, The Use of Ultraproducts in Commutative Algebra. Springer Lecture Notes in Mathematics,
SOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationFIBER 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
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
More information11 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(
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationFACTORING 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
More informationINTRODUCTION 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.
More informationChapter 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
More informationit 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
More informationCHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationFOUNDATIONS 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
More informationHow 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
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationMath 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
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationADDITIVE GROUPS OF RINGS WITH IDENTITY
ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsion-free
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationRow 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
More informationThe Kolchin Topology
The Kolchin Topology Phyllis Joan Cassidy City College of CUNY November 2, 2007 hyllis Joan Cassidy City College of CUNY () The Kolchin Topology November 2, 2007 1 / 35 Conventions. F is a - eld, and A
More informationI. 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
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationChapter 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
More information3. 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)
More informationUnique 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
More informationMATH10040 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
More informationNon-unique factorization of polynomials over residue class rings of the integers
Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More informationIntroduction 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
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationSMALL 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
More informationWHAT 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
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationModule 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
More informationOSTROWSKI 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
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationHow To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationTree sums and maximal connected I-spaces
Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
More informationGröbner Bases and their Applications
Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,
More information6. Fields I. 1. Adjoining things
6. Fields I 6.1 Adjoining things 6.2 Fields of fractions, fields of rational functions 6.3 Characteristics, finite fields 6.4 Algebraic field extensions 6.5 Algebraic closures 1. Adjoining things The general
More informationModern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)
Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)
More informationHow To Understand The Theory Of Hyperreals
Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer
More informationINTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More information7. 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
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationZORN S LEMMA AND SOME APPLICATIONS
ZORN S LEMMA AND SOME APPLICATIONS KEITH CONRAD 1. Introduction Zorn s lemma is a result in set theory that appears in proofs of some non-constructive existence theorems throughout mathematics. We will
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationRINGS WITH A POLYNOMIAL IDENTITY
RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationGroup 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
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationCommutative Algebra Notes Introduction to Commutative Algebra Atiyah & Macdonald
Commutative Algebra Notes Introduction to Commutative Algebra Atiyah & Macdonald Adam Boocher 1 Rings and Ideals 1.1 Rings and Ring Homomorphisms A commutative ring A with identity is a set with two binary
More informationMathematics 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
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationLecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook. John Rognes
Lecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook John Rognes November 29th 2010 Contents Introduction v 1 Set Theory and Logic 1 1.1 ( 1) Fundamental Concepts..............................
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationPrime 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.
More informationFactoring 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
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,
More information3 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
More informationCOMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationGROUPS 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
More informationa 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
More informationContinued 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
More informationThe Markov-Zariski topology of an infinite group
Mimar Sinan Güzel Sanatlar Üniversitesi Istanbul January 23, 2014 joint work with Daniele Toller and Dmitri Shakhmatov 1. Markov s problem 1 and 2 2. The three topologies on an infinite group 3. Problem
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
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 of Gallian s Contemporary Abstract Algebra. Most of the important
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationPoint Set Topology. A. Topological Spaces and Continuous Maps
Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.
More informationEXERCISES 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
More informationRINGS OF ZERO-DIVISORS
RINGS OF ZERO-DIVISORS P. M. COHN 1. Introduction. A well known theorem of algebra states that any integral domain can be embedded in a field. More generally [2, p. 39 ff. ], any commutative ring R with
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials
Hilbert Polynomials For a monomial ideal, we derive the dimension counting the monomials in the complement, arriving at the notion of the Hilbert polynomial. The first half of the note is derived from
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationChapter 7: Products and quotients
Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products
More informationField Fundamentals. Chapter 3. 3.1 Field Extensions. 3.1.1 Definitions. 3.1.2 Lemma
Chapter 3 Field Fundamentals 3.1 Field Extensions If F is a field and F [X] is the set of all polynomials over F, that is, polynomials with coefficients in F, we know that F [X] is a Euclidean domain,
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationHow To Find Out How To Build An Elliptic Curve Over A Number Field
Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More information