range
is the set of all the images of f
subset of codomain
Ran f = { f(x) |x ∈ Dom f } c Codom f
codomain isnt mentioned assume its R
domain isnt mentioned assume it to be the maximal subset of R for which the map is defined
function
f: D-> C is a map from a set D (domain) to a set C (codomain)
for any x in D there is a unique f(x) in C (called the image of x under f)
f: D -> C
x -> f(x)
eg range, codomain, domain of x^2
f: R -> R is given by f(x) = x^2
so Dom f = R, Codom f = R and Ran f = [0, inf) c R
the graph of a function
is the set of all points (x,y) ∈ R^2 (the xy plane) such that x is in the Dom f and y = f(x)
(we often draw it over an interval restricting the function to the same interval - often pick one to include important features)
is a curve but not every curve is the graph of a function
included vs excluded points
shaded circle to indicate an included point
unshaded circle to denote excluded
vertical line test
if any vertical line intersects curve more than once NOT A FUNCTION
even function
f(x) = f(-x)
reflectionaly symmetric
odd function
f(x) = -f(-x)
or f(-x) = -f(x)
rotationaly symmetric
even and odd functions
all functions can be written as the sum of an even + odd function
f(x) = f even(x) + f odd(x)
f even(x) = 1/2(f(x) + f(-x))
f odd(x) = 1/2(f(x) - f(-x))
piecewise functions
diff expressions for diff intervals of the domain
eg f(x) = |x|
x if x>= 0
-x if x <0
step function
common piecewise function
constant on each piece
Eg Heaviside step
0 x<0
1 x>0
operations with functions
sum
difference
scalar multiplication
linear combination
product
ratio
composition
sum (f + g)
f+g(x) = f(x) + g(x)
Dom(f + g) = Dom f ⋂ Dom g
Difference (f -g)
f -g(x) = f(x) - g(x)
Dom(f-g) = Dom f ⋂ Dom g
scalar multiplication (cf)
(cf)(x) = c*f(x)
Dom(cf) = Dom f
linear combinations (af + bg)
(af + bg) (x) = af(x) + bg(x)
Dom(af + bg) = Dom f ⋂ Dom g
product (fg)
(fg)(x) = f(x)*g(x)
Dom(fg) = Dom f ⋂ Dom g
ratio (f/g)
(f/g)(x) = f(x)/g(x)
Dom f/g = (Dom f ⋂ Dom g) \ {x|g(x) = 0}
composition (f֯ºg)
(fºg)(x) = f(g(x))
Dom fºg = {x ∈ Dom g | g(x) ∈ Dom f}
surjective
a function is surjective if Ran f = C
(if for all y within C there exists x within Dom f such that f(x) = y)
injective
f : D-> C is injective if for all x1,x2 within D x1=/=x2 then f(x1) =/= f(x2)
horizontal line test
if no horizontal line intersects the graph of f more than once then f is injective otherwise its not
bijective
a function f: D -> C is bijective if its both injective + surjective
inverse function
a bijective function f: D-> C has a unique inverse f^-1 such that fºf^-1(x) = x = f^-1ºf(x)
Ran f^-1 = Dom f
Dom f^-1 = Ran f ( = Codom f)
y = f(x) iff f^-1(y) = x