Analysis 3 Functions

$\quad$ A function or map $f$ from X to Y is a rule which, for each element of X, specifies exactly one element of Y.
$f: X \rightarrow Y$ or $X \rightarrow Y, X \mapsto f(x)$
$\quad$ Here $f(x) \in Y$ is the value of $f$ at x.
The set X is called the domain of f and is denoted $dom(f)$, and Y is the codomain of f.
$\quad$ Finally $im(f) := {y \in Y; \exists x \in X : y=f(x)}$ is called the image of $f$

$\quad$ If $f: X \rightarrow Y$ is a function, then
$graph(f) :={ (x,y) \in X \times Y; y=f(x) }={(x,f(x)) \in X \times Y; x \in X}$ is called the graph of f. Clearly, the graph of a function is a subset of the Cartesian product $X \times Y$.

3.1 Remark
A function $X\rightarrow Y$ is an ordered triple (X, G, Y) with $G \subseteq X \times Y$ such that, for each $x\in X$, there is exactly one $y\in Y$ with $(x,y) \in G$.
(This definition avoids the useful but imprecise expression ‘rule’ and uses only set theoretical concepts)

3.2 Examples
a. identity function
b. If $X \subseteq Y$, then $i: X \rightarrow Y$, $x \mapsto x$ is called the inclusion of X into Y. Note that $i={id}_{X} \Leftrightarrow X=Y$
c. If X and Y are nonempty and $b \in Y$, then $X \rightarrow Y$, $x \mapsto b$ is a constant function
d. If $f: X \rightarrow Y$ and $A \subseteq X$, then $f | A: A \rightarrow Y$, $x \mapsto f(x)$ is the restriction of $f$ to A. Clearly $f | A=f \Leftrightarrow A=X$
e. Let $A \subseteq X$ and $g: A \rightarrow Y$. Then any function $f: X \rightarrow Y$ with $f|A=g$ is called an extension of $g$, written $f \supseteq g$.
g. Let $X \neq \phi$ and $A \subseteq X$. Then the characteristic function of A is
${ \chi }_{ A }: X \rightarrow {0,1}$, $x \mapsto \begin{cases} 1, x\in A \\ 0, x\in { A }^{ c } \end{cases}$

Composition of Function
Let $f: X \rightarrow Y$ and $g: Y \rightarrow V$ be two functions. Then we define a new function $g\circ f: X \rightarrow V$, $x\mapsto g(f(x))$

3.3 Proposition
$(h \circ g) \circ f = h \circ (g \circ f)$
(associativity of composition)

Commutative Diagrams
Injection, Surjections and Bijections
Let $f: X \rightarrow Y$ be a function. Then f is
surjective if $im(f)=Y$
injective is $f(x)=f(y)$ implies x=y for all $x,y \in X$, and
bijective if $f$ is both injective and surjective

3.5 Proposition
Let $f: X\rightarrow Y$ be a function. Then $f$ is bijective iff there is a function $g: Y\rightarrow X$ such that $g\circ f={id}_{X}$ and $f \circ g={id}_{Y}$. In this case, $g$ is uniquely determined by $f$.

Inverse Function
Let $f: X \rightarrow Y$ be bijective. Then the inverse function $f^{ -1 }$ of $f$ is the unique function $f^{ -1 }: Y\rightarrow X$ such that $f\circ f^{ -1 }={id}_{Y}$ and $f^{ -1 }\circ f={id}_{X}$
3.6 Proposition
$\quad$ Let $f: X \rightarrow Y$ and $g: Y \rightarrow V$ be bijective. Then $g \circ f: X \rightarrow V$ is bijective and
${\left( g \circ f \right)}^{-1}=f^{-1} \circ g^{-1}$
$\quad$ Let $f: X \rightarrow Y$ be a function and $A \subseteq X$. Then
$f(A):=\left\{ f(a)\in Y; a \in A \right\}$
is called the image of A under $f$.
$\quad$ For each $C\subseteq Y$
$f^{-1}(C):=\left\{ x\in X; f(x)\in C \right\}$
is called the preimage of C under $f$

Set valued Functions
Let $f: X \rightarrow Y$ be a function. Then, using the above definitions, we have two ‘induced’ set valued functions.
$f: P(X) \rightarrow P(Y), A \mapsto f(A)\quad$ and $\quad f^{-1}: P(Y) \rightarrow P(X), B \mapsto f^{-1}(B)$
$\quad$ If $f: X \rightarrow Y$ is bijective, then $f^{ -1 }:Y\rightarrow X$ exists and $\left\{f^{ -1 }\left( y \right) \right\} =f^{ -1 }\left( \left\{ y \right\} \right)$ for all $y\in Y$.
$\quad$ If $f: X \rightarrow Y$ is not bijective, then only the set valued function $f^{ -1 }$ is defined.
In either cases, we write $f^{ -1 }\left( y \right)$ for $f^{ -1 }(\left\{ y \right\})$ and call $f^{ -1 }\left( y \right) \subseteq X$ the fiber of f at y. The fiber $f^{ -1 }\left( y \right)$ is simply the solution set $\left\{ x\in X;f\left( x \right) =y \right\}$ of the equation $f\left( x \right) =y$. This could be empty.

Finally, we denote the set of all functions from X to Y by Funct (X,Y)
Funct (X,Y) is a subset of $P(X\times Y)$.