Prof. Shachar Lovett http://cseweb.ucsd.edu/classes/wi15/cse20-a/ Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett http://cseweb.ucsd.edu/classes/wi15/cse20-a/

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
Discrete Math Methods of proof 1.
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.
Chapter 3 Elementary Number Theory and Methods of Proof.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Elementary Number Theory and Methods of Proof
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
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:
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
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.
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.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
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.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: More Proofs.
Proofs1 Elementary Discrete Mathematics Jim Skon.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
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.
9.4 Mathematical Induction
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.
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.
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 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
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.
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
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.
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
Proof Techniques CS160/CS122 Rosen: 1.5, 1.6, 1.7.
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
Proof Techniques.
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
CS 220: Discrete Structures and their Applications
CS 220: Discrete Structures and their Applications
Presentation transcript:

Prof. Shachar Lovett http://cseweb.ucsd.edu/classes/wi15/cse20-a/ Clicker frequency: CA CSE 20 Discrete math Prof. Shachar Lovett http://cseweb.ucsd.edu/classes/wi15/cse20-a/

Todays topics Direct proofs Section 3.5 in Jenkyns, Stephenson

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 (Want To Show): [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

Without a plan…

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

Rational numbers Definition: 𝑄= 𝑎 𝑏 :𝑎∈𝑍,𝑏∈𝑍∖{0} Theorem: “The rational numbers are closed under addition and multiplication.” What does that mean? Closed under addition: if 𝑥,𝑦∈𝑄 then 𝑥+𝑦∈𝑄 Closed under addition: if 𝑥,𝑦∈𝑄 then 𝑥𝑦∈𝑄

Rational numbers Thm: “The rational numbers are closed under addition and multiplication.” Proof: Given: Let x and y be rational numbers. WTS: x + y, xy are rational numbers. What can we use? Definition of rational numbers Basic arithmetic Axioms (which ones would we need?) Logic

Rational numbers Try it yourself first Thm: “The rational numbers are closed under addition and multiplication.” Proof: Given: Let x and y be rational numbers. WTS: x + y, xy are rational numbers. Conclusion: So, x+y and xy are rational numbers, which is what we needed to show. Hence the rational numbers are closed under addition and multiplication. Try it yourself first

Next class More direct proof techniques Read section 3.5 in Jenkyns, Stephenson