types of functions › guides › wp...a function is a relation that map each element x of a set a...

2
A function is a relation that map each element x of a set A with only one element y of set B FUNCTIONS Types Of Functions A B 5 6 7 8 9 2 3 4 5 6 7 (1) One to one function/ Injective f: A B is one to one if every element of A has distinct image in B. A B a b c d e (2) Many to one function f: A B is many to one if two or more elements of A have same image in B A B a b c d e f g (3) Onto function/ Surjective f: A B is onto if every element of B is related to at least one element of A A B e f g a b c d (4) One-one and onto function / Bijective f: A B is one-one and onto if it satisfies both the condition for one-one and onto A B a b c d e f g h Function f: A B is given as y= f(x) Composite functions f: A B and g: B C can be composed to form a function which maps from A to C. A composite function is denoted by x A f g gof f(x) B g(f(x)) C (gof)(x): g(f(x)) For a function to be invertible it needs to be both one-one and onto function If Then Invertible functions A B f B A f -1

Upload: others

Post on 27-Jan-2021

2 views

Category:

Documents


0 download

TRANSCRIPT

  • A function is a relation that map each element x of a set A with only one element y of set B

    FUNCTIONS

    Types Of Functions

    A B

    56789

    234567

    (1) One to one function/ Injective f: A B is one to one if every element of A has distinct image in B.

    A B

    ab

    cde

    (2) Many to one functionf: A B is many to one if two or more elements of A have same image in B

    A B

    abc

    defg

    (3) Onto function/ Surjectivef: A B is onto if every element of B is related to at least one element of A

    A B

    efg

    abcd

    (4) One-one and onto function / Bijective

    f: A B is one-one and onto if it satis�es both the condition for one-one and onto

    A B

    abcd

    efgh

    Function f: A B is given as y= f(x)

    Composite functionsf: A B and g: B C can be composed to form a function which maps from A to C.A composite function is denoted by

    x

    A f g

    gof

    f(x)

    B

    g(f(x))

    C

    (gof)(x): g(f(x))

    For a function to be invertible it needs to be both one-one and onto function

    If

    Then

    Invertible functions

    A Bf

    B Af -1

  • Relation R from set A to set B is a subset of the cartesian productA X B and is derived by describing a relationship between �rst and second element of the ordered pair A X B

    RELATIONS

    (2) In roster form

    (1) Set buider formR= { (x,y), x is square of y, x Є A and y Є B }

    R= { (9, 3), (9, -3), (16, 4) , (16, -4), (25, 5), (25, -5) }

    Representation Of Relation

    Terminologies related to Relations

    Domain = Collection of elements of A = {5, 6, 7, 8 , 9}Co-domain = Collection of elements of B = {7, 8 , 9, 10, 11,12}Range = Collection of elements of B related to A = {7, 8 , 9, 10, 11}

    Types Of Relation

    (2) Identity Relations/Re�exive

    (1) Universal Relation

    (4) Symmetric RelationFor a relation R, if (a,b) Є R then(b, a) Є R; V a, b Є A

    R is a relation from A to B then R-1 is inverse relation from B to A

    (5) Transitive RelationFor a relation R, if (a,b) Є R ,(b, c) Є R then (a, c) Є R; V a, b, c Є R

    (6) Equivalence RelationA transitive, symmetric and re�exive relation is an equivalence relation.

    (3) Inverse Relation

    Each element of A is related to every element of Ai.e, R= A X A

    Each element of A is related to itselfi.e, R= { (a,a) a Є A}

    Number Of Relations

    If A has h elements and B has k elements then number of relations from A to B are 2hk.

    A B

    91625

    3-34-45-5

    For A={ 9, 16, 25} B= { 5, 4, 3 , -3, -4,-5}Here, relation is that elements of A are square of elements of B

    A B

    789

    101112

    56789