Functions Flashcards

1
Q

function

A

maps elements of a set X to elements of a set Y, is a subset of X x Y such that for every x ∈ X, there is exactly one y ∈ Y for which (x,y) ∈ f

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

domain (chapter 5)

A

the set X of f

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

target

A

the set Y of f

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

f maps x to y can be denoted as…

A

(x, y) ∈ f OR f(x) = y

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

when is f well-defined

A

when one element of the domain is mapped to one element of the target

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

when is an element y in the range of f?

A

if and only if there is an x ∈ X such that (x,y) ∈ f

Expressed in set notation as:
Range of f = { y: (x, y) ∈ f, for some x ∈ X }

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

when are two functions equal?

A

if f and g have the same domain and target, and f(x) = g(x) for every element in the domain

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

floor function

A

maps real number to nearest integer in the downward direction

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

ceiling function

A

maps real number to nearest integer in the upward direction

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

nested floor and ceiling functions

A

perform operation on inside first (like brackets)

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

one-to-one (injective)

A

if x1 != x2, f maps different elements in X to different elements in Y

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

onto (surjective)

A

if the range of f is equal to the target Y, for every y ∈ Y, there is an x ∈ X such that f(x) = y

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

bijective

A

if it is both one-to-one and onto

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

if function is onto

A

|D| >= |T|

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

if function is one-to-one

A

|D| <= |T|

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

if function is bijection

A

|D| <= |T| and |D| >= |T|

17
Q

inverse

A

f is obtained by exchanging the first and second entries

f = (x,y), f^-1 = (y,x), if bijection

18
Q

when does a function have an inverse?

A

f: X → Y has an inverse if and only if reversing each pair in f results in a well-defined function from Y to X

19
Q

composition

A

the process of applying a function to the result of another function

20
Q

identity function

A

always maps a set onto itself and maps every element onto itself eg. IvA: A → A, Iva(a) = a for all a ∈ A