Functions and Relations Flashcards
If A and B are sets, a relation from A to B is …
… a subset of the Cartesian product AxB
So, a relation R from A to B (sets) is a subset of AxB. Given an ordered pair in AxB (x, y), x is related to y by R, if and only if …
(x, y) is in R
Assume a relation R from A to B. What is the domain and codomain of R?
A is the domain and B is the codomain
A function F from a set A to a set B is a relation with domain A and codomain B that satisfies the following properties:
…
- For every element x in A, there is an element y in B, such that (x, y) is in F
- For all elements x in A and y, z in B,
if (x, y) is in F and (x, z) is in F, then y = z
Easily put as:
- Every element of A is the first element of an ordered pair of F
- No two distinct ordered pairs in F have the same first element
Another definition of domain and codomain of a function that I think it is easiest to understand:
The domain is the set in which the variable x takes values.
The codomain is the set in which the function f(x) takes values (the set of the images of the function).
Let’s repeat: A function f from a set X to a set Y is a relation from X (the domain) to Y (the codomain) that satisfies two properties:
…
- Every element in X is related to some element in Y
- No element in X is related to more than one element in Y
SOOOO Every element in the domain is related to one and only one element in Y.
What is the range of a function f?
The range is the set of all values of f taken together.
The image of X under f = the range of f. True or false?
True
What is the set of the images of f?
The set of the images of f is the set of all f values taken together.
What is the inverse image of y? (when y = f(x))
The inverse image of y is the set of all values in X that have y as their image.
When are two functions equal?
Two functions are equal if they have the same domain and codomain and their values are the same for all elements of the domain.
What is a one-to-one function? (injective)
An injective function is a function that maps distinct elements of its domain to distinct elements of its codomain.
How do you check whether a function is injective?
you set f(x1) = f(x2) and see if it leads to x1 = x2. If yes, then the function is injective
btw, all linear functions are injective, when a in ax+b=0 is != 0
When is a function onto? (surjective)
A function f from a set X to a set Y is surjective, if for every element y in the codomain Y of f, there is at least one element x in the domain of X of f such that f(x) = y
SO, every element of Y has to be related to an least one element of X for the function to be surjective
When is a function bijective? (one-to-one correspondence)
When it is both injective and surjective