Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.
Union Definition: The union of sets A and B, denoted by A B, contains those elements that are in A or B or both: Example: { 1, 2, 3} {3, 4, 5} = { 1,
With examples from Number Theory
PROOF BY CONTRADICTION
Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.
CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.
Prof. Johnnie Baker Module Basic Structures: Sets
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Discrete Structures & Algorithms Basics of Set Theory EECE 320 — UBC.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
(CSC 102) Discrete Structures Lecture 14.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Set Operators Goals Show how set identities are established Introduce some important identities.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
Copyright © Zeph Grunschlag, Set Operations Zeph Grunschlag.
מבנה המחשב + מבוא למחשבים ספרתיים תרגול 1#
1 CA 208 Logic Ex4 Commutativity (P  Q)  Associativity P  (Q  R)  (P  Q)  R Distributivity P  (Q  R)  Idempotency.
1 CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng 4/26/2011.
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Set Operations CS/APMA 202, Spring 2005 Rosen, section 1.7 Aaron Bloomfield.
Review I Rosen , 3.1 Know your definitions!
Discrete Structure Sets. 2 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.
Lecture 2.2: Set Theory* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
CS201: Data Structures and Discrete Mathematics I
CompSci 102 Discrete Math for Computer Science
Set Operators. Copyright © Peter Cappello Union Let A and B be sets. A union B, denoted A  B, is the set A  B = { x | x  A  x  B }. Draw a.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sets Operations.
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
Chapter 1: The Foundations: Logic and Proofs
Chapter 2 With Question/Answer Animations. Section 2.1.
Set identities.
Lecture # 12 Set Identities
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.
Snick  snack Supplement: Worked Set Proofs Based on work by Meghan Allen.
Lecture 2.2: Set Theory CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Review 2 Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by lower.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Discrete Mathematics CS 2610 January 27, part 2.
Strings and Languages Denning, Section 2.7. Alphabet An alphabet V is a finite nonempty set of symbols. Each symbol is a non- divisible or atomic object.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Proof Review CS 202 Aaron Bloomfield Spring 2007.
Thinking Mathematically Venn Diagrams and Set Operations.
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.
Set Operators Goals Show how set identities are established
Set Operations CS 202, Spring 2008 Epp, chapter 5.
Copyright © Zeph Grunschlag,
Set Theory.
Discrete Structures – CNS 2300
Discrete Mathematical The Set Theory
The Foundations: Logic and Proofs
Sets Section 2.1.
Week 7 - Monday CS322.
Exercises Show that (P  Q)  (P)  (Q)
Review 2.
Set Operations Section 2.2.
Propositional Equivalences
Propositional Equivalence (§1.2)
CSE 311 Foundations of Computing I
CS 250, Discrete Structures, Fall 2013
L5 Set Operations.
CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
5.6 Inequalities in Two Triangles and Indirect Proof
Presentation transcript:

Rosen 1.6

Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use set identities for a tabular proof (similar to what we did for the propositional logic examples but using set identities) Do a logical (sentence-type) argument (similar to what we did for the number theory examples)

Prove (A  B)  (A  B) = B AB (A  B)(A  B) (A  B)  (A  B)

Prove (A  B)  (A  B) = B (A  B)  (A  B) = {x | x  (A  B)  (A  B)} Set builder notation = {x | x  (A  B)  x  (A  B)} Def of  = {x | (x  A  x  B)  (x  A  x  B)} Def of  x2 and Def of complement = {x | (x  B  x  A )  (x  B  x  A )} Commutative x2 = {x | (x  B  (x  A  x  A )} Distributive ={x | (x  B  T } Or tautology ={x | (x  B } Identity = BSet Builder notation

Set Identities (Rosen, p. 89) A  Ø = A A  U = A A  U = U A  Ø = Ø A  A = A A  A = A (A) = A Identity Laws Domination Laws Idempotent Laws Complementation Law

Set Identities (cont.) A  B = B  A A  B = B  A A  (B  C) = (A  B)  C A  (B  C) = (A  B)  C A  (B  C)=(A  B)  (A  C) A  (B  C)=(A  B)  (A  C) A  B = A  B A  B = A  B Commutative Laws Associative Laws Distributive Laws De Morgan’s Laws

Prove (A  B)  (A  B) = B (A  B)  (A  B) = (B  A)  (B  A) Commutative Law x2 =B  (A  A) Distributive Law =B  U Definition of U =BIdentity Law

Prove (A  B)  (A  B) = B Proof: We must show that (A  B)  (A  B)  B and that B  (A  B)  (A  B). First we will show that (A  B)  (A  B)  B. Let e be an arbitrary element of (A  B)  (A  B). Then either e  (A  B) or e  (A  B). If e  (A  B), then e  B and e  A. If e  (A  B), then e  B and e  A. In either case e  B.

Prove (A  B)  (A  B) = B Now we will show that B  (A  B)  (A  B). Let e be an arbitrary element of B. Then either e  A  B or e  A  B. Since e is in one or the other, then e  (A  B)  (A  B).

Prove A  B  A Proof: We must show that any element in A  B is also in A. Let e be an element in A  B. Since e is in the intersection of A and B, then e must be an element of A and e must be an element of B. Therefore e is in A.

Prove A  A =  A  A = (A  A) - (A  A) = (A) - (A) = Ø Definition of  Idempotent Laws Definition of -

Prove A  B = A  B Proof: To show that A  B = A  B we must show that A  B  A  B and A  B  A  B. First we will show that A  B  A  B. Let e  A  B. We must show that e is also  A  B. Since e  A  B, then e  A  B. So either e  A or e  B. If e  A then e  A. If e  B then e  B. In either case e  A  B

DeMorgan Proof (cont.) Next we will show that A  B  A  B. Let e  A  B. Then e  A or e  B. Therefore, by definition e  A or e  B. Therefore e  (A  B) which implies that e  A  B Since A  B  A  B and A  B  A  B then A  B = A  B.

Prove A  (B  C)=(A  B)  (A  C) Proof: To show that A  (B  C)=(A  B)  (A  C) we must show that A  (B  C)  (A  B)  (A  C) and (A  B)  (A  C)  A  (B  C).

Distributive Proof (cont.) First we will show that A  (B  C)  (A  B)  (A  C). Let e be an arbitrary element of A  (B  C). Then e  A and e  (B  C). Since e  (B  C), then either e  B or e  C or e is an element of both. Since e is in A and must be in at least one of B or C then e is an element of at least one of (A  B) or (A  C). Therefore e must be in the union of (A  B) and (A  C).

Distributive Proof (cont.) Next we will show that (A  B)  (A  C)  A  (B  C). Let x  (A  B)  (A  C). Then either x  (A  B) or x  (A  C) or x is in both. If x is in (A  B), then x  A and x  B If x  B, then x  (B  C). Therefore x  A  (B  C). By a similar argument if x  (A  C) then, again, x  A  (B  C). Since A  (B  C)  (A  B)  (A  C) and (A  B)  (A  C)  A  (B  C), then A  (B  C) = (A  B)  (A  C).

Prove: [A  B  A  B]  [A = B] Proof: We must show that when A  B  A  B is true then A=B is true. (Proof by contradiction) Assume that A  B  A  B is true but A  B. If A  B then this means that either  x  A but x  B, or  x  B but x  A. If  x  A but x  B, then x  A  B but x  A  B so A  B is not a subset of A  B and we have a contradiction to our original assumption. By a similar argument A  B is not a subset of A  B if  x  B but x  A. Therefore [A  B  A  B]  [A = B].

Prove or Disprove [A  B=A  C]  [B=C] False! A= Ø, B={a}, C={b} [A  B=A  C]  [B=C] False! A={a}, B= Ø, C={a}

Prove: A  (B-A) = A  B Proof: We must show that A  (B-A)  A  B and A  B  A  (B-A). First we will show that A  (B-A)  A  B. Let e  A  (B-A). Then either e  A or e  (B-A). If e  A, then e  A  B. Note that e cannot be an element of both by the definition of (B-A). If e  (B-A), then e  B and e  A by the definition of (B-A). In this case, too, e  A  B. Thus A  (B-A)  A  B.

Prove: A  (B-A) = A  B (cont.) Next we will show that A  B  A  (B-A). Let e  A  B. Then either e  A or e  B or both. If e  A or both, then e  A  (B-A). The other case is e  B, e  A. In this case e  (B-A) by the definition of (B-A). Again, this means that e  A  (B-A). Thus A  B  A  (B-A). Therefore A  (B-A) = A  B.