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

Slides:



Advertisements
Similar presentations
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
Advertisements

With examples from Number Theory
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.
PROOF BY CONTRADICTION
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Prof. Shachar Lovett Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Elementary Number Theory and Methods of Proof
Copyright © Cengage Learning. All rights reserved.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
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:
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
1 Number Theory and Methods of Proof Content: Properties of integer, rational and real numbers. Underlying theme: Methods of mathematical proofs.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.
What it is? Why is it a legitimate proof method? How to use it?
Making an Argument The goal of communication is to achieve the desired affect on the target audience. Often we want to convince the audience of something.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Proofs1 Elementary Discrete Mathematics Jim Skon.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
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 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 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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Conditional Statements
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
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.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
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.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Mathematical Induction What it is? Why is it a legitimate proof method? How to use it?
Chapter 1 Logic and proofs
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
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.
MATH 15A – Discrete Mathematics
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
Presentation transcript:

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

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

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

Truth table for implication 4 pqp → q TTT TFF FTT FFT  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: 1. Assume p is true (take it as “given”) 2. 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 5

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. 6

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? A. p could be true or false, but we are just saying it is true for the sake of argument. B. p is always true. C. p is always false, but we are just saying it is true in the proof. D. p is guaranteed to be true within the scope of the proof. E. Other/none/more 7

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? A. “If it is raining, then I will need an umbrella.” B. “Assume it is raining.” C. “I will need an umbrella.” D. QED E. Other/none/more 8

Direct Proof Template: Mathematical Driving Directions 9

10

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

Test yourself: Direct Proof Template  Thm. “The sum of any two odd numbers is even.”  What are your Given and WTS ? A. Given: Assume the sum of two odd numbers is even. WTS: This follows from axioms of algebra. B. Given: Assume x and y are odd numbers. WTS: x + y is even. C. Given: Assume 3 and 5* are odd. WTS: sum of 3 and 5 is even. D. You can’t use Direct Proof Template for this theorem because it is not of the form “If…then….” E. Other/none/more 12 * 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. 13

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. 14

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 15

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. 16 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. 17 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