- #1

Stephen Tashi

Science Advisor

- 7,741

- 1,527

There are trivial ways. For example, the 0-th composition of f with g could be f(x). The 1st order composition could be f(g(x)). The 1/3 rd order could be (1/3) f(x) + (2/3) f(g(x)). But one could make a similar definition for almost any discrete operation and that sort of thing isn't very compelling.

In a recent thread on nested functions, it has been pointed out that there are many ways to define sequences of functions recursively such that the sequences converge to the identity function. If you visualize the sequences in reverse (so to speak) they go from x to some function g(x). Apply f() to such a sequence would go from f(x) to f(g(x)). However, I don't understand how to apply these methods to find a sequence that begins at an arbitrary g(x) and tends toward the identity function.