Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from.
|
|
- Cathleen Moody
- 6 years ago
- Views:
Transcription
1 The Natural Numbers Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
2 The Natural Numbers Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from. Our first goal is to construct the set of natural numbers N = {0, 1, 2, 3, 4,...}. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
3 The Natural Numbers Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from. Our first goal is to construct the set of natural numbers N = {0, 1, 2, 3, 4,...}. This is going to come about in a rather hairy way, but in the end you ll see why. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
4 The Natural Numbers Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from. Our first goal is to construct the set of natural numbers N = {0, 1, 2, 3, 4,...}. This is going to come about in a rather hairy way, but in the end you ll see why. The first thing we need, of course, is a few more definitions: Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
5 The Natural Numbers Now, with all the definitions we ve made, we re ready see where all the math stuff we took for granted, like numbers, come from. Our first goal is to construct the set of natural numbers N = {0, 1, 2, 3, 4,...}. This is going to come about in a rather hairy way, but in the end you ll see why. The first thing we need, of course, is a few more definitions: Definition Given a set x, the successor of x, denoted S(x) is the set S(x) = x {x}. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
6 Since we re now ready to start getting some things that are familiar to us, we will start calling the empty set 0, but at this point, this is just another name for. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
7 Since we re now ready to start getting some things that are familiar to us, we will start calling the empty set 0, but at this point, this is just another name for. Definition A set I is called inductive if 0 I and if x I, then S(x) I. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
8 Since we re now ready to start getting some things that are familiar to us, we will start calling the empty set 0, but at this point, this is just another name for. Definition A set I is called inductive if 0 I and if x I, then S(x) I. Just think for a moment how wild an inductive set I must be. Just from the fact that 0 = I, by definition, this means S({ }) = { } = { } I. Again by definition S({ }) = { } {{ }} = {, { }} I. And this keeps going and going. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
9 ZF Nothing in our list of axioms so far tells us that an inductive set actually exists. First off, all sets that exist by our axioms so far must be finite. Clearly, inductive sets at least have some sort of infinite properties. So we need a new axiom. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
10 ZF Nothing in our list of axioms so far tells us that an inductive set actually exists. First off, all sets that exist by our axioms so far must be finite. Clearly, inductive sets at least have some sort of infinite properties. So we need a new axiom. Axiom (6. The Axiom of Infinity) There exists an inductive set I. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
11 ZF Nothing in our list of axioms so far tells us that an inductive set actually exists. First off, all sets that exist by our axioms so far must be finite. Clearly, inductive sets at least have some sort of infinite properties. So we need a new axiom. Axiom (6. The Axiom of Infinity) There exists an inductive set I. Notice if we have another inductive set J, then 0 J also. But if we can find even one x J such that x / I, then all the successors of that x are in J and not in I. What we want to get our hands on is the smallest possible inductive set. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
12 Let P(J) be the property J is an inductive set. By the axiom of comprehension and the axiom of infinity ω = {x I J(P(J) x J)} is a set. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
13 Let P(J) be the property J is an inductive set. By the axiom of comprehension and the axiom of infinity ω = {x I J(P(J) x J)} is a set. So ω is a set that is a subset of every possible inductive set. Since we want the smallest possible inductive set, all we have to prove now is: Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
14 Let P(J) be the property J is an inductive set. By the axiom of comprehension and the axiom of infinity ω = {x I J(P(J) x J)} is a set. So ω is a set that is a subset of every possible inductive set. Since we want the smallest possible inductive set, all we have to prove now is: Proposition ω is an inductive set Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
15 Proof. 0 ω since for all sets J such that J is inductive, by definition of inductive sets 0 J. Another way to say this is: J(P(J) 0 J) is true. Since ω = {x I J(P(J) x J)} this means 0 ω. Now suppose x ω. We want to prove that S(x) ω. Since we assumed x ω, this means J(P(J) x J) is true. This says, for any inductive set J, we know x J. By definition of J being an inductive set, we know S(x) J. Another way to say this is J(P(J) S(x) J), but this means exactly that S(x) ω Therefore ω is inductive. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
16 The point of this is to notice that we constructed ω as a smallest inductive set. That is, Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
17 The point of this is to notice that we constructed ω as a smallest inductive set. That is, Proposition (The Principal of Mathematical Induction) If S ω and S is an inductive set, then S = ω Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
18 The point of this is to notice that we constructed ω as a smallest inductive set. That is, Proposition (The Principal of Mathematical Induction) If S ω and S is an inductive set, then S = ω Proof. Suppose S ω is an inductive set. Take any element x ω. This means, by definition of ω, x satisfies the property: if J is an inductive set, then x J. We assumed S is an inductive set, so x S. We ve shown x ω x S. This says ω S. Since we assumed already S ω, by the axiom of extension, S = ω. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
19 The point of this is to notice that we constructed ω as a smallest inductive set. That is, Proposition (The Principal of Mathematical Induction) If S ω and S is an inductive set, then S = ω Proof. Suppose S ω is an inductive set. Take any element x ω. This means, by definition of ω, x satisfies the property: if J is an inductive set, then x J. We assumed S is an inductive set, so x S. We ve shown x ω x S. This says ω S. Since we assumed already S ω, by the axiom of extension, S = ω. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
20 Now consider the following construction: Starting with = 0, define the set n + 1 = S(n) = n {n}. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
21 Now consider the following construction: Starting with = 0, define the set n + 1 = S(n) = n {n}. Of course, you re thinking n is a number not a set. For us, everything is a set. Writing this out Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
22 Now consider the following construction: Starting with = 0, define the set n + 1 = S(n) = n {n}. Of course, you re thinking n is a number not a set. For us, everything is a set. Writing this out 0 = 1 = S(0) = { } = { } = {0} Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
23 Now consider the following construction: Starting with = 0, define the set n + 1 = S(n) = n {n}. Of course, you re thinking n is a number not a set. For us, everything is a set. Writing this out 0 = 1 = S(0) = { } = { } = {0} 2 = S(1) = 1 {1} = {0} {{0}} = {0, {0}} = {0, 1} Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
24 Now consider the following construction: Starting with = 0, define the set n + 1 = S(n) = n {n}. Of course, you re thinking n is a number not a set. For us, everything is a set. Writing this out 0 = 1 = S(0) = { } = { } = {0} 2 = S(1) = 1 {1} = {0} {{0}} = {0, {0}} = {0, 1} 3 = S(2) = 2 {2} = {0, 1} {{0, 1}} = {0, 1, {0, 1}} = {0, 1, 2} Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
25 Now consider the following construction: Starting with = 0, define the set n + 1 = S(n) = n {n}. Of course, you re thinking n is a number not a set. For us, everything is a set. Writing this out 0 = 1 = S(0) = { } = { } = {0} 2 = S(1) = 1 {1} = {0} {{0}} = {0, {0}} = {0, 1} 3 = S(2) = 2 {2} = {0, 1} {{0, 1}} = {0, 1, {0, 1}} = {0, 1, 2} n + 1 = S(n) = {0, 1, 2,..., n} Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
26 Notice every element in the sequence {0, 1, 2,...} is either 0 which is in ω or is a successor of some other element already in ω. So this sequence is secretly the set ω. Therefore we define N = ω. We will use the two names N and ω interchangeably. The important thing to remember, regardless if you call it N or ω, is that it is the smallest inductive set. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
27 Notice every element in the sequence {0, 1, 2,...} is either 0 which is in ω or is a successor of some other element already in ω. So this sequence is secretly the set ω. Therefore we define N = ω. We will use the two names N and ω interchangeably. The important thing to remember, regardless if you call it N or ω, is that it is the smallest inductive set. The reason the previous proposition is called the principal of mathematical induction is the following: Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
28 Notice every element in the sequence {0, 1, 2,...} is either 0 which is in ω or is a successor of some other element already in ω. So this sequence is secretly the set ω. Therefore we define N = ω. We will use the two names N and ω interchangeably. The important thing to remember, regardless if you call it N or ω, is that it is the smallest inductive set. The reason the previous proposition is called the principal of mathematical induction is the following: At many times in our mathematical lives we will be given a statement P(n) and be asked to prove it is true for all n N. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
29 Notice every element in the sequence {0, 1, 2,...} is either 0 which is in ω or is a successor of some other element already in ω. So this sequence is secretly the set ω. Therefore we define N = ω. We will use the two names N and ω interchangeably. The important thing to remember, regardless if you call it N or ω, is that it is the smallest inductive set. The reason the previous proposition is called the principal of mathematical induction is the following: At many times in our mathematical lives we will be given a statement P(n) and be asked to prove it is true for all n N. Notice to prove P(n) n N we are required to do an infinite number of proofs. So how do we accomplish this? Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
30 Theorem (Mathematical Induction) Suppose for each n N, P(n) is a statement. If P(0) is true and P(k) P(k + 1), then for all n N, P(n) is true. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
31 Theorem (Mathematical Induction) Suppose for each n N, P(n) is a statement. If P(0) is true and P(k) P(k + 1), then for all n N, P(n) is true. Proof. Let S = {n N P(n)}. Since P(0) is true, 0 S. Now take any k S. By definition of S, P(k) is then true. By hypothesis, P(k) P(k + 1), since P(k) is true we therefore know P(k + 1) is true. This says, k + 1 S. Since k + 1 is the successor of k, we have shown S is inductive. Since S N, by the Principal of Mathematical Induction S = N, and therefore P(n) is true for all n N. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
32 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
33 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = 2 1 1, = Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
34 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = 2 1 1, = 2 2 1, = Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
35 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = 2 1 1, = 2 2 1, = 2 3 1, = 2 4 1, etc. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
36 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = 2 1 1, = 2 2 1, = 2 3 1, = 2 4 1, etc. You guess that for all n Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
37 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = 2 1 1, = 2 2 1, = 2 3 1, = 2 4 1, etc. You guess that for all n n = 2 n+1 1. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
38 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = 2 1 1, = 2 2 1, = 2 3 1, = 2 4 1, etc. You guess that for all n n = 2 n+1 1. How would you prove this is true for every n? Maybe it s not true for n = 38 for example. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
39 Doing proofs by mathematical induction come up a lot. For example, suppose, while making a sandwich, you recognized that 1 = 2 1 1, = 2 2 1, = 2 3 1, = 2 4 1, etc. You guess that for all n n = 2 n+1 1. How would you prove this is true for every n? Maybe it s not true for n = 38 for example. We use mathematical induction. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
40 Proposition For all n N, n = 2 n+1 1. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
41 Proposition For all n N, n = 2 n+1 1. Proof. Let P(n) be the statement n = 2 n+1 1 is true. Now clearly 2 0 = , so P(0) is true. Next suppose that for some k N, P(k) is true. Notice that k+1 = ( k ). Since we assumed P(k) is true, we know ( k ) = (2 k+1 1) = 2 (k+1)+1 1. So we ve shown k+1 = 2 (k+1)+1 1 Therefore P(k + 1) is also true. We ve shown P(0) and P(k) P(k + 1). Therefore, by mathematical induction, P(n) is true for every n N. Math 144 Summer 2012 (UCR) Pro-Notes July 6, / 11
Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15
Before we start, I want to point out that these notes are not checked for typos. There are prbally many typeos in them and if you find any, please let me know as it s extremely difficult to find them all
More information( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of
Factoring Review for Algebra II The saddest thing about not doing well in Algebra II is that almost any math teacher can tell you going into it what s going to trip you up. One of the first things they
More informationEquivalent Forms of the Axiom of Infinity
Equivalent Forms of the Axiom of Infinity Axiom of Infinity 1. There is a set that contains each finite ordinal as an element. The Axiom of Infinity is the axiom of Set Theory that explicitly asserts that
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 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 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 informationMath 24 Spring 2012 Questions (mostly) from the Textbook
Math 24 Spring 2012 Questions (mostly) from the Textbook 1. TRUE OR FALSE? (a) The zero vector space has no basis. (F) (b) Every vector space that is generated by a finite set has a basis. (c) Every vector
More informationINDUCTION AND RECURSION. Lecture 7 - Ch. 4
INDUCTION AND RECURSION Lecture 7 - Ch. 4 4. Introduction Any mathematical statements assert that a property is true for all positive integers Examples: for every positive integer n: n!
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 informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
More informationRussell s logicism. Jeff Speaks. September 26, 2007
Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................
More informationNotes on induction proofs and recursive definitions
Notes on induction proofs and recursive definitions James Aspnes December 13, 2010 1 Simple induction Most of the proof techniques we ve talked about so far are only really useful for proving a property
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 informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationConsequences of the Completeness Property
Consequences of the Completeness Property Philippe B. Laval KSU Today Philippe B. Laval (KSU) Consequences of the Completeness Property Today 1 / 10 Introduction In this section, we use the fact that R
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationModels of Computation,
Models of Computation, 2010 1 Induction We use a lot of inductive techniques in this course, both to give definitions and to prove facts about our semantics So, it s worth taking a little while to set
More informationMATH 115, SUMMER 2012 LECTURE 12
MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct
More informationMathematical Induction. EECS 203: Discrete Mathematics Lecture 11 Spring
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring 2016 1 Climbing the Ladder We want to show that n 1 P(n) is true. Think of the positive integers as a ladder. 1, 2, 3, 4, 5, 6,...
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationn(n + 1). 2 . If n = 3, then 1+2+3=6= 3(3+1) . If n = 2, then = 3 = 2(2+1)
Chapter 4 Induction In this chapter, we introduce mathematical induction, which is a proof technique that is useful for proving statements of the form (8n N)P(n), or more generally (8n Z)(n a =) P(n)),
More informationSolving Quadratic & Higher Degree Equations
Chapter 9 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,
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 informationWe introduce one more operation on sets, perhaps the most important
11. The power set Please accept my resignation. I don t want to belong to any club that will accept me as a member. Groucho Marx We introduce one more operation on sets, perhaps the most important one:
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 informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Mathematical Induction Simple POMI Examples
More informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
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 informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 2, 207 Outline Mathematical Induction 2 Simple POMI Examples
More information06 Recursive Definition and Inductive Proof
CAS 701 Fall 2002 06 Recursive Definition and Inductive Proof Instructor: W. M. Farmer Revised: 30 November 2002 1 What is Recursion? Recursion is a method of defining a structure or operation in terms
More informationDiamond, Continuum, and Forcing
Diamond, Continuum, and Forcing Susan, Summer 2018 The Diamond Axiom Let s play a game. You choose a subset A of ω 1, and the game will be played in ω 1 rounds. On the α th round, I will attempt to guess
More informationThe Axiom of Infinity, Quantum Field Theory, and Large Cardinals. Paul Corazza Maharishi University
The Axiom of Infinity, Quantum Field Theory, and Large Cardinals Paul Corazza Maharishi University The Quest for an Axiomatic Foundation For Large Cardinals Gödel believed natural axioms would be found
More informationExtensions to the Logic of All x are y: Verbs, Relative Clauses, and Only
1/53 Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/53 An example that we ll see a few times Consider the
More informationMath 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10
Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive
More informationTHE SAMPLING DISTRIBUTION OF THE MEAN
THE SAMPLING DISTRIBUTION OF THE MEAN COGS 14B JANUARY 26, 2017 TODAY Sampling Distributions Sampling Distribution of the Mean Central Limit Theorem INFERENTIAL STATISTICS Inferential statistics: allows
More informationMathematical Induction
Mathematical Induction James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Introduction to the Class Mathematical Induction
More informationMAGIC Set theory. lecture 2
MAGIC Set theory lecture 2 David Asperó University of East Anglia 22 October 2014 Recall from last time: Syntactical vs. semantical logical consequence Given a set T of formulas and a formula ', we write
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 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 informationWell Ordered Sets (continued)
Well Ordered Sets (continued) Theorem 8 Given any two well-ordered sets, either they are isomorphic, or one is isomorphic to an initial segment of the other. Proof Let a,< and b, be well-ordered sets.
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 informationContradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
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 informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationLecture 6 : Induction DRAFT
CS/Math 40: Introduction to Discrete Mathematics /8/011 Lecture 6 : Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we began discussing proofs. We mentioned some proof
More informationProblems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman.
Math 224 Fall 2017 Homework 1 Drew Armstrong Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman. Section 1.1, Exercises 4,5,6,7,9,12. Solutions to Book Problems.
More informationHandout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1
22M:132 Fall 07 J. Simon Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1 Chapter 1 contains material on sets, functions, relations, and cardinality that
More informationTalk Science Professional Development
Talk Science Professional Development Transcript for Grade 4 Scientist Case: The Heavy for Size Investigations 1. The Heavy for Size Investigations, Through the Eyes of a Scientist We met Associate Professor
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 informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationNote that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.
Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable
More informationMITOCW ocw f99-lec09_300k
MITOCW ocw-18.06-f99-lec09_300k OK, this is linear algebra lecture nine. And this is a key lecture, this is where we get these ideas of linear independence, when a bunch of vectors are independent -- or
More informationSpanning, linear dependence, dimension
Spanning, linear dependence, dimension In the crudest possible measure of these things, the real line R and the plane R have the same size (and so does 3-space, R 3 ) That is, there is a function between
More informationChapter 3 ALGEBRA. Overview. Algebra. 3.1 Linear Equations and Applications 3.2 More Linear Equations 3.3 Equations with Exponents. Section 3.
4 Chapter 3 ALGEBRA Overview Algebra 3.1 Linear Equations and Applications 3.2 More Linear Equations 3.3 Equations with Exponents 5 LinearEquations 3+ what = 7? If you have come through arithmetic, the
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Asymptotic Analysis, recurrences Date: 9/7/17
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Asymptotic Analysis, recurrences Date: 9/7/17 2.1 Notes Homework 1 will be released today, and is due a week from today by the beginning
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: Rule of Inference Mathematical Induction: Conjecturing and Proving Mathematical Induction:
More informationMITOCW ocw f99-lec30_300k
MITOCW ocw-18.06-f99-lec30_300k OK, this is the lecture on linear transformations. Actually, linear algebra courses used to begin with this lecture, so you could say I'm beginning this course again by
More informationSolving Quadratic & Higher Degree Equations
Chapter 9 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationUnderstanding Decimal Addition
2 Understanding Decimal Addition 2.1 Experience Versus Understanding This book is about understanding system architecture in a quick and clean way: no black art, nothing you can only get a feeling for
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationMultiple Choice Questions
Multiple Choice Questions There is no penalty for guessing. Three points per question, so a total of 48 points for this section.. What is the complete relationship between homogeneous linear systems of
More informationWe have been going places in the car of calculus for years, but this analysis course is about how the car actually works.
Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost
More informationPOLYNOMIAL EXPRESSIONS PART 1
POLYNOMIAL EXPRESSIONS PART 1 A polynomial is an expression that is a sum of one or more terms. Each term consists of one or more variables multiplied by a coefficient. Coefficients can be negative, so
More informationMathematical Induction. Section 5.1
Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction
More informationSummer HSSP Lecture Notes Week 1. Lane Gunderman, Victor Lopez, James Rowan
Summer HSSP Lecture Notes Week 1 Lane Gunderman, Victor Lopez, James Rowan July 6, 014 First Class: proofs and friends 1 Contents 1 Glossary of symbols 4 Types of numbers 5.1 Breaking it down...........................
More informationDefinition Suppose M is a collection (set) of sets. M is called inductive if
Definition Suppose M is a collection (set) of sets. M is called inductive if a) g M, and b) if B Mß then B MÞ Then we ask: are there any inductive sets? Informally, it certainly looks like there are. For
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 information2 Analogies between addition and multiplication
Problem Analysis The problem Start out with 99% water. Some of the water evaporates, end up with 98% water. How much of the water evaporates? Guesses Solution: Guesses: Not %. 2%. 5%. Not 00%. 3%..0%..5%.
More informationDiscrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 3 This lecture covers further variants of induction, including strong induction and the closely related wellordering axiom. We then apply these
More informationSolving Quadratic & Higher Degree Equations
Chapter 7 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,
More informationMath 52: Course Summary
Math 52: Course Summary Rich Schwartz September 2, 2009 General Information: Math 52 is a first course in linear algebra. It is a transition between the lower level calculus courses and the upper level
More informationARE211, Fall2012. Contents. 2. Linear Algebra (cont) Vector Spaces Spanning, Dimension, Basis Matrices and Rank 8
ARE211, Fall2012 LINALGEBRA2: TUE, SEP 18, 2012 PRINTED: SEPTEMBER 27, 2012 (LEC# 8) Contents 2. Linear Algebra (cont) 1 2.6. Vector Spaces 1 2.7. Spanning, Dimension, Basis 3 2.8. Matrices and Rank 8
More informationSection 4.2: Mathematical Induction 1
Section 4.: Mathematical Induction 1 Over the next couple of sections, we shall consider a method of proof called mathematical induction. Induction is fairly complicated, but a very useful proof technique,
More informationAN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS
AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply
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 informationPolynomials; Add/Subtract
Chapter 7 Polynomials Polynomials; Add/Subtract Polynomials sounds tough enough. But, if you look at it close enough you ll notice that students have worked with polynomial expressions such as 6x 2 + 5x
More information1 Continuity and Limits of Functions
Week 4 Summary This week, we will move on from our discussion of sequences and series to functions. Even though sequences and functions seem to be very different things, they very similar. In fact, we
More informationAn very brief overview of Surreal Numbers
An very brief overview of Surreal Numbers for Gandalf MM 204 Steven Charlton History and Introduction Surreal numbers were created by John Horton Conway (of Game of Life fame), as a greatly simplified
More informationTips and Tricks in Real Analysis
Tips and Tricks in Real Analysis Nate Eldredge August 3, 2008 This is a list of tricks and standard approaches that are often helpful when solving qual-type problems in real analysis. Approximate. There
More informationSequence convergence, the weak T-axioms, and first countability
Sequence convergence, the weak T-axioms, and first countability 1 Motivation Up to now we have been mentioning the notion of sequence convergence without actually defining it. So in this section we will
More informationThe semantics of propositional logic
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional
More informationWhat if the characteristic equation has complex roots?
MA 360 Lecture 18 - Summary of Recurrence Relations (cont. and Binomial Stuff Thursday, November 13, 01. Objectives: Examples of Recurrence relation solutions, Pascal s triangle. A quadratic equation What
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationStudying Rudin s Principles of Mathematical Analysis Through Questions. August 4, 2008
Studying Rudin s Principles of Mathematical Analysis Through Questions Mesut B. Çakır c August 4, 2008 ii Contents 1 The Real and Complex Number Systems 3 1.1 Introduction............................................
More informationSolving a Series. Carmen Bruni
A Sample Series Problem Question: Does the following series converge or diverge? n=1 n 3 + 3n 2 + 1 n 5 + 14n 3 + 4n First Attempt First let s think about what this series is - maybe the terms are big
More informationDiscrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7
EECS 70 Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in topics
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 4 1 Principle of Mathematical Induction 2 Example 3 Base Case 4 Inductive Hypothesis 5 Inductive Step When Induction Isn t Enough
More informationCS173 Strong Induction and Functions. Tandy Warnow
CS173 Strong Induction and Functions Tandy Warnow CS 173 Introduction to Strong Induction (also Functions) Tandy Warnow Preview of the class today What are functions? Weak induction Strong induction A
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION Analysis and natural philosopy owe their most important discoveries to this fruitful means, which is called induction Newton was indebted to it for his theorem
More informationPeano Arithmetic. by replacing the schematic letter R with a formula, then prefixing universal quantifiers to bind
Peano Arithmetic Peano Arithmetic 1 or PA is the system we get from Robinson s Arithmetic by adding the induction axiom schema: ((R(0) v (œx)(r(x) 6 R(sx))) 6 (œx)r(x)). What this means is that any sentence
More informationNote: Please use the actual date you accessed this material in your citation.
MIT OpenCourseWare http://ocw.mit.edu 18.06 Linear Algebra, Spring 2005 Please use the following citation format: Gilbert Strang, 18.06 Linear Algebra, Spring 2005. (Massachusetts Institute of Technology:
More informationMI 4 Mathematical Induction Name. Mathematical Induction
Mathematical Induction It turns out that the most efficient solution to the Towers of Hanoi problem with n disks takes n 1 moves. If this isn t the formula you determined, make sure to check your data
More informationHow to write maths (well)
How to write maths (well) Dr Euan Spence 29 September 2017 These are the slides from a talk I gave to the new first-year students at Bath, annotated with some of the things I said (which appear in boxes
More information