Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 41

0

0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

You belong with


me! 1
2
4
Which does not belong to the
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1 group?

1
2
4
Which does not belong to the
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1 group?

1
2
4
Which does not belong to the
group?
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
4
SETS AND VENN
DIAGRAM

1
2
4
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

Prepared by:
Precious Kim P. Sambo
Learning Objectives
At the end of the lesson, the learners should be able
0
0
1100101010 1
101 0001010
0 1
011
to:
a. Define and illustrate sets;

1
2
b. Differentiate universal sets, subsets, empty sets,

4
equal sets, and equivalent sets;
c. Perform operations of sets: union and intersection
of sets; and
d. Illustrate relationships of sets using Venn
diagrams.
What is Set?
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

• A set is a collection of

2
objects.
1
4
• Objects in the collection are
called elements of the set.
0
0
1
1
00
1
0
1
01
0
1
1
0The collection of counting
1
0
0
0
10
1
0
01
0
1
1
numbers is a set.

1
2
4
The collection of pencils in your
briefcase is a set.
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

Reminders!
1
2
4
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

Sets can be defined in two


ways:
1
2
4
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

2
Roster Method
1
4
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

 The Roster Method of

2
specifying a set consists of

1
surrounding the collection of

4
elements with braces.
Example
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

The set of counting numbers from 1 to 5

1
2
would be written as:

{1, 2, 3, 4, 5}

4
Examples
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1
{1, 3, 5, 7, … , 9007}
is the set of odd counting numbers less

1
2
than or equal to 9007.

4
{1, 2, 3, … }
is the set of all counting
numbers.
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

Rule Method
1
2
4
 The Rule Method (Set builder)
notation has the general form
0
0
1
10
010
10
101
1
010
00
1 0
1
00
101
1

1
2
4
{variable | descriptive statement }.
Examples

{x | x < 6 and x is a counting number}


0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

{1,2,3,4,5}

1
2
{x | x is an odd number less than 10}

4
{1,3,5,7,9}
{x | x is a day in a week that starts
with T}
{Tuesday, Thursday}
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

2
Different kinds of Set
1
4
Universal Set and Subsets
The Universal Set denoted by U is the set
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1
of all possible elements used in a problem.

2
When every element of one set is also an

1
element of another set, we say the first

4
set is a SUBSET

Example A={1, 2, 3, 4, 5} and B={2, 3}


The notation we use isB A.
The Empty Set
The empty set is a special set. It contains no
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

elements. It is usually denoted as { } or  .

1
2
The empty set is always considered a

4
subset of any set.

• Is this set {0} empty?


Equivalent Set
If the number of elements is the same for
0
0
1
10
01010
1011
010
001
010010
11
two different sets, then they are called
equivalent sets.

1
2
The order of sets does not matter here.

4
It is represented as:
 n(A) = n(B)
where A and B are two different sets with
same number of elements.

Example: If A = {1,2,3,4} and B = {Red, Blue, Green, Black}


Equal Set
The two sets A and B are said to be equal
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

if they have exactly the same elements.

1
2
4
The order of elements do not matter.

It is represented as:
 A=B

Example: A = {1,2,3,4} and B = {4,3,2,1}


Union of sets
0
0
1
1
0The elements of the union are in A or in B
0
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1
or in both. If elements are in both sets, we
do not repeat them.

1
2
The union of two sets A, B is denoted by

4
A U B.

Example A={1, 3, 5, 7, 9} and B={1, 2, 3, 4, 5}


A U B = {1, 2, 3, 4, 5, 7, 9}.
Intersection of sets
When an element of a set belongs to two or
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1
more sets we say the sets will intersect.

1
2
The intersection of a set A and a set B is

4
denoted by A ∩ B.

Example A={1, 3, 5, 7, 9} and B={1, 2, 3, 4, 5}


A ∩ B = {1, 3, 5}
Complement of a Set
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

The complement of set A is denoted by A’


or by AC.

1
2
4
Example U={1,2,3,4,5}, A={1,2}
A’ = {3,4,5}
2
Venn Diagram
1
4
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1
Venn Diagrams
0
0
1
1
0Were conceived in 1880 by John Venn
0
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

It show all possible relations between a

1
2
finite collection of sets, as well as logical

4
relationships.

To draw a Venn diagram, you have to draw a


triangle (represents a universe) and a circle/s
(represents a distinct objects or elements).

Example: A = {1,2,3,4} and B = {4,3,2,1}


Use the Venn diagram to determine
each of the following sets:
a. U
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1 U = { , ∆ , $, M, 5}
b. A A = { , ∆}

1
2
c. The set of elements
{$, M, 5}

4
in U that are not in
A.
Using the numbers 0, 1, 2, … , 9
illustrate the sets: and
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
Solution: Use a Venn diagram

4
Using the numbers 0, 1, 2, … , 9 illustrate
the sets: and
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

4
1
2
A

4 is in BOTH sides
4 B
Using the numbers 0, 1, 2, … , 9 illustrate
the sets: and
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

2
7
4
1
4
9
A B

7 and 9 are only in set A


Using the numbers 0, 1, 2, … , 9 illustrate
the sets: and
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

2
7
4 2
1
4
3
9
A 5 B

1, 2, 3 and 5 are only in set B


Using the numbers 0, 1, 2, … , 9 illustrate
the sets: and
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

0
1

2
7
4 2
1 6

4
3
9
8 A 5 B

0, 6 and 8 are not in A or B


Intersection: Members of both set A and set B

0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
A

4 B
Union: Members of set A or set B or both

0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
A

4 B
Complementary: Members not in the set

0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

2
A

1
A’
4
Universal Set: All members

0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
U
4
Subset: All members of set A are in set B

0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
4
A
B
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
The End
4
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
4
0
0
1
1
00
1
0
1
01
0
1
1
01
0
0
0
10
1
0
01
0
1
1

1
2
4

You might also like