Wk 0: The Function and the Field Flashcards

1
Q

Set

A

an unordered collection of objects

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

Cardinality

A

If a set S is not infinite, we use |S| to denote the number of elements or cardinality of the set

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

Cartesian Product

A

A x B is the set of all pairs (a,b) where a ∈ A and b ∈ B

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

Cardinality of A x B

A

If A and B are finite sets then |A x B| = |A| x |B|

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

Function (informally)

A

For each input element in a set A, a function assigns a single output element from another set B

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

Domain of a function

A

Set A which contains input elements

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

Co-domain of a function

A

Set B from which all outputs are chosen

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

Function (formal)

A

A set of pairs (a,b) no two of which have the same first element

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

Image (of an input)

A

The output of a given input. The image of q under a function f is denote f(q)

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

f(q) = r or q ↦ r

A

q maps to r under f

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

f: D → F

A

f is a function with domain D and co-domain F

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

T/F: All elements of the co-domain are images of elements in the domain

A

FALSE. There might be elements in the co-domain that are not images of any elements in the domain

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

Caesar’s cryptosystem

A

Each letter is mapped to one three places ahead

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

Image (of a function)

A

The set of all images of inputs. written Im f

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

Range

A

Ambiguous - can refer to co-domain or image

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

FD

A

For sets F and D, FD denotes all functions from D to F

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

|FD| (prop.)

A

|FD| = |F||D|

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

Identity function

A

For any domain D, maps each domain element to itself. idD: D → D

19
Q

Functional composition

A

For functions f: A→B and g: B→C, the functional composition of f and g is the function (g ∘ f): A→C defined by (g ∘ f)(x) = g(f(x))

20
Q

Prop. Associativity of function composition

A

h ∘ (g ∘ f) = (h ∘ g) ∘ f

21
Q

Functional inverses

A

Functions f and g are functional inverses if f ∘ g and g ∘ f are defined and are identity functions

22
Q

Invertible function

A

A function that has an inverse

23
Q

One-to-one

A

f: D→F st f(x) = f(y) implies x = y

24
Q

Onto

A

f: D→F st ∀ z ∈ F, ∃ a ∈ D st f(a) = z

25
Q

Prop. Invertible functions are one-to-one

A

TRUE. To prove: Assume false and f-1 contradicts definition of function

26
Q

Prop. Invertible functions are onto

A

TRUE. To prove: Assume false and f-1 contradicts definition of inverse

27
Q

Function Invertibility Theorem

A

A function f is invertible ⇔ it is one-to-one and onto

28
Q

Procedure

A

A description of a computation that, given an input, produces an output

29
Q

Computational problem

A

An input-output specification that a procedure might be required to satisfy

30
Q

Procedure vs. Computational problem

A

1) Functions / CPs don’t tell us how
2) Many procedures may exist for same spec
3) CP may allow several diff outputs for same input

31
Q

Uniform distribution

A

pdf which assigns the same probability to each outcome

32
Q

Probability distribution function (pdf)

A

1) Assigns a nonnegative probability to each possible outcome
2) Probabilities of all possible outcomes must sum to 1

33
Q

Translation of complex number

A

f(z) = z + z0

34
Q

Scaling (of a complex number)

A

Multiplication by a scalar

35
Q

Reflection (of a complex number)

A

Multiplication by -1

36
Q

Rotation (of a complex number)

A

f(z) = z * eτ<strong>i</strong> does rotation by an angle τ in radians

37
Q

Euler’s formula

A

For any real number θ, eiθ is the point z on the unit circle with argument θ

38
Q

GF(2)

A

Galois Field 2; contains elements 0 and 1

39
Q

Addition in GF(2)

A

XOR

40
Q

Multiplication in GF(2)

A

Same as integer multiplication

41
Q

one-time pad

A

If each bit is encrypted with its own one-bit key, it is unbreakable

42
Q

Argument of z ∈ ℂ

A

Angle in radians between z arrow and 1 + 0i arrow

43
Q

z = reθ<strong>i</strong>

A
  • r is the absolute value of z
  • θ is the argument of z