Wk 0: The Function and the Field Flashcards
(43 cards)
Set
an unordered collection of objects
Cardinality
If a set S is not infinite, we use |S| to denote the number of elements or cardinality of the set
Cartesian Product
A x B is the set of all pairs (a,b) where a ∈ A and b ∈ B
Cardinality of A x B
If A and B are finite sets then |A x B| = |A| x |B|
Function (informally)
For each input element in a set A, a function assigns a single output element from another set B
Domain of a function
Set A which contains input elements
Co-domain of a function
Set B from which all outputs are chosen
Function (formal)
A set of pairs (a,b) no two of which have the same first element
Image (of an input)
The output of a given input. The image of q under a function f is denote f(q)
f(q) = r or q ↦ r
q maps to r under f
f: D → F
f is a function with domain D and co-domain F
T/F: All elements of the co-domain are images of elements in the domain
FALSE. There might be elements in the co-domain that are not images of any elements in the domain
Caesar’s cryptosystem
Each letter is mapped to one three places ahead
Image (of a function)
The set of all images of inputs. written Im f
Range
Ambiguous - can refer to co-domain or image
FD
For sets F and D, FD denotes all functions from D to F
|FD| (prop.)
|FD| = |F||D|
Identity function
For any domain D, maps each domain element to itself. idD: D → D
Functional composition
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))
Prop. Associativity of function composition
h ∘ (g ∘ f) = (h ∘ g) ∘ f
Functional inverses
Functions f and g are functional inverses if f ∘ g and g ∘ f are defined and are identity functions
Invertible function
A function that has an inverse
One-to-one
f: D→F st f(x) = f(y) implies x = y
Onto
f: D→F st ∀ z ∈ F, ∃ a ∈ D st f(a) = z