There are two ways of writing sets:

1. Roster Method
-listing the elements in any order and enclosing them with braces.

Example:

A= {January, February, MarchDecember}
B={1,3,5}

2. Rule Method
-giving a descriptive phrase that will clearly identify the elements of the set.

Example:

C={days of the week}
D={odd numbers}






#Properties of sets
Identity properties:

i) A U C = A
ii) A U = A

Domination properties:

i) A U U = U
ii) A C= C

Idempotent properties:

i) A U A = A
ii) A A = A

Commutative properties:

i) A B = B U A
ii) A B = U B A

Example:

Let, A = {1, 2, 3} and B = {4, 3, 2, 7}
A U B = {1, 2, 3, 4, 7}
B U A = {4, 3, 2, 7, 1} = {1, 2, 3, 4, 7}
Thus, A U B = B U A
We can prove A B = B A in the same way.


Associative properties:

i) A U(B U C) = (A U B) U C
ii) A (B C) = (A B) C

Example:

Let, A = {1, 2, 3}, B = {4, 3, 7} and c = {1, 7, 5, 6}
Finding of A U(B U C):
B U C = {1, 3, 4, 5, 6, 7}
A U (B U C) = {1, 2, 3, 4, 5, 6, 7}
Finding of (A U B) U C:
A U B = {1, 2, 3, 4, 7}
(A U B) U C = {1, 2, 3, 4, 5, 6, 7}
Thus, A U (B U C) = (A U B) U C
We can also prove, A (B C) = (A B) C in this same way.


Distributive properties:

i) A U(B C) = (A U B) (A U C)
ii) A (B U C) = (A B) U (A C)

Example:

Let, A = {1, 2, 3}, B = {4, 3, 7} and c = {1, 7, 5, 6}
Finding A U (B C):
B C = {7}
A U(B C) = {1, 2, 3, 7}
Finding (A U B) (A U C):
A U B = {1, 2, 3, 4, 7}
A U C = {1, 2, 3, 5, 6, 7}
(A U B) (A U C) = {1, 2, 3, 7}
Thus, A U(B C) = (A U B) (A U C)
We can also prove A(B U C) = (A B) U (A C) in the same way.



#Set Membership
Relation is an element of

Symbol : e and e

Example: X e A

X is an element of A X is a member of A
X is a subset of A
Example
A = {1, 2, 3, 4}, B = {blue, white, red}, F = {n^2 4: n is an integer, 0 s n s 19}
4 e A and 12 e F; but 9 e F and green e B




#Empty set
Symbol(null set) : {} and C

Set with no element

Example:

A = {2,6,8} and B = {3, 5, 7}

Let C is intersection A and B

Thus, C = {}, null set because no element common between the two
sets




#Set of numbers




#Set Equality
-Two set or equal if they contain of the same element.

Example 1 :

If, F = {20, 60, 80}
And, G = {80, 60, 20}
Then, F=G, that is both sets are equal.

Example 2 :

If, F = {2, 4, 6, 8, 10}
And, G = {10, 12, 18, 20, 22}
Then, n(F)= n(G)= 5, that is, sets F and G are equivalent.



#Venn Diagram
-is a set diagram that shows all possible logical relations between a
finite collection of sets.



A B A B


#Subset
A portion of set.

Example :

A set N is a subset of a set X
If, X = {3, 5, 6, 8, 9, 10, 11, 13}
And, N = {5, 11, 13}
Then, N is a subset of X.
That is, N X (where means is a subset of).



PROPER SUBSET
-Is a subset that strictly contained in a set.

Example :
If S={1,2,3,4}
Then T={1,2,3}
T is a proper subset of S.
T S

IMPROPER SUBSET
-subset consist of all element of a given set.

Example :
If W ={1,2,3,4}
Then V= {1,2,3,4}
W is a improper subset of V.
W . V






#Power Set
Collection of sets which represents every valid subset of a set

Example:

F = {Apple, Orange, Grape}

Member of power set:
C, {Apple} , {Orange}, {Grape}, {Apple, Orange}, {Orange, Grape}, {Apple,
Grape}, {Apple, Orange, Grape}

Write as:
P (P)= C, {Apple} , {Orange}, {Grape}, {Apple, Orange}, {Orange, Grape},
{Apple, Grape}, {Apple, Orange, Grape}





#Set Operation
Union

Two sets can be added together. The Union of A and B, denoted by
A U B, is the set of all things which are members of either A or B.

Example:
{3,4} U {A,B} = {3,4,A,B}

Properties:
A U B =B U A
A U (B U C) = (A U B) U C
A (A U B)
A B if and only if A U B = B
A U A = A
A U C = A


Intersection

The intersection of A and B, denoted by A B, is the set of all things
which are member of both A and B.

Example :
{1, 2} {3, 4} = C

Properties:
A B = B A
A (B C) = (A B) C
A B _ A
A A = A
A C = C
A _ B if and only if A B = A



Set Difference

The set difference between A and B is the set of all elements of A
that are not in B, denoted by A/B or A-B.

Example:
{1, 2, 3} \ {2, 3, 4} = {1}

Properties:
A \ C = A
A \ A = C = C \ A
B \ (A B) = B \ A
A \ B = A B
c

(A \ B)
c
= A
c
U B
(A \ B) (C \ D) = (A C) \ (B U D)


Disjoint set
Two set A and B are disjoint if their intersection is empty set

Example :
A B = C


Complement of a set

Complement of A is the set of all element in the universal set U,
but not in A, denoted A
c


Example:
Let A = {1, 2, 3, 4}
Let U = {1, 2, 3, 4, 5, 6}
A
c
= {5, 6}




#Generalised Union and Intersection
-Since union & intersection are commutative and associative, we can extend
them from operating on ordered pairs of sets (A,B) to operating on
sequences of sets (,,), or even unordered sets of sets, X={A | Q(A)}.

Generalized Union
-Binary union operator: AB
- n-ary union:
: (((() ))
(grouping & order is irrelevant)
-Big U notation:
-Or for infinite sets of sets:

Generalized Intersection
- Binary intersection operator: AB
- n-ary intersection:
A(((()))
(grouping & order is irrelevant)
-Big Arch notation:
-Or for infinite sets of sets:




#Cartesian Product
Product of two different sets


Example: Colour = {red, black}

Car = {Ferrari, saga}

Colour X Car = {(red, ferrari), (red, saga), (black, ferrari), (black,
saga)}

Colour X Car = Car X Colour