Applied Discrete Mathematics Week 1: Logic and Sets

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
Discrete Structures & Algorithms Basics of Set Theory EECE 320 — UBC.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
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)
Discrete Structures Chapter 3 Set Theory Nurul Amelina Nasharuddin Multimedia Department.
Sets 1.
Sets 1.
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Discrete Math 6A Max Welling. Recap 1. Proposition: statement that is true or false. 2. Logical operators: NOT, AND, OR, XOR, ,  3. Compound proposition:
SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
Intro to Set Theory. Sets and Their Elements A set A is a collection of elements. If x is an element of A, we write x  A; if not: x  A. Say: “x is a.
February 5, 2015Applied Discrete Mathematics Week 1: Logic and Sets 1 Homework Solution PQ  (P  Q) (  P)  (  Q)  (P  Q)  (  P)  (  Q) truetruefalsefalsetrue.
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
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.
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
ELEMENTARY SET THEORY.
Discrete Mathematical Structures 4 th Edition Kolman, Busby, Ross © 2000 by Prentice-Hall, Inc. ISBN
Chapter 2 With Question/Answer Animations. Section 2.1.
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
Discrete Mathematics SETS. What is a set? ^A set is a unordered collection of “objects”  People in a class: {A yşe, B arış, C anan }  Cities in Turkey.
12/19/20151 … and now for something completely different… Set Theory Actually, you will see that logic and set theory are very closely related.
(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.
Discrete Mathematics CS 2610 January 27, part 2.
Discrete Mathematics Set.
1 Topic Sets (5.1, 5.2, 5.3). 2 Original author of the slides: Vadim Bulitko University of Alberta Modified by.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Set Operations Section 2.2.
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
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.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
CPCS 222 Discrete Structures I
Set. Outline Universal Set Venn Diagram Operations on Sets.
CSE15 Discrete Mathematics 02/13/17
Dr. Ameria Eldosoky Discrete mathematics
Sets Finite 7-1.
Set Definition: A set is unordered collection of objects.
Set Theory.
Discrete Mathematical The Set Theory
Set, Combinatorics, Probability & Number Theory
Sets Section 2.1.
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.
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
Introduction to Set Theory
… and now for something completely different…
Exercises Show that (P  Q)  (P)  (Q)
CS100: Discrete structures
Set Theory Rosen 6th ed., §
Algebra 1 Section 1.1.
Unit I: Part I Set Theory
2.1 Sets Dr. Halimah Alshehri.
Applied Discrete Mathematics Week 2: Proofs
Discrete Mathematics CS 2610
Discrete Mathematics R. Johnsonbaugh
Chapter 7 Logic, Sets, and Counting
Applied Discrete Mathematics Week 3: Sets
… and now for something completely different…
Lecture Sets 2.2 Set Operations.
Sets & Set Operations.
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Presentation transcript:

Applied Discrete Mathematics Week 1: Logic and Sets Homework Solution P Q (PQ) (P)(Q) (PQ)(P)(Q) true false The statements (PQ) and (P)(Q) are logically equivalent, so we write (PQ)(P)(Q). January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

… and now for something completely different… Set Theory Actually, you will see that logic and set theory are very closely related. January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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. January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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 January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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) January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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” January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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. January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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 January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Subsets Useful rules: A = B  (A  B)  (B  A) (A  B)  (B  C)  A  C (see Venn Diagram) U C B A January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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) January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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! January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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 January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets 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 January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Cartesian Product The ordered n-tuple (a1, a2, a3, …, an) is an ordered collection of objects. Two ordered n-tuples (a1, a2, a3, …, an) and (b1, b2, b3, …, bn) are equal if and only if they contain exactly the same elements in the same order, i.e., ai = bi for 1  i  n. The Cartesian product of two sets is defined as: AB = {(a, b) | aA  bB} Example: A = {x, y}, B = {a, b, c} AB = {(x, a), (x, b), (x, c), (y, a), (y, b), (y, c)} January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Cartesian Product Note that: A =  A =  For non-empty sets A and B: AB  AB  BA |AB| = |A||B| The Cartesian product of two or more sets is defined as: A1A2…An = {(a1, a2, …, an) | aiAi for 1  i  n} January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Set Operations Union: AB = {x | xA  xB} Example: A = {a, b}, B = {b, c, d} AB = {a, b, c, d} Intersection: AB = {x | xA  xB} AB = {b} January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Set Operations Two sets are called disjoint if their intersection is empty, that is, they share no elements: AB =  The difference between two sets A and B contains exactly those elements of A that are not in B: A-B = {x | xA  xB} Example: A = {a, b}, B = {b, c, d}, A-B = {a} January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Set Operations The complement of a set A contains exactly those elements under consideration that are not in A: -A = U-A Example: U = N, B = {250, 251, 252, …} -B = {0, 1, 2, …, 248, 249} Table 1 in Section 2.2 (4th edition: Section 1.5; 5th edition: Section 1.7; 6th edition: Section 2.2) shows many useful equations for set identities. January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Set Operations How can we prove A(BC) = (AB)(AC)? Method I: xA(BC) xA  x(BC) xA  (xB  xC) (xA  xB)  (xA  xC) (distributive law for logical expressions) x(AB)  x(AC) x(AB)(AC) January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Set Operations Method II: Membership table 1 means “x is an element of this set” 0 means “x is not an element of this set” A B C BC A(BC) AB AC (AB) (AC) 0 0 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Set Operations Take-home message: Every logical expression can be transformed into an equivalent expression in set theory and vice versa. January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets

Applied Discrete Mathematics Week 1: Logic and Sets Exercises Question 1: Given a set A = {x, y, z} and a set B = {1, 2, 3, 4}, what is the value of | 2A  2B | ? Question 2: Is it true for all sets A and B that (AB)(BA) =  ? Or do A and B have to meet certain conditions? Question 3: For any two sets A and B, if A – B =  and B – A = , can we conclude that A = B? Why or why not? January 26, 2017 Applied Discrete Mathematics Week 1: Logic and Sets