MATHONGO - Formula Sheet - SET RELATION: Intersection of Two Sets

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

MATHONGO – formula sheet – SET RELATION

Union of Two Sets


A B
Let A and B be two sets.

Then, A  B  {x : x  A or x  B}
Clearly, A  A  B, B  A  B A B
and A B  B  A

Intersection of Two Sets


Intersection of two sets A and B is denoted by A B and,

A  B  {x : x  A and x  B} A B
Trivially, A  B  A, A  B  B
and A  B  B  A.
A B
Complement of a Set
Complement of a set B in set A is written as A ~ B  {x : x  A, x  B}
 
e.g. I ~ N  {.... 3,  2,  1, 0}.
 
The set of irrational numbers  R ~ Q

In any discussion involving sets and their


A B
operations, we presume that all these
A'
sets are subsets of a parent set called
Universal set, U. The complements of A
A~B A

and U is denoted by AC or

A'  {x : x  A} .

Some properties of operations on sets

(a) A  (B  C)  ( A  B)  C
(b) A  B  B  A, A     A B
(c) A  B  A B  A  A B  B
(d) (A  B)' A'B' and (A  B)' A' B' AB
(De Morgan’s Law)

n  n
(e)  
A ~  Ai   ( A ~ Ai )
 i 1  i 1
(Generalized De Morgan’s Law)

For more such resources and video lecture download the MathonGo App now. http://bit.ly/2CmMUs3
MATHONGO – formula sheet – SET RELATION
n  n
(f)  
A ~  Ai   ( A ~ Ai )
 i 1  i 1

Symmetric difference of two sets


AB  (A ~ B)  (B ~ A)

Cartesian Product
Let X be a non-empty set and a, b  X. Then the symbol (a,b) denotes ordered pair and is
defined by property that (a, b)  (c,d) if and only if a  c and b  d. The cartesian product of
sets A and B is denoted by A  B  B  A, moreover,

A(B  C)  ( A  B)  ( A  C) and A  (B  C)  ( A  B)  ( A  C)

Relations

A relation from set of X to a set Y is a subset R of X Y . If Y


(a, b) R, we say a is related to b and often write it as a R b. If

X  Y, we say that R is relation on X. R


Let R be a relation from X to Y. For each subset A of X, we write

R( A)  {y Y : x R y for some x  A} X

and call it the (direct) image of A under R, and for each subset B of Y, we write

R 1(B)  {x  X : x R y for some y  B} and call it the inverse image of B under R.

One can think of R1 as relation from Y to X, where

yR1x  xRy

that is, R 1  {(y, x ) : ( x, y )  R}

R1 is called the reverse of the relation R.


Domain of a relation R from a set X to a set Y is the set of all first components of the elements
of R, i.e. dom R  {a  X : (a, b)  R for some b  R}

Let R be a relation from X to Y and S from Y to Z, then SoR  {(x, z) | x  X, z  Z and

y Y such that and (x, y ) R and (y, z)  S.

For more such resources and video lecture download the MathonGo App now. http://bit.ly/2CmMUs3
MATHONGO – formula sheet – SET RELATION
Equivalence Relation

A relation R on a set X (i.e. R  X  X ) is said to be

(a) reflexive if x R x for all x  X.

(b) symmetric if x R y  y R x, where x, y  X

(c) transitive if x R y, y R z  x R z, where x, y, z  X

(d) antisymmetric if x R y and y R x then x  y.

Further, a relation R in a set X is said to be an equivalence relation if it is reflexive, symmetric


and transitive.

For more such resources and video lecture download the MathonGo App now. http://bit.ly/2CmMUs3

You might also like