1 Quantifiers Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.

Slides:



Advertisements
Similar presentations
Mathematical Induction
Advertisements

MA/CSSE 473/474 How (not) to do an induction proof.
Induction and recursion
1 The RSA Algorithm Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Induction Sections 41. and 4.2 of Rosen Fall 2008 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions:
1 Intro to Logic Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
CS5371 Theory of Computation
Recursive Definitions Rosen, 3.4. Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
Induction Sections 4.1 and 4.2 of Rosen Fall 2010
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
1 Intro to Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
CSE115/ENGR160 Discrete Mathematics 02/01/11
Inverses and GCDs Supplementary Notes Prepared by Raymond Wong
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
True/False. False True Subject May Go Here True / False ? Type correct answer here. Type incorrect answer here.
1 Solutions to Recurrences Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
1 Recursion, Recurrences and Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
The essential quality of a proof is to compel belief.
1 Section 3.3 Mathematical Induction. 2 Technique used extensively to prove results about large variety of discrete objects Can only be used to prove.
1 Advanced Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
CSE115/ENGR160 Discrete Mathematics 03/29/11 Ming-Hsuan Yang UC Merced 1.
Methods of Proof & Proof Strategies
Lecture 9. Arithmetic and geometric series and mathematical induction
Chapter 6 Mathematical Induction
1 Inclusion-Exclusion Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
1 Introduction to Abstract Mathematics Chapter 4: Sequences and Mathematical Induction Instructor: Hayk Melikya 4.1- Sequences. 4.2,
Discrete Maths Objective to introduce mathematical induction through examples , Semester 2, Mathematical Induction 1.
Proofs 1/25/12.
CSE 311 Foundations of Computing I Lecture 15 Recursive Definitions and Structural Induction Autumn 2011 CSE 3111.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Formal Semantics of Programming Languages 虞慧群 Topic 3: Principles of Induction.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Chap 3 –A theorem is a statement that can be shown to be true –A proof is a sequence of statements to show that a theorem is true –Axioms: statements which.
Predicates and Quantified Statements
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
1 Introduction to Abstract Mathematics Proofs in Predicate Logic , , ~, ,  Instructor: Hayk Melikya Purpose of Section: The theorems.
COMP 170 L2 L08: Quantifiers. COMP 170 L2 Outline l Quantifiers: Motivation and Concepts l Quantifiers: Notations and Meaning l Saying things with Quantified.
Mathematical Induction
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Section 3.3 Proving set properties. Element-wise set proofs Claim. For all sets A and B, (A  B)  A. Proof. Let sets A and B be given. Since every element.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
5-5 Indirect Proof. Indirect Reasoning: all possibilities are considered and then all but one are proved false. The remaining possibility must be true.
1 Formal Proofs. 2 Deductive Proofs From the given statement(s) to a conclusion statement (what we want to prove) Logical progression by direct implications.
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring
Hubert Chan (Chapters 1.6, 1.7, 4.1)
Special Triangles Review
CSE15 Discrete Mathematics 02/01/17
CSE15 Discrete Mathematics 03/22/17
Advanced Algorithms Analysis and Design
Advanced Algorithms Analysis and Design
Induction and recursion
Hubert Chan (Chapters 1.6, 1.7, 4.1)
Induction and recursion
Statements Containing Multiple Quantifiers
Section 2.1 Proof Techniques Introduce proof techniques:   o        Exhaustive Proof: to prove all possible cases, Only if it is about a.
Lecture 43 Section 10.1 Wed, Apr 6, 2005
2-1: Logic with Inductive Reasoning
Direct Proof and Counterexample I
Advanced Analysis of Algorithms
Mathematical Induction
Inequalities TRUE FALSE.
Introduction to Proofs
True or False True or False
Presentation transcript:

1 Quantifiers Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong

2 e.g.1 (Page 6) We are going to prove the following claim C is true: statement P(m) is true for each non-negative integer m, namely 0, 1, 2, … P(0)true P(1)true P(2)true P(3)true P(4)true If we can prove that statement P(m) is true for each non-negative integer separately, then we can prove the above claim C is correct. …true

3 e.g.1 We are going to prove the following claim C is false: statement P(m) is true for each non-negative integer m, namely 0, 1, 2, … P(0)true P(1)true P(2)true P(3)true P(4)true … false There may exist another non-negative integer k such that P(k) is false

4 e.g.1 We are going to prove the following claim C is false: statement P(m) is true for each non-negative integer m, namely 0, 1, 2, … P(0)false P(1)false P(2)true P(3)true P(4)true … m 2 > minteger 0, 1, 2, … -1, -2, … 0 2 > > > 2

5 e.g.2 (Page 9) We are going to prove the following claim C is true: there exists a non-negative integer m such that statement P(m) is true P(0) P(1) P(2)true P(3) P(4) If we can prove that statement P(m) is true for ONE non-negative integer, then we can prove the above claim C is correct. …

6 e.g.2 We are going to prove the following claim C is false: there exists a non-negative integer m such that statement P(m) is true If we can prove that statement P(m) is false for each non-negative integer separately, then we can prove the above claim C is false. P(0)false P(1)false P(2)false P(3)false P(4)false …

7 e.g.2 We are going to prove the following claim C is true: there exists a non-negative integer m such that statement P(m) is true true 2 2 > 2 P(0) P(1) P(2) P(3) P(4) … m 2 > m integer

8 e.g.3 (Page 13) E.g. Using the quantifier notations, please re-write the Euclid ’ s division theorem that states For every positive integer n and every non-negative integer m, there are integers q and r, with 0  r < n such that m = qn + r.

9 e.g.3 For every positive integer n and every non-negative integer m, there are integers q and r, with 0  r < n such that m = qn + r. Since m is non-negative and n is a positive integer, we derive that q and r are also non-negative. For every positive integer n and every non-negative integer m, there are non-negative integers q and r, with r < n such that m = qn + r. Let Z + be the set of positive integers. Let N be the set of non-negative integers.  n  Z + ( )  m  N ( )  q  N ( )  r  N ( ) (r < n)  (m = qn + r)

10 e.g.4 (Page 15)  n  Z + ( )  m  N ( )  q  N ( )  r  N ( ) (r < n)  (m = qn + r) Let p(m, n, q, r) denote m = nq + r with r < n  n ( )  m ( )  q ( ) rr p(m, n, q, r) If we remove the universe, then we can see the order in which the quantifier occurs

11 e.g.5 (Page 19) Is the following statement true?  x  R + (x > 1) If this statement is correct, we need to prove the following. P(0)true P(0.1)true P(0.2)true … P(1)true … Let P(x) be “ x > 1 ”

12 e.g.5 Is the following statement true?  x  R + (x > 1) If this statement is incorrect, we need to prove the following. false P(0) P(0.1) P(0.2) … P(1) … Let P(x) be “ x > 1 ”

13 e.g.5 Is the following statement true?  x  R + (x > 1) If this statement is incorrect, we need to prove the following. false P(0) P(0.1) P(0.2) … P(1) … Let P(x) be “ x > 1 ” Consider x = 0.1 Note that 0.1  R + “ 0.1 > 1 ” is false. This statement is false.

14 e.g.6 (Page 19) Is the following statement true?  x  R + (x > 1) If this statement is correct, we need to prove the following. Let P(x) be “ x > 1 ” P(0) P(0.1) P(0.2)true … P(2) …

15 e.g.6 Is the following statement true?  x  R + (x > 1) If this statement is incorrect, we need to prove the following. Let P(x) be “ x > 1 ” P(0)false P(0.1)false P(0.2)false … P(2)false …

16 e.g.6 Is the following statement true?  x  R + (x > 1) If this statement is correct, we need to prove the following. Let P(x) be “ x > 1 ” P(0) P(0.1) P(0.2) true … P(2) … Consider x = 2 Note that 2  R + “ 2 > 1 ” is true. This statement is true.

17 e.g.7 (Page 19) Is the following statement true?  x  R (  y  R (y > x)) If this statement is correct, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0) P(0, 0.1) P(0, 0.2) true … P(0.1, 0) P(0.1, 0.1) P(0.1, 0.2) … true x = 0 x = 0.1 x = 0.2true There exists a value y such that P(0, y) is true. true There exists a value y such that P(0.1, y) is true.

18 e.g.7 (Page 19) Is the following statement true?  x  R (  y  R (y > x)) If this statement is incorrect, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0) P(0, 0.1) P(0, 0.2) … P(0.1, 0) P(0.1, 0.1) P(0.1, 0.2) … false x = 0 x = 0.1 x = 0.2 There doest not exist a value y such that P(0.1, y) is true. That is, for each value y  R, P(0.1, y) is false. false

19 e.g.7 Is the following statement true?  x  R (  y  R (y > x)) If this statement is correct, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0) P(0, 0.1) P(0, 0.2) true … P(0.1, 0) P(0.1, 0.1) P(0.1, 0.2) … true x = 0 x = 0.1 x = 0.2true Let y = x + 1 Note that, if x  R, then y  R “ y > x ” is true. This statement is true. y = 1 y = 1.1 y = 1.2

20 e.g.8 (Page 19) Is the following statement true?  x  R (  y  R (y > x)) If this statement is correct, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0) P(0, 0.1) P(0, 0.2) true … P(0.1, 0) P(0.1, 0.1) P(0.1, 0.2) … true x = 0 x = 0.1 x = 0.2true

21 e.g.8 Is the following statement true?  x  R (  y  R (y > x)) If this statement is incorrect, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0) P(0, 0.1) P(0, 0.2) … P(0.1, 0) P(0.1, 0.1) P(0.1, 0.2) … false x = 0 x = 0.1 x = 0.2 false

22 e.g.8 Is the following statement true?  x  R (  y  R (y > x)) If this statement is incorrect, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0) P(0, 0.1) P(0, 0.2) … P(0.1, 0) P(0.1, 0.1) P(0.1, 0.2) … false x = 0 x = 0.1 x = 0.2 false Consider x = 0.1 and y = 0 Note that x  R and y  R “ y > x ” is false. (i.e., “ 0 > 0.1 ” is false) This statement is false.

23 e.g.9 (Page 19) Is the following statement true?  x  R ((x  0)   y  R + (y > x)) If this statement is correct, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0.1) P(0, 0.2) P(0, 0.3) true … P(0.1, 0.1) P(0.1, 0.2) P(0.1, 0.3) … x = 0 x = 0.1 x = 0.2 true

24 e.g.9 Is the following statement true?  x  R ((x  0)   y  R + (y > x)) If this statement is incorrect, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0.1) P(0, 0.2) P(0, 0.3) false … P(0.1, 0.1) P(0.1, 0.2) P(0.1, 0.3) … x = 0 x = 0.1 x = 0.2 false

25 e.g.9 Is the following statement true?  x  R ((x  0)   y  R + (y > x)) x = 0.2 If this statement is correct, we need to prove the following. Let P(x, y) be “ y > x ” P(0, 0.1) P(0, 0.2) P(0, 0.3) true … P(0.1, 0.1) P(0.1, 0.2) P(0.1, 0.3) … x = 0 x = 0.1 true Let x = 0 Note that y  R + (i.e., y > 0) “ y > x ” is true. (i.e., “ y > 0 ” is true) This statement is true.