~--tl--~~~"-"L.-~____!...,L___w_l/ut· 0..J.L-f..4-----d4.~L--~L..L+-l,4.

---~

.LlLY.Jd ____./fwu_ _a4

"------.---6...L...Ai.-l-~-

-·· .tr ~1,/YV ,a ,a:J ~ ,&,,t 1YJ all Jlv At.~~:;- . ~-

-- -
. . .~. ~ }./CW )l.,2n
-
HHillte
-----
ud,;rh r)u:J,L,Q£ , 11;,1b c ~ _ _
-- - Jiu - 't. hJm dfa I ,lm Jiu ~ .u)r - - - -- -
-
* --- - - - -
iu.h_1.1/4 r--- _x OMd Y _ev ~ i . w . ,!: ~.4-

~rrwr-J j 'I {4 ~ _k jfwr, '/ .{I; t l • ,L

X
y C )<

I'~ JJiA J lu Li1

k/ J .11 /A J
 1
i
1$ J
1
_ _-..._ cl ft

~------
~------'
~
)3
yr 3I ---~

_____----t'!-_eLa_ [ 11 1 11 .,; · - ~ ~ - - ~
·~ 1 - - - t - - - IJ u D
_ V
._ _ )_ ~JM~ f£xmjibm~ -2-,,- -- - -- - - --- - - ------ ---- --
1------------,..-. . If Jjj /& d_j}ent.m 1
[~#frJ'in{A , ,__g J ., ':lun,.em'-a
---- -r-- ,--~D.m.cL 8- .
~
__ __Jv.J_ if1 oJ- ~ .e_ ------ .-""-L-.-L~

_,., ___ --tt ---- -- - ~ ~~- rs -v: :r. E /}_ ;

1 ·.1 d .L.---F---J:>.~
 ~__,__.__~ l--_._ :J y_ . .
Lj-1 _3_ __ ~----·--
~ - - - 1 - L - - L __

...,._--tt----£-+~~6- A /V [J l

~-+- ~ Ulmtd ..ru l j)J it,u u ) /2un DIJ.uj_-.AP...14~~,A,-.I(

..,_._ _+ LlJnd dL_ :J/ IL ~ 7U
J}(J.l° dA ~
~----!---.iula nt Ju JI u:I £ /J;_,j 1?u ) ,6al!i__._.__----....ot

!) 1 , [ IJ 13) - 1-J /) a]
 fA. l)C -z

-----
tl
'
U(J-z ll
A n l3 ·1- Ba -
- ----- - ---- -

' if)- j~d.taJJJ'(j ~ I ,9_~

- J
______-. . ___ fJ u¢ /1 _ r 7
- ~----
fl a Q) .,q
7 11 1 Lr /J1
-
 2

- ------- - - - - - - - 1 - - - - - - - - - .

. . . _ _ - - - - + ' - ------I- _f/ria ~::_j)_ . . {l ( L ¢ / P- -~ Ir.~

1.--------\---,lr...+------~ l!ln, -
am t1
C
jeu 1/ -)

c- -
. ----------------
- - - H - - - - - - : ; - - - - - - - = - - - -- - - - - -- - - - - - . . . 1 !

----++----l--1,.......J._._-,UJJliLcj___:_ _J2- U)_ -r 'n (B ) t~'--,;;r----L.../--¼---L...L..L...l--..,.

- - - , ~ - - - - - = - ' Y ' ) - - - - - - -- - ~- ------

. . . , _ . _ _ . . . ,_ _~->L--

1
J u}lRn'l!. _ m _JA. /rl~ / ____.,_._......,__,
 ~ -t t- -" ~ -" " " "c_,12--1~M I"')
a~, a :n -J _/ 1/ 2 d il l -) _ ------
-----1

~ - + + - - ~~. ~

._ ,_ ._ __ ---- -
.. -- -- + + -- ~~ ,.,,.._a~t-'j k
~ - - f l- - - ~ ~IJ~£lmd .i c1 j, nrAL - 1 - ~ ..C V'-
-"- +--- - - - - = .
..<--~-.:,+
( -----.

~ + t - - - - - -lJi xB , 1
w1_1_11 1 · - ~ - -
-- ~
 b..1.l 1, 62<)
-------·----r-~
+ V:t. - t
I _XL - ~ 1- 7- ' : )
--------,----...
·. .x
-~----= _ Lb - 3) t 'f (,> X - J ) , O

- ~ r - - - - - - . -32±2) -~Jt-3)~
___,_-;:---.,.,. .,. ------:;;;:--------,..--.
-- "2 3
3 2
r------ 7) {f ()/Y)) 2 h ( 5) ·t

--------- _ _]_J ~J~_z- ]o_y· ·-t__f_£_/- - = - Yl {Jf)Jil__ ___ _

- - ~ __ Yl{f}_ I) !J) ·1-_ _ J_lS _:: _ ]J_1._ _ b R__ 1 - _ --- -----

- - .

1------+------ ____ _£ cl_ y ._ 2 q LI 8

~----.+-------~ - - - - Gc-{ ' ui 'ta
I J.r
=>. c..> 1
t-]'tlt :,X ) ' ) ()_
(. ~
1/
 ~
] Prove for an t
y WosetsAandBth
at, (A u B)' = A' n B'.

[ AKTU 2014-15, Marks os 1

-AnsWer -I

Let x E (A uB)'
⇒ xeAuB
⇒ x e A and x e B
⇒ XEA'andxEB'
⇒ x EA' n B'
⇒ (A u B)' c A' n B' ... (1.8.1)
Now, let x EA' nB'
⇒ x EA' andx EB'
⇒ x e A and x ~ B
⇒ e
(A uB)
x
x E (A uB)'
(A' n B') c (A uB)' ...(1.8.2)
From eq. (1.8.1) and (1.8.2), (A u B)' = A' n B'
Qu.e 1.9. ILet U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the ordering of
elements of U has the elements in increasing order; that is, ai = i.
What hit strings represent the subset of all odd integers in U, the
subset of all even integers in U, and the subset of integers not
exceeding 5 in U?

Answer j
Since U = {1,2,3,4,5,6, 7, 8, , 9 10}
Le t the subset of all odd integers be s1' i.e.,
s = {1, 3, 5, 7, !)}
1
subse.. t of' aJJ even integers be s , 1.e., ·
2
,r;'l. = {2, 4, 6, 8, 10} .
and the subset of integers not exct•rding fi ho 8 3' i.e.,
s. = { 1, 2, :j, 4' 5} ,.
'nle b't1 string
. .i • t'
by characteristic June ion 18
.. given ns folloW8.
 o · - - - - ,1-- - - - - - - - - - -

- ' If A and B are two subsets of universal set, then prove 1

the following :
a. (A-B) = (B-A) iffA=B
b. (A - B) = A iffA n B = cl>
Answer
a. Let A= B
Consider any element x E A - B
⇒ x E A and x ~ B
⇒ xEBandx~A
⇒ XE B-A
... (1.10.1)
A-BcB-A
Conversely, if x EB- A
⇒ x EB andx ~A
⇒ x EA andx ~ B
⇒ XEA-B
B-AcA-B ... (1.10.2)
From eq. (1.10.1) and (1.10.2), we have
ff A=B ⇒ A-B=B-A
Now let A-B = B-A
Let XEA-BMA-B=B-A
XE B-A
Now xEA-B ⇒ xEAandx~B ... (1.10.3)
and x E B -A ⇒ x E B and x ~ A ... (1.10.4)
Eq. (1.10.3) and (1.10.4), can hold true whenA = B
b. Let A-B=A
To show An B=$
Let *
A n B $ and let x E A n B and x ~ $
⇒ xEAandxtB
⇒ x E (A - B) and x ~ B [·:A -B = .41
⇒ x E A and x t B and x E B
⇒ XE$
which is a contradiction.
:. A nB = tj>
Now conversely, let An R = ¢>
'fo show A ~ B = A
Let x 1\ n I

., < 1\ n nd .x (ii: lJ
:x. c A las An B = ct,)
A He A ... ( 1.10.5)
Conversrly, let :x r A
x t. A and x rt: R las An B =+l
C (CSIIT-Sem-3)
Set Theory, P ~u
⇒ XEA-B
:. A~A- .B
From eq. (1.10.5) and (1.10.6),
A=A-B
 ""
+J
~I
.,___LI

.
. .-;..__N'-.:
✓

~r~

i:~t
~~' Jo '

'._
I
I
I
\

\
-- ~
_) 1
\ .'.l'.I
(

~I ~
t< '

·,

r,~ ~
'
("'<~
~~
" ·{ l
..,_--<:'.~I
~ I
I
ti
~
'-

\...

lt·
I

>- : )::,P~ I
I
~
~ .....,
~

0 ~
r) ~ u :
t I

~
---____.--- ~ - - - ----,__,....·•- - - - - - - ~ - - - - - - - -
.. ..,,.,.,,.. f f i l ~ A binary nl■l~n R d)fiilll • set A is said to
••efiexive if there is no element m A which is reJated to itself i.e., I
j
'ii a EA such that (a , a) ~ R. i
For example: l..etR = {(1, 2), (2, ll, (3, 1)} be a relatien defined on set I

I'
As: {l, 2, 3}. AP, (1, 1) ~ R, (2, 2) ~ Rand (3, 3) ~ R . Therefore, R 1~
i1"Nfiexive relation. i
s. Non-reflexive relation: A relationR defined on ~etA is said to be non- ~
reflexive ifit is neither reflexive nor irreflexive i.e .. some elements are

4.

5.
related to itself but there exist at least one element not related to itself.
Symmetric relation : A binary relation on a set A i~ ~nid to be
symmetric if (a, b) ER:..;:> (b , a ) ER .
Asymmetric relation : A binary r e1ation on a ~et A h~ ~aid to be
asymmetricjf (a , b) E R ~ .(b , a)~ R .
I
6. Antisymmetric relation: A binary relation R defined on o setA 1~ satd
to antisyn1u1etric relation if(a. b) c Rand (b. a) R > a bi e., aRb und
bRa ..;!> a = b for a, b E R.
7. Transitive relation : A binary re]ation R on a set A is tr n t \
whenever (a , b) < Rand (b , c) E R then (a, c) R
1.e., aRb and bRc ⇒ aRc.
Qu e 1,14. f Wr ite sho rt Dot es on :
a. Equ iva len ce rela tion
b. Com pos itio n of rela tion
OR
Wri te a sho rt not e on equ alit y of rela tion .

An swe r _ j
a. Equ iva len ce rela tion :
tion if it is
1. A rela tion R on a set A is said to be equ ival ence rela
refl exiv e, sym met ric and tran sitiv e. ,
rela tion are
2. The two elem ents a and b rela ted by an equ ival ence
call ed equ ival ent.
A ifit sati sfie s
3. So, a rela tion R is c~ll ed equ ival ence rela tion on set
foll owi ng thre e pro pert ies_:
(Ref lexi ve)
1. (a, a) ER v a EA "
(Sym met ric)
n. (a, b) ER ⇒ (b, a) ER
(Tra nsit ive)
n1. (a, b) ER and (b, c) ER ⇒ (a , c) ER
b. Com pos itio n of rela tion :
from set B
1. Let R be a rela tion from a set A to B and S be a rela tion
or orde red
to C then com pos itio n of R and Sis a rela tion con sist ing
E B such
pair (a, c) whe re a E A and c E C prov ided tha t ther e exis t b
by RoS .
tha t (a, b) e R cA x Ban d (b, c) e S cB x C. It is den oted
Que l.21.1 The following relation on A - {1 , 2 , 3 , 4} . D e t ermine
·
whether the following :
a. R = { (1, 3), (3, 1), (1, 1), (1, 2), (3, 3), (4, 4)}
b. R=AxA
Is an equivalence relation or not ?

Answer )
a. R = {(1, 3), (3, 1), (1, 1), (1, 2), (3, 3), (4, 4)}
Reflexive: (a, a) E R Va EA
·: (1, 1) ER, (2, 2) <t. R
:. R is not reflexive.
Symmetric: Let (a, b) ER then (b, a) ER.
· · (1, 3) E R so (3, 1) ER
·: (1, 2) E R but (2, 1) <t. R
:. R is not symmetric.
Transitive: Let (a, b) ER and (b, c) ER then (a, c) ER
·: (1, 3) E R and (3, 1) ER so (1, 1) E R
·: (2, 1) E R and (1, 3) E R but (2, 3) <t. R
:. R is not transitive.
Since, R is not reflexive, not symmetric, and not transitive so R is not an
equivalence relation.
b. R =A xA
Since, A x A contains all possible elements of set A. So, R is reflexive,
symmetric and transitive. Hence R is an equivalence relation.
 -~,~-~i1f D ef in e th e te rm fu nc tio n. Al so , gi ve cla ss ifi ca tio n of it.
~~-!,llifi
1. Le t X an d Y be an y tw o no n- em pt y se ts. A fu nc tio n fro m X to Y is a ru le
th at as sig ns to ea ch el em en t x E X a un iq ue ele me nt y
E Y.
2. If f is a fu nc tio n fro m X to Y we wr ite f:
X ➔ Y. .
3. Fu nc tio ns ar e de no te d by f, g, h, i etc .
4. It is als o ca lle d m ap pi ng or ✓tr an sf or mation or co rre sp on de nc e.