MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
|
|
- Barnard Allen
- 5 years ago
- Views:
Transcription
1 MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real line Thus a detail study of the real numbers is important However, such a study will take up quite a bit of time So we shall take a quicker approach by drawing up some essential properties about real numbers, and to deduce some consequences from them (W Rudin, Principles of Mathematical Analysis, or E Landau, Foundations of analysis, 2nd) Proposition (Associative law of addition) If a, b and c are any numbers, then a + (b + c) = (a + b) + c Proposition 2 (Existence of additive identity) There is a number denoted by 0 such that for any number a 0 + a = a + 0 = a Proposition 3 (Existence of additive inverse) For every number a there is a number denoted by a such that a + ( a) = ( a) + a = 0 Proposition 4 (Commutative law for addition) If a, b are any numbers, then a + b = b + a Proposition 5 (Associative law for multiplication) If a, b and c are any numbers, then a (b c) = (a b) c Proposition 6 (Existence of multiplication identity) There is a number denoted by, such that for any number a, a = a = a Moreover, 0 Proposition 7 (Existence of multiplicative inverse) For any number a 0 there is a number denoted by a such that a a = a a = Proposition 8 (Commutative law for multiplication) If a and b are any number, then a b = b a Proposition 9 (Distributive law) If a, b and c are any numbers, then a (b + c) = a b + a c Proposition 0 (Trichotomy law) There is a collection of positive numbers For every number a one and only one of the following follows: (i) a = 0 (ii) a is positive (written a > 0) (iii) a is positive Proposition (Closure under addition) If a > 0 and b > 0, then a + b > 0 Proposition 2 (Closure under multiplication) If a > 0 and b > 0, then a b > 0
2 2 MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Definitions a b = a + ( b) a > b means a b > 0 a < b means a b < 0 a b means either a > b or a = b a b means either a < b or a = b From Propositions -2 we may deduce the following consequences: () If x + a = b, then x = b a (x + a) + ( a) = b + ( a) = b a (Definition) x + (a + ( a)) = b a (Proposition ) x + 0 = b a (Proposition 3) x = b a (Proposition 2) (2) If ab = ac and a 0, then b = c a (ab) = a (ac) (Proposition 7) (3) a 0 = 0 for any a (a a)b = (a a)c (Proposition 5) b = c (Proposition 6) b = c a 0 = (0 + 0)a (Proposition 2) = 0a + 0a (Proposition 9) 0a 0a = 0a + (0a 0a) 0 = 0a = 0 a (4) If a b = 0, then either a = 0 or b = 0 If a = 0 and b = 0, then by (3), a b = 0 So there is nothing to prove So we may assume, say, a 0: a (ab) = a 0 (5) ( a)b = (ab) (a a)b = 0 b = 0 b = 0 Therefore ( a)b = (ab) ( a)b + ab = ( a + a)b = 0 b = 0
3 (6) ( a)( b) = ab MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS 3 ( a)( b) (ab) = ( a)( b) + ( a)b (5) = ( a)( b + b) = a 0 = 0 Therefore ( a)( b) = ab (7) If c < 0, then c > 0 For c < 0 means 0 > c which means 0 c > 0 by definition That is, c > 0 (8) If a < 0 and b < 0, then ab > 0 We have a > 0 and b > 0 from (7) From Proposition 2, ( a)( b) > 0 By (6), ab > 0 Remark a 2 > 0 for any a 0 In particular, = 2 = > 0 If a > 0, then a a > 0 by Proposition 2 If a < 0, then a > 0 and a 2 = ( a)( a) > 0 Definition Let N denotes the set of natural numbers That is, the set {, 2, 3, } Let Z denotes the set of integers That is, the set {, 3, 2,, 0,, 2, 3, } Let Q denotes the set of rational numbers or fractions That is, the set of numbers of the form p q where p and q are integers with no common factors and q 0 Clearly the Z and Q satisfy Proposition -2, and hence their consequences However, we shall show that Q is not complete in the following sense Example If x Q, then x 2 2 Proof Suppose not, let x = m n where m, n Z, n 0, and x2 = 2 Then m 2 n 2 = 2 or m2 = 2n 2 and m is even So we may write m = 2k for some k 0 Hence 2n 2 = m 2 = 4k 2 or n 2 = 2k 2 That is, n is also even This contradicts the fact that m and n have no common factors If we consider a bigger set, R the whole real line then we may say that there exists a number x R such that x 2 = 2 This number is denoted by 2 It is called an irrational number Note that we can merely assume its existence and we are unable to prove it exists at the point Even this pose a problem, since there are many different algebraic equations, so it has many different sorts of irrational numbers Clearly such an approach is unsatisfactory Hence we shall assume ione more property later, and this makes all the differences 2 Inequalities Definition For any number a, we define the absolute value or modulus a of it as follows: { a if a 0 a = a if a 0 Its graph looks like f(x) = x
4 4 MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Theorem (I) a b = a b (II) a + b a + b (III) a b a b b a a b Remark We may rewrite (III) as a b a b Proof We distinguish 4 cases: a 0, b 0 2 a 0, b 0 3 a 0, b 0 4 a 0, b 0 Case (I) ab = ab = a b (II) a + b = a + b = a + b Case 4 (I) ab = ab = ( a)( b) = a b (II) a + b = (a + b) = a + ( b) = a + b Case 2 (I) ab = (ab) = a( b) = a b To prove (II) in this case, we must prove that a + b a + b = a b If a + b 0, we need to show a + b = a + b a b That is, b b which is the case If a + b 0, we need to show a + b = a + b a b That is, a b a b That is, a a which is the case again For (III), we need only a = a b + b a b + b That is, a b a b and b = b a + a b a + a That is, b a a b Proposition 3 (Principle of mathematical induction) Let A be any collection (or set) of natural numbers with the properties () A and (2) k + A whenever k A Then A = N Bernoulli s inequality If h + > 0 then ( + h) n + nh for n N Clearly, it is true if n = So suppose it is valid for n That is, suppose ( + h) n + nh ( + h) n+ = ( + h)( + h) n ( + h)( + nh) = + nh + h + nh 2 = + (n + )h + nh 2 > + (n + )h Hence Bernoulli s inequality follows from the principle of induction Theorem 2 Every non-empty set A of natural numbers has a least member Proof Suppose that this is not the case In particular, / A Let B be the set of natural numbers,, n which are not in A Clearly B Suppose the natural number k B, then k + must also belong to B For suppose + k A, then k + would be the least member of A A contradiction Hence k + B Hence B = N from Proposition 3 and A = Remark The empty set is the only set of natural number without a least member We note that Theorem 2 is equivalent to the principle of induction That is, we can deduce Proposition 3 from Theorem 2 We leave this this as an exercise
5 MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS 5 3 A useful inequality The Greek letter epsilon ɛ is usually need in analysis for a small or arbitrary quantity If a < b + ɛ for any given ɛ (That is, no matter how small) then it follows that a b For suppose it is not true that a b, then a > b must be true Since ɛ is arbitrary, we choose ɛ = a b > 0 Then a < b + ɛ = b + (a b) = a A contradiction Hence a b must be true One can argue similarly that if x a < ɛ is true for any ɛ > 0, where x is a variable and a is fixed Then x = a (Try this!) 4 Least upper bounds Definition A set A of real numbers is said to be bounded above if (there exists) a number a such that x a for all x A Such a number is called an upper bound for A Example If A = {x 0 x } then, 2, 00, 0 are all upper bounds of A Similarly, A = {x 0 x < } has the same upper bounds However, none of the upper bounds actually belongs to A Definition A number a is a least upper bound (or supremum) of A if () a is an upper bound (2) if b is an upper bound then a b Remark Note that if a and b are both least upper bounds for A, then it is easy to see that a = b So we may speak of the least upper bound A set of real numbers is said to be bounded below if there is a number a such that x a for all x a A number a is the greatest lower bound (or infimum) of A if () a is a lower bound (2) if b is a lower bound then a b 5 The least upper bound property of R Proposition 4 If A is a non-empty set of real numbers and A is bounded above, then A has a supremum (sup A) or least upper bound (inf b) We note that Proposition 4 cannot be deduced from Proposition -3 And that it is an assumption only for R For example, this assumption is not true for Q Let A be the set of all real numbers x satisfying x 2 < 2, then there is no rational number q which is an upper bound for A Theorem 3 The set of natural numbers N is not bounded above Proof Suppose that N is bounded above Note that N is not empty Hence there exists a supremum α of N by Proposition 4 That is, n α for all n N That is, n + α for all n N since n + N by Proposition 3 That is, n α for all n N That is, α is an upper bound for N and which is less than α the supremum A contradiction Corollary 4 For any ɛ > 0 there is a natural number n with n < ɛ Proof Suppose this is not true, then there exists an ɛ > 0 such that n ɛ for all n N That is, n ɛ for all n N This contradicts Theorem 3 Theorem 5 There exists a positive real number a such that a 2 = 2 Proof We define S = {s R : s 0 and s 2 < 2} Clearly the set S is non-empty and bounded above Hence it has a supremum α by Proposition 4 We shall show that α 2 < 2 or α 2 > 2 are both impossible
6 6 MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS First we assume that α 2 < 2 That is, 2 α 2 > 0 Also note that α > Notice that 2 α2 2α+ is a positive number and hence we may find a n N such that This follows from corollary 4 Consider n < 2 α2 2α + (α + n )2 = α α n + n 2 α2 + (2α + ) n < α 2 + (2 α 2 ) = 2 Hence (α + n ) < 2 and this implies that α + n S, contradicting the fact that alpha is the supremum of S Hence α 2 2 The proof that α 2 > 2 is impossible is left as an exercise Theorem 6 Every interval (0, b) contains a rational numbers Proof Since b a > 0 it follows from Corollary 4 that there exists a rational number k such that k < b a Define A = {n N n k > a} Since A is not empty (why?) and so it must have a least member n 0 say, by Theorem 2 That is, n 0 k > a and n 0 a k Notice that a < n 0 k a + k < b Hence n 0 k is the required rational number Corollary 7 Every interval (a, b) contains an irrational number Proof Simply consider ( a 2, b 2 ) then it contains a rational r by Theorem 6 That is, a 2 < r < b 2 or a < r 2 < b And it is easy to show that r 2 is an irrational 6 Further properties about supremum etc Definition If a set S has a largest element M, we call M the maximum of the set S and write M = max S If S has a smallest element m, we call m the minimum of S and write m = min S Let us recall the example A = {x 0 x } and A = {x 0 x < } Clearly max A = = sup A and min A = 0 = inf A However although min A exists and equals 0, max A doesn t exist But sup A exists and equal Example B = { n : n N} Find max B, min B, sup B, inf B max B = = sup B It is easy to see that there is no min B For suppose min B = n 0 for some n 0 then n 0 + < n 0 We show inf B = 0 First note that inf B 0 For suppose inf B < 0 then 0 > inf B 2 > inf B is a lower bound greater than inf B Hence inf B 0 Suppose inf B > 0 Then by Corollary 4, one can find n N such that < inf B n This contradicts the definition of inf B Hence inf B = 0
7 MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS 7 Theorem 8 Suppose that S is a non-empty set of real numbers which is bounded above and ξ > 0 Then Proof Let α = sup S So Therefore sup{ξx x S} ξα That is, Let β = supξx then That is, sup ξ x = ξ sup x x α for all x S That is, ξx ξα for all x S sup ξx ξα = ξ sup x ξx β for all x S ξ (ξx) β ξ for all x S(ξ > 0) x ξ β Hence result follows α = sup x ξ β ξ sup x sup ξx We list some simple results (i) ξ > 0, and S is bounded above sup ξs = ξ sup S, ξs = ξ inf S (ii) ξ < 0, sup ξs = ξ inf S, inf ξs = ξ sup S In particular, if S = { x x S} then sup( S) = inf S and inf( S) = sup S (iii) Suppose both A and B are bounded above, then where A + B = {a + b a A, b B} sup A + sup B = sup(a + B), 7 Countable and uncountable sets Some definitions Two sets A and B are said to be equivalent written as A B, if there exists a one-to-one correspondence f : A B (that is, a bijection) A set A R is finite if there is a n N such that A {, 2,, n} A set which is not finite is called infinite A set A R is called countably infinite (or denumerable) if A N A set is called countable if it is either finite or countably infinite A set is called uncountable if it is not countable Theorem 9 If f : A B is an injection and B is countable then A is also countable
8 8 MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Proof We may assume that A is infinite, otherwise there is nothing to prove Since A f(a) and hence f(a) B is also infinite This implies that B is countably infinite (that is, not finite) Let ϕ : N B be a bijection and ϕ(n) = b n That is, we put B = {b, b 2, } Now let k be the first integer such that b k f(a); let k 2 k be the next integer so that b k2 f(a), etc Then f(a) = {b k, b k2, b k3, } Now define g : f(a) N by g(b ki ) = i which is clearly a bijection The composed mapping g f : A N shows that A N as required Corollary 0 Every subset of a countable set is countable Theorem If A and B are countably infinite then the Cartesian product A B is countably infinite Proof We may write A = {a, a 2, a 3, } and B = {b, b 2, b 3, } We write A B in the following way (a, b ) (a, b 2 ) (a, b 3 ) (a 2, b ) (a 2, b 2 ) (a 2, b 3 ) (a 3, b ) (a 3, b 2 ) (a 3, b 3 ) Define ϕ : A B N by φ(a, b ) =, φ(a, b 2 ) = 2, φ(a 2, b ) = 3, φ(a, b 3 ) = 4, φ(a 2, b 2 ) = 5, φ(a 3, b ) = 6, φ(a, b 4 ) = 7, Theorem 2 The set Q of all rational numbers is countably infinite Theorem 3 For any a, b R, the interval (a, b) is uncountable Proof It is sufficient to consider the interval (0, ) We assume on the contrary that the set is countable Recall that any number in (0, ) can be written as 0a a 2 a 3 a 4 = a 0 + a a where a, a 2, a 3, are digits taken from 0 to 9 So we may list (0, ) as {a, x 2, x 3, } such that x = a a 2 a 3 a n x 2 = a 2 a 22 a 23 a 2n x 3 = a 3 a 32 a 33 a 3n x n = a n a n2 a n3 a nn So any number in (0, ) can be found from the above list We now defined a number as follows { 7 a ii 7 x = b b 2 b 3 b n where b i = 8 a ii = 7 Then clearly the x differs from any number of {a, x 2, } by at least one digit That is, x is not on the list A contradiction
Structure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationDescribing the Real Numbers
Describing the Real Numbers Anthony Várilly Math 25a, Fall 2001 1 Introduction The goal of these notes is to uniquely describe the real numbers by taking certain statements as axioms. This exercise might
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More informationLecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay
Lecture Notes in Real Analysis 2010 Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay August 6, 2010 Lectures 1-3 (I-week) Lecture 1 Why real numbers? Example 1 Gaps in the
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationCardinality and ordinal numbers
Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.
More informationHomework 1 (revised) Solutions
Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationECARES Université Libre de Bruxelles MATH CAMP Basic Topology
ECARES Université Libre de Bruxelles MATH CAMP 03 Basic Topology Marjorie Gassner Contents: - Subsets, Cartesian products, de Morgan laws - Ordered sets, bounds, supremum, infimum - Functions, image, preimage,
More information1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
More informationSuppose R is an ordered ring with positive elements P.
1. The real numbers. 1.1. Ordered rings. Definition 1.1. By an ordered commutative ring with unity we mean an ordered sextuple (R, +, 0,, 1, P ) such that (R, +, 0,, 1) is a commutative ring with unity
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationSets, Structures, Numbers
Chapter 1 Sets, Structures, Numbers Abstract In this chapter we shall introduce most of the background needed to develop the foundations of mathematical analysis. We start with sets and algebraic structures.
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationMath 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012
Instructions: Answer all of the problems. Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Definitions (2 points each) 1. State the definition of a metric space. A metric space (X, d) is set
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationA NEW SET THEORY FOR ANALYSIS
Article A NEW SET THEORY FOR ANALYSIS Juan Pablo Ramírez 0000-0002-4912-2952 Abstract: We present the real number system as a generalization of the natural numbers. First, we prove the co-finite topology,
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the
More informationSTA2112F99 ε δ Review
STA2112F99 ε δ Review 1. Sequences of real numbers Definition: Let a 1, a 2,... be a sequence of real numbers. We will write a n a, or lim a n = a, if for n all ε > 0, there exists a real number N such
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationAnalysis I. Classroom Notes. H.-D. Alber
Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21
More informationDefinition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationDiscrete Mathematics 2007: Lecture 5 Infinite sets
Discrete Mathematics 2007: Lecture 5 Infinite sets Debrup Chakraborty 1 Countability The natural numbers originally arose from counting elements in sets. There are two very different possible sizes for
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
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 informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationProf. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.
1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and
More informationImportant Properties of R
Chapter 2 Important Properties of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference
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 informationMATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7
MATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #7 Real Number Summary of terminology and theorems: Definition: (Supremum & infimum) A supremum (or least upper bound) of a non-empty
More informationMAS221 Analysis, Semester 1,
MAS221 Analysis, Semester 1, 2018-19 Sarah Whitehouse Contents About these notes 2 1 Numbers, inequalities, bounds and completeness 2 1.1 What is analysis?.......................... 2 1.2 Irrational numbers.........................
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationSection 2.5 : The Completeness Axiom in R
Section 2.5 : The Completeness Axiom in R The rational numbers and real numbers are closely related. The set Q of rational numbers is countable and the set R of real numbers is not, and in this sense there
More informationEconomics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa:
Economics 04 Summer/Fall 011 Lecture Tuesday July 6, 011 Section 1.4. Cardinality (cont.) Theorem 1 (Cantor) N, the set of all subsets of N, is not countable. Proof: Suppose N is countable. Then there
More informationNotes on Ordered Sets
Notes on Ordered Sets Mariusz Wodzicki September 10, 2013 1 Vocabulary 1.1 Definitions Definition 1.1 A binary relation on a set S is said to be a partial order if it is reflexive, x x, weakly antisymmetric,
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More information1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation
1. Foundations of Numerics from Advanced Mathematics Mathematical Essentials and Notation Mathematical Essentials and Notation, October 22, 2012 1 The main purpose of this first chapter (about 4 lectures)
More information2.1 Convergence of Sequences
Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationPostulate 2 [Order Axioms] in WRW the usual rules for inequalities
Number Systems N 1,2,3,... the positive integers Z 3, 2, 1,0,1,2,3,... the integers Q p q : p,q Z with q 0 the rational numbers R {numbers expressible by finite or unending decimal expansions} makes sense
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE. B.Sc. MATHEMATICS V SEMESTER. (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CORE COURSE B.Sc. MATHEMATICS V SEMESTER (2011 Admission onwards) BASIC MATHEMATICAL ANALYSIS QUESTION BANK 1. Find the number of elements in the power
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationChapter 3 Continuous Functions
Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationREAL ANALYSIS: INTRODUCTION
REAL ANALYSIS: INTRODUCTION DR. RITU AGARWAL EMAIL: RAGARWAL.MATHS@MNIT.AC.IN MALVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR Contents 1. The real number system 1 2. Field Axioms 1 3. Order Axioms 2 4.
More informationMATH 131A: REAL ANALYSIS (BIG IDEAS)
MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.
More informationABSTRACT INTEGRATION CHAPTER ONE
CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationA Short Review of Cardinality
Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the
More informationEcon Lecture 2. Outline
Econ 204 2010 Lecture 2 Outline 1. Cardinality (cont.) 2. Algebraic Structures: Fields and Vector Spaces 3. Axioms for R 4. Sup, Inf, and the Supremum Property 5. Intermediate Value Theorem 1 Cardinality
More informationHomework 1 Solutions
MATH 171 Spring 2016 Problem 1 Homework 1 Solutions (If you find any errors, please send an e-mail to farana at stanford dot edu) Presenting your arguments in steps, using only axioms of an ordered field,
More informationMidterm Review Math 311, Spring 2016
Midterm Review Math 3, Spring 206 Material Review Preliminaries and Chapter Chapter 2. Set theory (DeMorgan s laws, infinite collections of sets, nested sets, cardinality) 2. Functions (image, preimage,
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationIntroduction to Real Analysis
Christopher Heil Introduction to Real Analysis Chapter 0 Online Expanded Chapter on Notation and Preliminaries Last Updated: January 9, 2018 c 2018 by Christopher Heil Chapter 0 Notation and Preliminaries:
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationF (x) = P [X x[. DF1 F is nondecreasing. DF2 F is right-continuous
7: /4/ TOPIC Distribution functions their inverses This section develops properties of probability distribution functions their inverses Two main topics are the so-called probability integral transformation
More information3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers
Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationMATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6
MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction
More informationCopyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction
Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More information1 Homework. Recommended Reading:
Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis
More information1 Definition of the Riemann integral
MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationSection 4.4 Functions. CS 130 Discrete Structures
Section 4.4 Functions CS 130 Discrete Structures Function Definitions Let S and T be sets. A function f from S to T, f: S T, is a subset of S x T where each member of S appears exactly once as the first
More information