Scribd
Upload
47 views2 pages

Chapter 2.2.1 Sets

This document defines and provides examples of sets, including: - A set is a well-defined collection of distinct objects called elements. - Sets can be represented using a roster method that lists elements or a rule method that describes inclusion criteria. - Sets can be finite if their elements can be counted, or infinite if elements are unlimited. - The power set of a set is the set of all its subsets.

Uploaded by

Aira Cordero
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views2 pages

Chapter 2.2.1 Sets

This document defines and provides examples of sets, including: - A set is a well-defined collection of distinct objects called elements. - Sets can be represented using a roster method that lists elements or a rule method that describes inclusion criteria. - Sets can be finite if their elements can be counted, or infinite if elements are unlimited. - The power set of a set is the set of all its subsets.

Uploaded by

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

Chapter 2.

2 Sets

The foundation of mathematics starts with the basic understanding of the idea of sets which was introduced
by George Cantor (1845-1918). A set must be well defined; i.e., for any given object, it must be clear whether
or not the object is an element of the set. Objects in sets can be anything. It can be people, physical objects,
numbers, signs, other sets, etc.

If a set contains all the chairs in a designated room, then any chair can be determined either to be in or not in
the set. If there were no chairs in the room, the set would be called the empty { }, or null ϕ set, i.e., one
containing no elements. A set is usually designated by a capital letter.

Roster Method (Tabular Form) is a method where the set is represented by listing all its elements. Two
distinct elements are separated by a comma, and braces { } are used to enclose the listed elements of a
set. If A is the set of even numbers between 1 and 9, then A = {2, 4, 6, 8}.

The elements of a set may be described without actually being listed; this is the Rule method. We
indicate a set by enclosing in braces a descriptive phrase, and agreeing that those objects, and only
those, which have the described property are elements of the set. If B is the set of real numbers that are
solutions of the equation x2 = 9, then the set can be written as B = { x |x2 = 9}, which is read "B is the set
of all x such that x2 = 9"; hence B is the set {3, − 3}.

Activity 2.2a. Give the corresponding Roster form or Set Builder notations of the given sets in below.
1. B = { x|x is a color of the rainbow }
2. C = {tm, globe, sun, tnt, smart,}
3. D = {2, 4, 6, 8, 10, …}
4. E = { x|x is a prime number less than 20}

FINITE AND INFINITE SETS


Membership in a set is indicated by the symbol ∈ and non-membership by ∉; thus, x ∈ A means that element
x is a member of the set A (read simply as " x is an element of A ") and y ∉ A means y is not an element of A.
If it is possible to list down all the members or elements of a given set, then the set is said to be finite.
Otherwise, the set is said to be infinite. A set which has no element is said to be an empty set. This is
sometimes called the null or void set and is denoted by 𝜙. or { }

Finite Sets (Elements are limited or can be counted)


1. Let A be the set of counting numbers from 1 to 7. Then A = {1, 2, 3, 4, 5, 6, 7} in Tabular or Roster method
and A = { x |x are counting number from 1 to 7} in Rule Method. We can say that 5 ∈ A, 0 ∉ A, & 0.5 ∉ A

Infinite Sets (Elements are infinitely many)


1. Let C be the set of integers. Then C = {… , −3, −2, −1, 0, 1, 2, 3, … } in Tabular or Roster method, and
C = { x |x are integers} in Rule Method. We can say that −2 ∈ C, 5 ∈ C, 0.5 ∉ C

Activity 2.2b. Determine if the set is finite, infinite or empty set. Write the Set Builder Form and Roster Form.
1. Let B be the set of positive divisors of 12.
2. Let D be the set of prime numbers.
3. Let E be the set of integers between 3 and 4.

Subsets and Counting


If A is any set, then the number of elements of a set is called the cardinality of A
and is denoted n(A). A set is finite if it consists of a specific number of different elements; otherwise a set
is infinite. If A is infinite, then we write, n(A) = ∞. A set which has only one element is known as a
singleton set.
1. Let M be the set of the cities or municipalities of Bukidnon. Then M is finite and n(M) = 22.
2. Let 𝑇 = {𝑥𝑥 𝑖𝑠 𝑎𝑛𝑦 𝑝𝑒𝑟𝑠𝑜𝑛 𝑤ℎ𝑜𝑠𝑒 𝑓𝑖𝑟𝑠𝑡 𝑛𝑎𝑚𝑒 𝑠𝑡𝑎𝑟𝑡𝑠 𝑤𝑖𝑡ℎ 𝐸 𝑖𝑛 𝑡ℎ𝑒 𝑟𝑜𝑜𝑚}. Then T is finite.
3. Let 𝑁 = {1,3,5,7, … }. Then N is infinite and 𝑛(𝑁) = ∞.
4. H = {xx is a solution of 2x − 3 = 5}. The solution of 2x − 3 = 5 is 4. Here, H = {4}.
Activity 2.2.c Determine the cardinality of each set.
1. P = {xx is a current governor of Bukidnon}
2. S = {xx is a 100 year old student of BSU}
3. R = {xx is both an odd and an even number}
4. P = {xx is a solution of 3x − 3 = 9}
5. Z = {xx is a solution of 2x − 5 = 25}

Equal and Equivalent Sets


Two sets A and B are said to be equal if they have precisely the same elements. We denote this by A = B.
A set does not depend on the way in which the elements are displayed and a set remains the same if its
elements are repeated or rearranged. If the sets are not equal then we write A ≠ B.

If the elements in the two sets can be put into a one-to-one correspondence, the sets are said to be
equivalent sets. In general, two finite sets A and B with the same number of elements are equivalent sets
denoted by A ↔ B or A ≅ B. Equivalent sets are not necessarily equal but equal sets are equivalent sets.

Activity 2.2d. Identify the equal and equivalent sets.


1. Let A be the set of the letters of the word “veil” and B be the set of letters in the word
“evil”. 2. Let A = {∗, #, @} and B = {4, 1, 5}.
3. Let P = { x |x divides 6, 0 < x < 4} and Q = { x |x are the first three counting numbers}.
4. Let 𝐴 = {1,5,8,9} and 𝐵 = {9,1,5,8}.
5. Let 𝐸 = {3,4,5,4}, 𝐹 = {3,4,5,5, } and 𝐺 = {3,4,5}.
6. Let O={1,3,5,7,…} and E={2,4,6,8,…}.
7. Let 𝑍 = {𝑥𝑥(𝑥 − 3) = 0}, 𝑋 = {0,3}, 𝑌 = {0,3,3} and 𝑊 = {3,3,3, … ,0,0,0, … }.

Subset and Proper Set


If every element in a set A is also a member of a set B, then A is called a subset of B. We denote this
relationship by A ⊂ B. In the case that A ⊂ B but A ≠ B, we say that A is a proper subset of B. If A ⊂ B,
then B is called a superset of A, written B ⊃ A.
Remarks: Let A, B and C be any sets. Then
1. A ⊂ A - Any set is a subset of itself.
2. ϕ ⊂ A – Null set is a subset of every set.
3. If A ⊂ B and B ⊂ A, then A = B.
4. If A ⊂ B and B ⊂ C, then A ⊂ C.
5. The total number of subsets of a set with n elements is 2n.

Subsets
1. Let 𝐴 be the set of all BSU students and 𝐵 be the set of all freshmen students. Then 𝐵 ⊂ 𝐴.
2. If 𝑉 = {𝑎, 𝑒, 𝑖, 𝑜, 𝑢}. Then {𝑎, 𝑜} and {𝑎, 𝑒, 𝑢} are subsets of 𝑉.
3. Let 𝑋 = {1,3,5,7, … } and 𝑌 = {5,15,25,35, … }. Then 𝑌 ⊂ 𝑋.
4. Let 𝐴 = {1,2,3}. Then the proper subsets of 𝐴 are: {1} , {2}, {3}, {1,2}, {1,3}, {2,3} and improper
subsets of 𝐴 are: 𝐴 and ϕ.
5. 𝐴 = {1,2,3} and 𝑛(𝐴) = 3 = 𝑛 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 = 2𝑛 = 23 = 2𝑥2𝑥2 = 8 𝑠𝑢𝑏𝑠𝑒𝑡𝑠

In the case that the elements of a given set are set themselves, then we say that the given set is a family of sets
(set of sets or class of sets). To avoid confusion between ordinary set and family of sets, we will use script
letters
{𝓐, 𝓑, 𝓒, … } to denote the family/class/set of sets.

If A is any set, then the family of all subsets of A is called the power set of A, and is denoted 𝓟(𝐴).

Power set
1. If 𝐴 = {𝑎, 𝑏}, then the power set of 𝐴 is the set: 𝓟(𝐴) = {𝜙, {𝑎}, {𝑏}, 𝐴}.
2. Let 𝑆 be a set with 𝑛(𝑆) = 3, then 𝑛(𝓟(𝑆)) = 23 = 8.

You might also like