MODULE 4 - Language of Sets

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

LANGUAGE OF SETS

Introduction
Objectives: Language serves as a tool for
teaching mathematical concepts. It
 Identify and discuss the basic
can show how to make syntax and
concepts in mathematical
structure of mathematical language
language.
clear and explicit to understand the
 Familiarize the concepts on
fundamental mathematical concepts.
language of sets.
Language serves as a major
 Perform operations on sets
pedagogical tool to undertand how,
what, and why things are said.

SET THEORY is the branch of mathematics that studies sets or


mathematical science of the infinite. The study of sets has become a
fundamental theory in mathematics in 1870s which was introduced by Georg
Cantor (1845 – 1918), a German mathematician.
A SET is well – defined collection of objects; the objects are called the
elements or members of the set. The symbol ∈ is used to denote that an object
is an element of a set.
2 Ways to Represent a Set
1. Roster Method – the elemets of the set are enumerated and separated
by a comma. It is also called as tabulation method.
Examples:
a. A = { 1,2,3,4,5,6,7,8,9}
b. B = { d, i, r, t}

2. Rule Method – used to describe the elements or members. It is also


called set builder notation, symbol is written { x| P(x)}.
Examples:
a. C = { x|x is a positive integer less than 10}
b. D = { x|x is a letter in the word dirt}
Finite Set – set whose elements are limited or countable
Infinite Set – set whose elements are unlimited and uncountable and the, and
the last element cannot be specified.
Unit Set – set with only one element. It is also called as singleton.
Empty Set – unique set with no elements. It is also called as null set denoted by
the symbol { } or Ø.
Universal Set – all sets under investigation denoted by U.

The cardinal number of set is the number of elements or members in the


set. The cardinality of set A is denoted by n(A). For example, the given set A =
{a,e,i,o,u}, the cardinality of A is 5 or n(A) = 5.
If A and B are sets, A is called subset of B, written A ⊆ B, if and only if
every element of A is also an element of B. Symbolically, A ⊆ B ⇔ ∀x , x ∈ A → x
∈ B. A is a proper subset of B, written A ⊂ B, if and only if, every element of A is
in B but there is at leat one element of B that is not in A. On the contrary, the
symbol ⊄ denotes that it is not a proper subset.
A equals B, wrtitten A = B, if and only if, every element in A is in B and
every element in B is in A. Symbolically: A = B ⇔ (A ⊆ B) ^ (B ⊆ A).
Examples:
a. Suppose A = {c,d,e}, B = {a,b,c,d,e} and U = {a,b,c,d,e,f,g}, then A ⊆ B
since all elements of A is in B.
b. Suppose A = {c,d,e}, B = {a,b,c,d,e} , C = { a,e,c,b,d} and U =
{a,b,c,d,e,f,g}, then A and C are both subsets of B; but A ⊂ B, whereas
C ⊄ B.
c. Suppose A = {c,d,e}, B = {a,b,d,e,c} and U = {a,b,c,d,e,f,g},the A ⊆ B and
B ⊆ A, therefore A = B.
Given a set S from the universal set U, the power set of S denoted by P(S),
is the collection (or sets) of all subsets of S. The power set of A = {e,f} is P(S) = 2n
= 22 = 4, thus P(A) has 4 elements namely A= {e,f} , thepower set of A is
P(A) = { {e}, {f}, {e,f}, Ø }.
Operations on Sets
The union of A and B, denoted by A ⋃ B, is the set of all x in U such that x
is in A or x is in B. Symbolically A ⋃ B = { x|x ∈ A v x ∈ B}.
The intersection of A and B, denoted by A ⋂ B, is the set of all x in U such
that x is in A and x is in B. Symbolically A ⋂ B = { x|x ∈ A ^ x ∈ B}.
For example: A= {a,b,c} , B = {c,d,e} and U = {a,b,c,d,e,f,g}, then A ⋃ B = {a,b,c,d,e}
and A⋂ B = {c}.
The complement of A (or absolute complement of A) denoted by A’, is
the set of all elements x in U such that x is not in A. Symbolically A’ = { x ∈ U |x
∈ A}. For example: A = {a,b,c,d,e} and U = {a,b,c,d,e,f,g}, then A’ = {f,g}.
The difference of A and B (or relative complement) of B with respect to
A), denoted by A ~ B, is the set of all elements x in U such that x is in A and x is
not in B. Symbolically: A ~ B = { x|x ∈ A ^ x ∉ B} = A ⋂ B’.
For example: Let A and B be subsets of the universal set U. A = {a,b,c} and B =
{c,d,e} and U = {a,b,c,d,e,f,g} then A ~ B = {a,b}
If set A and B are two sets, their symmetric difference as the set consisting
of all elements that belong to A or to B, but not to both A and B, denoted by
A⊕B. Symbolically: A⊕B ={x|x ∈ (A⋃B) ˄ x ∉ (A⋂B)} = (A⋃B) ⋂ (A⋂B)’ or
((A⋂B) ~ (A⋂B).
For example, A={a,b,c} and B={c, d, e} and U= {a,b,c,d,e,f,g} then A⊕B = {a,b,d,e}.
Two set are called disjoint (or non-intersecting) if and only if, they have
no elements in common. Symbolically: A and B are disjoint ⇔ A⋂B = Ø. Let A
and B be subsets of a universal set U. For example, A = {a, b, c} and B = {d, e}.
Since A⋂B = Ø, therefore A and B are disjoint sets.
In the ordered pair (a,b), a is called the first component and b is called the
second component. In general, (a,b) ≠ (b,a). For example, (2, 5) = (9-7, 2+3) while
(2, 5) ≠ (5 ,2).
The Cartesian product of sets A and B, written AxB, is AxB= {(a, b) | a ∈ A
and b ∈ B}. For example, A = (2, 3, 5) and B = (7, 8). In able to get A x B, we pair
each element of A with each element of B. The results as ordered pairs, with
each element of A written first and the element of B written second such as A x
B ={(2,7), (2,8), (3,7), (3,8), (5,7), (5,8)}.
Activity:
1. Indicate which of the following verbal descriptions defines a set.
a. The list of course offerings in BUTC.
b. The elected councilors in Tabaco City
c. The collection of intelligent monkeys in Albay Wildlife park.

2. List the elements of the following sets.


a. A = { x|x is a letter in the word mathematics }
b. B = { x|x is a positive integer, 3 < x < 8 }
c. C = { x|x = 2n + 3, n is a positive integer }

3. Give examples of a finite set, infinite set, unit set and empty set.

4. Given U = { x|x is the set of letters in then English alphabet };


A = { a, e, i, o, u } ; B = { x|x is the set of consonant letters} and
C = { a, b, c, d, e }. Tell whether the statement is TRUE of FALSE.
a. B ⊂ U
b. C ⊄ B
c. B = A
d. A ⊆ B

5. Determine the cardinal number of A = { x| 0 < x < 4, x ∈ positive integer}.

6. Given U = { x|x is the set of letters in the English alphabet}, B = { x/x is the
set of vowel letters}, C = {x|x is the set of consonant letters}, C ={a,b,c,d,e}.
Determine the following.
a. A ⋃ B
b. A ⋂ B
c. A ~ C
d. B’
e. A ⊕ C
f. B ⋂ C

You might also like