[go: up one dir, main page]
Scribd
Upload
385 views27 pages

XII Formulas

The document defines various types of relations between sets, including empty, universal, reflexive, symmetric, transitive, antisymmetric, and equivalence relations. It also explains the concepts of domain, range, inverse relations, equivalence classes, and functions, particularly focusing on one-to-one functions. Each type of relation is characterized by specific properties that dictate how elements from one set relate to elements in another set.

Uploaded by

r529jpydz5
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
385 views27 pages

XII Formulas

The document defines various types of relations between sets, including empty, universal, reflexive, symmetric, transitive, antisymmetric, and equivalence relations. It also explains the concepts of domain, range, inverse relations, equivalence classes, and functions, particularly focusing on one-to-one functions. Each type of relation is characterized by specific properties that dictate how elements from one set relate to elements in another set.

Uploaded by

r529jpydz5
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/ 27

it(' 1/elation

: Tf A and Jl aite two non - emp!V sets , then an� subset R of AX B is called
Relation f11om set A to B. i.e. l 'R : A�� � 'R � AX 8 I
If (1,�)E R then we WJ-tite x®�ad as xis 'R nelated to�) and
Tf (1,�)(R then we WJ-tite x@� (1tead as xis not 'R nelated to�)
�
ft( Domaivi and Ranie of CA Relation : If R is an� 11,e.laHon f11.0m Set A to Set B then,

• Domaivi of R is the set of all (i11st coondincdes o( elements of R and is de11otecl b� JJom{RJ.

• Ran�e of R is the set of all second coond/ nates of R and it is denoted b Range (R J
�
A >te/aUon R. on set A means , the nelation fttom A to A i.e., I 'R � Ax A]
f££mptv Relation : A 'Relation ·'R in a set ·A is called empt'i nelation, tf 'YID element of A is
Jtelated to anv element Of A I i',e, IR -= tP C AX A I
r£Unive11sal Relotiorz : A 'Relation 'R in a set A is called univensa.l nelation each of A is
Jtelated to even element of A, i'-e. IR -= AX A I
f.irtJ.entit� Relation: R ={('r,): X£A, eA, x = } OR. IR = f(x,x); xeAJI
A Relation R in a set IJ is called -
r£Reflexive Relation : If Ca,a) € A , fox even� a EA
fis�mmetnic Relation : If (a,, a 2) e R implies {Oz. , a,) e R fon all a,, az € A

f£ Tnansltive Relation : If (a,, a 2 ) e R and ( a 2 , a 3 ) E 'R implies (a,, o. 3) E R fon all o,, a2 , a1 € A

f££q11ivalel'lce Rela.Uon : If 'R is Jteflexive, s�mmetn,ic and tnansitive

ftAntisvmmetJtic_Re_tation : A ne(ation R in a set fl is a nti��mmetnic.


lf ICa, b) € R ( b, a) e R => a= b v a, b e R I
f£ Invense Relation. : If A and 13 ane two non - empty sets and R be a 11ela.tion fnorn R to 8,
such that 'R ={Ca, b) : a EA , b € B j , then the inve11se of R, denoted b� R- 1,
is Q nelation fnom ,8 to A and is defined bu R- = f (b a): (QI b) f R
1
I JI
r£'£quivalence class : Let � be an equivo.lence he/ation on a non - empt� set A . Fon all a€ A ,
the e�uivalenc.e class of 'a' is defined as the set of all su.ch elements of P.
which cine Jt.elated to 'a' undrn 'R. 9t is denoted b fo. 1.
i.e. a] = equivalence class of 'a' :: 'X € A : C x., a)£ R
r£i=unct,'on : Let X and Y be two non - empt� sets. Then a nu.le f which associates
to each element x e X, a unt'4u.e element, derioted by f {;l) of Y, is called
a function fnom X to Y and WFtitten as f: X � Y whehe , f{x) is called ima9e of x
and x is called the pxe - i ma�e of f fa) and set Y is called the co- domain off
and r (X); { f (X) : Xe X j is called the }la�e of f. I

f£One- One OR T"fljedive Function : A function f: X � Y is defined to be one - one if the


i ma�es of distinct element of X unden f atte distinct ;
-
ie x
.... -l, - , - -
'X 2 _ € _ X
__: _ f _(_x_
,
> _
'X= _ f _ ( _
......,..
z _>_ -:> -,-=---zl Othenwise f is called man - one.
-x 'X
�
(Note):- .. Set always denoted blf capital Lettens ( A, B, C, D .... ) ---\..- �-
.. £/ements of a set always denoted blf small Lettens (a,b,c,d .... )

You might also like