Functions and Relations Flashcards

1
Q

If A and B are sets, a relation from A to B is …

A

… a subset of the Cartesian product AxB

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

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 …

A

(x, y) is in R

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Assume a relation R from A to B. What is the domain and codomain of R?

A

A is the domain and B is the codomain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

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:

A
  1. For every element x in A, there is an element y in B, such that (x, y) is in F
  2. 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:

  1. Every element of A is the first element of an ordered pair of F
  2. No two distinct ordered pairs in F have the same first element
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Another definition of domain and codomain of a function that I think it is easiest to understand:

A

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).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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:

A
  1. Every element in X is related to some element in Y
  2. 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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the range of a function f?

A

The range is the set of all values of f taken together.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The image of X under f = the range of f. True or false?

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the set of the images of f?

A

The set of the images of f is the set of all f values taken together.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the inverse image of y? (when y = f(x))

A

The inverse image of y is the set of all values in X that have y as their image.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

When are two functions equal?

A

Two functions are equal if they have the same domain and codomain and their values are the same for all elements of the domain.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is a one-to-one function? (injective)

A

An injective function is a function that maps distinct elements of its domain to distinct elements of its codomain.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How do you check whether a function is injective?

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

When is a function onto? (surjective)

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

When is a function bijective? (one-to-one correspondence)

A

When it is both injective and surjective

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How do you simply define the inverse of a relation?

A

If R is a relation from A to B, then a relation Rˆ(-1) from B to A can be defined by interchanging the elements of all ordered pairs of R.

17
Q

There are three main properties of relations. Can you name them?

A

Reflexivity, symmetry, transitivity.

18
Q

When is a relation reflexive?

A

A relation is reflexive when each element is related to itself.

19
Q

When is a relation symmetric?

A

A relation is symmetric when, if one element is related to another, then the second element is related to the first.

20
Q

When is a relation transitive?

A

A relation is transitive when, if one element is related to another, and that latter is related to a third, then the first element is related to that third element.

21
Q

Good to know.

A negation of a universal statement is a ______ statement

A

Existential

22
Q

The definitions of reflexivity, symmetry and transitivity are all examples of ____ statements

A

Universal

23
Q

When analysing transitivity, if the hypotheses are not met (if one element is related to another and that other is related to a third) then the relation is __________

A

Vacuously transitive

24
Q

When is a relation called “equivalence relation”?

A

When the relation is reflexive, symmetric and transitive

25
Q

If F is a one-to-one correspondence from a set X to a set Y, then there is a function from Y to X that “undoes” the action of F (i.e., sends each element of Y back to the element of X that it came from). This function is called …

A

… the inverse function for F.

26
Q

(g ○ f) (x) = ?
when we set the property that the range of f is a subset of the domain of g

And, how is this function called?

A

(g ○ f) (x) = g(f(x))

The function is called the composition of f and g