Applied Discrete Mathematics Week 2: Proofs

Slides:



Advertisements
Similar presentations
Fall 2002CMSC Discrete Structures1 … and now for something completely different… Set Theory Actually, you will see that logic and set theory are.
Advertisements

Discrete Mathematics I Lectures Chapter 6
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Section 1.6: Sets Sets are the most basic of discrete structures and also the most general. Several of the discrete structures we will study are built.
The Engineering Design of Systems: Models and Methods
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Analytical Methods in CS (CIS 505)
So far we have learned about:
CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.
Sets. Copyright © Peter Cappello Definition Visualize a dictionary as a directed graph. Nodes represent words If word w is defined in terms of word.
Lecture , 3.1 Methods of Proof. Last time in 1.5 To prove theorems we use rules of inference such as: p, p  q, therefore, q NOT q, p  q, therefore.
Discrete Math 6A Max Welling. Recap 1. Proposition: statement that is true or false. 2. Logical operators: NOT, AND, OR, XOR, ,  3. Compound proposition:
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
February 5, 2015Applied Discrete Mathematics Week 1: Logic and Sets 1 Homework Solution PQ  (P  Q) (  P)  (  Q)  (P  Q)  (  P)  (  Q) truetruefalsefalsetrue.
Survey of Mathematical Ideas Math 100 Chapter 2 John Rosson Thursday January 25, 2007.
CSCI 1900 Discrete Structures
Methods of Proof & Proof Strategies
1 Methods of Proof CS/APMA 202 Epp, chapter 3 Aaron Bloomfield.
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
CS201: Data Structures and Discrete Mathematics I
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
1. Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element of A” A = {a 1, a 2,
CompSci 102 Discrete Math for Computer Science
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
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,
Sets Goal: Introduce the basic terminology of set theory.
CSE 311 Foundations of Computing I Lecture 9 Proofs and Set Theory Autumn 2012 CSE
Chapter 2 With Question/Answer Animations. Section 2.1.
12/19/20151 … and now for something completely different… Set Theory Actually, you will see that logic and set theory are very closely related.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
CS 285- Discrete Mathematics
CS104:Discrete Structures Chapter 2: Proof Techniques.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
Chapter 1 Logic and Proof.
CSE15 Discrete Mathematics 02/13/17
Sets.
Dr. Ameria Eldosoky Discrete mathematics
Applied Discrete Mathematics Week 1: Logic and Sets
Sets Finite 7-1.
Chapter 2 Sets and Functions.
Set Definition: A set is unordered collection of objects.
The Language of Sets If S is a set, then
Discrete Mathematical The Set Theory
Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.
Methods of Proof CS 202 Epp, chapter 3.
Methods of Proof A mathematical theorem is usually of the form pq
… and now for something completely different…
Exercises Show that (P  Q)  (P)  (Q)
CS100: Discrete structures
Mathematical Reasoning
2.1 Sets Dr. Halimah Alshehri.
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
Discrete Mathematics CS 2610
… and now for something completely different…
Which sets are equal? Which sets are equivalent?
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Mathematical Reasoning
Mathematical Induction
Presentation transcript:

Applied Discrete Mathematics Week 2: Proofs Proving Theorems Direct proof: An implication pq can be proved by showing that if p is true, then q is also true. Example: Give a direct proof of the theorem “If n is odd, then n2 is odd.” Idea: Assume that the hypothesis of this implication is true (n is odd). Then use rules of inference and known theorems to show that q must also be true (n2 is odd). September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Proving Theorems n is odd. Then n = 2k + 1, where k is an integer. Consequently, n2 = (2k + 1)2. = 4k2 + 4k + 1 = 2(2k2 + 2k) + 1 Since n2 can be written in this form, it is odd. September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Proving Theorems Indirect proof: An implication pq is equivalent to its contra-positive q  p. Therefore, we can prove pq by showing that whenever q is false, then p is also false. Example: Give an indirect proof of the theorem “If 3n + 2 is odd, then n is odd.” Idea: Assume that the conclusion of this implication is false (n is even). Then use rules of inference and known theorems to show that p must also be false (3n + 2 is even). September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Proving Theorems n is even. Then n = 2k, where k is an integer. It follows that 3n + 2 = 3(2k) + 2 = 6k + 2 = 2(3k + 1) Therefore, 3n + 2 is even. We have shown that the contrapositive of the implication is true, so the implication itself is also true (If 3n + 2 is odd, then n is odd). September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Proving by Cases For every positive integer n, n(n + 1) is even. Idea: Let us first show that the product of an even number m and an odd number n is always even: m = 2k n = 2p + 1 mn = 2k (2p + 1) = 4kp + 2k mn = 2(2kp + k) Since k and p are integers, (2kp + k) is an integer as well, and we have shown that mn is even. September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Proving by Cases The remainder of the proof becomes easy if we separately consider each of the two main situations that can occur: Case I: n is even. Then n(n + 1) means that we multiply an even number with an odd one. As shown above, the result must be even. Case II: n is odd. Then n(n + 1) means that we multiply an odd number with an even one. As shown above, the result must be even. Since there are no other cases, we have proven that n(n + 1) s always even. September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

… and now for something completely different… Set Theory Actually, you will see that logic and set theory are very closely related. September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Set Theory Set: Collection of objects (“elements”) aA “a is an element of A” “a is a member of A” aA “a is not an element of A” A = {a1, a2, …, an} “A contains…” Order of elements is meaningless It does not matter how often the same element is listed. September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Set Equality Sets A and B are equal if and only if they contain exactly the same elements. Examples: A = {9, 2, 7, -3}, B = {7, 9, -3, 2} : A = B A = {dog, cat, horse}, B = {cat, horse, squirrel, dog} : A  B A = {dog, cat, horse}, B = {cat, horse, dog, dog} : A = B September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Examples for Sets “Standard” Sets: Natural numbers N = {0, 1, 2, 3, …} Integers Z = {…, -2, -1, 0, 1, 2, …} Positive Integers Z+ = {1, 2, 3, 4, …} Real Numbers R = {47.3, -12, , …} Rational Numbers Q = {1.5, 2.6, -3.8, 15, …} (correct definition will follow) September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Examples for Sets A =  “empty set/null set” A = {z} Note: zA, but z  {z} A = {{b, c}, {c, x, d}} A = {{x, y}} Note: {x, y} A, but {x, y}  {{x, y}} A = {x | P(x)} “set of all x such that P(x)” A = {x | xN  x > 7} = {8, 9, 10, …} “set builder notation” September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Examples for Sets We are now able to define the set of rational numbers Q: Q = {a/b | aZ  bZ+} or Q = {a/b | aZ  bZ  b0} And how about the set of real numbers R? R = {r | r is a real number} That is the best we can do. September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Subsets A  B “A is a subset of B” A  B if and only if every element of A is also an element of B. We can completely formalize this: A  B  x (xA  xB) Examples: A = {3, 9}, B = {5, 9, 1, 3}, A  B ? true A = {3, 3, 3, 9}, B = {5, 9, 1, 3}, A  B ? true A = {1, 2, 3}, B = {2, 3, 4}, A  B ? false September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Subsets Useful rules: A = B  (A  B)  (B  A) (A  B)  (B  C)  A  C (see Venn Diagram) U C B A September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Subsets Useful rules:   A for any set A A  A for any set A Proper subsets: A  B “A is a proper subset of B” A  B  x (xA  xB)  x (xB  xA) or A  B  x (xA  xB)  x (xB  xA) September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs Cardinality of Sets If a set S contains n distinct elements, nN, we call S a finite set with cardinality n. Examples: A = {Mercedes, BMW, Porsche}, |A| = 3 B = {1, {2, 3}, {4, 5}, 6} |B| = 4 C =  |C| = 0 D = { xN | x  7000 } |D| = 7001 E = { xN | x  7000 } E is infinite! September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs The Power Set 2A or P(A) “power set of A” 2A = {B | B  A} (contains all subsets of A) Examples: A = {x, y, z} 2A = {, {x}, {y}, {z}, {x, y}, {x, z}, {y, z}, {x, y, z}} A =  2A = {} Note: |A| = 0, |2A| = 1 September 13, 2018 Applied Discrete Mathematics Week 2: Proofs

Applied Discrete Mathematics Week 2: Proofs The Power Set Cardinality of power sets: | 2A | = 2|A| Imagine each element in A has an “on/off” switch Each possible switch configuration in A corresponds to one element in 2A A 1 2 3 4 5 6 7 8 x y z For 3 elements in A, there are 222 = 8 elements in 2A September 13, 2018 Applied Discrete Mathematics Week 2: Proofs