SEVENTH EDITION and EXPANDED SEVENTH EDITION

Size: px

Start display at page:

Download "SEVENTH EDITION and EXPANDED SEVENTH EDITION"

Edmund Hunt
5 years ago
Views:

1 SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 2-1

2 Chapter 2 Sets

3 2.1 Set Concepts

4 Set A collection of objects, which are called elements or members of the set. Listing the elements of a set inside a pair of braces, { }, is called roster form. Slide 2-4

5 Well-defined Set A set which has no question about what elements should be included. Its elements can be clearly determined. No opinion is associated with the members. Slide 2-5

6 Roster Form This is the form of the set where the elements are all listed, each separated by commas. Example: Set N is the set of all natural numbers less than or equal to 25. Solution: N = {1, 2, 3, 4, 5, 25} The 25 after the ellipsis indicates that the elements continue up to and including the number 25. Slide 2-6

7 Set-Builder (or Set-Generator) Notation A formal statement that describes the members of a set is written between the braces. A variable may represent any one of the members of the set. Example: Write set B = {2, 4, 6, 8, 10} in set-builder notation. Solution: B = { x x N and x is an even number 10}. Slide 2-7

8 Finite Set A set that contains no elements or the number of elements in the set is a natural number. Example: Set S = {2, 3, 4, 5, 6, 7} is a finite set because the number of elements in the set is 6, and 6 is a natural number. Slide 2-8

9 Infinite Set An infinite set contains an indefinite (uncountable) number of elements. The set of natural numbers is an example of an infinite set because it continues to increase forever without stopping, making it impossible to count its members. Slide 2-9

10 Equal Sets Equal sets have the exact same elements in them, regardless of their order. Symbol: A = B Slide 2-10

11 Cardinal Number The number of elements in set A is its cardinal number. Symbol: n(a) Slide 2-11

12 Equivalent Sets Equivalent sets have the same number of elements in them. Symbol: n(a) = n(b) Slide 2-12

13 Empty (or Null) Set A null (or empty set ) contains absolutely NO elements. Symbol: or { } Slide 2-13

14 Universal Set The universal set contains all of the possible elements which could be discusses in a particular problem. Symbol: U Slide 2-14

15 2.2 Subsets

16 Subsets A set is a subset of a given set if and only if all elements of the subset are also elements of the given set. Symbol: To show that set A is not a subset of set B, one must find at least one element of set A that is not an element of set B. Slide 2-16

17 Determining Subsets Example: Determine whether set A is a subset of set B. A = { 3, 5, 6, 8 } B = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} Solution: All of the elements of set A are contained in set B, so A B. Slide 2-17

18 Proper Subset All subsets are proper subsets except the subset containing all of the given elements. Symbol: Slide 2-18

19 Determining Proper Subsets Example: Determine whether set A is a proper subset of set B. A = { dog, cat } B = { dog, cat, bird, fish } Solution: All the elements of set A are contained in set B, and sets A and B are not equal, therefore A B. Slide 2-19

20 Determining Proper Subsets continued Example: Determine whether set A is a proper subset of set B. A = { dog, bird, fish, cat } B = { dog, cat, bird, fish } Solution: All the elements of set A are contained in set B, but sets A and B are equal, therefore A B. Slide 2-20

21 Number of Distinct Subsets The number of distinct subsets of a finite set A is 2 n, where n is the number of elements in set A. Example: Determine the number of distinct subsets for the given set { t, a, p, e }. List all the distinct subsets for the given set: { t, a, p, e }. Slide 2-21

22 Number of Distinct Subsets continued Solution: Since there are 4 elements in the given set, the number of distinct subsets is 2 4 = = 16 subsets. {t,a,p,e}, {t,a,p}, {t,a,e}, {t,p,e}, {a,p,e}, {t,a}, {t,p}, {t,e}, {a,p}, {a,e}, {p,e}, {t}, {a}, {p}, {e}, { } Slide 2-22

23 2.3 Venn Diagrams and Set Operations

24 Venn Diagrams A Venn diagram is a technique used for picturing set relationships. A rectangle usually represents the universal set, U. The items inside the rectangle are divided into subsets of U and are represented by circles. Slide 2-24

25 Disjoint Sets Two sets which have no elements in common are said to be disjoint. The intersection of disjoint sets is the empty set. Disjoint sets A and B are drawn in this figure. There U are no elements in common since there is no overlapping area of the two circles. A B Slide 2-25

26 Overlapping Sets For sets A and B drawn in this figure, notice the overlapping area shared by the two circles. This section represents the elements are in the intersection of set A and set B. U A B Slide 2-26

27 Complement of a Set The set known as the complement contains all the elements of the universal set, which are not listed in the given subset. Symbol: A Slide 2-27

28 Intersection The intersection of two given sets contains only those elements common to those sets. Symbol: A I B Slide 2-28

29 Union The union of two given sets contains all of the elements for those sets. The union unites that is, it brings together everything into one set. Symbol: AUB Slide 2-29

30 Subsets When B A, every element of B is also an element of A. Circle B is completely inside circle A. U A B Slide 2-30

31 Equal Sets When set A is equal to set B, all the elements of A are elements of B, and all the elements of B are elements of A. U A B Both sets are drawn as one circle. Slide 2-31

32 2.4 Venn Diagrams with Three Sets

33 General Procedure for Constructing Venn Diagrams with Three Sets Find the elements that are common to all three sets and place in region V. U A I IV II V VI III B VII C VIII Slide 2-33

34 General Procedure for Constructing Venn Diagrams with Three Sets continued Find the elements for region II. Find the elements in AI B. The elements in this set belong in regions II and V. Place the elements in the set AI B that are not listed in region V in region II. The elements in regions IV and VI are found in a similar manner. U A I IV II V VI VII C III B VIII Slide 2-34

35 General Procedure for Constructing Venn Diagrams with Three Sets continued Determine the elements to be placed in region I by determining the elements in set A that are not in regions II, IV, and V. The elements in regions III and VII are found in a similar manner. U A I IV II V VI VII C III B VIII Slide 2-35

36 General Procedure for Constructing Venn Diagrams with Three Sets continued Determine the elements to be placed in region VIII by finding the elements in the universal set that are not in regions I through VII. U A I IV II V VI VII C III B VIII Slide 2-36

37 Example: Constructing a Venn diagram for Three Sets Construct a Venn diagram illustrating the following sets. U = {1, 2, 3, 4, 5, 6, 7, 8} A = { 1, 2, 5, 8} B = {2, 4, 5} C = {1, 3, 5, 8} Solution: Find the intersection of all three sets and place in region V, {5}. AIBIC = Slide 2-37

38 Example: Constructing a Venn diagram for Three Sets continued Determine the intersection of sets A and B and place in region II. AI B = {2, 5} Element 5 has already been placed in region V, so 2 must be placed in region II. Now determine the numbers that go into region V. AI C = { 1, 2, 5, 8} Since 5 has been placed in region V, place 1 and 8 in region IV. Slide 2-38

39 Example: Constructing a Venn diagram for Three Sets continued Now determine the numbers that go in region VI. BI C = {5} There are now new numbers to be placed in this region. Since all numbers in set A have been placed, there are no numbers in region I. The same procedures using set B completes region III. Using set C completes region VII. Slide 2-39

40 Example: Constructing a Venn diagram for Three Sets continued The Venn diagram is then completed. U A I 1,8 IV II 2 4 III 5 V VI 3 VII B 6 7 C VIII Slide 2-40

41 De Morgan s Laws A pair of related theorems known as De Morgan s laws make it possible to change statements and formulas into more convenient forms. (A UB) = A I B (A IB) = A U B Slide 2-41

42 2.5 Applications of Sets

43 Example: Toothpaste Taste Test A drug company is considering manufacturing a new toothpaste. They are considering two flavors, regular and mint. In a sample of 120 people, it was found that 74 liked the regular, 62 liked the mint, and 35 liked both types. How many liked only the regular flavor? How many liked either one or the other or both? How many people did not like either flavor? Slide 2-43

44 Solution Begin by setting up a Venn diagram with sets A (regular flavor) and B (mint flavor). Since some people liked both flavors, the sets will overlap and the number who liked both with be placed in region II. 35 people liked both flavors. U Regular 35 Mint Slide 2-44

45 Solution continued Next, region I will refer to those who liked only the regular and region III will refer to those who liked only the mint. In order to get the number of people in each region, find the difference between all the people who liked each toothpaste and those who liked both = = 27 U Regular 39 regular only 35 both 27 mint only Mint Slide 2-45

46 Solution continued One or the other or both represents the UNION of the two sets. Therefore, = 101 people who liked one or the other or both. Slide 2-46

47 Solution continued Take the total number of people in the entire sample and subtract the number who liked one or the other or both. 19 people did not like either flavor. U 19 liked neither 74-35=39 Liked mint only 35 both 62-35=27 Liked mint only Regular Mint Slide 2-47

48 2.6 Infinite Sets

49 Infinite Sets An infinite set is a set that can be placed in a one-to-one correspondence with a proper subset of itself. These sets are unbounded. Slide 2-49

50 Example: The Set of Multiples of Four Show that it is an infinite set. {4, 8, 12, 16, 20,,4n, } Solution: We establish one-to-one correspondence between the counting numbers and a proper subset of itself. Given set: {4, 8, 12, 16, 20,, 4n, } Proper subset: {4, 8, 12, 16, 20,, 4n + 4, } Therefore, the given set is infinite. Slide 2-50

51 Countable Sets A set is countable if it is finite or if it can be placed in a one-to-one correspondence with the set of counting numbers. Any set that can be placed in a one-to-one correspondence with a set of counting numbers has cardinality aleph-null and is countable. Slide 2-51

Section 1.1. Inductive Reasoning. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section 1.1. Inductive Reasoning. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 1.1 Inductive Reasoning What You Will Learn Inductive and deductive reasoning processes 1.1-2 Natural Numbers The set of natural numbers is also called the set of counting numbers. N = {1, 2, 3,