FUNCTIONS
FUNCTIONS
A function F from a set P into a set Q is a relation from
P → Q such that each element of P is related to exactly
one element of set Q.
It is denoted as f:P→Q and it is read as f is function
from P to Q.
Domain of a function
Let F be a function from P →Q . The set P is
called Domain of function F.
Co-Domain of a function
Let F be a function from P →Q . The set Q is
called co-domain of the function F.
Image of a Element
If the element x of P corresponds to y under
function F then y is image of x under function
f and is written as f(x)=y.
Eg: Let A={1 2 3 4} and function f is from A →A.
Find image of
F(1)=3 f(2)=4 f(3)=1 f(4)=2.
Range of a function
It is the set of images of its domain.
Eg: Range of Fn=1,3,4,2.
Type of Functions
Injective function.
Onto/Surjective function.
Bijective(one-one onto fn).
Injective Function
A function f is called one to one if different
elements in x have different images in y
f(a)=f (a1) ⇒ a=a1
˅ (a,a1) ЄX
Onto/Surjective Function
Let f be function from x →y function f is
called an onto function. If each element in y is
the image of at least one element in x or the
range of f=co domain(y).
Bijective Function(one-one onto fn)
Function which is both injective and
surjective is called a bijective fn.
Composition of functions
Consider functions ‘f’ from a →b and ‘g’ from
‘b →c’ the composition of f with g is a function
from a →c defined by gof(x)=[g[f(x)]]
Eg: x={1,2,3} y={a,b,c} z={5,7}
f={(1,a)(2,a)(3,b)}
g={(a,5)(b,7)}
Consider f , g &h all are fn on integers
defined by f(n)=n2 ; g(n)=n+1 h(n)=n-1
Determine hofog , gofoh,fogoh?
Identity function
Consider any set A. Let the function ‘f’ f:A
→A The function f is called an identity.
Function if each element of set A has image
on itself. It’s denoted by IA
A={1,2,3}
IA ={(1,1)(2,2)(3,3)}
f(A)=a ˅ a ЄA.
Equal function
Consider two functions f and h from a set X
to a set y functions f and h are called equal
fns iff f(A)=h(A) ˅ a ЄX
Eg: f={(1,a)(2,a)(3,c)}
h={(1,a)(2,a)(3,c)}
Inverse of a function
If f is a fn from A →B and g is fn from B →A
then , fn
‘g’ is called inverse of fn ‘f’ if gof=I A (f
composite g)
Fog=IB .
Inverse of ‘f’ is denoted by f-1
Eg: A={1,2,3}
B={a,b,c}
f={(1,a)(2,b)(3,c)}
Let f be fn from R →R & g be from R →R are
defined as f(x)=x2-2 & g(x)=x+4 Find gof &
fog and state whether these fn’s are one-one ,
onto and bijective ?
BINARY OPERATIONS ON A SET
Consider a non empty set A and a fn F such that
F:A×A → A is called a binary operation on A.
If ‘*’ is a binary operation on A then it may be
written as a*b. A binary operation can be denoted by
any of the following symbols * + . etc. Thus, + will be
a binary operation
iff a+b ЄG ˅ (a,b) ЄG and a+b is unique.
Eg 1 : The operation of addition is a binary
operation on a set of N.
The operation of subtraction is a binary
operation on a set of integers but not on
natural number because subtraction of 2
natural numbers may or may not be a natural
number.
If G is a non empty set, ‘o’ is a binary
operation on G. Then (G,O) is called a group
If following condition are satisfied.
1) ˅ a,b Є G aob Є G (closure property)
2) ˅ a,b,c Є G ao[boc]=[aob]oc
[Associative]
3) There exist e Є G. If aoe=eoa=a
[Existence of Identity]
4)For each a ЄG there is an element b ЄG
such that
aob=boa=e [Existence of Inverse]
If in addition aob=boa ˅ (a,b) ЄG
Then G is called a commutative or ‘Abelian
Group’.
P.T a set of all integers Z with operation
addition is an abelian group
Let a,b Є Z
∴ a+b Є Z (closure property is satisfied)
Since sum of two integers is an integer,
‘+’ is a binary operation defined on Z.
∴ closure property is satisfied
1+2 =3 1,2,3 Є Z.
If a,b,c are in Z. Then (a+b)+c = a+(b+c)
Since associative law of addition holds for
integers.
The number 0 is in Z such that
0+a = a+0 =a
Eg: 0+5 =5+0 =5
∴ 0 is the Identity element.
If a is in Z then (-a) is also in Z
Such that –a+a=0=a+(-a)
Thus every integer has additive Inverse
a+b=b+a ˅ (a,b) Є z
∴ It satisfies commutative property
Hence (Z , +) is an Abelian group
S.T set Q0 for all non zero rational numbers
forms a group under the operation of
multiplication of rational number.
Closure property
The product of two non zero rational number is
also a non zero rational number.
∴ Q0 is closed w.r.t multiplication.
Associative property
Multiplication of rational number is an
associative composition.
Existence of Identity
Rational number 1 belongs to Q0 also we have
1×a =a×1=a ˅ (a) ЄQ0
∴ Rational number is the multiplicative Identity.
Existence of Inverse
If a ЄQ0 the obviously 1/a belongs to Q0
Also 1/a ×a =1 =a×1/a
Thus 1/a is the multiplicative inverse of a.
Hence Q0 is the group w.r.t multiplication.
S.T a set of all +’ve rational numbers forms
an abelian group under the composition
defined by a*b =ab/2
Let Q+ denote a set of all +’ve rational
numbers
∴ ˅ (a,b) Є Q+
Closure property
ab/2 is also in Q+
∴ Q+ is closed w.r.t operation *.
Associative property
Let a,b,c Є Q+
Commutative Property
Let (a,b) Є Q+ then
Existence of Identity
Existence of Inverse
Let (a,b) Є Q+ The number b is inverse of a.
Then we have
∴ (Q+ , *) is an abelian group.
Properties of Groups
Theorem 1: Uniqueness of Identity
The identity element in a group is unique.
Suppose e & e1 are two identity
elements of group G,
ee1 =e if e1 is the identity element.
ee1 =e1 if e is the identity element.
∴ ee1 =e & ee1 =e1 ⇒ e=e1
but ee1 is the unique of element of G.
Theorem 2: Uniqueness of Inverse
ie inverse of each element of a group is unique.
Let ‘a’ be any element of a group G and ‘e’ be
the identity element.
Suppose b & c are two inverse of a
Ie ab=e=ba
ac=e=ca.
=b[∴ e is the identity element]
b(ac)=be
(ba)c =ec
∴
=c
b=c
Theorem:3
if a,b,c Є G and ab=ac then b=c (left
cancellation law)
a ЄG ⇒ a-1 exist & ЄG
Such that
a-1a=e
Where ‘e’ is the identity element
ab=ac-----------1
a-1(ab)=a-1(ac)[multiplying both sides on left by
a-1 )
(a-1a)b= (a-1a)c [by associative law]
eb =ec
b=c [ e is the identity]
Theorem:4
If a,b,c Є G ba=ca
Then b=c (right cancelation law)
a ЄG ⇒ there exist a-1ЄG
Such that
aa-1 = e
ba =ca------------1
(ba)a-1 =c(aa-1) [ multiply a-1 on both of right]
( ∴ e is the identity element)
be = ce
b=c
Theorem no:5
If the inverse of a is a-1 then the inverse of a-1 is a
Ie (a-1)-1 =a
We have a-1a=e
(a-1 )-1 [a-1a] =(a-1)-1 e (multiply (a-1)-1 on both sides)
[(a-1)-1 a-1]a =(a-1)-1
ea=(a-1)-1 [ e is the identity element]
a=(a-1)-1
P.T (ab)-1 = b-1 a-1 ie inverse of product of two
elements of a group G is the product of
inverses taken in reverse order.
Suppose a & b are any two elements of G
If a-1 & b-1 are the inverses of a & b.
Then a-1a =e =aa-1 (e is identity element)
bb-1 =e=b-1b
Best of Luck!!!