question  |
réponse |
describe a function from A to B. commencer à apprendre
|
|
A (total) function f from A to B, f: A->B, is a relation from A to B such that for all x ∈ A there is exactly one element in B, f(x) associated with x by a relation f
|
|
|
how is the expression f(x) read? commencer à apprendre
|
|
"f of x" or "f at x" or "f applied to x" also called the image of x
|
|
|
If f: A->B and f associates the element x ∈ A with the element y ∈ B what do we write? commencer à apprendre
|
|
f(x) = y or "f maps x to y ".
|
|
|
explain x ∈ A maps to y = f(x) ∈ B commencer à apprendre
|
|
A (total) function f maps a set of inputs (the set A) to the outputs (the set B)
|
|
|
what is the function f from N -> N that maps every natural number x to its cube x^3 commencer à apprendre
|
|
|
|
|
what is a partial function? commencer à apprendre
|
|
A partial function from A to B is like a function except that it might not be defined for some elements of A
|
|
|
Let f: A -> B (f is partial or total): What is the domain of f? commencer à apprendre
|
|
The subset D ⊆ A of all elements for which f is defined is called the domain of f. In case of a total function D=A. In case of a partial function, D ⊂ A
|
|
|
Let f: A->B(f is partial or total): what is the co-domain? commencer à apprendre
|
|
The set B is the co-domain of f
|
|
|
Let f: A->B(f is partial or total): what is the range of f? commencer à apprendre
|
|
range(f) = {f(x) |x ∈ A} or The range (image) of f, denoted by range(f), is the set of elements in the co-domain B that are associated with some element of A
|
|
|
when is a function such as f: A->B called injective? commencer à apprendre
|
|
A function f: A->B is called injective (also one-to-one) if it maps distinct elements ofA to distinct elements of B. or for all x, y ∈ A if x ≠y => f(x)≠f(y)
|
|
|
when is a function such as f: A->B called surjective? commencer à apprendre
|
|
A function f: A->B is called surjective (onto) if the range(f)is the co-domain B. To put it another way for all y∈B there exists x∈A such thatf(x)=y
|
|
|
when is a function such as f: A->B called bijective? commencer à apprendre
|
|
if it is both injective and surjective
|
|
|
Let f: A->B and g: B->C be functions. what is the composit of g with f commencer à apprendre
|
|
The composition of g with f is the function denoted by g ∘ f: A->C and denoted by(g∘f)(x) = g(f(x))for all x∈A
|
|
|
how is (g∘f)(x) =g(f(x)) read? commencer à apprendre
|
|
as g of f, this means do f first then g
|
|
|
Suppose f:->! Y is a bijective function what is the inverse? explain. commencer à apprendre
|
|
the inverse function f^-1: Y->X that is denoted asfollows: f-1(y) = x if and only if f(x) = y
|
|
|
