Relation

Relation :-) Relation defined from A → B is

any
subset of A✗B_ .

A- = £1,23 ,
13={1,2/3}
( 1,37 (2/1) 12,23 }
( 2,37
A- ✗ D= { ( 1,17 ,
(1/2) ,
, ,
,

[={'→=
Empty relation →
01
-

Universal relation →
A✗B_
'
Pi
Ca b) C- R (b. a) c-

Inverse relation (12-1) ,

'

Ri =
{ 411,411 }
 contains elements
Relation gf set A m
Number
af
:-)

elements then Number

and set B Contains n

subset
of relation from A → B = Number
af
> af A- ✗ B =
2mL

[ Trivial relation →
Empty relation ,
universal
relation

relation -2
Number
of non trivial relation → Number
af
(2m^_2_)
Number
of non
empty relation →
2m72
 Relations
Type of
defined from Aton is reflexive
Reflexive a relation
A
- a c-
if (a,a? ER for every

from Aton is
symmetric a relation defined
- Cb, a) C- R
Symmetric if @ b)
,
ER
 A
A- →

Transitive a relation
"
is called transitive relation

( b , C) C- R Cl C) C- R
if @ ,
b) ER and
- -
,
=

then relation is transitive .

equivalence relation A relation is called

-
equivalence relation iff
and transitive
reflexive symmetric
.

it is ,
 natural Number such that
# A relation is defined on

relation
:{ cn.is and 7-+4=8} Define .

R )

R= { 12,3 ) ,
Co2) 6,11 }

C.
,

{ }
Domain 2,4
→ 6
,

→ { 42,3}
Range
4,67}
Inverse Relation
→ { (3/2)/(2/4) ,
 is
identity relation set A
Identity relation in on

A connected with itself .

element of
every
A- = { 42,3}

relation -_ { 44,421,1331}
Identity
f-

Reflexive =

e
Symmetric

Transitive =

it is not transitive
( For a relation to show
ordered pair
we have to tell an example or
 not tell counterexample then relation is
gf we can

transitive
consider to be like
Identity
relation )

# A set ④ is set
of
all children in
family
is defined
as Ébrotheryy
n
Ry
to be reflexive
relation
Identify symmetric
Transitive
.

① Relation is not reflexive

 ② Relation is not symmetric
is male but b Can
a
@ b) C- R
,

be female

R
③ @ , b)
C- R
and (b ,
C-

as →
→ Ce , C) C- R
-

Lice , bismuth
is transitive
this relation

£1,33 } -4,1333 }
A- =
✗ qq.n.cz ,

Reflexive
see ] @ 23 } gefle
Ref¥x
,
R ,= , ,

(3,33
Ella ,
Rz=
 reflex ie Relation
Number
of
has n elements
Set A

II

( 1
""
A- ✗ A →
' a. as

elements
Non diagonal
⇐ a)
n2
A =L ,
2,33
ri n

[ÉY&f
-

AXA
v

¥:i:÷÷'¥¥
 relation
Number
of symmetric

set Ah¥n elements

A#A

ñ ☐
-_n2
Total elements

no
(a. a) type --

elements
Remaining
six i¥ =
IE =n
?⃝
 Relation
Antisymmetric
( b, a) C- R
( a. b) C- R
Symmetric →

Ca , b) C- R and
C beat c- R Ca=#
Antisymmetric →

{atb } In antisymmetric one

of
both
=

(a , b) or ( bca ) or none
of
can exist .
← ✗

✗ ✗

ere flex ive

C- R but 4,1 ) is not

(A)
✗ Symmetric

e.Transitive

✓ -
.

K2 , 2) (3/3) 4,43 ( 3,2) 4,3 )}

{ ( 2,37 ,
in
4)
in
, , , ,
,
1-

A=
✗

{ i. 2,3 }"t←-
,

(
a

2,17 1¢12
✗

C- R
④ 2)

xx
✗

✗
0
ARB # It ab >

Hard > 04 Reflexive

ARA #

Ca , b) C- R ⇐ tab > °

symmetric
C- R ltebaso
Cbca )
 0
( too 2) I -12W > 0

@ It ab >
/ b) C- R ,

> 0
(21--1) 1+2×(-1-4)>0
☒
It be
R
, c-

/ * ac
> 0
Co ,
-

4) ¢12
@ ,
C- R
=
I -25
It Liotta ) =

-24
=

I
✗ wid , (21-4) but

is
co -4),
not
 A=s } T
Reflexive
Symmetric
Transitive

R =
{¥2 ,
(
2¥37 ,
(1/17,12/2313,3)>[2,1796*(1-11,1311)]
7irs
 -

✗ ✗

serves N -
ytrz is an irrational

irrational number
X-x-irz.is an

(Reflexive
verse ⇐
( True)

an irrational
V2 Itv2 is
FRI # -

national (false)
-421¥
but
# I is
IRR

( V2 2✓z)¢R
( 1,252)
but
¢2 C- R
,

,
1)