Scribd
Upload
8 views21 pages

MS 121 Set Theory

The document provides an overview of Discrete Mathematics, focusing on set theory, including definitions, methods of defining sets, and operations on sets such as union, intersection, and Cartesian products. It also discusses special sets like universal sets, null sets, and subsets, along with examples and terminologies. Additionally, it includes a practical application through a survey example to illustrate the use of Venn diagrams in analyzing purchasing behavior.

Uploaded by

Abegail Tacogue
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views21 pages

MS 121 Set Theory

The document provides an overview of Discrete Mathematics, focusing on set theory, including definitions, methods of defining sets, and operations on sets such as union, intersection, and Cartesian products. It also discusses special sets like universal sets, null sets, and subsets, along with examples and terminologies. Additionally, it includes a practical application through a survey example to illustrate the use of Venn diagrams in analyzing purchasing behavior.

Uploaded by

Abegail Tacogue
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

MS 121 – Discrete Mathematics

Module 1: Introduction and Sets


Importance of Discrete Mathematics

Discrete Mathematics is a branch of mathematics


dealing with discrete elements that use distinct
values. It is essential for computer science,
engineering, mathematics, and related fields
Key topics covered in the course

- Set Theory
- Logic Theory
- Number Theory
- Graph Theory
Terminologies on Sets

SET – is an collection of unordered objects.


The objects which belong to a set are called elements
of the set.
Ways of defining a set:
1. Enumeration Method / Roster Method
A = {1, 3, 5, 7, 9}

2. Descriptive Property Method


A = {x| x is a positive odd integer less than 10}
Ways of Defining a Set

1. Enumeration Method
A = {1, 3, 5, 7, 9}
A is a set consisting of the elements 1, 3, 5, 7, and 9

2. Descriptive Property Method / Set Builder Notation


A = {x|x is a positive odd integer less than 10}
A is a set consisting of all elements x such that x is a positive odd
integer less than 10.
Note:

• n(A) = 5 reads as the number of elements contained in set A is 5


• 1 ∈ A reads as 1 is an element of Set A; or 1 is a member of Set A
• 2 ∉ A reads as 2 is not an element of Set A; or 2 is not a member of Set A

Example:
G = {1, 2, 3, …, 10} values in the … are 4, 5, 6, 7, 8, 9
H = {-6, -4, -2, …, 20} values in the … are 0, 2, 4, 6, 8, 10, 12, 14, 16, 18
1. Enumeration Method
A = {1, 3, 5, 7, 9}
B = {a, e, i, o, u}
C = {Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday}

2. Descriptive Property Method


A = {x|x is a positive odd integer less than 10}
D = {b|when a=2, a + 3b = -7}
E = {x|x2 – 3x + 2 = 0}
F = {x|(x-1)(x-2)(x-3)=0}
SPECIAL SETS
• Universal Set
– is the set which contains all possible elements within a particular
application under consideration.
- denoted as U or U

Example:
A survey is conducted on the DNSC students on how they perceived
the use of the DNSC-LMS, then the universal set will consists of all DNSC
students.
But if the survey is about the DNSC BSIT students on how they
perceived the use of the DNSC-LMS, then the universal set will consists of
all BSIT students in DNSC only.
Complement of a set
– in the set which consists of all elements in the universal set that are
not members of the set itself.
- denoted by S’

Example: if U = {1, 2, 3, 4, 5, 6, 7, 8, 9,10} and A = {1, 3, 5, 7, 9} then A’ =


{2, 4, 6, 8, 10}
Null set
– in the set which consists of no elements.
- denoted by ∅

Subset
- A is a subset of set B if and only if every member of set A is also an
element of set B.
- denoted by A  B which reads as A is a subset of B

Example:
A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} In this case, is A  B? NO
B = {1, 3, 5, 7, 9} But it is the case that B  A
Subset
- A is a subset of set B if and only if every member of set A is
also an element of set B.
- denoted by A  B which reads as A is a subset of B

Example:
A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
B = {1, 3, 5, 7, 9}
C = {x|x is an integer}
D = {z|z – 1 = 4}

Answers:
A  C, B  C, D  C, B  A, D  A, D  B
OPERATIONS ON SETS

Set Equality
- Two sets are equal if and only if every element of A is an
element of B and every element of B is an element of A
- denoted by A = B
Example:
A = {1, 2} C = {1, 2, 3}
B = {x|(x-1)(x-2)(x-3)=0} D = {x|x2 - 3x + 2 = 0)

Answer: A = D and B = C
OPERATIONS ON SETS
Union of Sets
- The union of two sets A and B is a set which consists of all
elements contained in either set A or set B of both A and B.
- denoted by A ∪ B

Example: Given the following sets:


A = {1, 2, 3, a, b}; B = {1, 3, 7, 9, b}; C = {2, 6, 8, a, c}
Solve for
A ∪ B = {1, 2, 3, 7, 9, a, b}
A ∪ C = {1, 2, 3, 6, 8, a, b, c}
B ∪ C = {1, 2, 3, 6, 7, 8, 9, a, b, c}
A ∪ B ∪ C = {1, 2, 3, 6, 7, 8, 9, a, b, c}
OPERATIONS ON SETS
Intersection of Sets
- The intersection of two sets A and B is a set which consists of
all elements which belong to both A and B.
- denoted by A ∩ B

Example: Given the following sets:


A = {1, 2, 3, a, b}; B = {1, 3, 7, 9, b}; C = {2, 6, 8, a, c}
Solve for
A ∩ B = {1, 3, b}
A ∩ C = {2, a}
B∩C=∅
A∩B∩ C=∅
OPERATIONS ON SETS
Difference of Sets
- Let A and B be sets. The difference of A and B, denoted by A − B, is
the set containing those elements that are in A but not in B.
- The difference of A and B is also called the complement of B with
respect to A.

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


Solve for a.) A – B and b.) B – A
Solution:
A – B = {5}
B – A = {2}
OPERATIONS ON SETS
Cartesian Product
- Let A and B be sets. The Cartesian product of A and B, is the set of all
ordered pairs (a, b), where a ∈ A and b ∈ B. Hence, A × B = {(a, b) | a ∈ A ∧ b
∈ B}.
- denoted by A × B

What is the Cartesian product of A = {1, 2} and B = {a, b, c}?


Solution: The Cartesian product A × B is

A × B = {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c)}

Solve for B × A
B × A = {(a, 1), (a, 2), (b, 1), (b, 2), (c, 1), (c, 2)}
OPERATIONS ON SETS

Power Set
- Given a set S, the power set of S is the set of all subsets of the set S.
- denoted by P(S).

Example: Given A = {0, 1, 2}, solve for P(A).

P(A) = {∅, {0}, {1}, {2}, {0, 1}, {0, 2}, {1, 2}, {0, 1, 2}}
VENN DIAGRAM
- Sets can be represented graphically using Venn diagrams,
named after the English mathematician John Venn, who
introduced their use in 1881.
- In Venn diagrams the universal set U, which contains all the
objects under consideration, is represented by a rectangle.
- Inside this rectangle, circles are used to represent sets.
A survey of 1,500 was conducted to determine their purchasing behavior
regarding two leading soft drinks. It was found out that during the past
month 600 had purchased brand A, 400 had purchased brand B, and 150
had purchased both brand A and brand B.

a.) Construct a Venn diagram summarizing the results of the survey.


b.) How many respondents purchased brand A only?
c.) How many respondents purchased brand B only?
d.) How many purchased neither brand A nor brand B?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy