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

Lecture-06

The document discusses the concepts of Cartesian products and relations between sets, defining a relation as a subset of the Cartesian product of two sets. It introduces equivalence relations, which are reflexive, symmetric, and transitive, and provides examples of these concepts using matrices and functions. Additionally, it presents exercises to determine specific relations and properties of matrices.
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)
12 views

Lecture-06

The document discusses the concepts of Cartesian products and relations between sets, defining a relation as a subset of the Cartesian product of two sets. It introduces equivalence relations, which are reflexive, symmetric, and transitive, and provides examples of these concepts using matrices and functions. Additionally, it presents exercises to determine specific relations and properties of matrices.
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/ 5

eture
6

Cartesian
- Product Given two
non-empty
Sets X & Y ,
their cartesian product XxY
is the set
consisting of all ordered pair
elements from X and Y
of ,
namely
x Y x =

((x ,
4) : xex and yeY] .

Relation
-
A relation between non-empty
sets X and Y is a subset R of
X xY-
RY Cread
thated
we it as
say
x

" is to
y") if (x 8) +R.
,

Example : On R consider the relation


,

R =

<(x, y) ERxRR : +
y =

3 .

ER be such that 1x17 1,


If
·

then s is NOT related to


any
I GR ·
Take xER such that

·
pul11 .

Then R Fir and xR truY .

Exercise : Let X= &190} 9 the set


of all
non-zero integers
->
.

Define ,
the relation R on x (that is
,

R = xxX) by the rule that muRn

if and only if m divides n .

Determine R .

also
Let us
a
denote a relation "R" on a nonempty
Set X by "

relation :
Equivalence
-
[
set X
A relation e on a non-empty
is said to be an nivalence relation if
eq
reflexive that is xvx
(i) ~ is , ,

for every xt X -

that is
(ii) is
symmetric , , if rvy
then
y ~x .

)
(III ~ is transitive , that is, whenever
and yvz then x ~I
x
~y
.

,

ample ·

· Given a matrix AtM(n , R) we


,

say that A is invertible


if there

exists BeM(
,
IR) such that

I
0

9100
...
o

0 10 -- -

00

1000-
BA =
= 001---00

. 01

Fas : 0
I If A is invertible with B
,

such that BA= I then


·
it also follows that AB =

I .

and such that


② If B
, By are

B A= I B
BA then =
Ba
=

, ,
, .

denote
So ,
we can the
(unique)
inverse of A
by At .
-2
relation M(n 1)
·
Define a ~on ,

as follows : Given A, BEMCn R ,

A WB if and only if there exists


an invertible matrix P such that

B =
PAP .

Exercise: The above relation ~


-

is an
nivalence relation on

eq
M(n , R) ·

Example
->
Let f : x-Y be a function
Define ~ follows :
on X as Given

2 guzXy4rlg if and
only
if f(2) f(x)
=
·

reflexive
8

symmetric
·

A transitive /

Such a relation on X is said to be


the relation induced by f .
On M(2, R) , consider ⑤
f : M(2
, R) ->R
det A
defined by f(A) =

(for a =

[ 2 ] , detA=ad-bc)
- .

Consider the relation on M(2 , R)


induced two matrices
by f .
Then

A & B will be related precisely


when their determinants are
equal .

You might also like