**Background:** One says that continuous maps $f: X \to X, g: Y \to Y$ are [topologically conjugate](http://en.wikipedia.org/wiki/Topological_conjugacy) if there exists a homeomorphism $h: X \to Y$ such that $h \circ f = g \circ h$. There are many ways one can see that two maps are *not* topologically conjugate. For instance, if $f$ has fixed points and $g$ does not (more generally if the same power $f$ and $g$ have different numbers of fixed points), they cannot be topologically conjugate. [Topological entropy](http://en.wikipedia.org/wiki/Topological_entropy) provides a fancier invariant in terms of coverings (assuming $X$ and $Y$ are compact spaces). 


I see also that there are many general theorems of that allow one to conclude that two maps are topologically conjugate (e.g. the [Hartman-Grobman theorem](http://en.wikipedia.org/wiki/Hartman-Grobman_theorem)). 


However, I am curious:



> 
> Given two discrete dynamical systems, is there a trick one can use to *construct* a topological conjugacy between them?
> 
> 
> 


I suppose an analogy would be a comparison between the Brouwer and Banach fixed point theorems. I'm curious if there is an iterative process as in the proof of the latter.


(Full disclosure: I was motivated to ask this question because I got stuck on what should be a simple exercise in a book on dynamical systems. The exercise was to prove that any two $C^1$ maps $f,g: \mathbb{R} \to \mathbb{R}$ such that $0<f'(0)<1, 0 < g'(0)<1$ are locally topologically conjugate.)



How to construct a topological conjugacy?
Let me throw in some speculations based on my limited involvement in dynamical systems.


The conjugation formula $f=h^{-1}gh$ is in general not a type of a functional equation that can be solved by iterative approximations or a clever fixed-point trick. The problem is that you cannot determine how badly a particular $h$ fails by looking at the difference between LHS and RHS of this equation. The obstructions are not local and you don't see them until you consider all iterations of $f$ and $g$. Sometimes you can do approximations (e.g. Anosov system more or less survive under perturbations) but this works only in special types of systems (some kind of "hyperbolicity" is needed).


It seems that the only "general" way for constructing a topological conjugation is to study the orbits of $f$ and $g$ and send each orbit of $f$ to a similar orbit of $g$ so that the whole map is continuous. (A dense set of orbits is sufficient, e.g. the set of periodic points of an Anosov system.) The problem is, of course, that the structure of orbits can be *really* complicated. But if it is simple, one can hope to construct a conjugation directly.


For example, consider two homeomorphisms $f,g:\mathbb R\to\mathbb R$ satisfying $f(x)>x$ and $g(x)>x$ for all $x$. They are conjugate. To see this, consider an orbit $\dots,x\_{-1},x\_0,x\_1,x\_2,\dots$ of a point $x\_0$ under the iterations of $f$. This is an increasing sequence and the intervals $[x\_i,x\_{i+1}]$ cover $\mathbb R$. Every other orbit "interleaves" with this one: for example, if $y\_0\in(x\_0,x\_1)$, then $y\_i:=f^i(y\_0)$ lies between $x\_i$ and $x\_{i+1}$. So every orbit has a unique member in the interval $[x\_0,x\_1)$. In a sense, this interval (or rather the closed one with the endpoints glued together) naturally represents the set of all orbits.


So take any orbit $(x\_i')$ of $g$ and let $h\_0$ be *any* order-preserving bijection from $[x\_0,x\_1]$ to $[x\_0',x\_1']$. This defines a unique conjugacy map $h:\mathbb R\to\mathbb R$ such that $h|\_{[x\_0,x\_1]}=h\_0$: the orbit $\{f^i(y)\}$ of a point $y\in [x\_0,x\_1]$ is mapped to the $g$-orbit $\{g^i(h\_0(y))\}$ of the point $h\_0(y)$. And all conjugations can be obtained this way.


Already in this simple example, you can see how fragile things can be. Even if $f$ and $g$ are smooth and have bounded derivatives, you have no control over how big the derivatives of $h$ can grow. (And you actually lose smoothness if you do the same on a closed interval rather than $\mathbb R$.)


If you vary the map $g$, it remains conjugate to $f$ while the condition $g(x)>x$ holds true. But it suddenly stops being conjugate once a fixed point appears. However trivial this fact is, is shows that limit of conjugacy maps does not make sense in general.


The exercise you mention can be solved in a similar fashion as my toy example; the orbits are not much more complicated. In fact, given any two homeomorphisms $\mathbb R\to\mathbb R$, it is easy to understand whether they are conjugate or not (just study the intervals between fixed points). But the next step - homeomorphisms of the circle - is much more difficult: there are beautiful theorems, unexpected conterexamples, connections to number theory and other signs of a rich theory around such a seemingly trivial object. See Denjoy theorem and especially its smoothness requirements to get an idea how interesting these things can be.


