In case (1) 1 = 0. Then using and from the previous lecture,
|
|
- Vernon Berry
- 5 years ago
- Views:
Transcription
1 Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty subset P F (called the set of positive elements) such that (1) P is closed under addition: For all a, b P (2) P is closed under multiplication: For all a, b P (3) The trichotomy law: For each x F exactly one of the following holds: (a) (b) (c) Proposition 2 (1 is positive.). Let F be an ordered field and 1 be the multiplicative identity, then 1 P Proof. Suppose for the sake of contradiction that 1 / P. According to the trichotomy law then either (1) 1 = 0 or (2) 1 P. Since P, we let p P. In case (1) 1 = 0. Then using and from the previous lecture, p = 1 p = =, contradicting the trichotomy law because. In case (2) 1 P. Then using from Friday, p = p, Since 1 P we see by closure under multiplication that contradicting the trichotomy law because. The algebraic and order properties of R can be summarized as: Axiom. R is an ordered field. This doesn t look like an ordering does it? involving the symbol <. You might have been expecting something Definition 3. Let F be an ordered field and P be its set of positive elements. If a, b F then we say that a < b if, a > b if a b if, and a b if 1
2 2 Let s begin by proving some properties which inequality should have. Theorem 4 (Properties of <). Let F be an ordered field and a, b, c F. Then (1) (Additivity) If a < b then a + c b + c. (2) (Transitivity) If a < b and b < c then a c. (3) (Multiplicativity) If a < b and 0 < c then a c b c. (4) (Multiplicativity II) If a < b and c < 0 then a c b c. (5) If a 0 then a 2 := a a 0. 1 We (you) will prove (1), (2), and (3) Proof. We ll start with the proof of the first claim: That for all a, b, c F if a < b then a + c b + c. Consider any a, b, c F. Assume that that.. According to Definition 3, this means Thus, and by Definition 3,. This completes the proof of the first result. Next we prove the second claim. Suppose that a, b, c F, and. According to Definition 3, this means that and. Thus we see that and by Definition 3, we conclude that. 1 The notation a 2 := a a is telling you that a 2 is defined to be a a.
3 3 Now we will prove the third claim. Consider any a, b, c F. Assume and. According to Definition 3, this means that and. Thus we see that and by Definition 3, we conclude that. Our next goal is a discussion of the action of raising real numbers (or any element of an ordered field) to a natural number. Definition 5. Let F be a field. For any x F and any natural number n N we define x n recursively by x 1 = x and x n = x x n 1 if n > 1. 2 How should order behave under exponentiation? Theorem 6. Let F be an ordered field (1) Let x F and n be a natural number. If x > 1 then 1 x n (2) Let x F and n be natural number. If 0 < x < 1 then 1 x n (3) Let x = 1 and n be a natural number. Then 1 x n In order to prove this we will need to recall the proof technique called mathematical induction. 3 Proof technique. Let P (n) be a statement which makes sense for every natural number n N. (For example P (n) might be n is even. ) If you can prove that (Base Case) P (1) is true and (Inductive step) For all n N P (n) implies P (n + 1) then you have proven that P (n) is true for all n N. This proof technique cannot be used to prove something for all n R. Let s prove claims (3) and (1) of Theorem 6: Proof of claim 3. Let F be a field and x = 1. Base Case We must show that x This is a more rigorous way of saying that x n = x n times... x 3 Whenever you see a recursive definition, induction might be worth considering.
4 4 Inductive step Consider any n N. Assume that x n 1. We must show that x n+1 1. Thus, by the principle of mathematics induction, If x = 1 then x n 1 for all n N. That was the easiest claim, though. Let s see how well the proof generalizes to the first claim Proof of claim 1. Let F be an ordered field and x > 1. Base Case We must show that x 1 1. Inductive step Consider any n N. Assume that x n 1. We must show that x n+1 1. Thus, by the principle of mathematics induction, If x > 1 then x n 1 for all n N. If there is demand then we will go through the proof of claim 2. Either way, here is an outline: Proof of claim 2. Let F be an ordered field and 0 < x < 1. Base Case We must show that 0 < x 1 < 1. Inductive step Consider any n N. Assume that 0 < x n < 1. We must show that 0 < x n+1 < 1.
5 Thus, by the principle of mathematics induction, If 0 < x < 1 then 0 < x n < 1 for all n N. If we have time, then at this point I will encourage people to begin on today s homework. Next time we will pick up on the absolute value. Absolute value. Continuing from last time, let F be an ordered field. The following function should be familiar. Definition 7 (Absolute Value). The absolute value function on the ordered field F, is defined by if x 0 x = if x < 0 Let s begin by proving some basic (and hopefully familiar) properties of the absolute value. Theorem 8. Let F be an ordered field. let a, b F. Then (1) a 0 (2) a a (3) a a a (4) ab a b (5) If b 0 (b 1 ) ( b ) 1 (6) a b if and only if b a b. (7) The Triangle inequality. a + b a + b (8) a b a b The Triangle inequality is by far the most important (and hardest to prove) of these. We ll talk though the proof of (3) and (6) because we ll need them in the proof of the triangle inequality (7). Proof of claim 3. Let F be an ordered field. Let a F. There are three cases: (0) a = 0 or (1) a > 0 or (2) a < 0. In case (0), a = 0, so that a = and a =. Thus, the inequality we need to check is, which is a truism. 5 In case (1) a > 0 so that a =, and the claimed inequality amounts to the inequalities and. One of these (the 1 st / 2 nd ) is a truism since a = a. To see the other inequality, notice that since a > 0, a 0, by the trichotomy law. By the transitivity law, then a a, completing the proof in case (1). In case (2) a < 0 so that a =, and the claimed inequality amounts to the inequalities and. One of these (the 1 st / 2 nd ) is a
6 6 truism since a = a. To see the other inequality, notice that since a 0, a the transitivity law, then a a, completing the proof in case (1). 0. By Proof of claim 6. Let F be an ordered field and consider any a, b F. ( ) Assume that a b. We must show that b < a and a < b. Since a 0 and b a we have that b 0. Again we will make a case-wise attack. Either (1) a 0 or (2) a < 0. In case (1), a = so that the assumption a b becomes, which proves one of the needed inequalities. Since we have assumed a 0, a 0. Since b 0, it follows that b 0 a and by transitivity completing the proof in this case. In case (2), a = so that the assumption a b becomes. Multiplying both sides by 1 and using Theorem 4, claim (4) we see. This proves one of the desired inequlities. Since b 0, it follows that b 0 a and by transitivity completing the proof in this case. Thus, if a b then b a b. This proves one of the implications. ( ) Suppose that b a and a b. We must show that a < b. Again we make a case-by-case proof. Either (1) a 0 or (2) a < 0. In the first case a = and the inequality to be proven becomes which is precisely the (1 st or 2 nd ) of the assumed inequalities. In the second case a = and the inequality to be proven becomes which is precisely the (1 st or 2 nd ) of the assumed inequalities. Proof of the triangle inequality. Let F be an ordered field and a, b F. We wish to show that a + b a + b. According to claim (6) this is equivalent to proving that or by factoring out the negative sign that Now using claim (3) a a a and b b b. Adding these inequalities together and using the additivity property of Theorem 4 we see that, which we have already seen to be equivalent to the claimed inequality.
In case (1) 1 = 0. Then using and from Friday,
Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationµ (X) := inf l(i k ) where X k=1 I k, I k an open interval Notice that is a map from subsets of R to non-negative number together with infinity
A crash course in Lebesgue measure theory, Math 317, Intro to Analysis II These lecture notes are inspired by the third edition of Royden s Real analysis. The Jordan content is an attempt to extend the
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 informationLecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
More informationMath 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions
Math 4: Principles of Analysis Fall 0 Homework Part B solutions. Let x, y, z R. Use the axioms of the real numbers to prove the following. a) If x + y = x + z then y = z. Solution. By Axiom a), there is
More informationAxioms for the Real Number System
Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,
More informationStructure 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 informationDivisibility = 16, = 9, = 2, = 5. (Negative!)
Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties
More informationMath Lecture 3 Notes
Math 1010 - Lecture 3 Notes Dylan Zwick Fall 2009 1 Operations with Real Numbers In our last lecture we covered some basic operations with real numbers like addition, subtraction and multiplication. This
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationMath 31 Lesson Plan. Day 5: Intro to Groups. Elizabeth Gillaspy. September 28, 2011
Math 31 Lesson Plan Day 5: Intro to Groups Elizabeth Gillaspy September 28, 2011 Supplies needed: Sign in sheet Goals for students: Students will: Improve the clarity of their proof-writing. Gain confidence
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 informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationn n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set
1 Mathematical Induction We assume that the set Z of integers are well defined, and we are familiar with the addition, subtraction, multiplication, and division. In particular, we assume the following
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 informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationTIPS FOR WRITING PROOFS IN HOMEWORK ASSIGNMENTS. 1. Simple rules
TIPS FOR WRITING PROOFS IN HOMEWORK ASSIGNMENTS MARK SKANDERA 1 Simple rules I require my students to follow the rules below when submitting problem sets While other instructors may be more lenient than
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
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 informationDistance in the Plane
Distance in the Plane The absolute value function is defined as { x if x 0; and x = x if x < 0. If the number a is positive or zero, then a = a. If a is negative, then a is the number you d get by erasing
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Math 0 Solutions to homework Due 9//6. An element [a] Z/nZ is idempotent if [a] 2 [a]. Find all idempotent elements in Z/0Z and in Z/Z. Solution. First note we clearly have [0] 2 [0] so [0] is idempotent
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationMath 300 Introduction to Mathematical Reasoning Autumn 2017 Axioms for the Real Numbers
Math 300 Introduction to Mathematical Reasoning Autumn 2017 Axioms for the Real Numbers PRIMITIVE TERMS To avoid circularity, we cannot give every term a rigorous mathematical definition; we have to accept
More informationMath 410 Homework 6 Due Monday, October 26
Math 40 Homework 6 Due Monday, October 26. Let c be any constant and assume that lim s n = s and lim t n = t. Prove that: a) lim c s n = c s We talked about these in class: We want to show that for all
More informationMATH ASSIGNMENT 1 - SOLUTIONS September 11, 2006
MATH 0-090 ASSIGNMENT - September, 00. Using the Trichotomy Law prove that if a and b are real numbers then one and only one of the following is possible: a < b, a b, or a > b. Since a and b are real numbers
More informationMath 104: Homework 1 solutions
Math 10: Homework 1 solutions 1. The basis for induction, P 1, is true, since 1 3 = 1. Now consider the induction step, assuming P n is true and examining P n+1. By making use of the result (1 + +... +
More informationLecture 5 : Proofs DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/3/2011 Lecture 5 : Proofs Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Up until now, we have been introducing mathematical notation
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationMath 414, Fall 2016, Test I
Math 414, Fall 2016, Test I Dr. Holmes September 23, 2016 The test begins at 10:30 am and ends officially at 11:45 am: what will actually happen at 11:45 is that I will give a five minute warning. The
More informationLecture 2: Vector Spaces, Metric Spaces
CCS Discrete II Professor: Padraic Bartlett Lecture 2: Vector Spaces, Metric Spaces Week 2 UCSB 2015 1 Vector Spaces, Informally The two vector spaces 1 you re probably the most used to working with, from
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16
60.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 0/3/6 6. Introduction We talked a lot the last lecture about greedy algorithms. While both Prim
More informationDay 6. Tuesday May 29, We continue our look at basic proofs. We will do a few examples of different methods of proving.
Day 6 Tuesday May 9, 01 1 Basic Proofs We continue our look at basic proofs. We will do a few examples of different methods of proving. 1.1 Proof Techniques Recall that so far in class we have made two
More informationBasics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On
Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen
More informationExercise 2. Prove that [ 1, 1] is the set of all the limit points of ( 1, 1] = {x R : 1 <
Math 316, Intro to Analysis Limits of functions We are experts at taking limits of sequences as the indexing parameter gets close to infinity. What about limits of functions as the independent variable
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationSeunghee Ye Ma 8: Week 2 Oct 6
Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationLecture 3: Latin Squares and Groups
Latin Squares Instructor: Padraic Bartlett Lecture 3: Latin Squares and Groups Week 2 Mathcamp 2012 In our last lecture, we came up with some fairly surprising connections between finite fields and Latin
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More informationPEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms
PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION The Peano axioms The following are the axioms for the natural numbers N. You might think of N as the set of integers {0, 1, 2,...}, but it turns
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 informationOutline. We will now investigate the structure of this important set.
The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't
More information22A-2 SUMMER 2014 LECTURE Agenda
22A-2 SUMMER 204 LECTURE 2 NATHANIEL GALLUP The Dot Product Continued Matrices Group Work Vectors and Linear Equations Agenda 2 Dot Product Continued Angles between vectors Given two 2-dimensional vectors
More informationMatrix-Vector Products and the Matrix Equation Ax = b
Matrix-Vector Products and the Matrix Equation Ax = b A. Havens Department of Mathematics University of Massachusetts, Amherst January 31, 2018 Outline 1 Matrices Acting on Vectors Linear Combinations
More informationLecture 3: Sizes of Infinity
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 3: Sizes of Infinity Week 2 UCSB 204 Sizes of Infinity On one hand, we know that the real numbers contain more elements than the rational
More informationAxiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:
Axiomatic systems Revisiting the rules of inference Material for this section references College Geometry: A Discovery Approach, 2/e, David C. Kay, Addison Wesley, 2001. In particular, see section 2.1,
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 informationMIDTERM REVIEW FOR MATH The limit
MIDTERM REVIEW FOR MATH 500 SHUANGLIN SHAO. The limit Define lim n a n = A: For any ε > 0, there exists N N such that for any n N, a n A < ε. The key in this definition is to realize that the choice of
More informationIntro to Algebra Today. We will learn names for the properties of real numbers. Homework Next Week. Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38
Intro to Algebra Today We will learn names for the properties of real numbers. Homework Next Week Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38 Due Thursday Pages 51-53/ 19-24, 29-36, *48-50, 60-65
More informationIntroduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 3 Dr. Ted Ralphs IE406 Lecture 3 1 Reading for This Lecture Bertsimas 2.1-2.2 IE406 Lecture 3 2 From Last Time Recall the Two Crude Petroleum example.
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 informationLecture 2. Econ August 11
Lecture 2 Econ 2001 2015 August 11 Lecture 2 Outline 1 Fields 2 Vector Spaces 3 Real Numbers 4 Sup and Inf, Max and Min 5 Intermediate Value Theorem Announcements: - Friday s exam will be at 3pm, in WWPH
More informationWell-Ordering Principle. Axiom: Every nonempty subset of Z + has a least element. That is, if S Z + and S, then S has a smallest element.
Well-Ordering Principle Axiom: Every nonempty subset of Z + has a least element. That is, if S Z + and S, then S has a smallest element. Well-Ordering Principle Example: Use well-ordering property to prove
More informationMATH 2400: PRACTICE PROBLEMS FOR EXAM 1
MATH 2400: PRACTICE PROBLEMS FOR EXAM 1 PETE L. CLARK 1) Find all real numbers x such that x 3 = x. Prove your answer! Solution: If x 3 = x, then 0 = x 3 x = x(x + 1)(x 1). Earlier we showed using the
More informationUnit 2: Functions and Patterns
For Teacher Use Packet Score: Name: Period: Algebra 1 Unit 2: Functions and Patterns Note Packet Date Topic/Assignment Page Due Date Score (For Teacher Use Only) Warm-Ups 2-A Intro to Functions 2-B Tile
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationComplete Induction and the Well- Ordering Principle
Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k
More informationTutorial on Axiomatic Set Theory. Javier R. Movellan
Tutorial on Axiomatic Set Theory Javier R. Movellan Intuitively we think of sets as collections of elements. The crucial part of this intuitive concept is that we are willing to treat sets as entities
More informationIntroduction to Basic Proof Techniques Mathew A. Johnson
Introduction to Basic Proof Techniques Mathew A. Johnson Throughout this class, you will be asked to rigorously prove various mathematical statements. Since there is no prerequisite of a formal proof class,
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More information4 Limit and Continuity of Functions
Module 2 : Limits and Continuity of Functions Lecture 4 : Limit at a point Objectives In this section you will learn the following The sequential concept of limit of a function The definition of the limit
More informationLecture 3. Theorem 1: D 6
Lecture 3 This week we have a longer section on homomorphisms and isomorphisms and start formally working with subgroups even though we have been using them in Chapter 1. First, let s finish what was claimed
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More information3.2 Conditional Probability and Independence
3.2 Conditional Probability and Independence Mark R. Woodard Furman U 2010 Mark R. Woodard (Furman U) 3.2 Conditional Probability and Independence 2010 1 / 6 Outline 1 Conditional Probability 2 Independence
More informationDot Products, Transposes, and Orthogonal Projections
Dot Products, Transposes, and Orthogonal Projections David Jekel November 13, 2015 Properties of Dot Products Recall that the dot product or standard inner product on R n is given by x y = x 1 y 1 + +
More informationLimits and Continuity
Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index
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 informationNOTES (1) FOR MATH 375, FALL 2012
NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =
More informationLecture 8: A Crash Course in Linear Algebra
Math/CS 120: Intro. to Math Professor: Padraic Bartlett Lecture 8: A Crash Course in Linear Algebra Week 9 UCSB 2014 Qué sed de saber cuánto! Pablo Neruda, Oda a los Números 1 Linear Algebra In the past
More informationScalar multiplication and addition of sequences 9
8 Sequences 1.2.7. Proposition. Every subsequence of a convergent sequence (a n ) n N converges to lim n a n. Proof. If (a nk ) k N is a subsequence of (a n ) n N, then n k k for every k. Hence if ε >
More informationTry the assignment f(1) = 2; f(2) = 1; f(3) = 4; f(4) = 3;.
I. Precisely complete the following definitions: 1. A natural number n is composite whenever... See class notes for the precise definitions 2. Fix n in N. The number s(n) represents... 3. For A and B sets,
More informationSeunghee Ye Ma 8: Week 1 Notes September 29, 2016
Week Notes Summary This week, we will learn about mathematical proofs. We start by defining what we mean by a mathematical proof and look at a few important things to avoid/keep in mind when writing mathematical
More informationS15 MA 274: Exam 3 Study Questions
S15 MA 274: Exam 3 Study Questions You can find solutions to some of these problems on the next page. These questions only pertain to material covered since Exam 2. The final exam is cumulative, so you
More informationMath From Scratch Lesson 24: The Rational Numbers
Math From Scratch Lesson 24: The Rational Numbers W. Blaine Dowler May 23, 2012 Contents 1 Defining the Rational Numbers 1 1.1 Defining inverses........................... 2 1.2 Alternative Definition
More informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More informationMathematical Induction
Mathematical Induction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Mathematical Induction Fall 2014 1 / 21 Outline 1 Mathematical Induction 2 Strong Mathematical
More informationWorkshop 1- Building on the Axioms. The First Proofs
Boston University Summer I 2009 Workshop 1- Building on the Axioms. The First Proofs MA341 Number Theory Kalin Kostadinov The goal of this workshop was to organize our experience with the common integers
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 informationMath 154 :: Elementary Algebra
Math 4 :: Elementary Algebra Section. Additive Property of Equality Section. Multiplicative Property of Equality Section.3 Linear Equations in One-Variable Section.4 Linear Equations in One-Variable with
More informationa = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let
2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different
More informationCONSTRUCTION OF sequence of rational approximations to sets of rational approximating sequences, all with the same tail behaviour Definition 1.
CONSTRUCTION OF R 1. MOTIVATION We are used to thinking of real numbers as successive approximations. For example, we write π = 3.14159... to mean that π is a real number which, accurate to 5 decimal places,
More informationWe ll start today by learning how to change a decimal to a fraction on our calculator! Then we will pick up our Unit 1-5 Review where we left off!
Welcome to math! We ll start today by learning how to change a decimal to a fraction on our calculator! Then we will pick up our Unit 1-5 Review where we left off! So go back to your normal seat and get
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
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
More informationCOMPLEX ANALYSIS TOPIC XVI: SEQUENCES. 1. Topology of C
COMPLEX ANALYSIS TOPIC XVI: SEQUENCES PAUL L. BAILEY Abstract. We outline the development of sequences in C, starting with open and closed sets, and ending with the statement of the Bolzano-Weierstrauss
More informationBob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 Linear, Compound, and Absolute Value Inequalities
Bob Brown, CCBC Essex Math 163 College Algebra, Chapter 1 Section 7 COMPLETED 1 What is the following symbol? < The inequality symbols < > are used to compare two real numbers. The meaning of anyone of
More informationPeano Axioms. 1. IfS x S y then x y (we say that S is one to one).
Peano Axioms To present a rigorous introduction to the natural numbers would take us too far afield. We will however, give a short introduction to one axiomatic approach that yields a system that is quite
More information