CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett

Slides:



Advertisements
Similar presentations
Introduction to Proofs
Advertisements

PROOF BY CONTRADICTION
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Chapter 3 Elementary Number Theory and Methods of Proof.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Chapter 3 Direct Proof and Proof by Contrapositive
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
Elementary Number Theory and Methods of Proof
Copyright © Cengage Learning. All rights reserved.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
So far we have learned about:
Copyright © Zeph Grunschlag,
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Introduction to Proofs
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Proofs1 Elementary Discrete Mathematics Jim Skon.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
CS104:Discrete Structures Chapter 2: Proof Techniques.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Notions & Notations - 1ICOM 4075 (Fall 2010) UPRM Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Fall 2010 ICOM.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Mathematical Induction. The Principle of Mathematical Induction Let S n be a statement involving the positive integer n. If 1.S 1 is true, and 2.the truth.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Proof Techniques CS160/CS122 Rosen: 1.5, 1.6, 1.7.
Introduction to Proofs Goals 1.Introduce notion of proof & basic proof methods. 2.Distinguish between correct & incorrect arguments 3.Understand & construct.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Chapter 1 Logic and Proof.
The Foundations: Logic and Proofs
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Chapter 4 (Part 1): Induction & Recursion
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Lecture 1 – Formal Logic.
Direct Proof and Counterexample I: Introduction
CISC 2315 Discrete Structures
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
Proof Techniques.
321 Section, 2-7 Natalie Linnell.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
MATH 15A – Discrete Mathematics
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Indirect Argument: Contradiction and Contraposition
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
The Foundations: Logic and Proofs
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
The sum of any two even integers is even.
PROOF BY CONTRADICTION
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
CS 220: Discrete Structures and their Applications
CS 220: Discrete Structures and their Applications
Computer Security: Art and Science, 2nd Edition
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
© School Improvement Liverpool Limited 2018
Foundations of Discrete Mathematics
Mathematical Induction
Presentation transcript:

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett

Today’s Topics: Proving a theorem of the form if-then, Part I: Direct Proof Template Proving a theorem of the form if-then, Part II: Identifying implicit if-then Generalization from a generic particular

1. Proving a theorem of the form if-then, Part I

Truth table for implication q p → q T F Note there is only one F This is when p the “if” part is true, and the “then” part is false To prove an implication is true, we must show this F row cannot happen

Proving an implication p→q Procedure: Assume p is true (take it as “given”) Show that q logically follows, in other words, derive q just from: The assumption that p is true Definitions Axioms Includes basic algebra and math laws Applying logical rules/valid argument forms

Direct Proof Template Thm. [write the theorem to be proved— “if p, then q.”] Proof: Given: Assume [p].   WTS: [q]. This is clearly identifying to the reader what you will be trying to reach in the main body of the proof. Main body of the proof: Using p, try to end up with q. …end with “…[q], which is what was to be shown." This clearly identifies for the reader that you reached what you said you were going to reach in the WTS section.] Conclusion: Therefore, [restate theorem]. QED.

Test yourself: Direct Proof Template For a theorem of the form: “If p, then q.” Given is where you make an assumption that p is true. What does this assumption really mean? p could be true or false, but we are just saying it is true for the sake of argument. p is always true. p is always false, but we are just saying it is true in the proof. p is guaranteed to be true within the scope of the proof. Other/none/more

Test yourself: Direct Proof Template Want to Show (WTS) is your goal for the main body of the proof. If your theorem is “If it is raining, then I will need an umbrella,” what is your WTS? “If it is raining, then I will need an umbrella.” “Assume it is raining.” “I will need an umbrella.” QED Other/none/more

Direct Proof Template: Mathematical Driving Directions

Direct Proof Template: Mathematical Driving Directions

2. Proving a theorem of the form if-then, Part II

Test yourself: Direct Proof Template Thm. “The sum of any two odd numbers is even.” What are your Given and WTS? Given: Assume the sum of two odd numbers is even. WTS: This follows from axioms of algebra. Given: Assume x and y are odd numbers. WTS: x + y is even. Given: Assume 3 and 5* are odd. WTS: sum of 3 and 5 is even. You can’t use Direct Proof Template for this theorem because it is not of the form “If…then….” Other/none/more * You could pick something else but we just happened to pick 3 and 5

Proof Keywords: Introducing/declaring variables in the Given section As you know, the Given section announces that you are assuming the p part of the “p IMPLIES q” theorem is true Given: Assume x and y are odd numbers. But sometimes the word “assume” is replaced by other options meaning the same thing Given: Let x and y be odd numbers. Given: Suppose x and y are odd numbers.

Example Thm.: “The sum of any two odd numbers is even.” Proof: Given: Let x and y be odd numbers. WTS: z = x + y is even. Conclusion: So z is even, which is what was to be shown, therefore the sum of any two odd numbers is even.

What we have to work with Given: x and y are odd Definition: odd means ∃ an integer k such that [odd number] = 2k + 1. Definition: even means ∃ an integer k such that [even number] = 2k. Axiom: sum of two integers is an integer. algebra logic

Example Try it yourself first Thm.: “The sum of any two odd numbers is even.” Proof: Given: Let x and y be odd numbers. WTS: z = x + y is even. Conclusion: So z is even, which is what was to be shown, therefore the sum of any two odd numbers is even. Try it yourself first

Example Thm.: “The sum of any two odd numbers is even.” Proof: Given: Let x and y be odd numbers. WTS: z = x + y is even. Conclusion: So z is even, which is what was to be shown, therefore the sum of any two odd numbers is even. Let x and y be odd numbers. By definition, x=2a+1 and y=2b+1 where a,b are integers. So, z=x+y=(2a+1)+(2b+1)=2a+2b+2=2(a+b+1). That is, z=2c where c=a+b+1 is an integer. Hence, c is even

Can you spot the error? Theorem: the product of an even integer and an odd integer is even “Proof”: Let x be even. So x=2a for some integer a. Let y be odd. So y=2a+1 for some integer a. Their product is xy=2a(2a+1)=2 (a (2a+1)) So xy=2b for b=a(2a+1), by definition xy is even

The importance of variables It is very useful to introduce new variables in a proof (x is even  x=2a for integer a) It is a common mistake to REUSE VARIABLES Why is this wrong? It makes assumptions that need not be true (that two variables are related, when they shouldn’t be)