Ultraproducts and Applications I


 Amber Walters
 1 years ago
 Views:
Transcription
1 Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013
2 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer Principal Sample Theorems
3 History Liebniz proved that d(xy) = xdx + ydy as follows. d(xy) = (x + dx)(x + dy) xy = xy + xdy + ydx + dxdy xy = xdy + ydx + dxdy = xdy + ydx Can this proof be made rigorous? Without talking about limits (or ɛ and δ)?
4 History Around 1670 Newton and Leibniz used infinitesimal quantities, but the foundations of calculus were controversial until the mid 1800 s. ɛδ arguments were in use in the early 1800 s. Dedekind, Cantor and others: gave an explicit construction of the reals from the rationals around The foundations of calculus were solid by the 1870 s. Robinson showed, around 1960, that...the concepts and methods of mathematical logic are capable of providing a suitable framework for the development of the Differential and Integral Calculus by means of infinitely small and infinitely large quantities.
5 The Idea of Hyperreals What is an infintesimal? Idea: A sequence of real numbers a = a 0, a 1,... satisfying lim n a n = 0 will be regarded as an infinitesimal, while if lim n a n = then the sequence a will be an infinitely large quantity. E.g. 1, 1 2, 1 3,... will be twice 1 2, 1 4, 1 6,....
6 The Idea of Hyperreals R R is a new number system containing infinitesimal and infinite elements. Q R = equivalence classes of Cauchy sequences of rationals R R = equivalence classes of sequences of reals. But these equivalence relation are very different.
7 The Idea of Hyperreals In building R, sequences of reals a = a 0, a 1,... and b = b0, b 1,... will be identified if they agree at a Large number of places. In other words, a b if {n N : a n = b n } is large. What properties should largeness satisfy?
8 Filters Largeness (These properties can be derived) N should be large and should not be large. If A and B are large subsets of N then A B should be large. If A N is large and A B N then B should be large. Definition If X is a set then F is a filter on X if F is a collection of subsets of X such that (i) / F and X F, (ii) if A, B F then A B F, and (iii) if A F and A B X then B F. Idea: A X is large if and only if A F
9 Filters Examples: The cofinite filter on N F co = {A N : N \ A is finite} {2n : n N} / F co {2, 4, 6, 7, 8, 9, 10, 11, 12, 13...} F co If x X then the following is called the principal filter generated by x. F x = F {x} = {Y X : x Y }
10 Ultrafilters A filter U on X is an ultrafilter if (iv) for every A X either A F or X \ A U. Examples: If n N then the principal filter generated by n, namely F n = {Y N : n Y } is an ultrafilter but not a very useful one. Question: Are there any nonprincipal ultrafilters on N?
11 Theorem If X is an infinite set then there is a nonprincipal ultrafilter U on X. Zorn s Lemma tells us that maximal filters exist on X, and maximal filters are ultrafilters. The ultrafilter U given by Zorn s Lemma can be assumed to be nonprinciple because we can assume F co (X ) = {A X : X \ A is finite} U.
12 Definition of Hyperreals We want to expand the domain of the structure The new domain will be R = R, 0, 1, +,,. R N = set of infinite sequences of reals For sequences a = a 0, a 1,... and b = a 0, a 1,... define 0 = 0, 0,... a b = a 0 a 1, b 0 b 1,... 1 = 1, 1,... a b iff n N (a n b n ) a b = a 0 + b 0, a 1 + b 1,...
13 This new structure is not a field R N, 0, 1,,, because 0, 1, 0, 1, 0 has no inverse and it is not linearly ordered But this can be fixed... because 0, 1, 0, 1, is not comparable to 1, 0, 1, 0,.
14 From here on, fix U to be a nonprinciple ultrafilter on N with U F co. Define an equivalence relation on R N by a 0, a 1,... b 0, b 1,... a n equals b n for a large set of n The equivalence class {n N : a n = b n } U. [ a] U = [ a] = [ a n ] = { b R N : b a} is just the set of all sequences of reals that are almost equal to a. So for example, 3, 7, 2, 1, 1, 1, 1,... is equivalent to 1, 1, 1, 1, 1, 1, 1,...
15 We now define a structure with domain the set of equivalence classes: R N /U. Adding equivalence classes: [ a] + [ b] := [ a b] = [ a n + b n : n N ] (Welldefined) If c, d R N and we have {n : a n = c n } U and {n : d n = b n } U, then {n : a n + b n } = {n : a n = c n } {n : b n = d n } U. Multiplying equivalence classes: [ a] [ b] = [ a b] = [ a n b n : n N ] (well defined) Ordering equivalence classes: [ a] [ b] : {n N : a n b n } U [ a] < [ b] : {n N : a n < b n } U This defines a new structure: R N /U, [ 0], [ 1], +,,
16 Ordered Field Theorem R N /U, [ 0], [ 1], +,, is a linearly ordered field. (Additive Inverses) [ a n : n N ] = [ a n : n N ] (Multiplicative Inverses) If [ a] = [ a n : n N ] [ 0] then {n N : a n 0} U and we can define b by { (a n ) 1 if a n 0 b n := 0 otherwise Then [ b] [ a] = [ 1]. (Linearity) this is where we need the ultra part of ultrafilter N = {n : a n < b n } {n : a n = b n } {n : b n < a n }
17 R This structure is called the hyperreals and is denoted by R = R N /U, [ 0], [ 1], +,, In Summary, elements of R are equivalence classes of sequences of reals defined using U, +,, are all defined using U, R is a linearly ordered field, and there is a copy of R sitting nicely inside of R.
18 Fitting R inside R Theorem There is a natural orderpreserving field isomorphism from R into R. f :R R r r := [ r, r, r,... ] R will be identified with the copy of R sitting inside R, in the same way that Q is often identified with the copy of Q sitting inside R. In other words, if r R we sometimes mean r, r, r,... when we write r.
19 Infinitesimals and Infinities R contains infinitesimal and infinite elements! Infintesimals Let a = 1, 1 2, 1 3,.... Then [ a] R. If r R >0 we have {n N : a n < r} is cofinite and is thus in U F co. So we have [ a] < r. In other words, [ a] is less than every positive real number. Infinities Let b = 0, 1, 2, 3,.... Then [ b] R. If r R we have {n N : b n > r} is cofinite and is thus in U F co. So we have r < [ b]. In other words, [ b] is greater than every positive real number.
20 Definitions A hyperreal a R is... limited if there are real numbers r, s R such that r < a < s. infinitesimal if for all positive reals r R >0 one has r < a < r. unlimited if either for all reals r R one has r < a or for all reals r R one has a < r.
21 Definition Two hyperreals a, b R are said to be infinitely close to each other if their difference a b is infinitesimal. The halo of a hyperreal a R is the set hal(a) = {b R : a and b are infintesimaly close}
22 The operation Extending sets If A R then A denotes the collection of hyperreals that are represented by a sequence a whose components are almost always in A i.e., {n N : a n A} U. N N contains unlimited (infinite) elements. [Draw pictures of N and R.]
23 The operation Extending functions If f : R R is a function then f : R R denotes the function defined by f ([ a]) := [ f (a n ) : n N ]. We have f R = f.
24 The operation Extending sequences If f : N R is a sequence then f : N R denotes the hypersequence defined as follows. If [ a] N what should f ([ a]) be? Since [ a] N we have {n N : a n N} U. Define b R N by b n := { f (a n ) if a n N 0 otherwise Then {n N : b n = f (a n )} U. Define f ([ a]) = [ b] (welldefined)
25 The operation Example: The statement x m(x < m and m N) is true about R but false about R (b/c there are hyperreals larger than every natural number). We can apply this operation to statements. E.g. ( x R m N(x < m)) = x R m N(x < m) Fix a natural number n N. Consider the statement: ( x N(n x n + 1 implies x = n or x = n + 1)) = x N( n x (n + 1) implies x = n or x = (n + 1))
26 The Transfer Principle The operation preserves the truth of firstorder statements. Theorem (The Transfer Principle) Suppose ϕ is a firstorder statement in the language of R. Then ϕ is true about R if and only if ϕ is true about R. The statements asserting that R is a linearly ordered field ( x, y R(x + y = y + x), etc.) are true about R and so by the theorem R is a linearly ordered field.
27 Los Theorem Theorem ( Los Theorem) For any firstorder formula ϕ(x 1,..., x k ) in the language of R and any r 1,..., r k R N, the sentence ϕ([r 1 ],..., [r k ]) is true if and only if ϕ(r 1 n,..., r k n ) is true for almost all n N. more about this in the next lecture.
28 Sample Theorems Theorem A realvalued sequence s n : n N converges to L R if and only if s n is infinitely close to L for all unlimited n. Recall that a sequence of reals s n : n N can be extended to a hyper sequence s n : n N = s n : n N of hyperreals s n R. Convergence to L amounts to the requirement that the extended tail of the sequence is contained in the halo of L. The role of the standard tails is taken over by the extended tail and the standard open neighborhoods (L ɛ, L + ɛ) are replaced by the infinitesimal neighborhood hal(l).
29 Sample Theorems Recall that for a, b R, we say a is infinitely close to b if and only if a b is infinitesimal. Theorem A function f : R R is continuous at the real point c R if and only if f (x) is infinitely close to f (c) for all x R such that x is infinitely close to c, i.e. if and only if f (hal(c)) hal(f (c)).
30 Sample Theorems Every hyperreal a R has a shadow in R, denoted by sh(r), defined to be the unique real that is infinitesimally close to a. Theorem (Intermediate Value Theorem) If a function f : R R is continuous on [a, b] where a, b R, then for every real d with f (a) < d < f (b) there is a real c (a, b) such that f (c) = d. Idea of proof using infintesimals: Partition [a, b] into intervals of equal infinitesimal width. Find an interval whose end points have f values on either side of d. Then c will be the common shadow of these endpoints.
31 Next Time Ultraproducts! More about Los Theorem. Robinson s Theorem. Let ϕ be a firstorder statement in the language of fields (i.e., referring only to 0, 1, + and ). Then ϕ is true about C if and only if there are arbitrarily large primes p such that the statement ϕ is true of some algebraically closed field of characteristic p. AxGrothendieck Theorem. Every injective polynomial map f : C n C n is bijective.
1 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 informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
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 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 informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationk=1 k2, and therefore f(m + 1) = f(m) + (m + 1) 2 =
Math 104: Introduction to Analysis SOLUTIONS Alexander Givental HOMEWORK 1 1.1. Prove that 1 2 +2 2 + +n 2 = 1 n(n+1)(2n+1) for all n N. 6 Put f(n) = n(n + 1)(2n + 1)/6. Then f(1) = 1, i.e the theorem
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 informationSETS, RELATIONS, AND FUNCTIONS
September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four
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 information8.1 Examples, definitions, and basic properties
8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A kform ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)form σ Ω k 1 (M) such that dσ = ω.
More informationLECTURE 1: DIFFERENTIAL FORMS. 1. 1forms on R n
LECTURE 1: DIFFERENTIAL FORMS 1. 1forms on R n In calculus, you may have seen the differential or exterior derivative df of a function f(x, y, z) defined to be df = f f f dx + dy + x y z dz. The expression
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 informationx < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).
12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More informationFinite Sets. Theorem 5.1. Two nonempty finite sets have the same cardinality if and only if they are equivalent.
MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we
More informationLectures 56: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5: Taylor Series Weeks 5 Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
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 informationReview for Final Exam
Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters
More informationFirstOrder Logics and Truth Degrees
FirstOrder Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 1519 July 2014 George Metcalfe (University of Bern) FirstOrder Logics
More informationIntroducing Functions
Functions 1 Introducing Functions A function f from a set A to a set B, written f : A B, is a relation f A B such that every element of A is related to one element of B; in logical notation 1. (a, b 1
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 informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS 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 the identity, such that (i) the
More informationMath 313 Lecture #10 2.2: The Inverse of a Matrix
Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is
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 informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationINTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 =0, x 1 = π 4, x
More informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More informationRadboud Universiteit Nijmegen
Radboud Universiteit Nijmegen Faculteit der Natuurwetenschappen, Wiskunde en Informatica Uniqueness of the Hyperreal Field Noud Aldenhoven (0620874) Supervisor: dr. W.H.M. Veldman Second reader: prof.
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
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 information3. Equivalence Relations. Discussion
3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,
More informationMathematics 31 Precalculus and Limits
Mathematics 31 Precalculus and Limits Overview After completing this section, students will be epected to have acquired reliability and fluency in the algebraic skills of factoring, operations with radicals
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 informationDIVISORS IN A DEDEKIND DOMAIN. Javier Cilleruelo and Jorge JiménezUrroz. 1 Introduction
DIVISORS IN A DEDEKIND DOMAIN Javier Cilleruelo and Jorge JiménezUrroz 1 Introduction Let A be a Dedekind domain in which we can define a notion of distance. We are interested in the number of divisors
More information2 Complex Functions and the CauchyRiemann Equations
2 Complex Functions and the CauchyRiemann Equations 2.1 Complex functions In onevariable calculus, we study functions f(x) of a real variable x. Likewise, in complex analysis, we study functions f(z)
More informationPOWER SETS AND RELATIONS
POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty
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 informationPART I. THE REAL NUMBERS
PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS
More informationThe 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 informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H1088 Budapest, Múzeum krt. 68. CONTENTS 1. SETS Set, equal sets, subset,
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationReference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.
5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2
More informationExamples and Exercises
Examples and Exercises Guerino Mazzola January 6, 00 Example of A Rigorous Proof Claim: Let a, b, c be sets. Then we have c (a b) = (c a) (c b). Proof. By definition of equality of sets, we have to prove
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
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 realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationIntroduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
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 informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationDegrees that are not degrees of categoricity
Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara
More informationDiscrete Mathematics, Chapter : Predicate Logic
Discrete Mathematics, Chapter 1.41.5: Predicate Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.41.5 1 / 23 Outline 1 Predicates
More informationChapter 10. Abstract algebra
Chapter 10. Abstract algebra C.O.S. Sorzano Biomedical Engineering December 17, 2013 10. Abstract algebra December 17, 2013 1 / 62 Outline 10 Abstract algebra Sets Relations and functions Partitions and
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 informationSlope and Rate of Change
Chapter 1 Slope and Rate of Change Chapter Summary and Goal This chapter will start with a discussion of slopes and the tangent line. This will rapidly lead to heuristic developments of limits and the
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 informationA number field is a field of finite degree over Q. By the Primitive Element Theorem, any number
Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and
More informationSets and Cardinality Notes for C. F. Miller
Sets and Cardinality Notes for 620111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use
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 informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
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 informationCHAPTER 2. Inequalities
CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationIn mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)
Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics
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 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 informationCARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE
CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify
More informationAppendix F: Mathematical Induction
Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
More informationMA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationColumbia University in the City of New York New York, N.Y. 10027
Columbia University in the City of New York New York, N.Y. 10027 DEPARTMENT OF MATHEMATICS 508 Mathematics Building 2990 Broadway Fall Semester 2005 Professor Ioannis Karatzas W4061: MODERN ANALYSIS Description
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 informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More information(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.
11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order
More informationGeorg Cantor (18451918):
Georg Cantor (84598): The man who tamed infinity lecture by Eric Schechter Associate Professor of Mathematics Vanderbilt University http://www.math.vanderbilt.edu/ schectex/ In papers of 873 and 874,
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
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 information13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcsftl 2010/9/8 0:40 page 379 #385
mcsftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite
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 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 informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationRecall that the gradient of a differentiable scalar field ϕ on an open set D in R n is given by the formula:
Chapter 7 Div, grad, and curl 7.1 The operator and the gradient: Recall that the gradient of a differentiable scalar field ϕ on an open set D in R n is given by the formula: ( ϕ ϕ =, ϕ,..., ϕ. (7.1 x 1
More informationTaylor Polynomials and Taylor Series Math 126
Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will
More information3(vi) B. Answer: False. 3(vii) B. Answer: True
Mathematics 0N1 Solutions 1 1. Write the following sets in list form. 1(i) The set of letters in the word banana. {a, b, n}. 1(ii) {x : x 2 + 3x 10 = 0}. 3(iv) C A. True 3(v) B = {e, e, f, c}. True 3(vi)
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 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 informationDEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsionfree abelian groups, one of isomorphism
More informationHow many numbers there are?
How many numbers there are? RADEK HONZIK Radek Honzik: Charles University, Department of Logic, Celetná 20, Praha 1, 116 42, Czech Republic radek.honzik@ff.cuni.cz Contents 1 What are numbers 2 1.1 Natural
More informationDiscrete Mathematics: Solutions to Homework (12%) For each of the following sets, determine whether {2} is an element of that set.
Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationFACTORIZATION OF TROPICAL POLYNOMIALS IN ONE AND SEVERAL VARIABLES. Nathan B. Grigg. Submitted to Brigham Young University in partial fulfillment
FACTORIZATION OF TROPICAL POLYNOMIALS IN ONE AND SEVERAL VARIABLES by Nathan B. Grigg Submitted to Brigham Young University in partial fulfillment of graduation requirements for University Honors Department
More informationDoug Ravenel. October 15, 2008
Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationECG590I Asset Pricing. Lecture 2: Present Value 1
ECG59I Asset Pricing. Lecture 2: Present Value 1 2 Present Value If you have to decide between receiving 1$ now or 1$ one year from now, then you would rather have your money now. If you have to decide
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationPartitioning edgecoloured complete graphs into monochromatic cycles and paths
arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edgecoloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political
More informationChange of Continuous Random Variable
Change of Continuous Random Variable All you are responsible for from this lecture is how to implement the Engineer s Way (see page 4) to compute how the probability density function changes when we make
More information