INTRODUCTION
Course Contents
FUNCTIONS: Introduction to functions, Types, Algebra
LIMITS AND CONTINUITY: Introduction to limits, Techniques of funding limits,
Indeterminate forms of limits, Continuous and discontinuous functions and their
applications
DIFFERENTIAL CALCULUS: Concept and idea of differentiation, Geometrical and Physical
meaning of derivatives, Rules of differentiation, Techniques of differentiation, Rates of
change, Tangents and Normal lines, Chain rule, implicit differentiation, linear
approximation, Applications of differentiation; Extreme value functions, Mean value
theorems, Maxima and Minima of a function for single-variable, Concavity
INTEGRAL CALCULUS: Concept and idea of Integration, Indefinite Integrals, Techniques
of integration, Riemann sums and Definite Integrals, Applications of definite integrals,
Improper integral, Applications of Integration; Area under the curve
ANALYTICAL GEOMETRY: Straight lines in R3, Equations for planes.
BOOK
Functions
OBJECTIVE
Revision to functions
Understand function, terms, types,
operations and graphs
DOMAIN
INPUT
FUNCTION
OUTPUT RANGE
EVERY INPUT MUST HAVE AN OUTPUT
TWO DIFFERENT INPUTS CAN HAVE THE SAME OUTPUT
ONE INPUT CAN HAVE ONLY ONE OUTPUT
FUNCTIONS
Given any sets A and B, a function f from (or
“mapping”) A to B
f:AB
is an assignment of exactly one element
f(x)B
to each element
xA.
it can be written in form of an equation
y=f(x)
DOMAIN & RANGE
The set of all values of the input
(independent variable) is called the domain.
The set of all possible values of the output
(dependent variable) is called the range.
SOME FUNCTION TERMINOLOGY
If f:AB, and f(a)=b (where aA & bB), then:
A is the domain of f.
B is the codomain of f.
b is the image of a under f.
a is a pre-image of b under f.
In general, b may have more than one pre-image.
The range RB of f is {b | a f(a)=b }.
9
TYPES OF FUNCTION
SURJECTIVE (ONTO)
A surjective function is a function whose image is equal to its
codomain. Equivalently, a function 𝑓 with domain 𝐴 and
codomain 𝐵 is surjective if for every 𝑏 in 𝐵 there exists at least
one 𝑎 in 𝐴 with 𝑓 𝑎 = 𝑏. If f : A B , then f is said to be surjective if:
b B a A, such that f (a) b.
INJECTIVE (ONE-TO-ONE)
A function 𝑓 is injective if and only if for all 𝑎 and 𝑏 in 𝐴, if
𝑓 𝑎 = 𝑓(𝑏), then 𝑎 = 𝑏; that is, 𝑓 𝑎 = 𝑓(𝑏) implies 𝑎 = 𝑏.
Equivalently, if 𝑎 ≠ 𝑏, then 𝑓(𝑎) ≠ 𝑓(𝑏). If f : A B , then f is said to be injective if:
a, b A if f (a) f (b) a b.
BIJECTIVE
A function is bijective (one-to-one and onto or one-to-one
correspondence) if every element of the codomain is
mapped to by exactly one element of the domain. (That is, the
function is both injective and surjective.)
FUNCTION ADDITION/MULTIPLICATION
We can add and multiply functions
f,g:RR:
(f g)(x) = f(x) g(x)
(f × g)(x) = f(x) × g(x)
12
FUNCTION COMPOSITION
For functions g:AB and f:BC, there is a special operator
called compose (“○”).
Itcomposes (i.e., creates) a new function out of f,g by applying f to
the result of g.
(f○g):AC, where (f○g)(a) = f(g(a)).
Note g(a)B, so f(g(a)) is defined and C.
The range of g must be a subset of f’s domain!!
Note that ○ (like Cartesian , but unlike +,,) is non-commuting.
(In general, f○g g○f.)
13