Matrix Multiplication $\to$ Function Composition? One property of matrices that I found very interesting is the fact that if you have two functions of the same form
$$f_0(x)=\frac{ax+b}{cx+d}$$
$$f_1(x)=\frac{a'x+b'}{c'x+d'}$$
then the function $f_0\circ f_1$ is in the same form, and if you put the coefficients $a,b,c,d$ and $a',b',c',d'$ into two matrices like this:
$$\begin{pmatrix} a&b \\ c&d \end{pmatrix}$$
$$\begin{pmatrix} a'&b' \\ c'&d' \end{pmatrix}$$
Then the coefficients of $f_0\circ f_1$ are given by the matrix
$$\begin{pmatrix} a&b \\ c&d \end{pmatrix}\begin{pmatrix} a'&b' \\ c'&d' \end{pmatrix}$$
I use this property quite often when dealing with the composition of rational functions with linear numerators and denominators since it spares me the trouble of putting myself through some unnecessary algebra.
Whilst thinking about this property, however, I was wondering if there is an analogous type of function that corresponds to a three-by-three matrix. I'm looking for some type of function so that if $g$ and $g_0$ are of this type such that the ambiguous non-$x$ variables of the type of function (suppose they are $a,b,c,d,e,f,g,h,i$ and $a',b',c',d',e',f',g',h',i'$) can be assigned to two three-by-three matrices
$$\begin{pmatrix} a&b&c \\ d&e&f \\ g&h&i \end{pmatrix}$$
$$\begin{pmatrix} a'&b'&c' \\ d'&e'&f' \\ g'&h'&i' \end{pmatrix}$$
and the matrix corresponding to $g\circ g_0$ is
$$\begin{pmatrix} a&b&c \\ d&e&f \\ g&h&i \end{pmatrix}\begin{pmatrix} a'&b'&c' \\ d'&e'&f' \\ g'&h'&i' \end{pmatrix}$$
Can anyone find a type of function like this? This would be very helpful to me in my studies of iterated functions.
 A: Instead of the function $f : \mathbb{K} \to \mathbb{K}$, with $$f(x) = \frac{ax+b}{cx+d},$$ think about the function $g:\mathbb{PK} \to \mathbb{PK}$ with $$g([X:Y]) = [aX + bY : cX + dY].$$The $[A:B]$ notation is of projective space, which is $\mathbb{K}^2/\sim$, where $[a : b] \sim [A:B]$ if $ aB = bA$.
One can go from one to the other by the natural substitution $x = X/Y$. Indeed, one can think of projective space as a 2-dimensional vector space and as such $g$ is a linear map, (projective linear, but linear nonetheless). So it can be represented by a matrix for $\mathbb{PK}$ to itself (or more fancy: $Aut(\mathbb{PK}) \cong PGL(2, \mathbb{K})$. Which look just like two by two matrices over $\mathbb{K}$ modulo scalar matrices. And this works well for what you want them to do, since if you check then $\frac{ax+0}{0x+a}$ (a function relating to a scalar matrix and the projective function [aX + 0Y: 0X + aY] = [X:Y]) is indeed the identity function. 
Although the above is astonishing and does help answer part of your question, it does not answer it entirely. You placed no restriction on $a$, $b$, $c$ or $d$, whereas I did. I assumed $ad-bc \neq 0$. I'm going to show you why this is a valid, and important assumption.
If $ad = bc$, then the fractional map reduces to $\frac ac$ and is constant. Now, if you compose several matrices and one of them is a singular matrix, then the resulting matrix is. Similarly, composing several functions and if one of them is constant, then the resulting function is also.
But $d=2$ was fairly arbitrary here, the same is true for any dimension. However, when $d=2$, we can think of the projective space as fractions, and so can relate the fractional linear maps with the matricies. Note that more generally $Aut(\mathbb{P^nK}) \cong PGL(n+1, \mathbb{K})$. Which has a fairly elementary but lengthy proof in Hartshorne comment 2.7.1.1, which I won't recreate. 
You can construct functions which have a similar property to the one you wanted, but instead, it would be a function from $\mathbb{K}^{n-1}$ to itself for $n$ by $n$ matrices. If you wanted to make it work for 1 variable, the only way would be to take a copy of $\mathbb{PK}$ inside a much larger space, and do everything else the same, but this is a rather trivial and disappointing answer.
