functions definitions Flashcards
function
Let A and B be sets. A function from A to B is a rule that associates every element of A to exactly one element of B
image
if f: A->B and x∈A, then the element of B associated to x by f is called the image(range) of x via f. denoted by f(x).
pre image
if f: A->B and y∈B then any element x∈A such that f(x)=y is called the pre image of y via f.
range
The image(range) of a function f:A->B is the subset of B whose elements are the images of the elements of A.
Graph of a function
Let f: A->B. The graph of f is the set ⌈f = {(x,y)∈AxB: y=f(x)}
Restriction
Let f:A->B. Let S⊆A. The restriction of f to s if the function f|ₛ: S->B defined by f|ₛ(x)= f(x) for all x∈S
Composition
Let f: A->B and g: C->D. Assume that f(A)⊆C (if B=C then definitely true) Then the composition of g and f is the function g∘f: A->D. defined by g∘f(x) = g(f(x)) for all x∈A
identity function
let A be a set.The identity function of A is the function id: A->A defined by id(x) = x for all x∈A
constant function
a function f:A->B is said to be constant if there exists b∈B such that f(x)=b for all x∈A.
invertibility
Let f:A-B. we say that f is invertible if there exists a function g:B->A such that for all x∈A and y∈B f(x) = u <=> g(y) = x
injective
Let f:A->B we say that f is injective (or one-to-one) if for all x, x’∈A: x!=x’ => f(x)!=f(x’).
or
f is injective iff every y∈B has at most one preimage in A
srujective
Let f:A->B we say that f is surjective (or onto) if f(A)=B
or
f is surjective iff every y∈B has at least one preimage in A
injective simply
Two inputs don’t give the same output
surjective simply
An input can give any output even if its a repeated output
bijective
|Let f:A-B why say that f is bijective if it is both injective and surjective i.e. it has exactly one preimage in A for every y∈B
parity
Let f: A->ℝ for some A⊆ℝ. we say that:
(1) f is an even function if for all x∈A we have -x∈A and f(-x) = f(x)
(2) f is an odd function if for all x∈A we have -x∈A and f(-x) = -f(x)
real valued function of a real variable
f:A->ℝ, where A⊆ℝ
periodicity
let f:A->ℝ for some A⊆ℝ we say that f is periodic if there exists a number ω>0 such that for all x∈A we have x+ω∈A and f(x+ω)=f(x)
fundamental period
if f is periodic and has a minimum period ω>0, then this ω is called the fundamental period of f
monotonicity
Let f:A->ℝ for some A⊆ℝ. we say that:
1) f is increasing for all x,x’∈A x≤x’ => f(x)≤f(x’
(2) f is strictly increasing for all x,x’∈A x f(x) f(x)f(x’)
Boundedness
Let A⊆ℝ. We say that:
(1) b∈ℝ is an upperbound of A is x≤b for all x∈A
(2) b∈ℝ is an lowerbound of A is x≥b for all x∈A
(3) A is bounded above if it has an upperbound
(4) A is bounded below if it has a lowerbound
(5) A is bounded if it is both bounded above and below