Beruflich Dokumente
Kultur Dokumente
SIZE OF SET
Sets are used extensively in counting problems, and for such applications we
need to discuss the sizes of sets.
Remark: The term cardinality comes from the common usage of the term cardinal
number as the size of a finite set.
EXAMPLE
A = {x| x ∈ N , x = x < 10 ^ x = 2n - 1}
Then |A| = 5
For A = {1,3,5,7,9}
FOR ODD WHOLE NUMBERS
{x : x = 2n + 1 where n ∈ W}.
For Programming x = 2 % != 0;
{ {},{a},{b},{c}, {a,b},{a,c},{b,c},{a,b,c}}
HOW MANY SUBSETS
If the original set has n members, then the Power Set will have 2n members
n = size of Set
So, the Power Set should have 23 = 8, which it does, as we worked out before.
{{a,b,c},{a,b},{a,c},{b,c},{a},{b},{c},{}} = subsets
NOTATION
The number of members of a set is often written as |S|, so when S has n members we can write:
|P(S)| = 2n
Example : S={1,2,3,4,5}
||P(S)| = 2n
||P(S)| = 25
||P(S)| = 32
BINARY
ANOTHER EXAMPLE
P = { {}, {b}, {c}, {l}, {s}, {b,c}, {b,l}, {b,s}, {c,l}, {c,s}, {l,s}, {b,c,l}, {b,c,s},{b,l,s}, {c,l,s}, {b,c,l,s} }
PRACTICE GET THE POWER SET :
For
the set S = {1, 2, 3, 4, 5, 6}, how many members will the power set have?
|P(6)| =
64
TYPES OF SET
TYPES OF SET
Symbol { } or ∅
S = (0,1,2,3,4,5,6,7,8,9)
INFINITE SETS
N= {1, 2, 3,…}
EQUAL SETS
Two sets are equal sets if they have exactly the same members. i.e. Each element
of P are in Q and each element of Q are in P. The order of elements in a set
is not important.
P = {1,2,3,4,5} , Q ={2,3,1,5,4}
P=Q
EQUIVALENT SETS
Equivalent sets have different elements but have the same number of elements.
N = {1,2,3,4,5,6} , A = {a,b,c,d,e,f}
The set containing all objects or elements and of which all other sets are
subsets.
If A and B are two sets, and every element of set A is also an element of set B,
then A is called a subset of B and we write it as A ⊆ B or B ⊇ A
Proper Subset:
If A and B are two sets, then A is called the proper subset of B if A ⊆ B but B ⊇
A i.e., A ≠ B. The symbol ‘⊂’ is used to denote proper subset. Symbolically, we
write A ⊂ B.
SUPER SET:
The collection of all subsets of set A is called the power set of A. It is denoted by
P(A). In P(A), every element is a set.