CSE 20 DISCRETE MATH SPRING

Similar documents
CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH WINTER

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

Readings: Conjecture. Theorem. Rosen Section 1.5

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Intro to Logic and Proofs

Propositional Logic, Predicates, and Equivalence

DISCRETE MATH: FINAL REVIEW

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

Lecture 2: Proof Techniques Lecturer: Lale Özkahya

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

Proof by Contradiction

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Proofs. Joe Patten August 10, 2018

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

CSE 20 DISCRETE MATH SPRING

Discrete Mathematical Structures: Theory and Applications

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Introduction to proofs. Niloufar Shafiei

Logic and Proof. Aiichiro Nakano

Logic, Sets, and Proofs

With Question/Answer Animations. Chapter 2

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

MATH CSE20 Homework 5 Due Monday November 4

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

CSE 20 DISCRETE MATH. Winter

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

EECS 1028 M: Discrete Mathematics for Engineers

1.1 Language and Logic

Mathematics Review for Business PhD Students

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.

CSE 20 DISCRETE MATH. Fall

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

CITS2211 Discrete Structures Proofs

Mathematics Review for Business PhD Students Lecture Notes

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

CSE 20 DISCRETE MATH. Fall

CSE 1400 Applied Discrete Mathematics Proofs

Topics in Logic and Proofs

Any Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?

Logic Overview, I. and T T T T F F F T F F F F

software design & management Gachon University Chulyun Kim

Review 1. Andreas Klappenecker

Proofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement.

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...

1 The Foundation: Logic and Proofs

MATH 271 Summer 2016 Practice problem solutions Week 1

Section Summary. Proof by Cases Existence Proofs

Solutions to Homework Set 1

In 1854, Karl Weierstrauss gave an example of a continuous function which was nowhere di erentiable: cos(3 n x) 2 n. sin(3 n x), 2

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Proofs. Chapter 2 P P Q Q

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Spring

Sec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6

COT3100 SI Final Exam Review

Properties of the Integers

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

1 The Foundation: Logic and Proofs

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

MTHSC 3190 Section 2.9 Sets a first look

Mathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.

Carmen s Core Concepts (Math 135)

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Discrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams

Basic properties of the Integers

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

Chapter 1 : The language of mathematics.

Section 3.1: Direct Proof and Counterexample 1

5 Set Operations, Functions, and Counting

Predicate Logic. Andreas Klappenecker

Discrete Mathematics Exam File Spring Exam #1

Transcription:

CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/

Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition Proofs by contradiction Proof by cases Constructive existence proofs Correctly prove statements using appropriate style conventions, guiding text, notation, and terminology Define and differentiate between important sets Use correct notation when describing sets: {...}, intervals Define and prove properties of: subset relation, power set, Cartesian products of sets, union of sets, intersection of sets, disjoint sets, set differences, complement of a set

Overall proof strategy Do you believe the statement? Try some small examples. Determine logical structure + main connective. Determine relevant definitions. Map out possible proof strategies. For each strategy: what can we assume, what is the goal? Start with simplest, move to more complicated if/when get stuck.

Main connective: conditional Rosen p. 82 Modus ponens Direct proof To prove that "If P, then Q" - Assume P is true. - Use rules of inference, axioms, definitions to - conclude Q is true.

Main connective: conditional Rosen p. 83 Modus tollens Proof by contraposition To prove that "If P, then Q" - Assume Q is false. - Use rules of inference, axioms, definitions to - conclude P is also false. Both modus ponens and modus tollens apply when proving a conditional statement

Universal conditionals Rosen p. 88, 82 To prove this statement is false : Find a counterexample. To prove this statement is true : Select a general element of the domain, use rules of inference (e.g direct proof, proof by contrapositive, etc.) to prove that the conditional statement is true of this element, c conclude that it holds of all members of the domain.

Reminder: evens and odds An integer a is even if there is some integer b such that a = 2b Which of the following is equivalent to definition of a being even? A. a/2 B. a div 2 is an integer. C. a mod 2 is zero. D. 2a is an integer. E. More than one of the above.

Reminder: evens and odds An integer a is even if there is some integer b such that a = 2b. Why equivalent? An integer a is odd iff it's not even or equivalently there is some integer b such that a = 2b + 1.

Flexing proof muscles Theorem: If n is even, then so is n 2. Proof:

Flexing proof muscles Theorem: If n is even, then so is n 2. Proof: Let n be an arbitrary integer. Assume, towards a direct proof, that n is even. WTS that n 2 is also even. By definition of n being even, there is some integer c such that n = 2c. Squaring both sides, n 2 = 4c 2. Since c is an integer and integers are closed under multiplication, 2c 2 is also an integer. Therefore, x=2c 2 serves as an example to prove the existential statement which is the definition of n 2 being even, so the proof is complete.

Flexing proof muscles Theorem: If n is odd, then so is n 2. Proof:

Flexing proof muscles Theorem: If n is odd, then so is n 2. Proof: Let n be an arbitrary integer. Assume, towards a direct proof, that n is odd. WTS that n 2 is also odd. By definition of n being odd, there is some integer c such that n = 2c+1. Squaring both sides, n 2 = 4c 2 +4c+1. Since c is an integer and integers are closed under addition and multiplication, 2c 2 +2c is also an integer. Since n 2 = 2(2c 2 +2c)+1, x = 2c 2 +2c serves as an example to prove the existential statement which is the definition of n 2 being odd, so the proof is complete.

Flexing proof muscles Theorem: If n 2 is even, then so is n. Proof:

Flexing proof muscles Theorem: If n 2 is even, then so is n. Proof: Let n be an arbitrary integer. Assume, towards a proof by contraposition, that that n is not even. WTS that n 2 is also not even. By definition of n, n is odd (since it's not even). Applying our previous theorem, we conclude that n 2 is also odd. By definition of odd, this means that n 2 is not even, as required.

Flexing proof muscles Theorem: If n 2 is odd, then so is n. Proof:

Flexing proof muscles Theorem: If n 2 is odd, then so is n. Proof: Let n be an arbitrary integer. Assume, towards a proof by contraposition, that that n is not odd. WTS that n 2 is also not odd. By definition of n, n is even (since it's not odd). Applying our previous theorem, we conclude that n 2 is also even. By definition of odd, this means that n 2 is not odd, as required.

Reminder: perfect squares Rosen p. 83 Theorem: For integers k>1, then 2 k -1 is not a perfect square. Proof:???

Proof by contradiction Rosen p. 86 Idea: To prove P, instead, we prove that the conditional is true. But, the only way for a conditional to be true if its conclusion is false is for its hypothesis to be false too. Conclude: is false, i.e. P is true!

Back to: perfect squares Rosen p. 83 Theorem: For integers k>1, then 2 k -1 is not a perfect square. Proof: What would we assume in a proof by contradiction? A. k > 1 B. k <= 1 C. 2 k -1 is not a perfect square D. 2 k -1 is a perfect square E. More than one of the above

Back to: perfect squares Rosen p. 83 Theorem: For integers k>1, then 2 k -1 is not a perfect square. Proof: Let k be an integer. Assume that k >1 and that 2 k -1 is a perfect square. Goal: look for a contradiction that is now guaranteed. Keep going

Overall proof strategy Do you believe the statement? Try some small examples. Determine logical structure + main connective. Determine relevant definitions. Map out possible proof strategies. Conditional statement? Direct OR contrapositive. Existential statement? Find an example. Universal statement? Start with generic element Any statement: contradiction For each strategy: what can we assume, what is the goal? Start with simplest, move to more complicated if/when get stuck.

Some definitions Rosen Sections 2.1, 2.2 Set: unordered collection of elements "x is an element of set A" "x is not an element of set A"

Some definitions Rosen Sections 2.1, 2.2 Set: unordered collection of elements A = B iff How to specify these elements? Roster { } Set builder

Some definitions Rosen Sections 2.1, 2.2 Set: unordered collection of elements A = B iff Which of the following is not equal to the rest? A. { 1, 2, 3 } B. C. { 3, 1, 2 } D. { 1, 1, 2, 3} E.

Some definitions Rosen Sections 2.1, 2.2 Set: unordered collection of elements N: natural numbers {0, 1, 2, 3, } Z: integers {, -2, -1, 0, 1, 2, } Z + : positive integers {1, 2, 3, } Q: rational numbers R: real numbers R + : positive real numbers C: complex numbers Arrows in set builder notation indicate "and"

Some definitions Rosen Sections 2.1, 2.2 Subset: means

Some definitions Rosen Sections 2.1, 2.2 Subset: means Theorem: For any sets A and B, A = B if and only if both and Proof: What's the logical structure of this statement? A. Universal conditional. C. Conjunction (and) B. Biconditional. D. None of the above.

Some definitions Rosen Sections 2.1, 2.2 Subset: means Theorem: For any sets A and B, A = B if and only if both and Proof: Let A and B be any sets. WTS if A=B, then both and. WTS if both and, then A=B. Keep going

Some definitions Rosen Sections 2.1, 2.2 Subset: means How would you prove that R is not a subset of Q? A. Prove that every real number is not rational. B. Prove that every rational number is real. C. Prove that there is a real number that is rational. D. Prove that there is a real number that is not rational. E. Prove that there is a rational number that is not real.

An (ir)rational excursion Rosen p. 86, 97 Theorem: R is not a subset of Q. Lemma: 2 is not rational. Corollary: There are irrational numbers x,y such that x y is rational.

An (ir)rational excursion Rosen p. 86, 97 Theorem: R is not a subset of Q. Lemma: 2 is not rational. What's the logical structure of each of these statements? Recall: Q= Details of proof in page 86: use contradiction! Corollary: There are irrational numbers x,y such that x y is rational. Existential statement: can we build a witness?

An (ir)rational excursion Rosen p. 86, 97 Theorem: R is not a subset of Q. Lemma: 2 is not rational. What's the logical structure of each of these statements? Corollary: There are irrational numbers x,y such that x y is rational.

Some definitions Rosen Sections 2.1, 2.2 Empty set: Which of the following is not equal to the rest? A. { } B. C. D. E.

Some definitions Rosen Sections 2.1, 2.2 Power set: For a set S, its powers set is the set of all subsets of S. Which of the following is not true (in general)? A. B. C. D. E.