Defining Valuation Rings
|
|
- Aubrie Morrison
- 5 years ago
- Views:
Transcription
1 East Carolina University, Greenville, North Carolina, USA June 8, 2018
2 Outline 1 What? Valuations and Valuation Rings Definability Questions in Number Theory 2 Why? Some Questions and Answers Becoming More Ambitious 3 Other Applications of Definitions of Valuation Rings Infinite Algebraic Extensions of Q Function Fields Using Definitions of Valuations over Function Fields of Positive Characteristic Using Definitions of Valuations over Function Fields of Characteristic 0. 4 How?
3 Product Formula Fields Some of the objects we consider: number fields, i.e. finite extensions of Q; function fields of transcendence degree 1 over a finite field; function fields of transcendence degree 1 over arbitrary constant fields. The last class includes function fields of curves over number fields or algebraic closure of Q.
4 non-archimedean Discrete Valuations Let K be a product formula field. Let v : K Z { } be a map satisfying the following conditions: 1 For all x, y K \ {0}, we have that v(xy) = v(x) + v(y). 2 v(1) = 0. 3 v(0) =. 4 v(x + y) min(v(x), v(y)). 5 If v(x) < v(y), then v(x + y) = v(x). 6 If K is a function field of transcendence degree 1 over a constant field k, then v k is trivial, i.e. for every non-zero constant c k, we have that v(c) = 0.
5 Valuation Rings Let K be a product formula field and let v be a discrete valuation on K. Then the valuation ring of v is the ring R v = {x K v(x) 0}. The unique maximal ideal p = {x K v(x) > 0} of R p is often identified with the valuation itself. The field R v /p is the residue field of the valuation. In the case of a function field, the residue field is always a finite extension of the field of constants. If the extension is of degree 1, we say that the valuation (or the prime) is of degree one.
6 Valuation Rings Let K be a product formula field and let v be a discrete valuation on K. Then the valuation ring of v is the ring R v = {x K v(x) 0}. The unique maximal ideal p = {x K v(x) > 0} of R p is often identified with the valuation itself. The field R v /p is the residue field of the valuation. In the case of a function field, the residue field is always a finite extension of the field of constants. If the extension is of degree 1, we say that the valuation (or the prime) is of degree one. If K is an infinite algebraic extension of a product formula field, we will define R v, to be the integral closure of R v in K (i.e. the ring of all elements of K satisfying monic irreducible polynomials with coefficients in R v.)
7 The Questions Let K be a product formula field or its infinite algebraic extension K. 1 Is there a polynomial f v (T, X 1,..., X M ) K[T, X 1,..., X m ] such that for any element t K the sentence E 1 X 1 K... E m X m K : f (t, X 1,..., X m ) = 0 is true if and only if t R v, v M for some set M of valuations of K?
8 The Questions Let K be a product formula field or its infinite algebraic extension K. 1 Is there a polynomial f v (T, X 1,..., X M ) K[T, X 1,..., X m ] such that for any element t K the sentence E 1 X 1 K... E m X m K : f (t, X 1,..., X m ) = 0 is true if and only if t R v, v M for some set M of valuations of K? 2 Is there a polynomial f (T, X 1,..., X M ) K[T, X 1,..., X m ] such that for any element t K the sentence E 1 X 1 K... E m X m K : f v, (t, X 1,..., X m ) = 0 is true if and only if t R v,? Here E i stands for one of the quantifiers: or.
9 The Language of Rings The Classical Language of Rings The language of rings is the language where we are allowed to use only the following symbols to form sentences together with logical connectives, and the universal and existential quantifiers: L R = (0, 1, +, ). Occasionally we augment the language by adding names of some specific elements of the ring. Generally speaking a formula of the language is an expression of the form: E 1 X 1... E m X m P(X 1,..., X m, T 1,..., T s ), where, as before, E i stands for one of the quantifiers: or, and P(X 1,..., X m, T 1,..., T s ) is a polynomial over a given ring. If all variables are within the range of some quantifier, the formula becomes a sentence that is either true or false.
10 Two General Problems The General Definability Problems for Countable Rings 1 Is there an algorithm to determine whether a sentence of the language is true over a specific ring? (The answer will vary with the ring of course.) 2 What subsets of a given ring can we define using formulas of the language? The quantifiers may range over the whole ring or a subset of the ring. On many occasions we will require that only existential or only universal quantifiers are used in the formulas.
11 Outline 1 What? Valuations and Valuation Rings Definability Questions in Number Theory 2 Why? Some Questions and Answers Becoming More Ambitious 3 Other Applications of Definitions of Valuation Rings Infinite Algebraic Extensions of Q Function Fields Using Definitions of Valuations over Function Fields of Positive Characteristic Using Definitions of Valuations over Function Fields of Characteristic 0. 4 How?
12 The Origin Is there an algorithm which can determine whether or not an arbitrary polynomial equation in several variables has solutions in integers? Using modern terms one can ask if there exists a program taking coefficients of a polynomial equation as input and producing yes or no answer to the question Are there integer solutions?. This problem became known as Hilbert s Tenth Problem
13 The First-Order Theory of Z is Undecidable J.B. Rosser, Extensions of Some Theorems of Gödel and Church, J. Symb Logic, vol. 1, (1936), Grundlagen der Mathematik, by David Hilbert and Paul Bernays, , Springer In other words, there is no algorithm to determine whether a sentence of the form E 1 X 1... E m X m P(X 1,..., X m ), is true when the variables are ranging over Z. (As above, E i is either or.)
14 Number Field Results of Julia Robinson Theorem (1949) Z is definable by a first-order formula over Q. Thus the first-order theory of Q (in the language of rings) is undecidable.
15 Number Field Results of Julia Robinson Theorem (1949) Z is definable by a first-order formula over Q. Thus the first-order theory of Q (in the language of rings) is undecidable. Theorem (1959) If K is a number field, then Z is definable over K by a first-order formula. Thus the first-order theory of K (in the language of rings) is undecidable.
16 The Answer to Hilbert s Question This question of Hilbert was answered negatively (with the final piece in place in 1970) in the work of Martin Davis, Hilary Putnam, Julia Robinson and Yuri Matiyasevich. Actually a much stronger result was proved. It was shown that the recursively enumerable subsets of Z are the same as the Diophantine sets.
17 Recursive, Recursively Enumerable Sets. Definition (Recursive Sets) A subset of integers is called recursive or computable if there is an algorithm to determine membership in the set.
18 Recursive, Recursively Enumerable Sets. Definition (Recursive Sets) A subset of integers is called recursive or computable if there is an algorithm to determine membership in the set. Definition (Recursively Enumerable Sets) A subset of integers is called recursively (or computably) enumerable if there is an algorithm to list the elements of the set.
19 Recursive, Recursively Enumerable Sets. Definition (Recursive Sets) A subset of integers is called recursive or computable if there is an algorithm to determine membership in the set. Definition (Recursively Enumerable Sets) A subset of integers is called recursively (or computably) enumerable if there is an algorithm to list the elements of the set. Theorem There are r.e. sets that are not recursive.
20 Diophantine Sets: a Number-Theoretic Definition For an integral domain R, a subset A R m is called Diophantine over R if there exists a polynomial p(t 1,... T m, X 1,..., X k ) with coefficients in R such that for any element (t 1,..., t m ) R m we have that x 1,..., x k R : p(t 1,..., t m, x 1,..., x k ) = 0 (t 1,..., t m ) A. In this case we call p(t 1,..., T m, X 1,..., X k ) a Diophantine definition of A over R.
21 Diophantine Sets: a Number-Theoretic Definition For an integral domain R, a subset A R m is called Diophantine over R if there exists a polynomial p(t 1,... T m, X 1,..., X k ) with coefficients in R such that for any element (t 1,..., t m ) R m we have that x 1,..., x k R : p(t 1,..., t m, x 1,..., x k ) = 0 (t 1,..., t m ) A. In this case we call p(t 1,..., T m, X 1,..., X k ) a Diophantine definition of A over R. Remark Diophantine sets can also be described as the sets existentially definable in the language of rings or as projections of algebraic sets.
22 Undecidable Diophantine Sets Theorem (MDRP) There are undecidable Diophantine sets over Z.
23 Undecidable Diophantine Sets Theorem (MDRP) There are undecidable Diophantine sets over Z. Corollary HTP is undecidable or positive existential theory of Z is undecidable.
24 Undecidable Diophantine Sets Theorem (MDRP) There are undecidable Diophantine sets over Z. Corollary HTP is undecidable or positive existential theory of Z is undecidable. Proof. Let f (t, x) be a Diophantine definition of an undecidable Diophantine set. If HTP is decidable, then for each t Z we can determine if the polynomial equation f (t, x) = 0 has solutions in Z. However, this process would also determine whether t is an element of our set, contradicting the fact that the set was undecidable.
25 Some Properties of Diophantine Sets and Definitions over Subrings of Algebraic Extensions of Q Intersections and unions of Diophantine sets are Diophantine (unions always, intersection over not algebraically closed fields).
26 Some Properties of Diophantine Sets and Definitions over Subrings of Algebraic Extensions of Q Intersections and unions of Diophantine sets are Diophantine (unions always, intersection over not algebraically closed fields). One = finitely many (not algebraically closed fields)
27 Some Properties of Diophantine Sets and Definitions over Subrings of Algebraic Extensions of Q Intersections and unions of Diophantine sets are Diophantine (unions always, intersection over not algebraically closed fields). One = finitely many (not algebraically closed fields) The set of non-zero elements is Diophantine (over all integrally closed subrings).
28 A General Question A Question about an Arbitrary Recursive Ring R Is there an algorithm, which if given an arbitrary polynomial equation in several variables with coefficients in R, can determine whether this equation has solutions in R?
29 A General Question A Question about an Arbitrary Recursive Ring R Is there an algorithm, which if given an arbitrary polynomial equation in several variables with coefficients in R, can determine whether this equation has solutions in R? The most prominent open questions are probably the decidability of HTP for R = Q and R equal to the ring of integers of an arbitrary number field.
30 Undecidability of HTP over Q Implies Undecidability of HTP for Z Indeed, suppose we knew how to determine whether solutions exist over Z. Let Q(x 1,..., x k ) be a polynomial with rational coefficients. Then x 1,..., x k Q : Q(x 1,..., x k ) = 0 y 1,..., y k, z 1,..., z k Z : Q( y 1 z 1,..., y k z k ) = 0 z 1... z k 0. So decidability of HTP over Z would imply the decidability of HTP over Q.
31 Using Diophantine Definitions to Solve the Problem Lemma Let R be a recursive ring containing Z and such that Z has a Diophantine definition p(t, X ) over R. Then HTP is not decidable over R.
32 Using Diophantine Definitions to Solve the Problem Lemma Let R be a recursive ring containing Z and such that Z has a Diophantine definition p(t, X ) over R. Then HTP is not decidable over R. Proof. Let h(t 1,..., T l ) be a polynomial with rational integer coefficients and consider the following system of equations. h(t 1,..., T l ) = 0 p(t 1, X 1 ) = 0... p(t l, X l ) = 0 It is easy to see that h(t 1,..., T l ) = 0 has solutions in Z iff (1) has solutions in R. Thus if HTP is decidable over R, it is decidable over Z. [1]
33 HTP for Q and Valuation Rings Non-Archimedean Valuations of Q Every non-archimedean valuation of Q can be associated with a prime number p Z. For any integer z Z, let ord p z be the highest power of p dividing z. Given a non-zero element x = a b with a, b Z, we can let v p (x) = ord p x = ord p a ord p b. The valuation ring R p corresponding to this valuation is the set of all elements of Q with a reduced denominator not divisible by p.
34 HTP for Q and Valuation Rings Non-Archimedean Valuations of Q Every non-archimedean valuation of Q can be associated with a prime number p Z. For any integer z Z, let ord p z be the highest power of p dividing z. Given a non-zero element x = a b with a, b Z, we can let v p (x) = ord p x = ord p a ord p b. The valuation ring R p corresponding to this valuation is the set of all elements of Q with a reduced denominator not divisible by p. Reformulating the problem of defining Z inside Q Now we can view the problem of defining Z inside Q by a Diophantine definition as a problem of defining existentially p P R p, where P is the set of all rational prime numbers.
35 A Conjecture of Barry Mazur The Conjecture on the Topology of Rational Points Let V be any variety over Q. Then the topological closure of V (Q) in V (R) possesses at most a finite number of connected components.
36 A Conjecture of Barry Mazur The Conjecture on the Topology of Rational Points Let V be any variety over Q. Then the topological closure of V (Q) in V (R) possesses at most a finite number of connected components. A Nasty Consequence There is no Diophantine definition of Z over Q. Unfortunately, as it stands now, the reformulation of the of the problem in terms of valuations does not give us anything beyond the connection between defining valuation rings and defining Z.
37 More Rings Definable through Valuations inside Q If we choose a subset S P, and let W = P \ S, then we can consider a ring p W R p = Z[S 1 ] and the problem of existentially defining Z[S 1 ] over Q, as well as the problem of defining Z over Z[S 1 ]. As of now we can construct the first definition if S is co-finite, and the second one, if S is finite. (These two Diophantine definitions are due to J. Robinson.)
38 First-order and Existential (Diophantine) Models Another way to show undecidablity of the first-order (existential) theory of a ring R is to construct a map n A n, where A = i=0 A i R is first-order (existentially) definable over R, the collection {A i, i Z 0 } is a partition of A, the set + = {(x, y, z) R 3 : x A i, y A j, z A i+j } and the set = {(x, y, z) R 3 : x A i, y A j, z A ij } are first-order (existentially) definable.
39 Outline 1 What? Valuations and Valuation Rings Definability Questions in Number Theory 2 Why? Some Questions and Answers Becoming More Ambitious 3 Other Applications of Definitions of Valuation Rings Infinite Algebraic Extensions of Q Function Fields Using Definitions of Valuations over Function Fields of Positive Characteristic Using Definitions of Valuations over Function Fields of Characteristic 0. 4 How?
40 Discrete Valuations of a Number Field Let K be a number field, and let O K be the ring of integers of K, i.e. the integral closure of Z in K. Then we identify each valuation of K with a prime ideal p of O K, and for x 0 we set v p (x) = ord p x. Here, if x O K, then ord p x is the non-negative integer n such that x p n \ p n+1. If x = a b, a, b O K \ {0}, then ord p x = ord p a ord p b.
41 Using Elliptic Curves to Generate Integers Theorem (Poonen, 2002) Let K be a number field, and let E be an elliptic curve over K of positive rank. We choose a model of E placing the neutral element of E at the origin. Then there exists G P K such that P K \ G is finite, and the following assertions are true for every p G. There exists a point P E(K) of infinite order such that: 1 P ker(red p ), 2 P has homogeneous coordinates of the form (x 1 : y 1 : 1), where ord p x 1 > 0, ord p y 1 > 0. We let ord p P = min(ord p x 1, ord p y 1 ), 3 for every positive integer n, we have that ord p [n]p ord p P, 4 for every positive integer l Z >0, there exists m Z such that ord p [m]p > l, 5 for every positive integer n, we have that ord p ( x([n]p) x(p) n) ord p P.
42 Using Finitely Generated Elliptic Curves and Valuation Rings Theorem (S., 2017) Let K be an infinite algebraic extension of K, and assume E(K) = E(K ). For convenience, we will also assume that K /K is normal. Now let x K be such that the following sentence is true. x(q) x(p) y K P, Q E(K ) : x R p,. y Then x K. Further, if x Z >0, then the sentence is true for x.
43 Some Proof Ideas Given x K, consider a field M, the Galois closure of K(x) in K. Let ˆx be any conjugate of x over K, and let y K. Now if then x(q) x(p) x y x(q) x(p) ˆx y R p,, [2] R p,. [3] Let q be any prime above p in M. From [2] and [3], we can conclude that ord q (x ˆx) ord q y. [4] Since y can be an arbitrary element of K, the only way [4] can be satisfied for all y K is for ˆx = x. Since ˆx is an arbitrary conjugate of x over K, we can conclude that x K.
44 Positive Integers Satisfy the Sentence To prove that positive integers satisfy the sentence y K P, Q E(K ) : x(q) x(p) x y R p,, let x = n Z >0, and assume without loss of generality that we are given y K. Choose a point P, as above, with ord p P > ord p y, and let Q = [n]p. In this case, ( ) x(q) ord p x(p) x > ord p y, and x(q) x(p) x y R p R p,.
45 The First-Order Theory of K is Undecidable We have constructed a first-order definition over K of a subset of K containing all positive integers. Since all elements of K can be written down as linear combinations of some basis elements over Q, and all elements of Q are ratios of integers, we have, in fact constructed a first-order definition of K over K. We can now use the result of J. Robinson stating that the first-order theory of any number field is undecidable to reach the desired conclusion.
46 Fields where Assumptions on Elliptic Curves and Valuation Rings are Satisfied By a theorem of B. Mazur and K. Rubin (2017), there are infinitely many infinite algebraic extensions of Q with finitely generated elliptic curves of positive rank, and where by a theorem of S., the integral closure of a valuation ring of a number field is definable. However, we do not have a definitive description of a class of infinite algebraic extensions of Q, where our assumptions hold.
47 Valuations of Function Fields Trivial on Constant Fields Valuations of Rational Fields Let k be a field, and let t be transcendental over k. All valuations of k(t), except for one, can be identified with prime ideals of k[t] using the order function. The remaining valuation, attached to the degrees of polynomials, corresponds to a prime ideal generated by 1 t in k[ 1 t ].
48 Valuations of Function Fields Trivial on Constant Fields Valuations of Rational Fields Let k be a field, and let t be transcendental over k. All valuations of k(t), except for one, can be identified with prime ideals of k[t] using the order function. The remaining valuation, attached to the degrees of polynomials, corresponds to a prime ideal generated by 1 t in k[ 1 t ]. Valuations in Algebraic Extensions Let K/k(t) be a finite extension. Let O K be the integral closure of k[t] in K, and let O K 1 be the integral closure of k[ 1 t ] in K. Then all valuations of K correspond to the prime ideals of O K and O K 1 via the order function.
49 Different Ways of Defining Multiplication Addition and Divisibility. (J. Robinson, 1949) Let L be a first-order language generated by {0, 1, +, }. Then multiplication is first-order definable in this language over Z 0.
50 Different Ways of Defining Multiplication Addition and Divisibility. (J. Robinson, 1949) Let L be a first-order language generated by {0, 1, +, }. Then multiplication is first-order definable in this language over Z 0. Adding Division with p-th Powers. (T. Pheidas, 1987) Let L be a first-order language generated by {0, 1, +,, p }, where p is a prime number, and x p y is equivalent to x = yp s, s Z 0. Then multiplication is definable existentially in this language over Z 0.
51 Modeling Z 0 over a Function Field K. Let P = {(x, y) K 2 : s Z 0 y = x ps }, and let p be a prime of K. If P is first-order definable over K, then the map n t pn for a fixed element t of K gives rise to a first-order model of Z 0. If P and R p are both existentially definable over K, then the map n {x K ord p x = n} gives rise to an existential model of Z over K.
52 Modeling Z 0 over a Function Field K. Let P = {(x, y) K 2 : s Z 0 y = x ps }, and let p be a prime of K. If P is first-order definable over K, then the map n t pn for a fixed element t of K gives rise to a first-order model of Z 0. If P and R p are both existentially definable over K, then the map n {x K ord p x = n} gives rise to an existential model of Z over K. Theorem (K. Eisenträger, S., 2017) 1 The first-order theory in the language of rings of any function field of positive characteristic is undecidable. 2 The existential theory in the language of rings of any function field of positive characteristic not containing the algebraic closure of a finite field is undecidable.
53 Some Open Problems about Valuations in Positive Characteristic Define R p over a function field K with a constant field k, not algebraic over a finite field. Define R p over a function field K with a constant field k containing the algebraic closure of a finite field.
54 Elliptic Curves of Rank One over Function Fields of Characteristic 0. Let K be a function field of characteristic 0, and let E be an elliptic curve of rank 1 over K. We again choose a model of E placing the neutral element at the origin. Let p be a prime of K such that E has a good reduction at p, and there exists a point P ker(red p ) of infinite order. Let (x : y : 1) be the homogenous coordinates of P, and let (x n : y n : 1) be the homogeneous coordinates of [n]p. Then, as before, we have that ord p ( xn x 1 n) ord p P. If R p is existentially (first-order) definable over K, then the map n {x K ord p x = n} for n 0, gives rise to an existential (first-order) model of Z.
55 Existence of Elliptic curves of rank 1 over Function Fields of Characteristic 0 Theorem (Moret-Bailly, 2005) Let K be a function field of characteristic 0. Then there exists an elliptic curve of rank 1 defined over K.
56 Valuations over Function Fields of Characteristic 0 Theorem (H. Kim and Fred Roush, 1995) Let k be a field such that it is formally real (i.e. -1 is not a sum of squares), or can be embedded into a finite extension of Q p. Let p be a prime of degree one. Then R p is existentially definable over k(t).
57 Valuations over Function Fields of Characteristic 0 Theorem (H. Kim and Fred Roush, 1995) Let k be a field such that it is formally real (i.e. -1 is not a sum of squares), or can be embedded into a finite extension of Q p. Let p be a prime of degree one. Then R p is existentially definable over k(t). Extensions This theorem was partially extended to finite algebraic extensions of k(t) by K. Eisenträger and L. Moret-Bailly. They independently constructed an existential definition of a subset of R p. This partial extension of Kim and Roush result allowed Eisenträger (2007) and Moret-Bailly (2005) to show that HTP was undecidable over finite extensions of k(t). S. [2018] constructed an existential definition of a valuation ring for an arbitrary prime of a finite extension of k(t).
58 Open problems 1 Describe constant fields k such that a function field over k has a definition (existential or first-order) of an arbitrary valuation ring. 2 In particular, determine whether one can define valuation rings when k is algebraically closed. 3 In the case the valuation rings are not definable, find another method for showing that the corresponding function fields have undecidable existential or first-order theory. 4 In particular, determine the status of theories of Q(t) and C(t).
59 Outline 1 What? Valuations and Valuation Rings Definability Questions in Number Theory 2 Why? Some Questions and Answers Becoming More Ambitious 3 Other Applications of Definitions of Valuation Rings Infinite Algebraic Extensions of Q Function Fields Using Definitions of Valuations over Function Fields of Positive Characteristic Using Definitions of Valuations over Function Fields of Characteristic 0. 4 How?
60 From Poles to Divisibility of Order at a Prime Let q be a rational number, let K be a product formula field, let p be a prime of K, let a K be such that ord p a = 1. Now let x K, and observe that ord p ( xq a + 1 a ) 0 mod q if and only if q ord p x 0. Indeed, suppose ord p x 0, then ord p ( xq a ) 1, and ord p ( xq a + 1 x a ) = min(ord q q p a, ord p 1 1 a ) = ord q p a = q. Suppose q now that ord p x < 0. Then ord p ( xq a ) = q ord 1 p x 1 < q = ord p a. q
61 Using Quadratic Forms Consider a quadratic form x1 2 bx 2 2 cx bcx 4 2. This form is anisotropic (i.e. the only solutions to x1 2 bx 2 2 cx bcx 4 2 = 0 are x 1 = x 2 = x 3 = x 4 = 0) if and only if there exists a prime p such that ord p b is odd, and c is not a square mod p (or vice versa). So let s fix a prime p and c not equivalent to a square modulo p. Let ord p a = 1 and consider the equation x 2 1 bx 2 2 cx bcx 2 4 = 0, where b = xq a + 1 a q. If this equation has non-trivial solutions, then ord p b is even, and ord p x 0.
62 Satisfying the Equation When x is Integral at p The main tool is Hasse-Minkowski local-global principle. It states that the form x 2 1 bx 2 2 cx bcx 2 4 is anisotropic globally if and only if it is anisotropic locally, i.e. over K q the q-adic completion of K with respect to q, at some prime q of K.
63 From Quadratic Forms to Norm Equations We can rewrite the equation as or x 2 1 bx 2 2 cx bcx 2 4 = 0 c = x 1 2 bx 2 2 x3 2 bx 4 2, c = N K( b)/k (y), where y K( b). If we consider norm equations instead of quadratic forms, we are not restricted to extensions of degree 2. This is useful if one works over a global field of characteristic 2, or if one works over an infinite extension of Q where the local degrees of factors of p are divisible by arbitrarily high powers of 2. R. Rumely (1980) was the first person to use norm equations for this purpose. Instead of Hasse-Minkowski theorem, we use Hasse norm principle to make sure our equations are satisfied when c does not have a negative order at p.
according to Alexandra Shlapentokh September 30, 2016
according to Alexandra Shlapentokh East Carolina University, Greenville, North Carolina, USA September 30, 2016 Prologue Outline 1 Prologue Some Questions and Answers 2 Becoming More Ambitious 3 Complications
More informationHTP over Algebraic Extensions of Q: Normforms vs. Elliptic Curves
HTP over Algebraic Extensions of Q: Normforms vs. Elliptic Curves Alexandra Shlapentokh East Carolina University Number Theory and Computability, ICMS, June 2007 A Talk in Two Rounds Round I: Normforms
More informationOn Computably Enumerable Sets over Function Fields
On Computably Enumerable Sets over Function Fields Alexandra Shlapentokh East Carolina University Joint Meetings 2017 Atlanta January 2017 Some History Outline 1 Some History A Question and the Answer
More informationBjorn Poonen. MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties. January 18, 2006
University of California at Berkeley MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties January 18, 2006 The original problem H10: Find an algorithm that solves
More informationCHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA
CHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA BJORN POONEN Abstract. We prove that Z in definable in Q by a formula with 2 universal quantifiers followed by 7 existential
More informationDefinability in fields Lecture 2: Defining valuations
Definability in fields Lecture 2: Defining valuations 6 February 2007 Model Theory and Computable Model Theory Gainesville, Florida Defining Z in Q Theorem (J. Robinson) Th(Q) is undecidable. Defining
More informationON EXISTENTIAL DEFINITIONS OF C.E. SUBSETS OF RINGS OF FUNCTIONS OF CHARACTERISTIC 0
ON EXISTENTIAL DEFINITIONS OF C.E. SUBSETS OF RINGS OF FUNCTIONS OF CHARACTERISTIC 0 RUSSELL MILLER & ALEXANDRA SHLAPENTOKH Abstract. We extend results of Denef, Zahidi, Demeyer and the second author to
More informationDiophantine sets of polynomials over number
Diophantine sets of polynomials over number fields arxiv:0807.1970v2 [math.nt] 11 Sep 2008 Jeroen Demeyer 2018 10 08 Abstract Let R be a recursive subring of a number field. We show that recursively enumerable
More informationDefinability in fields Lecture 1: Undecidabile arithmetic, decidable geometry
Definability in fields Lecture 1: Undecidabile arithmetic, decidable geometry 5 February 2007 Model Theory and Computable Model Theory Gainesville, Florida Structures from logic Question What do we study
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 informationUndecidability in number theory 1
Undecidability in number theory 1 Bjorn Poonen Does the equation x 3 +y 3 +z 3 = 29 have a solution in integers? Yes: (3, 1, 1), for instance. How about x 3 +y 3 +z 3 = 30? Again yes, although this was
More informationMathematisches Forschungsinstitut Oberwolfach. Miniworkshop: Hilbert s Tenth Problem, Mazur s Conjecture and Divisibility Sequences
Mathematisches Forschungsinstitut Oberwolfach Report No. 3/2003 Miniworkshop: Hilbert s Tenth Problem, Mazur s Conjecture and Divisibility Sequences January 19th January 25th, 2003 The mini workshop was
More informationThe first-order theory of finitely generated fields
generated fields University of California at Berkeley (on work of Robinson, Ershov, Rumely, Pop, myself, and Scanlon) Antalya Algebra Days X June 1, 2008 Quadratic sentence ( x)( y) x 2 + y 2 = 1 holds
More informationElliptic curves and Hilbert s Tenth Problem
Elliptic curves and Hilbert s Tenth Problem Karl Rubin, UC Irvine MAA @ UC Irvine October 16, 2010 Karl Rubin Elliptic curves and Hilbert s Tenth Problem MAA, October 2010 1 / 40 Elliptic curves An elliptic
More informationLogic, Elliptic curves, and Diophantine stability
Logic, Elliptic curves, and Diophantine stability Hilbert s classical Tenth Problem Given a diophantine equation with any number of unknown quantities and with rational integral numerical coefficients:
More informationUsing elliptic curves of rank one towards the undecidability of Hilbert s Tenth Problem over rings of algebraic integers
Using elliptic curves of rank one towards the undecidability of Hilbert s Tenth Problem over rings of algebraic integers Bjorn Poonen Department of Mathematics, University of California, Berkeley, CA 94720-3840,
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics HILBERT S TENTH PROBLEM FOR ALGEBRAIC FUNCTION FIELDS OVER INFINITE FIELDS OF CONSTANTS OF POSITIVE CHARACTERISTIC Alexandra Shlapentokh Volume 193 No. 2 April 2000 PACIFIC
More informationElliptic Curves Retaining Their Rank in Finite Extensions and Hilbert s Tenth Problem for Rings of Algebraic Numbers.
Elliptic Curves Retaining Their Rank in Finite Extensions and Hilbert s Tenth Problem for Rings of Algebraic Numbers. Alexandra Shlapentokh Department of Mathematics East Carolina University Greenville,
More informationarxiv:math/ v1 [math.nt] 5 Oct 2006
arxiv:math/0610162v1 [math.nt] 5 Oct 2006 HILBERT S TENTH PROBLEM FOR FUNCTION FIELDS OF CHARACTERISTIC ZERO KIRSTEN EISENTRÄGER Abstract. In this article we outline the methods that are used to prove
More informationAn Existential Divisibility Lemma for Global Fields
An Existential Divisibility Lemma for Global Fields Jeroen Demeyer Jan Van Geel 005 07 11 Abstract We generalize the Existential Divisibility Lemma by Th. Pheidas [Phe00]) to all global fields K of characteristic
More informationDESCENT ON ELLIPTIC CURVES AND HILBERT S TENTH PROBLEM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 DESCENT ON ELLIPTIC CURVES AND HILBERT S TENTH PROBLEM KIRSTEN EISENTRÄGER AND GRAHAM EVEREST Abstract.
More informationDivisibility Sequences for Elliptic Curves with Complex Multiplication
Divisibility Sequences for Elliptic Curves with Complex Multiplication Master s thesis, Universiteit Utrecht supervisor: Gunther Cornelissen Universiteit Leiden Journées Arithmétiques, Edinburgh, July
More informationMaterial covered: Class numbers of quadratic fields, Valuations, Completions of fields.
ALGEBRAIC NUMBER THEORY LECTURE 6 NOTES Material covered: Class numbers of quadratic fields, Valuations, Completions of fields. 1. Ideal class groups of quadratic fields These are the ideal class groups
More informationHilbert s problems, Gödel, and the limits of computation
Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University April 6, 2011 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert gave
More informationHilbert s problems, Gödel, and the limits of computation
Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University November 14, 2013 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert
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 informationSUMS OF VALUES OF A RATIONAL FUNCTION. x k i
SUMS OF VALUES OF A RATIONAL FUNCTION BJORN POONEN Abstract. Let K be a number field, and let f K(x) be a nonconstant rational function. We study the sets { n } f(x i ) : x i K {poles of f} and { n f(x
More informationIntroduction to Arithmetic Geometry
Introduction to Arithmetic Geometry 18.782 Andrew V. Sutherland September 5, 2013 What is arithmetic geometry? Arithmetic geometry applies the techniques of algebraic geometry to problems in number theory
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 informationDEFINABILITY OF FROBENIUS ORBITS AND A RESULT ON RATIONAL DISTANCE SETS
DEFINABILITY OF FROBENIUS ORBITS AND A RESULT ON RATIONAL DISTANCE SETS HECTOR PASTEN Abstract. We prove that the first order theory of (possibly transcendental) meromorphic functions of positive characteristic
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
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 informationLimit computable integer parts
Limit computable integer parts Paola D Aquino, Julia Knight, and Karen Lange July 12, 2010 Abstract Let R be a real closed field. An integer part I for R is a discretely ordered subring such that for every
More informationA talk given at the City Univ. of Hong Kong on April 14, ON HILBERT S TENTH PROBLEM AND RELATED TOPICS
A talk given at the City Univ. of Hong Kong on April 14, 000. ON HILBERT S TENTH PROBLEM AND RELATED TOPICS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 10093 People s Republic of China
More informationNotes on QE for ACVF
Notes on QE for ACVF Fall 2016 1 Preliminaries on Valuations We begin with some very basic definitions and examples. An excellent survey of this material with can be found in van den Dries [3]. Engler
More informationThe analogue of Büchi s problem for rational functions
The analogue of Büchi s problem for rational functions Thanases Pheidas University of Crete and Xavier Vidaux Universidad de Concepción revised version in Journal of LMS, vol. 74-3, pp. 545-565 (2006)
More informationA tour through Elliptic Divisibility Sequences
A tour through Elliptic Divisibility Sequences Victor S. Miller CCR Princeton Princeton, NJ 08540 15 April 2010 Points and their denominators Let E : y 2 + a 1 xy + a 3 y = x 3 + a 2 x 2 + a 4 x + a 6
More informationPoints of Finite Order
Points of Finite Order Alex Tao 23 June 2008 1 Points of Order Two and Three If G is a group with respect to multiplication and g is an element of G then the order of g is the minimum positive integer
More informationSyntax and Semantics. The integer arithmetic (IA) is the first order theory of integer numbers. The alphabet of the integer arithmetic consists of:
Integer Arithmetic Syntax and Semantics The integer arithmetic (IA) is the first order theory of integer numbers. The alphabet of the integer arithmetic consists of: function symbols +,,s (s is the successor
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 informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationExtension theorems for homomorphisms
Algebraic Geometry Fall 2009 Extension theorems for homomorphisms In this note, we prove some extension theorems for homomorphisms from rings to algebraically closed fields. The prototype is the following
More informationUndecidable propositions with Diophantine form arisen from. every axiom and every theorem in Peano Arithmetic. T. Mei
Undecidable propositions with Diophantine form arisen from every axiom and every theorem in Peano Arithmetic T. Mei (Department of Journal, Central China Normal University, Wuhan, Hubei PRO, People s Republic
More informationCS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati
CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati Important 1. No questions about the paper will be entertained during
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 informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
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 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 informationHILBERT S TENTH PROBLEM OVER RINGS OF NUMBER-THEORETIC INTEREST
HILBERT S TENTH PROBLEM OVER RINGS OF NUMBER-THEORETIC INTEREST BJORN POONEN Contents 1. Introduction 1 2. The original problem 1 3. Turing machines and decision problems 2 4. Recursive and listable sets
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 informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #24 12/03/2013
18.78 Introduction to Arithmetic Geometry Fall 013 Lecture #4 1/03/013 4.1 Isogenies of elliptic curves Definition 4.1. Let E 1 /k and E /k be elliptic curves with distinguished rational points O 1 and
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 informationThanases Pheidas University of Crete and Karim Zahidi University of Antwerp
Decision problems in Algebra and analogues of Hilbert s tenth problem A tutorial presented at American Institute of Mathematics and Newton Institute of Mathematical Sciences Thanases Pheidas University
More informationDimension Theory. Mathematics 683, Fall 2013
Dimension Theory Mathematics 683, Fall 2013 In this note we prove some of the standard results of commutative ring theory that lead up to proofs of the main theorem of dimension theory and of the Nullstellensatz.
More informationUndecidability of C(T 0,T 1 )
Undecidability of C(T 0,T 1 ) David A. Pierce 1997; recompiled, April 4, 2017 Mathematics Dept Mimar Sinan Fine Arts University, Istanbul david.pierce@msgsu.edu.tr http://mat.msgsu.edu.tr/~dpierce/ We
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
More informationDefinable henselian valuation rings
Definable henselian valuation rings Alexander Prestel Abstract We give model theoretic criteria for the existence of and - formulas in the ring language to define uniformly the valuation rings O of models
More informationIntroduction to Lucas Sequences
A talk given at Liaoning Normal Univ. (Dec. 14, 017) Introduction to Lucas Sequences Zhi-Wei Sun Nanjing University Nanjing 10093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun Dec. 14, 017
More informationPart 1. For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form
Commutative Algebra Homework 3 David Nichols Part 1 Exercise 2.6 For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form m 0 + m
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More information0.1 Valuations on a number field
The Dictionary Between Nevanlinna Theory and Diophantine approximation 0. Valuations on a number field Definition Let F be a field. By an absolute value on F, we mean a real-valued function on F satisfying
More informationDecidability of Sub-theories of Polynomials over a Finite Field
Decidability of Sub-theories of Polynomials over a Finite Field Alla Sirokofskich Hausdorff Research Institute for Mathematics Poppelsdorfer Allee 45, D-53115, Bonn, Germany Department of Mathematics University
More informationTheory of Computation (IX) Yijia Chen Fudan University
Theory of Computation (IX) Yijia Chen Fudan University Review The Definition of Algorithm Polynomials and their roots A polynomial is a sum of terms, where each term is a product of certain variables and
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationInfinite rank of elliptic curves over Q ab and quadratic twists with positive rank
Infinite rank of elliptic curves over Q ab and quadratic twists with positive rank Bo-Hae Im Chung-Ang University The 3rd East Asian Number Theory Conference National Taiwan University, Taipei January
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 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 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 informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationModel theory, stability, applications
Model theory, stability, applications Anand Pillay University of Leeds June 6, 2013 Logic I Modern mathematical logic developed at the end of the 19th and beginning of 20th centuries with the so-called
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 informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
More informationMaximal Class Numbers of CM Number Fields
Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis
More informationTHE SET OF NONSQUARES IN A NUMBER FIELD IS DIOPHANTINE
THE SET OF NONSQUARES IN A NUMBER FIELD IS DIOPHANTINE BJORN POONEN Abstract. Fix a number field k. We prove that k k 2 is diophantine over k. This is deduced from a theorem that for a nonconstant separable
More informationHilbert s Tenth Problem for Subrings of the Rationals
Hilbert s Tenth Problem for Subrings of the Rationals Russell Miller Queens College & CUNY Graduate Center Special Session on Computability Theory & Applications AMS Sectional Meeting Loyola University,
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
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 Integral Domains and Fraction Fields 0.1.1 Theorems Now what we are going
More informationABSOLUTE VALUES AND VALUATIONS
ABSOLUTE VALUES AND VALUATIONS YIFAN WU, wuyifan@umich.edu Abstract. We introduce the basis notions, properties and results of absolute values, valuations, discrete valuation rings and higher unit groups.
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 informationMore Model Theory Notes
More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A M with A M finite, and any
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationA WEAK VERSION OF ROLLE S THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3147 3153 S 0002-9939(97)03910-5 A WEAK VERSION OF ROLLE S THEOREM THOMAS C. CRAVEN (Communicated by Wolmer
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 informationOSTROWSKI S THEOREM. Contents
OSTROWSKI S THEOREM GEUNHO GIM Contents. Ostrowski s theorem for Q 2. Ostrowski s theorem for number fields 2 3. Ostrowski s theorem for F T ) 4 References 5. Ostrowski s theorem for Q Definition.. A valuation
More informationarithmetic properties of weighted catalan numbers
arithmetic properties of weighted catalan numbers Jason Chen Mentor: Dmitry Kubrak May 20, 2017 MIT PRIMES Conference background: catalan numbers Definition The Catalan numbers are the sequence of integers
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationModel Theory of Differential Fields
Model Theory, Algebra, and Geometry MSRI Publications Volume 39, 2000 Model Theory of Differential Fields DAVID MARKER Abstract. This article surveys the model theory of differentially closed fields, an
More informationALGEBRA EXERCISES, PhD EXAMINATION LEVEL
ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)
More informationQuaternion algebras over local fields
Chapter 11 Quaternion algebras over local fields In this chapter, we classify quaternion algebras over local fields; this generalizes the classification of quaternion algebras over R. 11.1 Local quaternion
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 informationPrimitive recursive functions: decidability problems
Primitive recursive functions: decidability problems Armando B. Matos October 24, 2014 Abstract Although every primitive recursive (PR) function is total, many problems related to PR functions are undecidable.
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
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 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 informationPlaces of Number Fields and Function Fields MATH 681, Spring 2018
Places of Number Fields and Function Fields MATH 681, Spring 2018 From now on we will denote the field Z/pZ for a prime p more compactly by F p. More generally, for q a power of a prime p, F q will denote
More informationAlgebraic Varieties. Chapter Algebraic Varieties
Chapter 12 Algebraic Varieties 12.1 Algebraic Varieties Let K be a field, n 1 a natural number, and let f 1,..., f m K[X 1,..., X n ] be polynomials with coefficients in K. Then V = {(a 1,..., a n ) :
More information