- Relations Short Notes
Basics >
-
(i) A (AMB)
A
Only
-
B = -
=
A
B-A B- LAMBI B
(ii) Only
= = .
(ii) A or As or F =
elements not in A
(iv) AXB = (A-B) U (B -
Al
(v) n(AUB) =
n(A) + n(B) -
u(AMB)
(vi) n (AUBU() =
n(A) + n(B) + n() -
n(AMB)
-
n (BMC) -
uCCNAl + n(ARBMC)
(vii) if n(A) then Clubsets CP
p of Al
= =
3
(viii) (AUB)1 =
A'M BI
De Law.
(AMB)
Morgan's
(ix) =
AUBI
Cartesian Product -
AxB =
2(a ,
b) + a = A$bt B)
Question Oriented -
n)(AxB)n(c xD)) =
n(An() n(BnD)
-
* same
goes
over with
simple Cartesian .
Prodt
* Cartesian Product is Distributive over Union
,
Inter
section , Difference
* n(AxBx() =
n(A) .
n(B) -
n(s)
* n)(AXBx()n(DXE F)) u(AD) n(BNE) n(ChF)
=
X - .
* same
goes
over with
simple Cartesian .
Prodt
Relations
* A relation
from Set A- Set B is a subset
of (A x B) -
* No.
Subset
of (AXB) No
of Relations (A-B)
= ·
.
* Preimage $ Image
:
A R 13
↓
Preomageof
Element
Images of in
Elements
* Codomain >
Complete set on which the
-
domain is
mapped .
Question Oriented -
3 All
>
-
a divides bo
b
> a is a
factor of
-
is b
>
-
a a divisor of a
integral
is
multiple of
a
>
-
b an a .
↓
i .
e =
> b =
n(a)
Inverse Relation :
R :
A >
B /Elements b11
type (a
-
:
R B /Elements (b
all
type
: +
A :
Types of Relation >
Defined only for (A-A)
- .
related
1) Identify Every element
of set A is
:
to and to itself
itself only .
2) Reflexive Every element
of A is related to
:
itself
.
242-n .
of Reflexive Relations A :
no on
>
3)
symmetric If Ca blE R then (b a) c R
: .
-
,
,
=
n + n
* Relations
No-
of symmetric on A 2
=
4) Transitive
of
bIER$ L,
:
(a
,