2 Chapter Introduction to Logic and Sets

Slides:



Advertisements
Similar presentations
Learning Objectives for Section 7.2 Sets
Advertisements

Introduction to Set Theory
(CSC 102) Discrete Structures Lecture 14.
Chapter 7 Logic, Sets, and Counting
Chapter 7 Logic, Sets, and Counting Section 3 Basic Counting Principles.
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.
1 Learning Objectives for Section 7.2 Sets After today’s lesson, you should be able to Identify and use set properties and set notation. Perform set operations.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Set Notation.
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Basic Counting Principles 6.3 Basic Counting.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Introduction to Set Theory. Introduction to Sets – the basics A set is a collection of objects. Objects in the collection are called elements of the set.
Sets Defined A set is an object defined as a collection of other distinct objects, known as elements of the set The elements of a set can be anything:
Chapter 7 Logic, Sets, and Counting Section 2 Sets.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © Cengage Learning. All rights reserved.
Unit 2 Sets.
SECTION 2-3 Set Operations and Cartesian Products Slide
Sets Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Definition of Set A set is a collection of objects called elements.
ELEMENTARY SET THEORY.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Sets and Counting6 Sets and Set Operations The Number of Elements in a Finite Set The.
Set Operations Chapter 2 Sec 3. Union What does the word mean to you? What does it mean in mathematics?
(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.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Thinking Mathematically Venn Diagrams and Set Operations.
Copyright © 2015, 2011, 2007 Pearson Education, Inc. Section 2.3, Slide 1 CHAPTER 2 Set Theory.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
Union and Intersection of Sets. Definition - intersection The intersection of two sets A and B is the set containing those elements which are and elements.
Sets and Operations TSWBAT apply Venn diagrams in problem solving; use roster and set-builder notation; find the complement of a set; apply the set operations.
 2012 Pearson Education, Inc. Slide Chapter 2 The Basic Concepts of Set Theory.
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Lecture 6 Set Theory.
The set of whole numbers less than 7 is {1, 2, 3, 4, 5, 6}
Chapter two Theory of sets
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Unions and Intersections of Sets
G2.4 – Set Operations There are some operations that we can do on sets. Some of them will look very similar to operations from algebra. August 2006 Copyright.
Venn Diagrams and Set Operation
CSNB 143 Discrete Mathematical Structures
Set, Combinatorics, Probability & Number Theory
The Basic Concepts of Set Theory
Sets Section 2.1.
Solving Compound Inequalities
The Basic Concepts of Set Theory
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
CSE 2353 – September 22nd 2003 Sets.
Section 2.3 Venn Diagrams and Set Operations
Chapter 2 The Basic Concepts of Set Theory
The Basic Concepts of Set Theory
The Basic Concepts of Set Theory
The Basic Concepts of Set Theory
Chapter 7 Logic, Sets, and Counting
Copyright © Cengage Learning. All rights reserved.
ALGEBRA I - SETS : UNION and INTERSECTION
SETS Sets are denoted by Capital letters Sets use “curly” brackets
2 Chapter Numeration Systems and Sets
MCS680: Foundations Of Computer Science
Chapter 7 Logic, Sets, and Counting
Thinking Mathematically
Thinking Mathematically
CHAPTER 2 Set Theory.
2.1 – Symbols and Terminology
Thinking Mathematically
CHAPTER 2 Set Theory.
Presentation transcript:

2 Chapter Introduction to Logic and Sets Copyright © 2016, 2013, and 2010, Pearson Education, Inc.

2-3 Other Set Operations and Their Properties Students will be able to understand and explain • Relations between set operations and logic connectives. • Properties of set and logic operations. • Venn diagrams to sort and reason with data.

Set Intersection Consider the following sets: C = {x | x is a college graduate} S = {x | x earns at least $40,000} Suppose we want to mail a questionnaire to all individuals in a certain city who are college graduates and who earn at least $40,000. Then the individuals to receive the questionnaire include those common to both sets C and S.

Set Intersection C = {x | x is a college graduate} S = {x | x earns at least $40,000} The intersection of sets C and S is the shaded region. S C Intersection of sets C and S

Definition The intersection of two sets A and B, written is the set of all elements common to both A and B. The key word is “and” which implies both conditions must be met.

Example Find a. b. (A and B are disjoint.) c.

4800 – 1200 = 3600 have college degrees but earn less than $40,000. If C represents the individuals with a college degree and S represents the individuals earning at least $40,000, we can use a Venn diagram to display information. If we know that 4800 individuals have college degrees, 5400 earn at least $40,000, and 1200 have a college degree and make at least $40,000, then 4800 – 1200 = 3600 have college degrees but earn less than $40,000. C S 3600 4200 1200 5400 – 1200 = 4200 earn at least $40,000 and do not have a college degree.

Set Union Consider the following sets: C = {x | x is a college graduate} S = {x | x earns at least $40,000} Suppose we want to mail a questionnaire to all individuals in a certain city who are college graduates or who earn at least $40,000, or both. Then the individuals to receive the questionnaire include those who are members of set C or set S.

Set Union C = {x | x is a college graduate} S = {x | x earns at least $40,000} The union of sets C and S is the shaded region. S C Union of sets C and S

Definition The union of two sets A and B, written is the set of all elements in A or in B. The key word is “or” which implies one or the other or both.

Example Find a. b. c. since every element of A is in B.

Set Difference Consider the following sets: C = {x | x is a college graduate} S = {x | x earns at least $40,000} The set of individuals earning at least $40,000 but not a college graduate is called the complement of C relative to S, or the set difference of S and C.

Definition The complement of A relative to B, written B − A, is the set of all elements in B that are not in A. Note B − A that is not read as “B minus A.” Minus is an operation on numbers and set difference is an operation on sets.

Relative Complement B A This is the set of all elements in B and not in A.

Example If find A − B, B − A, B − C, and C − B.

Properties of Set Operations Commutative Properties For all sets A and B, Since the order of the elements in a set is not important, it does not matter in which order we write the sets when we find the union or the intersection.

Properties of Set Operations Associative Properties For all sets A and B, Since the order of the elements in a set is not important, it does not matter in which way we associate sets when we take the union or the intersection.

Distributive Property of Intersection Over Union For all sets A, B, and C,

Example Use set notation to describe the shaded portions of the Venn diagrams. a. b.

Example (continued) c. d.

Example Suppose M is the set of all students taking mathematics and E is the set of all students taking English. Identify the students described by each region in the figure. Region (a) contains all students taking mathematics but not English or M – E. Region (b) contains all students taking both mathematics and English or

Example cont. Suppose M is the set of all students taking mathematics and E is the set of all students taking English. Identify the students described by each region in the figure. Region (c) contains all students taking English but not mathematics or E – M. Region (d) contains all students taking neither mathematics nor English or

Example In a survey that investigated the high school backgrounds of 110 college freshmen, the following information was gathered: 25 took physics 45 took biology 48 took mathematics 10 took physics and mathematics 8 took biology and mathematics 6 took physics and biology 5 took all three subjects.

Example (continued) a. How many students took biology but neither physics nor mathematics? b. How many took physics, biology, or mathematics? c. How many did not take any of the three subjects? To solve this problem, we build a model using sets.

Example (continued) P is the set of students taking physics, B is the set taking biology, and M is the set taking mathematics. The shaded region represents the 5 students who took all three subjects. The lined region represents the students who took physics and mathematics, but who did not take biology.

Example (continued) The number of students who took biology but not physics or mathematics is represented by Because a total of 10 students took physics and mathematics and 5 of those also took biology, 10 − 5, or 5, students took physics and mathematics but not biology.

Example (continued) Because 8 students took biology and mathematics and 5 took all three subjects, 8 − 5, or 3, took biology and mathematics but not physics. 6 − 5, or 1, student took physics and biology, but not mathematics.

Example (continued) To find the number of students who took biology but neither physics nor mathematics, we subtract from 45 (the total number that took biology) the number of those that are in the distinct regions that include biology and other subjects, that is, 1 + 5 + 3, or 9. Because 45 − 9 = 36, we know that 36 students took biology, but neither physics nor mathematics.

Example (continued) The number of students who took physics, biology, or mathematics is represented by The number of students who took physics but neither mathematics nor biology is 25 − (1 + 5 + 5), or 14. The number of students who took mathematics but neither physics nor biology is 48 − (5 + 5 + 3), or 35.

Example (continued) The number of students who took physics, biology, or mathematics is 35 + 14 + 36 + 3 + 5 + 5 + 1, or 99. Because the total number of students is 110, the number that did not take any of the three subjects is 110 − 99, or 11.

Cartesian Products One way to produce a set from two sets is by forming pairs of elements of one set with the elements of another set in a specific way.

Cartesian Products Suppose a person has three pairs of pants, P = {blue, green, white}, and two shirts, S = {blue, red}. According to the Fundamental Counting Principle, there are 3 • 2 = 6 possible ways to pair an element from set P with an element from set S, forming a set of ordered pairs.

Cartesian Products Because the first component in each pair represents pants and the second component in each pair represents shirts, the order in which the components are written is important.

Definition Equality for ordered pairs: (x, y) = (m, n) if, and only if, the first components are equal and the second components are equal. A set consisting of ordered pairs is an example of a Cartesian product.

Definition For any sets A and B, the Cartesian product of A and B, written A  B, is the set of all ordered pairs such that the first component of each pair is an element of A and the second component of each pair is an element of B. Note that A  B is commonly read as “A cross B” and should never be read “A times B.”

Example If A = {a, b, c} and B = {1, 2, 3}, find each of the following: a. A  B b. B  A c. A  A a. A  B = {(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3), (c, 1), (c, 2), (c, 3)} b. B  A = {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c), (3, a), (3, b), (3, c)} c. A  A = {(a, a), (a, b), (a, c), (b, a), (b, b), (b, c), (c, a), (c, b), (c, c)}

Cartesian Products It is possible to form a Cartesian product involving the null or empty set. Suppose A = {1, 2}. Because there are no elements in Ø, no ordered pairs (x, y) with x A and y  Ø, so A  Ø = Ø. Similarly, Ø  A = Ø for all sets A.