Quick viewing(Text Mode)

Basic Concepts of Set Theory: Symbols & Terminology Defining

Basic Concepts of Set Theory: Symbols & Terminology Defining

Yes No, 2 ∈/ {1, 3, 5, 7, 9}

No

Yes

No

No

Basic of : Symbols & Terminology Defining Sets

word A set is a collection of objects. The set of odd between 2 and 12 A well-defined set has no as to what objects are in the the listing method set or not. {3, 5, 7, 9, 11} For example: set-builder or defining method The collection of all red cars {x | x is a counting , x is odd, and x < 12} The collection of positive numbers The collection of people born before 1980 Note: The collection of greatest baseball players Use curly braces to designate sets, Use commas to separate set elements All of these collections are sets. However, the collection of greatest The in the set–builder notation doesn’t have to be x. baseball players is not well-defined. Use ellipses (. . . ) to indicate a continuation of a pattern Normally we restrict our attention to just well-defined sets. established before the ellipses i.. {1, 2, 3, 4,..., 100} The | is read as “such that”

Set Membership Some Important Sets

N — Natural or Counting numbers: {1, 2, 3, . . . } An or member of a set is an object that belongs to the set W — Whole Numbers: {0, 1, 2, 3, . . . }

The symbol ∈ means “is an element of” I — : {. . . , -3, -2, -1, 0, 1, 2, 3, . . . } p Q — Rational numbers: { q | p, q ∈ I, q 6= 0 } The symbol ∈/ means “is not an element of” < — Real Numbers: { x | x is a number that can be written Generally capital letters are used to represent sets and lowercase as a decimal } letters are used for other objects i.e. = {2, 3, 5, 7} Irrational numbers: { x | x is a and x cannot be written as a of√ integers√}. Thus, a ∈ S means a is an element of S 3 Examples are: π, 2, and 4

Is 2 ∈ {0, 2, 4, 6}? ∅ — : {}, the set that contains nothing Is 2 ∈ {1, 3, 5, 7, 9}? U — : the set of all objects currently under discussion

Notes More Membership Questions

Any can be written as either a terminating decimal (like 0.5, 0.333, or 0.8578966) or a Is ∅ ∈ { a, b, c } ? repeating decimal (like 0.333 or 123.392545) Is ∅ ∈ { ∅, { ∅ } } ?

Is ∅ ∈ { { ∅ } } ? The decimal representation of an never 1 1 terminates and never repeats Is 3 ∈/ { x | x = p , p ∈ N}

The set { ∅ } is not empty, but is a set which contains the empty set 5 50 Infinite 3 6

Yes No Yes

Set Set Cardinality

The cardinality of a set is the number of distinct elements in the set

The cardinality of a set A is denoted n(A) or |A| A = {3, 5, 7, 9, 11},B = {2, 4, 6,..., 100},C = {1, 3, 5, 7,... }

If the cardinality of a set is a particular whole number, we call D = {1, 2, 3, 2, 1},E = {x | x is odd, and x < 12} that set a finite set

If a set is so large that there is no such number, it is called an infinite set (there is a precise definition of infinity but that is n(A) = ? beyond the scope of this course) n(B) = ? n(C) = ? Note: Sets do not care about the or how many times an n(D) = ? object is included. Thus, {1, 2, 3, 4}, {2, 3, 1, 4}, and n(E) = ? {1, 2, 2, 3, 3, 3, 4, 4} all describe the same set.

Set Venn Diagrams &

Universe of Discourse – the set containing all elements under Set Equality: the sets A and B are equal (written A = B) discussion for a particular problem provided: In mathematics, this is called the universal set and is denoted by 1. every element of A is an element of B, and U 2. every element of B is an element of A Venn diagrams can be used to represent sets and their relationships to each other

In other words, they contain exactly the same elements

A { a, b, c } = { b, c, a } = { a, b, a, b, c } ? { 3 } = { x | x ∈ N and 1 < x < 5} ? { x | x ∈ N and x < 0} = { y | y ∈ Q and y is irrational} ? U

Venn Diagrams The of a Set

The “” is represented by the rectangle A0 Sets are represented with circles, shaded regions, and other within the rectangle. A

A0

A The set A0, the shaded region, is the complement of A A0 is the set of all objects in the universe of discourse that are not elements of A

A0 = {x | x ∈ U and x∈ / A} R0 = {3, 4, 7, 8}

S0 = {1, 3, 6}

U 0 = {} = ∅

∅0 = U

T ⊆ R since T is completely contained inside of R Also every set is a of U

3 1 4 6 5 2 8

7

6⊆

6⊆

Subsets

Set A is a subset of set B if every element of A is also an element of B. In other words, B contains all of the elements of A. Let U = {1, 2, 3,..., 8}, R = {1, 2, 5, 6}, and S = {2, 4, 5, 7, 8} This is denoted A ⊆ B. Of the sets R, S, and T shown in the below, which are subsets? What is: R0, the complement of R ?

What is: S0, the complement of S ? R What is: U 0, the complement of U ? T What is: ∅0, the complement of ∅ ? S

Subsets Set Equality and Proper Subsets

Suppose U = {1, 2, 3,..., 8}, R = {1, 2, 5, 6}, S = {2, 4, 5, 7, 8}, and T = {2, 6}

What element(s) are in the where all the sets overlap? Another definition for set equality: Sets A and B are equal if and only if: What element(s) are in the area outside all the sets? 1. A ⊆ B and 2. B ⊆ A

R

T Proper Subset: A ⊂ B if A ⊆ B and A 6= B S

Is or Is Not a Subset? Notes

Is the left set a subset of the set on the right?

{a, b, c} {a, c, d, f}

{a, b, c} {c, a, b} Any set is a subset of itself {a, b, c} {a, b, c}

{a} {a, b, c} Any set is a subset of the universal set

{a, c} {a, b, c, d} The empty set is a subset of every set including itself

{a, c} {a, b, d, e, f}

X X

∅ {a, b, c}

∅ ∅ ⊂ {∅} 6⊆ {∅, {a}} ⊂ 6⊆ {∅, {a}, {b}, {a, b}} = {∅, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}} 6⊆ 6⊆ 1, 2, 4, 8, 16, 32, 64,..., 2n,...

Set Equality Cardinality of the

Power Set: (A) is the set of all possible subsets of the set A Is the left set equal to, a proper subset of, or not a subset of P the set on the right? For example, if A = {0, 1}, then P(A) = {∅, {0}, {1}, {0, 1}}

Find the following power sets and determine their cardinality. {1, 2, 3} I P(∅) = {a, b} {a} P({a}) = {a} {a, b} {a, b, c} {a, d, e, g} P({a, b}) = {a, b, c} {a, a, c, b, c} P({a, b, c}) = {∅} {a, b, c} Is there a pattern? {∅} {}

Another Method for Generating Power Sets Set Operations

A diagram can be used to generate P(A). Each element of the set is either in a particular subset, or it’s not. The intersection of two sets, A ∩ B, is the set of elements common to both: A ∩ B = {x|x ∈ A and x ∈ B}. ∅ In other words, for an object to be in A ∩ B it must be a member of both A and B. ∅ {a}

A ∅ {b} {a} {a, b}

∅ {c} {b} {b, c} {a} {a, c} {a, b} {a, b, c} B

The number of subsets of a set with cardinality n is 2n The number of proper subsets is 2n − 1 (Why?)

Find the Following

{a, b, c} ∩ {b, f, g} = Disjoint sets: two sets which have no elements in common. {a, b, c} ∩ {a, b, c} = I.e., their intersection is empty: A ∩ B = ∅ For any A, A ∩ A =

{a, b, c} ∩ {a, b, z} =

{a, b, c} ∩ {x, y, z} = A {a, b, c} ∩ ∅ =

For any A, A ∩ ∅ = B

For any A, A ∩ U =

For any A ⊆ B, A ∩ B = {1, 3, 5}

{1, 2, 3, 4, 6} {6}

{2, 4}

A = {1, 2, 3, 4}

U = {1, 2, 3, 4, 5, 6, 9}

Are the Following Sets Disjoint? Set

The union of two sets, A ∪ B, is the set of elements belonging to { a, b, c } and { d, e, f, g } either of the sets: A ∪ B = {x|x ∈ A or x ∈ B}

{ a, b, c } and { a, b, c } In other words, for an object to be in A ∪ B it must be a member of either A or B. { a, b, c } and { a, b, z }

{ a, b, c } and { x, y, z }

{ a, b, c } and ∅ A

For any A, A and ∅

For any A, A and A0 B

Find the Following Unions Set Difference

{ a, b, c } ∪ { b, f, g } = The difference of two sets, A − B, is the set of elements belonging to set A and not to set B: A − B = {x|x ∈ A and x∈ / B} { a, b, c } ∪ { a, b, c } =

For any A, A ∪ A =

{ a, b, c } ∪ { a, b, z } = A

{ a, b, c } ∪ { x, y, z } =

{ a, b, c } ∪ ∅ = B

For any A, A ∪ ∅ =

For any A, A ∪ U = Note: x∈ / B means x ∈ B0 For any A ⊆ B, A ∪ B = Thus, A − B = {x|x ∈ A and x ∈ B0} = A ∩ B0

Set Difference Example Given the sets: U = {1, 2, 3, 4, 5, 6, 9} A = {1, 2, 3, 4} B = {2, 4, 6} {1, 2, 3, 4, 5} − {2, 4, 6} = C = {1, 3, 6, 9}

Find each of these sets: A ∪ B = {2, 4, 6} − {1, 2, 3, 4, 5} =

A ∩ B =

Note, in general, A − B 6= B − A A ∩ U =

A ∪ U = Not in A or not in B

{5, 6, 9} Not in A and not in B

{6}

In A and either in B or in C (or both) {5, 6, 9, 2, 4}

{1, 2, 3, 4, 6, 9} In B and either not in A or in C

{1, 4, 5}

{1, 4, 5, 2, 6}

Given the sets: Describe the Following Sets in Words U = {1, 2, 3, 4, 5, 6, 9} A = {1, 2, 3, 4} B = {2, 4, 6} A0 ∪ B0 = C = {1, 3, 6, 9} Find each of these sets: A0 = A0 ∩ B0 =

A0 ∩ B =

A ∩ (B ∪ C) = A0 ∪ B =

A ∪ B ∪ C = (A0 ∪ C) ∩ B =

A ∩ B ∩ C =

Set Operations

Given the sets: Finding intersections, unions, differences, and complements of sets U = {1, 2, 3, 4, 5, 6, 7} are examples of set operations A = {1, 2, 3, 4, 5, 6} B = {2, 3, 6} An is a rule or procedure by which one or more objects C = {3, 5, 7} are used to obtain another object (usually a set or number). Common Set Operations Find each set: Let A and B be any sets, with U the universal set. A − B = The complement of A is: A0 = {x|x ∈ U and x∈ / A}

A0 B − A = A (A − B) ∪ C0 =

Set Intersection and Union Set Difference

The intersection of A and B is: A ∩ B = {x|x ∈ A and x ∈ B}

The difference of A and B is: A − B = {x|x ∈ A and x∈ / B} A

A B

The union of A and B is: A ∪ B = {x|x ∈ A or x ∈ B} B

A

B r, s, i t, v x

q, u, w, y, z

We get the same region. (A ∩ B)0 = A0 ∪ B0

The set of all 2120 students All 2120 students that own a car or a truck All 2120 students that own a car and a truck

10 23 + 10 + 17 = 50 = 33 + 27 − 10

97 + 101 = 198

Suppose U = {q, r, s, t, u, v, w, x, y, z}, 0 0 A = {r, s, t, i, v}, Shade the Diagram for: A ∩ B ∩ C and B = {t, v, x}

Complete the Venn Diagram to represent U, A, and B A B

A

C B

Shade the Diagram for: (A ∩ B)0 De Morgan’s Laws

De Morgan’s Laws: For any sets A and B A (A ∩ B)0 = A0 ∪ B0 (A ∪ B)0 = A0 ∩ B0 B Using A, B, C, ∩, ∪, −, and 0, give a symbolic description of the shaded area in each of the following diagrams. Is there more than one way to describe each? Shade the Diagram for: A0 ∪ B0

A A B A B

B

C C

Cardinal Numbers & Surveys Counting via Venn Diagrams

Suppose, U = The set of all students at EIU Suppose, A = The set of all male 2120 students U = The set of all students at EIU B = The set of all female 2120 students A = The set of all 2120 students that own a car A ∪ B = B = The set of all 2120 students that own a truck Now suppose, A ∪ B = n(A) = 97 A ∩ B = n(B) = 101

Now suppose, n(A) = 33 A A n(B) = 27 97 101 n(A ∩ B) = 10 B n(A ∪ B) = B

n(A ∪ B) = 50 20 10 50 + 20 − 10 = 60

3 5 2 12

3 2 10

Inclusion/Exclusion Principle Back to Counting with Venn Diagrams

For any two finite sets A and B: n(A ∪ B) = n(A) + n(B) − n(A ∩ B) A B 10 3 2 In other words, the number of elements in the union of two sets is 1 the sum of the number of elements in each of the sets minus the 4 0 number of elements in their intersection. 2 How many integers between 1 and 100 are divisible by 2 or 5? C 5 Let, A = {n | 1 ≤ n ≤ 100 and n is divisible by 2} Find the cardinality of the sets: B = {n | 1 ≤ n ≤ 100 and n is divisible by 5} A (A ∪ B) ∩ C n(A) = 0 n(B) = B A n(A ∩ B) = A ∩ B ∩ C0 C − B n(A ∪ B) = A ∪ B (A ∪ B) ∩ C0

Venn Diagram for 2 Sets Venn Diagram for 3 Sets

There are eight disjoint regions There are four disjoint regions I: A ∩ B0 ∩ C0 II: A ∩ B ∩ C0 I: A ∩ B0 III: A0 ∩ B ∩ C0 II: A ∩ B I III IV: A ∩ B0 ∩ C I II II III: A0 ∩ B III V: A ∩ B ∩ C V IV: A0 ∩ B0 IV VI VI: A0 ∩ B ∩ C

IV 0 0 VII VII: A ∩ B ∩ C VIII VIII: A0 ∩ B0 ∩ C0

Technique for Counting with Venn Diagrams Using Venn Diagrams to Display Survey Data

Kim is a fan of the of Paul Simon and Art Garfunkel. In her collection of 22 CDs, she has the following: Designate the universal set 5 on which both Simon and Garfunkel sing 8 total on which Simon sings 7 total on which Garfunkel sings Describe the sets of interest 12 on which neither Simon nor Garfunkel sings

Draw a general Venn diagram

S Relate known information to the sizes of the disjoint regions G of the diagram

Infer the sizes of any remaining regions 1. How many of her CDs feature only Paul Simon? 2. How many of her CDs feature only Art Garfunkel? 3. How many feature at least one of these two artists? Yes Yes Yes Yes Yes Maybe Yes Maybe Maybe Yes Maybe Yes No Yes Yes No Yes No No No No Maybe No Yes

1 9 2 12 6 3 10 8

51 31 18 15 33 23

17 3 13

11 14 9 23

9

Totals to 99 not 100

Love, Prison, and Trucks

Number Love? Prison? Trucks? There is the cliche that Country–Western songs emphasize three basic themes: love, prison, and trucks. A survey of the local 12 Country–Western radio station produced the following data of 13 songs about: 28 12 truck drivers in love while in prison 13 prisoners in love 18 28 people in love 3 18 truck drivers in love 3 truck drivers in prison who are not in love 2 2 prisoners not in love and not driving trucks 8 8 people who are out of prison, are not in love, and do not drive trucks 16 16 truck drivers who are not in prison

Catching Errors

L P Jim Donahue was a section chief for an electric utility company. The employees in his section cut down tall trees (T ), climbed (P ), and spliced wire (W ). Donahue submitted the following report to the his manager:

T n(T ) = 45 n(P ∩ W ) = 20 n(P ) = 50 n(T ∩ W ) = 25

How many songs were. . . n(W ) = 57 n(T ∩ P ∩ W ) = 11 0 0 0 1. Surveyed? n(T ∩ P ) = 28 n(T ∩ P ∩ W ) = 9 2. About truck drivers? 3. About prisoners? 4. About truck drivers in prison? Donahue also stated that 100 employees were included in the 5. About people not in prison? 6. About people not in love? report. Why did management reassign him to a new section?

n(T ) = 45 n(P ∩ W ) = 20 n(P ) = 50 n(T ∩ W ) = 25 n(W ) = 57 n(T ∩ P ∩ W ) = 11 Jim Donahue was reassigned to the home economics department of n(T ∩ P ) = 28 n(T 0 ∩ P 0 ∩ W 0) = 9 the electric utility company. he interviewed 140 people in a suburban shopping to find out some of their cooking habits. He obtained the following results. There is a job opening in Siberia. Should he be reassigned yet again? 58 use microwave ovens T P 63 use electric ranges 58 use gas ranges 19 use microwave ovens and electric ranges 17 use microwave ovens and gas ranges 4 use both gas and electric ranges 1 uses all three W 2 cook only with solar energy 18 23 38

1 16 3 41

2

Totals to 142 not 140

15 35 35

80 30 10 10

10

225 3 ∗ 2 = 6 ways

2 ways 2 ways 2 ways 2 ∗ 2 ∗ 2 = 23 = 8 ways

Student Values

Julie Ward, who sells college textbooks, interviewed freshmen on a community college campus to determine what is important to M E today’s students. She found that Wealth, Family, and Expertise topped the list. Her findings can be summarized as:

n(W) = 160 n(E ∩ F) = 90 n(F) = 140 n(W ∩ F ∩ E) = 80 0 G n(E) = 130 n(E ) = 95 n(W ∩ F) = 95 n[(W ∪ F ∪ E)0] = 10

How many students were interviewed?

Counting Principles

W F A B C

We have three choices from A to B and two choices from B to C. E

How many ways are there to get from A to C through B? How many students were interviewed?

Multiplication Principle Examples

If k operations (events, actions,...) are performed in succession where:

Operation 1 can be done in n1 ways Operation 2 can be done in n2 ways How many outcomes can there be from three flips of a coin? . . Action 1: Flip a coin Operation k can be done in nk ways Action 2: Flip a coin Action 3: Flip a coin then the total number of ways the k operations can all be Total performed is: n1 ∗ n2 ∗ n3 ∗ · · · ∗ nk

In other words, if you have several actions to do and you must do them all you multiply the number of choices to find the total number of choices. 26 ways 26 ways 26 ways 25 ways 26 ways 24 ways 26 ∗ 26 ∗ 26 = 263 = 17576 ways 26 ∗ 25 ∗ 24 = 15600 ways

263 ways 103 ways 263 ∗ 103 = 17, 576, 000 ways

How many ways are there to form a three letter from the How many ways are there to form a three letter sequence from the letters in {A, B, C, . . . , Z}? letters in {A, B, C, . . . , Z} without repeating any letter?

Action 1: Pick a letter Action 1: Pick a letter Action 2: Pick a letter Action 2: Pick an unused letter Action 3: Pick a letter Action 3: Pick an unused letter Total Total

Counting with Trees

Tree diagrams consist of nodes (the circles) and branches that connect some nodes. How many ways are there to form a license plate that starts with three uppercase letters and end with 3 digits (0–9)?

Action 1: Pick 3 letters Action 2: Pick 3 digits Total

The nodes represent the possible “states” of a situation. Branches are the ways or “choices” we have to move to another state. The “top” node is called the root and it represents the starting state. Leaves, nodes with no other nodes under them, represent an ending state.

Counting with Trees Examples

How many outcomes can there be from three flips of a coin?

start

This leads to the following technique: Use a tree diagram to illustrate a situation H T Count the number of leaves to find the number of possible outcomes HH HT TH TT

HHH HHT HTH HTT THH THT TTH TTT

8 outcomes n(A) + n(B)

26 = 64 choices 6 choices 29 = 512 choices 9 choices 64 + 512 = 576 choices 6 + 9 = 15 choices

Addition Principle

How many ways can a best of three Chess end. Must have a If A ∩ B = ∅, then n(A ∪ B) = . majority to be declared victor. If we are to perform one of k operations (events, actions,...) where: start Operation 1 can be done in n1 ways 1 2 T Operation 2 can be done in n2 ways . 11 12 1T 22 21 2T TT T1 T2 . Operation k can be done in nk ways 1T1 1T2 1TT 2T1 2T2 2TT T21 T22 T2T then the total number of choices is: 121 122 12T 211 212 21T T11 T12 T1T

n1 + n2 + n3 + ··· + nk

21 outcomes In other words, if you have several actions to do and you are only going to do one of them you add the number of choices to find the total number of choices.

Examples

You are hungry and want to order a pizza from either Pizza Place or Pizza Hog. Pizza Place has 6 different toppings and Pizza Hog You are hungry and want to order a combo meal from either Taco has 9. Topping can either be on or off of a pizza. How many Hut or Burger Lord. Taco Hut has 6 different combo meals and choices to you have? Burger Lord has 9. How many choices to you have?

Action 1: Order a pizza from Pizza Place Action 1: Order a combo from Taco Hut Action 2: Order a pizza from Pizza Hog Action 2: Order a combo from Burger Lord Total Total