Module 2 - Language of Sets
Module 2 - Language of Sets
Basic Properties
● a set "has" elements
● two sets are equal (one and the same) if and only if
every element of one is an element of the other.
Georg Cantor, founder of set theory
Describing Sets
1. Roster/Listing Method
- listing each member of the set
- denoted by enclosing the list of members in curly brackets
Examples:
A= {5,3,4,2,1}
Examples
A is the set whose members are the first four positive integers.
B is the set of colors of the Philippine flag.
Describing Sets
2. Rule Method or Semantic Description
- using intentional definition or rules describing the elements of the set
- This is otherwise referred as the set-builder notation.
Examples
Language of Sets
➔ Every element of a set must be unique; no two members may be identical. The
order in which the elements of a set are listed is irrelevant.
➔ For sets with many elements, the enumeration of members can be abbreviated.
ellipses “…”
Language of Sets
➔ The notation with braces may also be used in an intentional specification of a
set. The braces have the meaning "the set of all ...".
Membership (element of )
a is a member of B a∈B
4∈A and 4 ∉ B
Is 4 an element of set F?
Subsets
➔ If every member of set A is also a member of set B, then
A is said to be a subset of B
B⊇A B is a superset of A
B includes A, or
B contains A
Subsets
If A is a subset of but not equal to B, then A is a
A⊂B or A ⊊ B
proper subset of B
➔ any number that can be found in the real world is a real number
➔ denoted by R or ℝ
https://www.cuemath.com/numbers/real-numbers/
POWER SETS
The power set of a set S is the set of all subsets of S, including S itself and the
empty set.
Examples:
A = { red, blue, yellow} |A| = 3
B = {0,1,2,3,...,99} |B| = 100
C = {x| x is an integer} |C| = infinite