0% found this document useful (0 votes)
139 views12 pages

Understanding Set Concepts and Notation

1. The document discusses sets and set notation in mathematics. It defines what a set is, provides examples of well-defined and not well-defined sets, and explains how to write sets using roster and set-builder notation. 2. There are two primary methods for writing sets - enumeration or roster method, which lists the elements, and rule or set-builder method, which defines the properties of the elements. 3. The document provides examples of writing sets using both methods and explains the syntax for set-builder notation.

Uploaded by

Luccine Shin
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
0% found this document useful (0 votes)
139 views12 pages

Understanding Set Concepts and Notation

1. The document discusses sets and set notation in mathematics. It defines what a set is, provides examples of well-defined and not well-defined sets, and explains how to write sets using roster and set-builder notation. 2. There are two primary methods for writing sets - enumeration or roster method, which lists the elements, and rule or set-builder method, which defines the properties of the elements. 3. The document provides examples of writing sets using both methods and explains the syntax for set-builder notation.

Uploaded by

Luccine Shin
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

BULACAN STATE UNIVERSITY

COLLEGE OF SCIENCE

MMW 101
MATHEMATICS IN THE MODERN WORLD

Module 4
The Language of Sets
“Achieving Universal Understanding and
Peace Through the Language of
Mathematics”
36

The Language of Sets

Objectives of the Module


At the end of the module, you should be able to:
1. define and give examples of sets,
2. write sets using the roster and the rule method,
3. identify and differentiate the kinds of sets, and
4. perform operations on sets.

Sets become a powerful building block of mathematics when applied to different


situations. Some of the higher mathematics disciplines whose common denominator
is set are the following: Graph Theory, Abstract Algebra, Real Analysis, Complex
Analysis, Linear Algebra, and Number Theory.

Set and Set Notations

The idea of a set in Mathematics is not different from how we think of it in


everyday living. Words such as collection, group, batch, class, and bundle all convey
the idea of a set.

However, mathematically speaking, a set is a collection of distinct objects. The


objects must be well-defined, which means that we can tell whether any given object
is or is not in the set. Distinct means no duplication of the object in the set (it is listed
only once).

Consider these examples to distinguish well-defined sets.

Well-defined Sets Not Well-defined Sets


1. The set of female presidents of 1. The set of good Filipino writers
the Philippines
2. The set of quadrilaterals 2. The set of best books in the library
3. The set of rainbow colors 3. The set of difficult subjects in SHS
4. The set of even numbers less 4. The set of delicious smoothies
than 80
5. The set of ASEAN Member 5. The set of smart people in the
countries meeting

In writing sets, you need to follow these rules:


1. Name the set using a capital letter of the English alphabet (A, B, C, …, X, Y,
Z).
2. The objects in the set are known as elements. We write them in small letters
(a, b, c, …, x, y, z).
3. The elements are separated by commas and are written inside the braces { }.
37

For example, Set A has as its elements the letters in the word freshmen. Writing
the set, we have A = {𝑓, 𝑟, 𝑒, 𝑠, ℎ, 𝑚, 𝑛}.

Note: The letter 𝑒 must be written only once.

Another thing, if an object is an element of the set, use the symbol ∈.

In the above example, 𝑓 is an element of set A or 𝑓 is a member of set A or 𝑓 is


in A, or 𝑓 belongs to A. We write𝑓 ∈ 𝐴 .

On the other hand, if an object is not an element of the set, we use the symbol
∉ as in 𝑎 is not an element of set A, 𝑎 ∉ 𝐴.

Before moving further, to help you understand some concepts/examples in this


lesson, a review of the set of real numbers is given in the table that follows.

The Set of Real Numbers

Symbol Name Description Examples

Natural Counting numbers (also called


N 1, 2, 3, . . .
Numbers positive integers)

Naturals numbers, their …, -4, -3, -2, -1, 0, 1, 2,


Z Integers
negatives and 0 3, 4, ...

Numbers that can be


-15, -2, 0, 23,
represented as a/b, where a and
Rational -1/4, 3/7, 15/2,
Q b are integers and b≠0. The
Numbers -2.75, 1.625,
decimal representations are
-0.333…, 5.272727…
terminating or repeating.
Numbers that cannot be
expressed as the ratio of two
Irrational √2 = 1.414213562 … ,
Q' integers. They are the non-
Numbers 𝜋 = 3.141592654 …
repeating and non-terminating
decimals.

Real
R Rational and Irrational
Numbers
38

Methods of Writing a Set

Set-builder Notation or Rule


Enumeration or Roster Method
Method
• The elements of a set are • The members of the set are
listed or enumerated in any defined by stating their
order but no repetition and are common properties. Example
enclosed by curly braces. of a set-builder notation:
{x I x > -2} or {x : x > -2}

This is read as “the set of all


x’s, such that x is greater than
-2”.
The” I” is read as ”such that”.
The “:” can also be used
instead of ”I”.

These are the steps on how to write sets using the set builder notation:

1. Use a lowercase letter, x or any other letter, to describe the elements of the set.
2. Use a separator, either a colon ( : ) or a vertical bar ( l ).
3. Tell the condition or properties of the elements of the set.
4. Enclose the complete description inside curly braces.

Here are some examples for you.

Enumeration or
Statement Rule Method
Roster Method
D = {e, i} D is the set of vowels D = { 𝑥I𝑥 is a vowel in the
in the word little. word little}
E = {c, d, n, y} E is the set of E = { 𝑥I𝑥 is a consonant in the
consonants in the word decency}
word decency.
N = {1, 2, 3, . . .} N is the set of N = { 𝑥I𝑥 is a natural number}
Natural numbers. or
N = { 𝑥I𝑥 ∈ 𝑁}

S = {2, 1, 0, -1, -2, …} S is the set of S = { 𝑥I𝑥 is an integer less


integers less than 3. than 3}
or
S = {x ∈ 𝑍Ix < 3}

B = {11, 13, 17, 19, 23, B is the set of all B = { 𝑥I𝑥 is a prime number
29} prime numbers between 10 and 30} or
between 10 and 30. B = { 𝑥I𝑥 is a prime number,
11 ≤ 𝑥 ≤ 29}
39

T = {-15, -10, -5, 0, 5, T is the set of T = { 𝑥I𝑥 is a multiple of 5


10} multiples of 5 greater greater than -20 but less
than -20 but less than positive 15}
than positive 15. or
T = { 𝑥I𝑥 is a multiple of 5,
−15 ≤ 𝑥 ≤ 10 }
or
T = { 𝑥I𝑥 is a multiple of 5,
−16 < 𝑥 < 11 }

T = {5𝑥I𝑥 ∈ 𝑍, −4 < 𝑥 < 3} or


T = {5𝑥I𝑥 ∈ 𝑍, −3 ≤ 𝑥 ≤ 2} or
T = {5𝑥I𝑥 ∈ 𝑍, −3 ≤ 𝑥 < 3} or
T = {5𝑥I𝑥 ∈ 𝑍, −4 < 𝑥 ≤ 2}

G = {22,24, 26, 28, 30, G is the set of G = { 𝑥I𝑥 is a positive even


32, 34, 36, 38} positive even number greater than 20
numbers greater but less than 40} or
than 20 but less than G = { 𝑥I𝑥 is a positive even
40. number, 20 < 𝑥 < 40}
or
G = {2𝑥I𝑥 ∈ 𝑁, 10 < 𝑥 < 20} or
G = {2𝑥I𝑥 ∈ 𝑁, 11 ≤ 𝑥 < 20} or
G = {2𝑥I𝑥 ∈ 𝑁, 11 ≤ 𝑥 ≤ 19} or
G = {2𝑥I𝑥 ∈ 𝑁, 10 < 𝑥 ≤ 19}

M = {13, 15, 17, 19, 21} M is the set of odd M = { 𝑥I𝑥 is an odd number
numbers between between 12 and 22} or
12 and 22.
M = {2𝑥 + 1I𝑥 ∈ 𝑁, 5 < 𝑥 < 11}
or
M = {2𝑥 + 1I𝑥 ∈ 𝑁, 6 ≤ 𝑥 ≤ 10}
or
M = {2𝑥 + 1I𝑥 ∈ 𝑁, 6 ≤ 𝑥 < 11}
or
M = {2𝑥 + 1I𝑥 ∈ 𝑁, 5 < 𝑥 ≤ 10}
40

Kinds of Sets
These are simple descriptions and examples to help you distinguish one kind
of set from another.
Kind of Set Definition / Notation Examples
1. Finite Set • A set whose elements A = { 𝑥I𝑥 is a positive
are limited or countable integer less than17}
A = {1,2,3, …,16}
• The cardinality of a set is
the number of its n(A) = 16
elements. The cardinality
of set A is denoted by B = { 𝑥I𝑥 is an odd integer
n(A) or IAl. between 50 and 60}
B = {51,53,55,57,59}

n(B) = 5
2. Infinite Set • A set whose elements W = {0, 1, 2, 3, ...}
are unlimited or cannot n(W) = ∞
be counted
D = { 𝑥I𝑥 is a negative odd
Note: the infinity of the set integer}
is denoted by three dots (...) D = { -1, -3, -5, . . .}
called an ellipsis and is read
"and so forth." E = { 𝑥I𝑥 is a proper
fraction}
E = {1/2, 3/4, 5/7, . . .}
3. Unit Set • A set with only one F = { 𝑥I𝑥 is an integer
or element greater than 10 but
Singleton Set less than 12}
F = {11}
n(F) = 1

G = { 𝑥I𝑥 is the vowel in


the word day}
G = {a}
4. Empty Set • A set with no object or H = { 𝑥I𝑥 is an integer
or element greater than -1 but
Null set less than 0}
• The symbols "{ }" and H = { } or H = ∅
"∅" are used to denote n(H) = 0
an empty set.
B = { 𝑥I𝑥 is a counting
number between 45
and 46}
B = { } or I = ∅
n(B) = 0
41

5. Equal Sets • Two sets containing the Let A = {l3, 14, 15, 16}
same elements are B = {14, 15}
equal.
• Symbolically, A = B. D = { 𝑥I𝑥 is a natural
number greater
than 12 but less
than 17}.
• The symbol "≠" is used
to denote that two sets E = {l5, 16, 14, 13}
are not equal.
From the given sets, A = D
and that both A and D are
equal to E, A = D = E.
Also,
A ≠ B, D ≠ B, and E≠ B.
6. Equivalent • If Sets A and B have the
Sets same number of
elements or the same
cardinality, then they are
equivalent sets. Let A = {11,12, 13}
B = {x, y, z}
• They may have different C = {𝜆, 𝛽, 𝛼}.
elements or some
common elements only.
From the given sets,
A~B, A~C, and B~C.
We use the symbols “~”
or “≡” to denote that sets
are equivalent.

7. Disjoint Let R = {2, 4, 6},


Sets S = {11, 13, 15}
or • Two sets with no
non- common elements are Then, R and S are disjoint.
intersection disjoint.
The set of whole numbers
and the set of negative
numbers are disjoint.

Subsets, Supersets, and Power Sets

A is a subset of B if every Consider the sets:


element of A is in B. The J = {5, 6, 7}
phrases "A is contained in K = [8,7, 6, 5}
Subsets B" and "B contains A" are L = {5, 6, 7, 8, 9}
other ways of saying that A
is a subset of B. then, we can say that
J⊆K, J ⊆ L, and K ⊆ L.
Symbolically, A ⊆ B.
42

The number of subsets of a Given: M = {7, 8, 9}


given set with "n" elements can n(M) = 3
be computed using the formula
2n. 2n = 23
= 8 subsets
Note: Every set is a subset
of itself. The subsets of M are:
The empty set is a subset {7}, {8}, {9}, {7, 8}, {7, 9},
of every set. {8, 9}, {7, 8, 9}, ∅

If every element of A is in B, Consider the sets:


but there is at least one J = {7, 6, 5}
element in B that is not in A, K = {8,7, 6, 5}
then A is a proper subset of L = {9, 8, 7, 6, 5}
B.
We can say that
In symbols, we have A⊂B. J ⊂ K, J ⊂ L, and K ⊂ L.

If a set has "n "elements, Given: J = {5, 6, 7}


the number of proper
Proper Subset subsets can be verified For the number of
using proper subsets of J:
2n – 1. 2n – 1 = 23- 1
=8-1
=7

Note: Every set is not a The proper subsets of J


proper subset of itself. are:
A null set is a proper subset {5}, {6}, {7}, {5, 6}, {5, 7},
of every set. {6, 7}, ∅

• If A is a subset of B, then Consider the sets:


we can say that B is a J = {2, 4, 6}
superset of A, denoted by K = {2, 4, 6, 8}
Superset B ⊇ A. L = {2, 4, 6, 8, 10}

Then, we can say that


K ⊇ J, L ⊇ J, and L ⊇ K.

• The set of all subsets of a Let N = {q, r, s}


set A is called the power set n(N) = 3
of A, denoted as P(A).
|P(N)| = 23 = 8
Power Sets
• The cardinality (or the
number of elements) of the P(N) = {∅, {q}, {r}, {s},
power set of A is given by {q, r}, {q, s}, {r, s},
|P(A)| = 𝟐𝒏 . {q, r, s}}
43

Universal Set and Complementary Sets

• The universal set is the set Let A = {a, c, e, g}


containing all the possible B = {b, d, f}
elements under consideration C = {a, d, g, h}
Universal Set or the set containing all the
elements of its subsets, Then, U = {a, b, c, d, e,
without repetition. f, g, h}
• Sets A and B are Let U = {10, 11, 12, 13,
complementary if they have 14, 15, 16, 17}
no common elements, and A = {10, 12, 14}
their union is the universal B = {11, 13, 15, 17}
set. C = {10, 12, 13,14,
Complementary
16}
Sets
• In symbol, the complement of
A is 𝐀𝐜 𝒐𝒓 𝐀′. Then, Ac = {11, 13, 15,
16, 17}
Bc = {10, 12, 14, 16}
Cc = {11, 15, 17}

Operations on Sets

Union The union of two sets A and B Let A = {1, 3, 5}


is the set containing all the B = {1, 5, 8, 10}
elements of both sets. C = (3, 6, 12, 14}
D={}
In symbols, we write A ∪ B.
A U B = {1, 3, 5, 8, 10}
B U C = {1,3,5,6,8,10,12,14}
C U D = {3, 6, 12, 14}

Intersection The intersection of two sets A Let A = {1, 3, 5}


and B is the set containing the B = {1, 5, 8, 10}
common elements of both C = (3, 6, 12, 14}
sets. D={}

In symbols, we write A ∩ B. A ∩ B = {1, 5}


B ∩ C = { } or ∅
C ∩ D = { } or ∅
44

Combinations Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14}


A = {1, 3, 5}
B = {1, 5, 8, 10}
C = {3, 6, 12, 14}
D={ }

Examples:

(A U B) ∩ C = {1, 3, 5, 8, 10} ∩ (3, 6, 12, 14}


= {3}

(A ∩ C) U B = {3} U {1, 5, 8, 10}


= {1, 3, 5, 8, 10}

A U B U C = {1, 3, 5, 6, 8, 10, 12, 14}

(A ∩ B) ∩ C = {1, 5} ∩ {3, 6, 12, 14}


={ }

(A U B) ∩ (C U D) = {1, 3, 5, 8, 10} ∩ {3, 6, 12, 14}


= {3}

(A ∩ B) U (C ∩ D) = {1, 5} U { }
= {1, 5}

(A U D) ∩ (B ∩C) = {1, 3, 5} ∩ { }
= { } or ∅

Ac ∩ B c = {2,4,6,7,8,9,10,11,12,13,14} ∩
{2,3,4,6,7,9,11,12,13,14}
= {2, 4, 6, 7, 9, 11, 12, 13, 14}

B c ∩ C c = {2,3,4,6,7,9,11,12,13,14} ∩ {1,2,4,5,7,8,9,10,11,13}
= {2, 4, 7, 9, 11, 13}
45

Cross Product of Sets

Let A = {5, 7, 9},


B = {r, s, t}

Find: A x B
• The cross product of two non-
empty sets A and B is the set
of all ordered pairs (a, b), Solution:
where the first element a is
from set A, and the second A x B = {(5, r), (5, s),
element b is from set B. (5, t), (7, r),
Cross Product (7, s), (7, t),
of Sets (9, r), (9, s),
Note: The symbol "x" is used for (9, t)}
the operation.
Find: B x A
Read A x B as A cross B.
Solution:
AxB≠BxA B x A = {(r, 5), (r, 7),
(r, 9), (s, 5),
(s, 7), (s, 9),
(t, 5), (t, 7),
(t, 9)}
46

References

Cha, Jhon Harley Niño, Miro, Eden, and Quiming, Romel (2016). General
Mathematics. Quezon City : Vibal Group.

Simpson, Andrew (2002). Discrete Mathematics by Example. United Kingdom :


McGraw-Hill Education.

Alejan, Ronnie O., Veloria, Elisa V., et al. (2018) Mathematics in the Modern World.
Malabon, Metro Manila : Mutya Publishing House, Inc.

Malang, Paulino, Malang, B.,& Tiongson, I. (2011). Discrete Structure. San Rafael :
HFM Publishing.

Online References

Hoyland, S. (2021, November 8). Take online courses. earn college credit. Research
Schools, Degrees & Careers. [Link] | Take Online Courses. Earn College Credit.
Research Schools, Degrees & Careers. Retrieved July 14, 2022, from
[Link]
[Link]

The Story of Mathematics - A History of Mathematical Thought from Ancient Times to


the Modern Day. (2022, March 21). Set builder notation - Explanation and Examples.
Retrieved July 26, 2022, from [Link]
notation/

Common questions

Powered by AI

Sets can be categorized as finite, infinite, unit (singleton), empty (null), equal, equivalent, disjoint, subsets, and supersets, among others. Finite sets have a countable number of elements, such as A = {1,2,3,...,16} with n(A) = 16, whereas infinite sets are uncountably endless, represented with ellipses, like W = {0, 1, 2, 3, ...} . Equal sets have identical elements, while equivalent sets possess the same number of elements even if different. Disjoint sets share no common elements . Subsets and supersets describe hierarchical relationships, where all elements of a subset are contained within the superset .

The roster method defines a set by explicitly listing its elements inside curly braces, such as B = {11, 13, 17, 19, 23, 29}, which represents the set of all prime numbers between 10 and 30 . In contrast, set-builder notation defines a set by stating a property that its members must satisfy, such as B = {𝑥 | 𝑥 is a prime number between 10 and 30}, which uses a condition to implicitly describe the set .

Combination operations on sets involve applying unions (A ∪ B) and intersections (A ∩ B) to derive complex relationships. For instance, given A = {1, 3, 5}, B = {1, 5, 8, 10}, and C = {3, 6, 12, 14}, the operation (A ∪ B) ∩ C finds elements in the union of A and B that also belong to C, resulting in {3}. Similarly, (A ∩ C) ∪ B expands the shared elements of A and C, {3}, to include all of B, yielding {1, 3, 5, 8, 10} .

A subset exists when all elements of one set (A) are contained within another set (B), denoted as A ⊆ B. A proper subset is similar but requires B to have at least one element not in A, symbolized as A ⊂ B. Conversely, if A is a subset of B, then B is a superset of A, denoted by B ⊇ A. For instance, J = {5, 6, 7} ⊆ K = {8, 7, 6, 5} indicates J is a subset of K, but J is also ⊂ L = {9, 8, 7, 6, 5} because L has more elements .

Operations on sets include union, intersection, and difference. The union of sets A and B, symbolized as A ∪ B, includes all unique elements from both sets. For example, A ∪ B = {1, 3, 5, 8, 10} when A = {1, 3, 5} and B = {1, 5, 8, 10} . The intersection, A ∩ B, contains only elements common to both A and B, such as A ∩ B = {1, 5}. Set difference identifies elements belonging to one set but not the other, altering relationships based on shared or distinct elements .

The power set of a set includes all possible subsets, highlighting the hierarchical relationships between them. Calculated using 2^n, where n is the number of elements in the original set, the power set outlines all configurations from no elements (empty set) to all elements. For instance, if N = {q, r, s} with n(N) = 3, its power set P(N) is calculated as |P(N)| = 2^3 = 8, comprising subsets such as ∅, {q}, {r}, {s}, {q, r}, {q, s}, {r, s}, and {q, r, s} .

Cardinality measures the number of elements in a set, influencing our understanding of set size and equivalence. In finite sets, cardinality is the count of distinct elements, denoted by n(A). Two sets are considered equivalent if they share the same cardinality, regardless of specific elements, for example, A = {11, 12, 13} is equivalent to B = {x, y, z} since both have a cardinality of 3. Additionally, cardinality impacts power sets, which contain 2^n subsets, revealing hierarchical relationships and potential configurations within the set .

A well-defined set in mathematics is a collection of distinct objects that are clearly defined, allowing us to determine whether any given object is an element of the set. For example, the set of even numbers less than 80 is well-defined because it includes specific numbers (2, 4, 6, ..., 78). On the other hand, a non-well-defined set lacks clear criteria, making it impossible to verify membership; for instance, the set of good Filipino writers is subjective and lacks a universal definition .

The Cartesian product of two sets, A and B, consists of all possible ordered pairs where the first element comes from set A and the second from set B. For example, with A = {5, 7, 9} and B = {r, s, t}, the Cartesian product A × B is formed as A × B = {(5, r), (5, s), (5, t), (7, r), (7, s), (7, t), (9, r), (9, s), (9, t)}. This operation is not commutative, meaning A × B ≠ B × A .

In set theory, the universal set is the set containing all elements under consideration for a particular discussion. Complementary sets are subsets of this universal set that together contain all elements of the universal set without overlap. The complement of set A, denoted A', includes all elements in the universal set that are not in A. For example, if U = {10, 11, 12, 13, 14, 15, 16, 17} and A = {10, 12, 14}, then the complement of A includes elements not in A: Ac = {11, 13, 15, 16, 17} .

You might also like