FUNCTIONS Flashcards
(151 cards)
WHAT IS A FUNCTION
f : A- → B relation is said to be - a function if every element of A is mapped with unique element in B . i.e every element in A has only one image in B .
DESCRIBE A FUNCTION IN TERMS OF 1-1 OR MANY-1 1-MANY AND MANY-MANY
Every function is either I - l of many one relation . But converse is not true i -e every l - I , many one relation need not be function .
WHAT IS DOMAIN
THE COLLECTION OF ALL INITIAL ELEMENTS
WHAT IS RANGE
COLLECTION OF IMAGES OF DOMAIN
WHAT IS CODOMAIN
COLLECTION OF FINAL RESULTS. RANGE IS A SUBSET OF THIS
WHAT IS IMAGE
F(D)
D IS ANY ELEMENT IN DOMAIN
WHAT IS PREIMAGE
OPPOSITE OF IMAGE
UNDER WHAT CONDITION CAN YOU. USE OPERATION OM FUNCTIONS
YOU CAN ONLY USE IT ON. THE INTERSECTION OF 2 DOMAINS
Domain of f= {1,2) (3,-2) (5,6) (0,4) Domain of g= {1,8) (2,1). (5,0), (4,1)} find f+g f-g f*g f/g
f+g={{1,10],[5,6]}
f-g={ ( 1,-6) ,( 5,6) }
f*g={ (1,16)( 5,0) }
f/g={1,2/8} (REMEMBER THAT YOU DONT CONSIDER 5 AS DIVISION BY 0 IS NOT POSSIBLE)
domain of root(f)
x/f(x)>0
NUMBER OF FUNCTIONS
IF n(A) =m. n (B) = n
THEN
n^m
WHAT IS 1-1 OR INJECTIVE FUNCTION
if all distinct elements in A
have distinct images in B .
what are the characteristics of an injective function
If f is 1 - 1 function then no two elements in A have same image in B . ( ii) every element in range has exactly one pre image in domain ( iii) every element in codomain has at most one pre image in domain (iv) n(A)<=n(B)
how do you check a function using graphs
A- graph represent function if every
vertical line from domain intersects graph in
exactly one point .
how do you check a injective function using graphs
If every Horizontal line
from codomain intersect graph of f
in almost one point(0 or 1 point)
what can you say about a continuous graph
A continuous function graph is 1-1
if graph is strictly increasing or
strictly decreasing .
NUMBER OF INJECTIVE FUNCTIONS
nPm
what is many one function
function is said to be many one function if f is not 1-1
NUMBER OF MANY ONE FUNCTIONS
n^m-nPm
what happens if m>n
number of many one functions=n^m
what is onto function(surjective function)
function is said to be onto function if every element of codomain has atleast one preimage in domain . range=codoman n(A)>n(B)
how do you check a surjective function using graphs
graph represents
onto ( surjective ) function if every
Horizontal line from codomain intersect
graph in atleast one point
number of onto functions
n^m-nC1(n-m)^m+nC2(n-2)^m-nC3(n-3)^m………
what is bijective
function is
said to be bijective if f is 1-1 and onto
every
element in codomain has exactly
one pre image .
n(A)=n(B)