SETS
A set is a collection of distinct elements.
Its notation s={1,2,3}.
Where 1,2,3 are objects/elements/members of the set.
A set containing no elements is called an empty set.(Φ )
S={2,4,6,8,10}
S={ x/x is a even positive integer <12}
Subsets
Set P is a subset of Q, if every elements in P are also elements in Q.
Its denoted by P⊆Q
Properset
Let P⊆Q , Then we say that P is a properset of Q.
If p not equal to Q, ie there is atleast one element in Q. that is not in P.
SUPER SET
A is said to superset of B if all elements of B are in A.
Its denoted by A⊇B
A={1,2,3} B={1,2}
EQUAL SETS
Two sets are equal if all the elements in both the sets are same.
A={1,2,3} B={1,2,3}
POWER SET
The power set of set A is a collection of or family of all subsets of A and is
denoted by P(A).
A={1,2,3}
P(A)={{1},{2},{3},{1,2},{2,3},{1,3},{1,2,3}, Φ }
If A has ‘n’ members then P(A) has 2n members.
SINGLETON SET
A set with only one member is called a singleton set.
FINITE SET
It is a set in which there are only finite number of
elements.
A set ie not finite is called Infinite set.
CARDINALITY
Let ‘A’ be a finite set. The no. of diff. element in A is called its cardinality.
It is denoted as n(A) or |A|
A={1,2,3} n(A)=3
VENN DIAGRAMS
Sets can be represented pictorially, These diagrams are
called venn diagrams.
Operations on a Set
Let A & B be two sets. The union of A & B is defined as set of all
elements of A & B and the common elements being taken once.
A={1,2,3} B={2,4,6}
A U B={1,2,3,4,6}
A U B={X;X ЄA, X ЄB}
Intersection
Let A & B be two sets. The intersection of A&B is defined as the set
of all elements common to both sets A&B.
A={1,2,3}B={2,4,6}
A ∩B={2} A ∩B ={X; XЄA, X ЄB}
Disjoint sets
Two sets are said to be disjoint if A ∩B= Φ .
If A={a,b,c} B={1,2,3}
A ∩ B={}
DIFFERENCE SETS
Let A & B be any two sets, The relative complement of B in A written as
A-B is the set consisting of all elements of A which are not elements of B.
A ={1,2,3} B={2,4,6}.
A-B={1,3}
COMPLIMENT SET
Let U be the universal set. For any set A the relative complement of A w.r.t U
ie U-A is called the Absolute complement of A. It is often called the complement of
A & is denoted as Ac
U={1,2,3,4,5,6,7}
A={1,3,5,7}
Ac ={2,4,6}
Ordered pair
An Ordered pair of objects is a pair of objects
arranged in fixed order .
We use notation (a , b) to denote the ordered
pair in which the first elements is ‘a’, and
second one ‘b’.
The order of two objects in an ordered pair is
important
(a , b) ,(b , a) are two different ordered pairs.
{a , b}={b , a}—order is not important.
(a1 , b1)(a2 , b2) are equal if a1=a2 and
b1=b2.
Cartesian products
For sets A,B ⊆U, The Cartesian product or
cross product of A & B is denoted by A×B .
A×B={(a , b)/a ЄA , b ЄB}.
A={1,2} B={a , b, c}.
A ×B={(1,a)(1,b)(1,c)(2,a)(2,b)(2,c)}
Relation
Relation between two objects can be defined
by listing the two objects as an ordered pair.
A set of all such ordered pairs in each of
which , the first member has some definite
relationship to second describes a particular
relationship.
For A,B ⊆U. Any ⊆ of A×B is called a
relation from A →B.
Any subset of A×A is called a binary relation on
A.
Ternary Relation
It consist of 3 sets it is a subset of cross
product of 2 sets and another set.
n-ary relation
It is a ⊆ of cross product of n sets.
Domain and Range of Relation
Let R⊆A×B be a relation from A →B then
domain of R denoted by Dom(R) .
The set of all first elements in the pair that
makes R.
III’y Range of R denoted by Ran(R) is the set of
all second elements of the pair in R.
Inverse Relation
It is the set of all ordered pair obtained by
interchanging the co-ordinates of members of R.
R={(1,2)(3,4)(5,6)}
R-1 ={(2,1)(4,3)(6,5)}
Dom(R-1 )=Ran(R)
Properties of Relation
SYMMETRIC .
ASYMMETRIC.
ANTISYMMETRIC.
TRANSITIVE RELATION
REFLEXIVE RELATION
IRREFLEXIVE RELATION
EQUIVALENCE RELATION
SYMMETRIC
Let A be a non empty set and R be a binary
relation in A . R is said to be symmetric (a ,
b) ЄR (b , a) ЄR ˅ (a , b) ЄR.
A={1,2,3}
R={(1,2)(2,1)(3,2)(2,3)}
ASYMMETRIC
Consider a binary relation R on
{A}.Relation R is called an asymmetric
relation.
If for every (a , b) ЄR (b , a) Є R
A={1,2,3}
R={(1,2)(3,2)}
ANTISYMMETRIC
Let A be a non empty set and R be a relation
in A.R is said to be antisymmetric.
If (a , b) ЄR (b , a) Є R When a= b.
A={1,2,3}
R={(1,1)(2,2)(3,3)}
TRANSITIVE RELATION
Let A be a set and R be a binary relation in
A.R is said to be transitive
If (a , b) ЄR , (b , c) Є R (a , c) ЄR
A={1,2,3}
R={(1,2)(2,3)(1,3)}
REFLEXIVE RELATION
Let A be a set and R be a binary relation in
A.R is said to be reflexive.
If (a , a) ЄR ˅a ЄA
A={1,2,3}
R={(1,1)(2,2)(3,3)}
IRREFLEXIVE RELATION
Let A be a set and R be a binary relation in
A.R is said to be irreflexive.
If (a , a) ЄR ˅aЄ A.
A={1,2,3}
R={(1,1)(2,2)}
EQUIVALENCE RELATION
A binary relation R on a set A is said to be an
equivalence relation.
If R is reflexive , symmetric and
Transitive.
PARTIALLY ORDERING RELATION
A binary relation R on a set A is be partially ordering
relation.
If R is reflexive, antisymmetric and transitive.
Let A={1,2,3} check whether the following relation are
symmetric , antisymmetric , asymmetric, reflexive ,
transitive and irreflexive.
R1={(1,2)(2,1)(1,3)(3,1)}=Symmetric
R2={(1,1)(2,2)(3,3)(2,3)}=Reflexive , Antisymmetric ,
Asymmetric
R3 ={(1,1)(2,2)(3,3)(2,3)(3,2)(1,3)(3,1)}=Symmetric ,
Reflexive , Transitive
Let A={1,2,3,4,5,6,7} and relation R is
defined as
R={(x , y)/|x-y|=2} is R an equivalence
relation.
R={(1,3)(3,1)(2,4)(4,2)(5,3)(3,5)(4,6)(6,4)
(5,7)(7,5)}
It is not an equivalence relation.
Let A={1,2,3,4}
R={(1,1)(1,3)(2,2)(2,4)(3,1)(3,3)(4,2)(4,4)}
S.T R is an equivalence relation?
R is reflexive,Symmetric,transitive
{(1,1)(2,2)(3,3)(4,4)}
{(1,3)(3,1)(2,4)(4,2)}
{(1,1)(1,3)(2,2)(2,4)(3,1)(3,3)(4,2)(4,4)}
Show whether the relation (x,y) ЄR if x≥y
Defined on the set A{1,2,3,4} is a partial order relation.
R={(2,1)(3,1)(4,1)(3,2)(4,2)(4,3)(1,1)(2,2)(3,3)(4,4)}
P.T (A×B) ∩(P×Q)=(A ∩P)×(B ∩Q) .
⇒ Let (x,y) Є(A×B) ∩(P×Q)
⇒(x,y) Є(A×B) and (x,y) Є(P×Q)
⇒(x ЄA) and (y ЄB) and (x ЄP) and (y ЄQ)
⇒(X ЄA) and (X ЄP) and (Y ЄB) and (y ЄQ)
⇒ X Є(A ∩ P) and Y Є(B ∩ Q)
⇒(x,y) Є(A ∩ P)×(B ∩ Q)
Conversely Let
⇒(x,y) Є (A ∩P)×(B ∩Q)
⇒(x,y) Є(A ∩P) and (x,y) Є(B ∩Q)
⇒(x ЄA and xЄP) and (y ЄB and Y ЄQ)
⇒(x ЄA and y ЄB) and (x ЄP and y Є Q)
⇒(x,y) Є(A×B) and (x,y) Є(P×Q)
⇒(x,y) Є(A×B) ∩ (P×Q)
P.T A×(B∩C)=(A×B) ∩(A×C) .
Let (x,y) Є A×(B∩C)
Conversly
P.T A×(B U C)=(A×B) U(A×C) .
Let (x,y) Є A×(B U C)
Conversly
Let R denote the relation on set of all ordered pair of +’ve
integers by (x,y) R (u,v) iff xv=yu, So that R is equivalence
relation .
If (x,y)(u,v) are +ve integers it is given that (x,y) R (u,v) iff
xv=yu.
1) As ( xy)=y(x)
It is true for all +’ve integers x and y
We (x,y) R (x,y) for all ordered pair of +’ve integers
So R is REFLEXIVE
2) (x , y) R (u , v)
xv=yu
yu=xv
uy=vx
(u , v) R (x , y)
So R is SYMMETRIC
3 ) Let (x,y,u,v,m,n) are +’ve integers.
When (x,y) R (u,v) (u,v) R (m,n)
xv=yu--------1
un=vm-------2
1×2
unvx=yuvm
xn=ym
(x,y) R (m ,n)
So R is TRANSITIVE