THE SIZE OF A SET

SIZE OF SET

Sets are used extensively in counting problems, and for such applications we
need to discuss the sizes of sets.

Let S be a set. If there are exactly n distinct elements in S where n is a

nonnegative integer, we say that S is a finite set and that n is the cardinality of S.
The cardinality of S is denoted by |S|
REMEMBER

Remark: The term cardinality comes from the common usage of the term cardinal
number as the size of a finite set.
EXAMPLE

Let A be the set of odd positive integers less than 10.

A = {x| x ∈ N , x = x < 10 ^ x = 2n - 1}

Then |A| = 5

For A = {1,3,5,7,9}
FOR ODD WHOLE NUMBERS

The set of odd whole numbers is

{x : x = 2n + 1 where n ∈ W}.

The set of odd whole numbers is {1, 3, 5, 7, 9, …}.

For Programming x = 2 % != 0;

X is equal to mod of 2 not equal to zero.

POWER SETS
POWER SETS

 "The set of all the subsets of a set“

 Basically we collect all possible subsets of a set.

 Example: For the set {a,b,c}:

{ {},{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 :

 What is the power set for {0, 1}?

{{ }, {0}, {1}, {0, 1}}

PRACTICE HOW MANY SUBSET

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

 Empty set  Universal set

 Singleton set  Subset
 Finite set  Proper set
 Infinite set  Superset
 Equal sets  Proper super set
 Equivalent sets  Power set
EMPTY SET

Symbol { } or ∅

Set wit empty or no element

SINGLETON

A set with one element

S = {e} one element

S = {∅} <- this is not an empty set

FINITE SET

 A set with limited (countable) elements

Set S is the set of natural numbers less than 10

S = (0,1,2,3,4,5,6,7,8,9)
INFINITE SETS

An infinite set is a set whose elements can not be counted.

Set N is the set of counting numbers.

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}

N  ↔ A (without the box <->)

UNIVERSAL SET

 The set containing all objects or elements and of which all other sets are
subsets.

 It is expressed by the capital letter U.

Universal : A = {a, b, c}, B = {a, c, e, f}, C = {b, d, f, h} from U = {a, b, c, d, e, f, g, h}.

Union: AUB = {a, b, c ,e ,f}

UNIVERSAL IN VENN DIAGRAM
VENN DIAGRAM OF UNION OF TWO SET
SUBSET

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

A = {2, 4, 6}  B = {6, 4, 8, 2} 

Here A is a subset of B
Since, all the elements of set A are contained in set B. 
But B is not the subset of A 
Since, all the elements of set B are not contained in set A. 
PROPER SUBSET

 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:

 Whenever a set A is a subset of set B, we say the B is a superset of A and we

write, B ⊇ A. 
PROPER SET

A superset which is not the entire set. A ⊃ B = {1,2,3,4} ⊃ {1,2,3}

POWER 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.

 If A = {p, q} then all the subsets of A will be

P(A) = {∅, {p}, {q}, {p, q}}