*2017 April 17*

Find a function with the property $f^3(x)=x$. Find a function with the property $f^4(x)=x$. Find a function with the property $f^6(x)=x$.

Lately I've been fascinated with a different class of functions - *involutory* functions, or functions that invert themselves. These functions have the property $f^2(x)=x$. A few of these functions include:

In fact, there are infinitely many such functions, because if $f$ is in the form

then $f$ is an involution whenever $h$ is. A very special type of function to consider is a function of the type

which does some interesting things when iterated. Notice what happens when we compose two rational functions of the form

This may not seem remarkable at first, but notice what happens when we multiply two matrices:

Which is analogous to what we got for our iterated rational function. Therefore, if we map the rational function

onto the matrix

so that we map the coefficients of $x$ on the numerator and denominator to the leftmost entries and the constants to the rightmost entries, then $f^n(x)$ maps onto the matrix

Notice then that if such a function is involutory, then the matrix that it maps onto has the property that

which is the $2$ x $2$ identity matrix. Interestingly, this holds even for fractional and negative iterates of $f$. Using this result, we can find a couple very interesting types of rational functions. For example, functions of the form

are *3-involutory*, meaning that $f^3(x)=x$. The function

is *4-involutory*. We can even find a function that is $6-involutory$ by finding the halfth iterate of our 3-involutory function. To find the halfth iterate or *functional square root* of a rational function

we map it onto a matrix

and use the matrix square root formula:

where $s$ is the positive or negative root of the determinant. We don't have to worry about what $t$ is, because when we revert this back to a rational function, it will cancel out. So the square root of our rational function is

and using this, we can find the functional square root of our *3-involutory function*:

and so now we know that functions of the form

are *6-involutory*. We could go even further and find a *12-involutory* function or a *24-involutory* function, but... nah. There's one more interesting property about these types of functions. If

and

then if

it must be true that

Why is this true? Well, try mapping the functions $f$ and $g$ onto matrices $F$ and $G$. Then it is clear that $F$ is the transpose of $G$, or that $F^T=G$. There is a property of matrices stating that for any matrices $A$ and $B$,

so it follows from this that for any matrix $A$,

Since we are likening exponentiation of matrices to the iteration of functions, this means that the "transpose" of $f$ iterated $n$ times is equal to the the *n*th iterate of its transpose, proving our original statement. Furthermore, if a function of this type is *n-involutory*, then so is its "transpose", telling us that in addition to our above *6-involutory* functions, we also have the functions

And this theorem can be applied to all types of *n-involutory* functions of this type.

Edit: *2017 June 3*

Okay, there is a way to find an *n-involutory* rational function for any positive integer $n$. Such a function is given by

where

To prove this, we will have to employ the trigonometric sum angle formulas for the sine and cosine:

This can be derived by, once again, using matrices in place of actual rational functions. Suppose we are multiplying the matrices

When we carry out the multiplication, we get

Look! These are the sum angle formulas, and this can be simplified to

Now that we know this, we can say that

And, if $\zeta=\frac{2\pi}{n}$,

Thus it is proven. Because of the relationship previously established between matrices and rational functions, if and then

back to home page