0% found this document useful (0 votes)
2 views

XII Relation and Function

The document discusses properties of relations, specifically reflexivity, symmetry, and transitivity, using various examples. It also examines functions, including one-to-one and onto functions, and provides proofs for these properties. Additionally, it explores equivalence relations and the conditions necessary for a relation to be classified as such.

Uploaded by

sujaljasuja208
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

XII Relation and Function

The document discusses properties of relations, specifically reflexivity, symmetry, and transitivity, using various examples. It also examines functions, including one-to-one and onto functions, and provides proofs for these properties. Additionally, it explores equivalence relations and the conditions necessary for a relation to be classified as such.

Uploaded by

sujaljasuja208
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 42

mu

:
· (x⑤x)ER ,

for
Hence ,
R is
Reflexive

For
Symmetry
· -
-

Let (m Y] ER where
.
,
H
, YEA
=> x and work at the place
L
y same .

:
Y and i also work at the same place .

=>> LY ,
] ER

R
Hence ,
is
symmetry -

For Transitive
-
-

and 2) ER where 3, EA
Let (x , y) ER (Y ,
2 ,
2

x and y
=>
work at the same place
and and
I at
y work the same place

: x and
I also work at the
are same place.

=> ( 2) , ER

Hence ,
R is Transitive .

(b) R = &(2 y) ,
: x and
y live in the same
locality's
*
sol same as part A
-
-
(ii) R= <(a ,
b), a = b)

For Reflexive :·
=C for all & EA
a

.
(a a) ER
,

Therefor ,
R is Reflexive

-
For Symmetric :
·
Miscellaneous
-

·
So1/
-
-
Given f(x) = -
x
on R =
Gx (R : -
1xc]
·
1 + | x)

·
f(x)
T x
a

· =

#
- + (x)

x
E
220
;

=>
f(x) =

&xix3 ,

For one-one
-

Put f(x) =
f(ue) where r,
,
NzER

Case I : When v
Ng 0
,,

x1 Uz
- = -
=
1 - x , 1 -
xz

=> x, (1 xz)- = my(l - m, )

M nz
My
-

Mz
,
x, H =
= -
,

=> x =
ug

Case II : When x
, Mz o

x x2
/
- I -

1 +x , 1 + uz

=> r
, (I +2) = My (l + R ] ,

2 + x, 22
=
xz + M, 22
=

=> x ,
= xz
·
Case I : When r 10 and u2 o

·
,

x, x2
- = -

·
1 - x ,
1 +nz

· x2() x, )
(1 + (2)

T
-

=> x
=
.

- => M ,
+
Mitz =
xz - 4
, 22

[
]
= x, -

x2 = -
2x , 42 = m ,
-

420
and -24 >0
12 ,

N T .

.. f(x) is one-one .

For on to :
-
-

Let y = f(x)
x no

E
;
Fu
=)
y =

2 n = 0
- ;
Itm

CaseI
-
: when lo

2
y
=
=
F

x
x)
y(
=
=> -

x
xy
=
=> y -

=> y = x +
xy
=>
y = x(1 + y)

=
=> x

y
· o
=
x0

o
·
=>

· ↓
-
+

-*
· [ ①

T
as
-
I
-

- => y = ( - 1
,
0)

Case It : When x > o


S

y = x
-

1 +x

=> y (1 +x) = x

x
=> y + xy
=

=>
y = x -

xy

=>
y =
x(1 -

y)

=>
= u

30
&

-
2

-By 0
-

=>

5, 0
-

=
o
+
-

=o
-
b I
+o

=> ye[0 1) ,
· for
-

Theref one
,
each
y (-1 , 1)
,
there exist a HER

·
Hence
,
it is on to function

·Injective
Sol 2

For
·
-
-

f
-T
f(uz) Put (vi) =
,
where
, my ER

3 3
= x, =
x2

=> x ,
=
xg

:
f(x) is Injective function .

Sol3 Reflexive
For
-

0 A C A for At P(x)

=>
ARA

: It is
Reflexive

symmetric
For
-

Let ARB Where A, BEP(X)

= ACB

But it is not that


receury is is also a subset
A
of .

i C iSKA 1 for some Sett EP(X)


.

A, B

: R is not symmetric .
· For Transitive

·
:

let ARB and BRC where A, B CE P(X)

·
,

=> ACB and BCC

·
-T => A is also a subset a
of i .
e ACL

: ARC

Hence , R is transitive .

sol4 n !
-
-

Sol5 Givew : A =
2-1 0 1
23 B =
E-4 2)
fig
,
and
,
- , 2, 0
A e i
-
, , , :

and f(x) = r -x gas =


2(x- 1) 1 where n EA
-

%
:

f(x) = x x

f =
(( - 1
, 2) (0, 03, (1 03
, ,
12
,
233
,

·
g(n) =
g(x -
) -
1

:
g = (( - 1
,
2) , 10, 03 ,
(1 ,
0)
,
(2 , 87)

=>> f =
g .
·
SG Given A 1 2 33

·
=
, ,
-

·: A xA = G (1 13
, 11 , 83 41 , 3)

·
, , ,

18 13 . 18 , 87 (8 , 3),
, ,

· (3 13 (3 2) (3 333

T
,
, ,
, ,

-let to be the relation a which is and


on
reflexive containing
(1 , 2)
,
(1 , 3) .

R = G (1 1), 18 23 13 3) (1 8) (1
,
, , ,
,
, , , 333
12 1 and 13 is to it
To it symmetric have to add
.

make
, ,
we

: R = GC1 ,
1)
,
18 23 (3 , 3)
,
,
,
(1 9), 28 13 (1, 3), (3
, ,
, , 13]
but (3, 8) &R Hence it is not
· (3 1) ER and (1, 2) ER ,
,

Transitive
.

cartesian product and (3, 2)


Remaining clement of are (2 3)
.

and if add any there cements to relation


we one
of
,
then other clement must be added to make the relation

symmetry and the complete relation will become


Transitive

also

No recquired Relations
of
·
which and
are
reflexive
but not transitive
symmetric -
-

· option (A)
·
·
sol I
-
-
Given A = 1 2
, , 33

· ·: A xA = G (1 13 , 11 , 83 41 , 3)

·
, , ,

T
18 13 . 18 , 87 (8 , 3),
, ,

-333 (3 13 ,
,
(3 2)
,
(3 ,
,

equivalence relation containing


Let P bet the (1 2)
,
,

(1 2), (8 13)
: R ,
= [ (1 , 1)
,
(8, 2) (3 , 3) ,
,
, ,

1 (2 3) and (3, 9)
order pain 4 , 3) (3 , ,
Remaining
are ,
,

there to o, then we have to add


if we add any one
of
three allo to make it symmetric and transitive
remaining
.

: R2 = &(1 1) ,
,
(2 2), (3 3) (1 , 83, (2 1) (1, 3) (3 1) (3 2) 22
. ,
, ,
. , , 333
, ,
, ,

No (118)
.
of equivalence relations containing
= S .

: Option (B) .

You might also like