This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Normal forms, differentiable conjugacies and elementary bifurcations of maps.

P.A. Glendinning D.J.W. Simpson
Abstract

We strengthen the standard bifurcation theorems for saddle-node, transcritical, pitchfork, and period-doubling bifurcations of maps. Our new formulation involves adding one or two extra terms to the standard truncated normal forms with coefficients determined by algebraic equations. These extended normal forms are differentiably conjugate to the original maps on basins of attraction and repulsion of fixed points or periodic orbits. This reflects common assumptions about the additional information in normal forms despite standard bifurcation theorems being formulated only in terms of topological equivalence.

1 Introduction

In most textbooks bifurcation theorems contain two parts: a skeleton in which the existence of particular solutions (e.g. fixed points or periodic orbits) is established as a function of parameters, and a local equivalence in which the dynamics away from the skeleton is described. The local equivalence is topological, but in this paper we show that it can be made differentiably conjugate to simple polynomial normal forms.

The skeleton is usually established using the Implicit Function Theorem [4, 9, 11, 17], although versal deformations of singularities can also provide this information [12], as can local asymptotic expansions [5]. The local equivalence often relates the dynamics to a ‘typical’ simple example. This can either be by a rigorous change of coordinates to a simple normal form [16], or to a truncated version of the normal form [8, 11] for which it is claimed that the local dynamics is topologically equivalent to the general system being studied.

For the four simplest local bifurcations of one-dimensional maps, the truncated normal forms used to describe these bifurcations are listed in the second column of Table 1. This table also lists our modifications to the normal forms introduced below. For multi-dimensional maps the normal forms can be obtained by first reducing to a one-dimensional centre manifold.

Bifurcation Standard normal form Additional terms
saddle-node xn+1=xn+νxn2x_{n+1}=x_{n}+\nu-x_{n}^{2} +axn3+\,ax_{n}^{3}
transcritical xn+1=xn+xn(νxn)x_{n+1}=x_{n}+x_{n}(\nu-x_{n}) +axn3+\,ax_{n}^{3}
pitchfork xn+1=xn+xn(νxn2)x_{n+1}=x_{n}+x_{n}(\nu-x^{2}_{n}) +axn5+bνxn2+\,ax_{n}^{5}+b\nu x_{n}^{2}
period-doubling xn+1=xnxn(νxn2)x_{n+1}=-x_{n}-x_{n}(\nu-x_{n}^{2}) +axn5+\,ax_{n}^{5}
Table 1: Standard normal forms and additional terms that make it possible to create differentiable conjugacies.

The relationship between the two elements of the analysis, change of coordinates and topological equivalence, is often unclear. If only topological equivalence is required, then the continuous parameter ν\nu of the truncated normal form of the saddle-node bifurcation, for example, could be replaced by the sign of ν\nu, a discrete parameter (see Theorem 2.1). Since a topological conjugacy does not depend on the existence of derivatives, a family of piecewise-affine maps could also be used.

Despite this, many textbooks take great care to show that the truncated normal forms of Table 1 can be obtained by smooth changes of coordinates to leading order, e.g. [11]. Clearly there is an unwritten assumption that the truncated normal forms carry more information than the topological conjugacies stated in the theorems, and indeed the skeleton arguments carry information about the parameter dependence of some solutions without recourse to the normal form. But in that case why introduce the normal forms and changes of coordinates as anything other than simple examples?

In this paper we will show that the normal forms, modified as in Table 1, do indeed carry more information. More explicitly, there are local diffeomorphisms between parts of the dynamics of the general map and the corresponding parts of the dynamics of the extended normal form. We also provide equations connecting the new parameterisation to the parameter dependent coefficients of the new terms. Our proof of local differentiable equivalence does not involve actually creating the coordinate changes, so none of the technical issues regarding the convergence of infinitely many successive coordinate changes will be needed.

The extra information used in our analysis is the multiplier (or stability coefficient) of a periodic orbit. The multiplier of a fixed point is the derivative of the map evaluated at the fixed point. For a periodic orbit the multiplier is the product of the derivative evaluated at the points on the orbit. Our method is to equate the multipliers of the fixed points of the normal form to those of the original map and the additional terms in Table 1 allow us to do this. Then we use local linearization theorems [2, 13, 14, 15] to show the existence of differentiable conjugacies on the basins of attraction and basins of repulsion of the fixed points and periodic orbits of the skeletons. This extends the standard two step analysis (skeleton and topological equivalence) to the following four steps (once the reduction to a one-dimensional centre manifold has been made):

  • a skeleton in which the existence of particular solutions is established as a function of parameters;

  • a normal form skeleton in which the existence of particular solutions is established as a function of parameters of the normal form;

  • multiplier equivalence in which it is shown that the multipliers of the skeleton are equal to the multipliers of corresponding solutions of the normal form skeleton for appropriate values of coefficients; and

  • local differentiable conjugacy in which the dynamics away from the skeleton is described via one or more differentiable conjugacies.

In the remainder of this paper we go through the standard bifurcation theorems in this stronger format. In §2 we give the definitions and sketch the conjugacy theorems needed to develop this approach. In §3 we give the strengthened bifurcation theorems in full; the subsequent four sections go through the four fundamental cases. This starts with the transcritical bifurcation (§4) as it is in many ways the easiest to handle, and we do this without full rigour to show how the method works. As in most expositions we do not specify neighbourhoods as we go through the argument. A more detailed account is given in §5 where we treat the saddle-node bifurcation. Paradoxically it is the case with no fixed points, the easiest to work with on the whole real line, which presents the greatest challenge when restricted to a fixed interval in space with varying parameter. We then sketch the equivalent approach for the pitchfork bifurcation and period-doubling bifurcation in §6 and §7. We conclude in §8 with a short summary of how our new approach fits in with other bifurcations. For each bifurcation there is a tension between having the strongest dynamic equivalence given the types of dynamics that are generated and keeping the analysis as simple as possible. We argue that the approach here via differentiable conjugacy is optimal for the elementary bifurcations, but that it is not so appropriate in more complicated bifurcations.

2 Topological versus differentiable conjugacies

Near local bifurcations maps are monotonic on a neighbourhood of the bifurcation point, increasing for the saddle-node, transcritical and pitchfork bifurcations and decreasing for the period-doubling bidurcation. In this section we bring together the technical results needed to prove the new bifurcation theorems stated in §3.

Definition 2.1.

Maps f:Uf:U\to\mathbb{R} and g:Vg:V\to\mathbb{R} are topologically conjugate if there exists a homeomorphism (continuous bijection with continuous inverse) h:UVh:U\to V such that hf=ghh\circ f=g\circ h. If hh is a diffeomorphism then ff and gg are differentiably conjugate. If hh is of class CrC^{r}, r1r\geq 1, then ff and gg are CrC^{r}-conjugate.

If xx is a fixed point of ff then y=h(x)y=h(x) is a fixed point of gg and referred to as the corresponding fixed point of gg. If hh is differentiable then xx and yy have the same multiplier: f(x)=g(y)f^{\prime}(x)=g^{\prime}(y). The conjugacy hh is essentially a coordinate transformation, so if yn=h(xn)y_{n}=h(x_{n}) then

yn+1=h(xn+1)=h(f(xn))=h(f(h1(yn))),i.e.g=hfh1.y_{n+1}=h(x_{n+1})=h(f(x_{n}))=h(f(h^{-1}(y_{n}))),\qquad\textrm{i.e.}~{}g=h\circ f\circ h^{-1}.

The following result shows just how weak the condition of topological conjugacy is for increasing maps of the real line. We are not sure to whom this result should be attributed, but it is part of the folklore of the subject.

Theorem 2.1.

Suppose f:f:\mathbb{R}\to\mathbb{R} and g:g:\mathbb{R}\to\mathbb{R} are increasing homeomorphisms with precisely n0n\geq 0 fixed points, xkx_{k} and yky_{k} respectively for k=1,,nk=1,\dots,n, with x0=<x1<<xn<=xn+1x_{0}=-\infty<x_{1}<\dots<x_{n}<\infty=x_{n+1} and y0=<y1<<yn<=yn+1y_{0}=-\infty<y_{1}<\dots<y_{n}<\infty=y_{n+1}. Then ff and gg are topologically conjugate by an increasing homeomorphism if and only if the sign of f(x)xf(x)-x on (xk,xk+1)(x_{k},x_{k+1}) and the sign of g(y)yg(y)-y on (yk,yk+1)(y_{k},y_{k+1}) is equal for each k=0,,nk=0,\dots,n.

Here we prove Theorem 2.1 by constructing hh on each (xk,xk+1)(x_{k},x_{k+1}) so that it maps an orbit of ff on this interval to an orbit of gg on (yk,yk+1)(y_{k},y_{k+1}), as in Fig. 1.

Refer to caption
Figure 1: A sketch of the increasing maps ff and gg of Theorem 2.1. As indicated hh is constructed so that it maps an orbit of ff to an orbit of gg.
Proof.

First suppose hf=ghh\circ f=g\circ h for an increasing homeomorphism hh. Then each fixed point of ff maps to some fixed point of gg. Further h(xk)=ykh(x_{k})=y_{k} for each kk because hh is increasing. Thus hh maps (xk,xk+1)(x_{k},x_{k+1}) to (yk,yk+1)(y_{k},y_{k+1}) for each k=0,,nk=0,\dots,n. Now choose any k=0,,nk=0,\dots,n and x(xk,xk+1)x\in(x_{k},x_{k+1}). The sign of f(x)xf(x)-x is the same as the sign of h(f(x))h(x)h(f(x))-h(x) because hh is increasing. By hf=ghh\circ f=g\circ h this is the sign of g(y)yg(y)-y where y=h(x)(yk,yk+1)y=h(x)\in(y_{k},y_{k+1}). Thus f(x)xf(x)-x and g(y)yg(y)-y have the same sign as required.

Conversely suppose f(x)xf(x)-x on (xk,xk+1)(x_{k},x_{k+1}) has the same sign as g(y)yg(y)-y on (yk,yk+1)(y_{k},y_{k+1}) for each kk. Define hh on the fixed points {xk}1n\{x_{k}\}_{1}^{n} by h(xk)=ykh(x_{k})=y_{k}. For each k{0,,n}k\in\{0,\dots,n\} choose some p0(xk,xk+1)p_{0}\in(x_{k},x_{k+1}) and q0(yk,yk+1)q_{0}\in(y_{k},y_{k+1}) and let

pi=fi(p0),qi=gi(q0),p_{i}=f^{i}(p_{0}),\qquad q_{i}=g^{i}(q_{0}),

for all ii\in\mathbb{Z}. Suppose f(x)x>0f(x)-x>0 on (xk,xk+1)(x_{k},x_{k+1}). Then {pi}\{p_{i}\} and {qi}\{q_{i}\} are strictly increasing sequences and

limipi=xk,limipi=xk+1,limiqi=yk,limiqi=yk+1,\lim_{i\to-\infty}p_{i}=x_{k},\qquad\lim_{i\to\infty}p_{i}=x_{k+1},\qquad\lim_{i\to-\infty}q_{i}=y_{k},\qquad\lim_{i\to\infty}q_{i}=y_{k+1}\,,

as in Fig. 1. (If f(x)xf(x)-x and g(y)yg(y)-y are negative the sequences are decreasing and the limits are switched.) Now define h:[p0,p1][q0,q1]h:[p_{0},p_{1}]\to[q_{0},q_{1}] using any continuous strictly increasing function, say

h(x)=q0+q1q0p1p0(xp0).h(x)=q_{0}+\frac{q_{1}-q_{0}}{p_{1}-p_{0}}(x-p_{0}).

Then define hh inductively for x[pi,pi+1]x\in[p_{i},p_{i+1}], i1i\geq 1 by

h(x)=(ghf1)(x),h(x)=\mathopen{}\mathclose{{}\left(g\circ h\circ f^{-1}}\right)\!(x),

and for x[p(i+1),pi],i0x\in[p_{-(i+1)},p_{-i}],i\geq 0 by

h(x)=(g1hf)(x).h(x)=\mathopen{}\mathclose{{}\left(g^{-1}\circ h\circ f}\right)\!(x).

By construction this is continuous on the images and preimages of p0p_{0}, continuous and strictly increasing at all other points, and gh=hfg\circ h=h\circ f. ∎

The remarks in §1 about the inadequacies of topological conjugation stem from this theorem. Stronger results of course need more conditions. These are supplied by an extension of Sternberg’s linearization result [15] due to Belitskii [2].

Theorem 2.2.

(Belitskii) Suppose f:f:\mathbb{R}\to\mathbb{R} and g:g:\mathbb{R}\to\mathbb{R} are strictly increasing CrC^{r} diffeomorphisms, r1r\geq 1, and both maps have precisely n1n\geq 1 fixed points, xkx_{k} and yky_{k} respectively for k=1,,nk=1,\dots,n, with x0=<x1<<xn<=xn+1x_{0}=-\infty<x_{1}<\dots<x_{n}<\infty=x_{n+1} and y0=<y1<<yn<=yn+1y_{0}=-\infty<y_{1}<\dots<y_{n}<\infty=y_{n+1}. Suppose in addition that

f(xk)=g(yk)1,for allk=1,,n.f^{\prime}(x_{k})=g^{\prime}(y_{k})\neq 1,\qquad\text{for all}~{}k=1,\dots,n.

Then ff restricted to (xk1,xk+1)(x_{k-1},x_{k+1}) and gg restricted to (yk1,yk+1)(y_{k-1},y_{k+1}) are Cr1C^{r-1}-conjugate for each k=1,,nk=1,\dots,n.

An outline of a proof of this result is given in Appendix A. If ff and gg have no fixed points then a minor variation of the construction in the proof of Theorem 2.1 shows that there is a topological conjugacy which is smooth everywhere except at the ‘boundary’ points pip_{i} (these are the points of an orbit of ff). Since there are no fixed points we cannot use Sternberg’s result [15] to generate intervals on which both pip_{i} and f(pi)f(p_{i}) or f1(pi)f^{-1}(p_{i}) are contained in an open set on which they are both continuously differentiable. It is possible to use a lemma due originally to Borel (see e.g. [14]) based on formal power series and Taylor’s theorem to prove that the conjugating function can be chosen to be continuously differentiable at these end points. Here we adopt a slightly different, and simpler, strategy.

Theorem 2.3.

Suppose that f:f:\mathbb{R}\to\mathbb{R} and g:g:\mathbb{R}\to\mathbb{R} are increasing CrC^{r} diffeomorphisms, r1r\geq 1, with no fixed points, and that both f(x)xf(x)-x and g(x)xg(x)-x have the same sign. Then there exists an increasing CrC^{r}-conjugacy h:h:\mathbb{R}\to\mathbb{R} with gh=hfg\circ h=h\circ f.

Proof.

Suppose f(x)x>0f(x)-x>0 so the images and preimages {fi(x)}\{f^{i}(x)\}_{-\infty}^{\infty} form an increasing sequence. Choose any point, for example x=0x=0, and define the conjugating function from an open neighbourhood UU of 0 to a neighbourhood VV of 0, say by letting h(x)=xh(x)=x on UU. By choosing UU smaller if necessary we may assume that the closures of the images fi(U)f^{i}(U) are disjoint for all ii\in\mathbb{Z}. Now define hh on fi(U)f^{i}(U), ii\in\mathbb{Z}, by

h(x)=(gihfi)(x).h(x)=\mathopen{}\mathclose{{}\left(g^{i}\circ h\circ f^{-i}}\right)\!(x).

This immediately implies h=g[gi1hf(i1)]f1h=g\circ[g^{i-1}\circ h\circ f^{-(i-1)}]\circ f^{-1} and since the composition of maps in square brackets is simply hh on fi1(U)f^{i-1}(U) the functions hh defined in this way satisfy hf=hgh\circ f=h\circ g.

Now write fi(U)=(ui,ui)f^{i}(U)=(u_{i},u^{\prime}_{i}). Using a CC^{\infty} jump function extend hh on [u0,u1][u^{\prime}_{0},u_{1}] so that hh is a CrC^{r} diffeomorphism on (u0,u1)(u_{0},u^{\prime}_{1}). We can now push hh forwards and backwards as in the proof of Theorem 2.1, and the CrC^{r} differentiability of hh follows from the fact that ff and gg are CrC^{r}. ∎

The non-hyperbolic case is more subtle and is treated by Takens [16] in the CC^{\infty} case and Kuczema et al. [10] (Theorem 8.4.5) in the C2C^{2} case, see also [18].

Theorem 2.4.

([10, 16]) Suppose that ff and gg are C2C^{2} and

f(x)=x+axp+O(xp+1),g(x)=x+bxp+O(xp+1),p=2,3,.f(x)=x+ax^{p}+O(x^{p+1}),\quad g(x)=x+bx^{p}+O(x^{p+1}),\quad p=2,3,\dots.

Then if ab>0ab>0 there is a C1C^{1} increasing conjugacy between ff and gg on neighbourhoods of the origin, and in particular ff is differentiably conjugate to yy+sign(a)ypy\to y+\textrm{sign}(a)y^{p}. If ff is CC^{\infty} then there is a CC^{\infty} increasing conjugacy to

yn+1=yn+sign(a)ynp+αpynp+1,y_{n+1}=y_{n}+\textrm{sign}(a)y_{n}^{p}+\alpha_{p}y_{n}^{p+1},

where, if f(r)(x)f^{(r)}(x) is the rthr^{th} derivative of ff, αp=(p!|f(p)(0)|)pp1f(p+1)(0)(p+1)!.\alpha_{p}=\mathopen{}\mathclose{{}\left(\frac{p!}{|f^{(p)}(0)|}}\right)^{\frac{p}{p-1}}\frac{f^{(p+1)}(0)}{(p+1)!}.

Note that

α2=2fxxx3fxx2|x=0,α3=38fxxxx|fxxx|32|x=0,\alpha_{2}=\frac{2f_{xxx}}{3f_{xx}^{2}}\Big{|}_{x=0},\quad\alpha_{3}=\sqrt{\frac{3}{8}}\frac{f_{xxxx}}{|f_{xxx}|^{\frac{3}{2}}}\Bigg{|}_{x=0}, (2.1)

which are quantities that appear in our results below.

To the best of our knowledge it is not known whether the conjugacy can be made smoother under the assumption that ff and gg are CrC^{r}, 3r<3\leq r<\infty. The statement of Kuczema et al. [10] allows for non-integer values of pp but we have stated the result for the cases needed below. However, their construction is for the half neighbourhood [0,a)[0,a) and to extend to (a,0](-a,0] as a C1C^{1} function the transformation xxx\to-x can be used giving coefficents (1)p+1a(-1)^{p+1}a and (1)p+1b(-1)^{p+1}b which lead to the same derivative for the conjugating function at 0 when transformed back to x0x\leq 0.

As mentioned in §1, the main tool for proving the existence and persistence of periodic orbits is the Implicit Function Theorem. This comes in many forms. For our purposes the statement below, from [3] (Theorem 2.1), gives the important smoothness conditions we need.

Theorem 2.5.

(Implicit Function Theorem) Let UU be an open neighbourhood of (x0,y0)p×q(x_{0},y_{0})\in\mathbb{R}^{p}\times\mathbb{R}^{q}. Let F:UqF:U\to\mathbb{R}^{q} be a CrC^{r} function where 1r1\leq r\leq\infty and suppose that F(x0,y0)=0F(x_{0},y_{0})=0. If DFy(x0,y0)DF_{y}(x_{0},y_{0}) is non-singular then there exists an open neighbourhood VV of (x0,y0)(x_{0},y_{0}) with VUV\subseteq U, such that DFy(x,y)DF_{y}(x,y) is non-singular for all (x,y)V(x,y)\in V and an open neighbourhood of x=x0x=x_{0}, WpW\subset\mathbb{R}^{p}, and a unique function f:Wqf:W\to\mathbb{R}^{q} which is CrC^{r} such that f(x0)=y0f(x_{0})=y_{0} and, for all xWx\in W,

(x,f(x))VandF(x,f(x))=0.(x,f(x))\in V\quad\textrm{and}\quad F(x,f(x))=0.

Moreover,

Df(x0)=[DFy(x0,y0)]1DFx(x0,y0).Df(x_{0})=-[DF_{y}(x_{0},y_{0})]^{-1}DF_{x}(x_{0},y_{0}).

If p=q=1p=q=1 the condition that DFy(x0,y0)DF_{y}(x_{0},y_{0}) is non-singular, i.e. det(DFy(0,0))0\det\mathopen{}\mathclose{{}\left(DF_{y}(0,0)}\right)\neq 0, is equivalent to Fy(x0,y0)0\frac{\partial F}{\partial y}(x_{0},y_{0})\neq 0 in which case y=f(x)=f(x0)(xx0)+o(|xx0|)y=f(x)=f^{\prime}(x_{0})(x-x_{0})+o(|x-x_{0}|) locally, with

f(x0)=(Fy(x0,y0))1Fx(x0,y0).f^{\prime}(x_{0})=-\mathopen{}\mathclose{{}\left(\frac{\partial F}{\partial y}(x_{0},y_{0})}\right)^{-1}\frac{\partial F}{\partial x}(x_{0},y_{0}).

To summarise, given qq CrC^{r} real equations in p+qp+q variables, the Implicit Function Theorem provides conditions under which there is a locally unique CrC^{r} function determining qq of the variables as a function of the remaining pp variables on which the original qq real equations are satisfied.

3 Bifurcation Theorems

The conditions of Belitskii’s Theorem do not imply the existence of global conjugacies, so the best we can hope for in general is local. This is reflected in the theorems below.

Each theorem concerns a map xn+1=f(xn,μ)x_{n+1}=f(x_{n},\mu) and an extended normal form. For the saddle-node bifurcation this form is

yn+1=g(yn,ν,a)=yn+νyn2+ayn3.y_{n+1}=g(y_{n},\nu,a)=y_{n}+\nu-y_{n}^{2}+ay_{n}^{3}\,. (3.1)
Theorem 3.1.

(Saddle-node bifurcation) Suppose ff is CrC^{r}, r4r\geq 4, and

f(0,0)=0,fx(0,0)=1,fμ(0,0)>0,andfxx(0,0)<0.f(0,0)=0,\quad f_{x}(0,0)=1,\quad f_{\mu}(0,0)>0,\quad\textrm{and}\quad f_{xx}(0,0)<0. (3.2)

Let gg be the truncated normal form (3.1). There exists a neighbourhood NN of x=0x=0 and μ0>0\mu_{0}>0 such that if μ(μ0,0)\mu\in(-\mu_{0},0) then ff has no fixed points in NN, and if μ(0,μ0)\mu\in(0,\mu_{0}) then ff has two fixed points in NN. Moreover, there exists a neighbourhood MM of y=0y=0 and continuous functions ν(μ)\nu(\mu) and a(μ)a(\mu) with

ν(0)=0,limμ0+ν(μ)=fμfxx2|(0,0),a(0)=2fxxx3fxx2|(0,0),\nu(0)=0,\quad\lim_{\mu\to 0^{+}}\nu^{\prime}(\mu)=-\frac{f_{\mu}f_{xx}}{2}\Big{|}_{(0,0)},\quad a(0)=\frac{2f_{xxx}}{3f_{xx}^{2}}\Big{|}_{(0,0)}, (3.3)

such that with g~(y,μ)=g(y,ν(μ),a(μ))\tilde{g}(y,\mu)=g(y,\nu(\mu),a(\mu)),

  1. i)

    if μ(μ0,0)\mu\in(-\mu_{0},0) then f|Nf|_{N} is CrC^{r}-conjugate to g~|M\tilde{g}|_{M},

  2. ii)

    if μ=0\mu=0 then f|Nf|_{N} is C1C^{1}-conjugate to g~|M\tilde{g}|_{M}, and

  3. iii)

    if μ(0,μ0)\mu\in(0,\mu_{0}) then f|Nf|_{N} and g~|M\tilde{g}|_{M} are Cr1C^{r-1}-conjugate on the basins of attraction/repulsion of their corresponding fixed points.

Note that the signs of fμ(0,0)f_{\mu}(0,0) and fxx(0,0)f_{xx}(0,0) (provided they are non-zero) can be chosen as stated without loss of generality by using the orientation-reversing transformations xxx\mapsto-x and μμ\mu\mapsto-\mu where necessary. The extra differentiablility (CrC^{r}, r4r\geq 4) is required for the application of the Implicit Function Theorem to obtain the parameters ν\nu and aa of the normal form as a function of μ\mu. The maps remain CrC^{r} so the conjugacies in neighbourhoods of the fixed points are Cr1C^{r-1} by Theorem 2.2.

One can show that ν(μ)\nu(\mu) is C1C^{1} except possibly at μ=0\mu=0. The value of the derivative ν(μ)\nu^{\prime}(\mu) as μ\mu approaches 0 from the right is well-defined and takes the value fμfxx2|(0,0)-\frac{f_{\mu}f_{xx}}{2}\big{|}_{(0,0)} as indicated above. This value represents the rate at which μ\mu unfolds the bifurcation relative to ν\nu in the extended normal form. Furthermore, as evident in the proof below, for μ(0,μ0)\mu\in(0,\mu_{0}) if we treat ν\nu and aa as functions of m=μm=\sqrt{\mu}, then ν\nu is Cr2C^{r-2} and aa is Cr3C^{r-3}. The value of a(0)a(0) is precisely Takens’ α2\alpha_{2} in (2.1).

For the remaining bifurcations we make the (standard) simplification of assuming the origin is always a fixed point. Specifically we assume

f(0,μ)=0,for all μ in a neighbourhood of 0.f(0,\mu)=0,\quad\text{for all $\mu$ in a neighbourhood of $0$}. (3.4)

For transcritical the extended normal form is

yn+1=g(yn,ν,a)=yn+νynyn2+ayn3.y_{n+1}=g(y_{n},\nu,a)=y_{n}+\nu y_{n}-y_{n}^{2}+ay_{n}^{3}\,. (3.5)
Theorem 3.2.

(Transcritical bifurcation) Suppose ff is CrC^{r}, r4r\geq 4, satisfying (3.4) and

fx(0,0)=1,fxx(0,0)<0,andfxμ(0,0)>0.f_{x}(0,0)=1,\quad f_{xx}(0,0)<0,\quad\textrm{and}\quad f_{x\mu}(0,0)>0. (3.6)

Let gg be the truncated normal form (3.5). There exists a neighbourhood NN of x=0x=0 and μ0>0\mu_{0}>0 such that if μ(μ0,μ0){0}\mu\in(-\mu_{0},\mu_{0})\setminus\{0\} then ff has two fixed points in NN. Moreover, there exists a neighbourhood MM of y=0y=0, a Cr1C^{r-1} function ν(μ)\nu(\mu), and a Cr3C^{r-3} function a(μ)a(\mu) with

ν(0)=0,ν(0)=fxμ(0,0),a(0)=2fxxx3fxx2|(0,0),\nu(0)=0,\quad\nu^{\prime}(0)=f_{x\mu}(0,0),\quad a(0)=\frac{2f_{xxx}}{3f_{xx}^{2}}\Big{|}_{(0,0)}, (3.7)

such that with g~(y,μ)=g(y,ν(μ),a(μ))\tilde{g}(y,\mu)=g(y,\nu(\mu),a(\mu)),

  1. i)

    if μ(μ0,μ0){0}\mu\in(-\mu_{0},\mu_{0})\setminus\{0\} then f|Nf|_{N} and g~|M\tilde{g}|_{M} are Cr1C^{r-1}-conjugate on the basins of attraction/repulsion of their corresponding fixed points, and

  2. ii)

    if μ=0\mu=0 then f|Nf|_{N} is C1C^{1}-conjugate to g~|M\tilde{g}|_{M}.

Next we consider the pitchfork bifurcation. This bifurcation involves one more fixed point than the last two cases so we need an extra parameter in our extended normal form in order to be able to match the derivatives of all the fixed points. Specifically we use the form

yn+1=g(yn,ν,a,b)=yn+νynyn3+ayn5+bνyn2.y_{n+1}=g(y_{n},\nu,a,b)=y_{n}+\nu y_{n}-y_{n}^{3}+ay_{n}^{5}+b\nu y_{n}^{2}\,. (3.8)

In this form the bifurcation is supercritical in that the pair of fixed points that bifurcate from zero are stable. Unlike the previous cases, the subcritical bifurcation, in which the non-trivial fixed points are unstable, cannot be obtained from transformations of the supercritical case. The methods are of course analogous and we will not go through the argument again here.

Theorem 3.3.

(Supercritical pitchfork bifurcation) Suppose ff is CrC^{r}, r7r\geq 7, satisfying (3.4) and

fx(0,0)=1,fxx(0,0)=0,fxμ(0,0)>0,andfxxx(0,0)<0.f_{x}(0,0)=1,\quad f_{xx}(0,0)=0,\quad f_{x\mu}(0,0)>0,\quad\textrm{and}\quad f_{xxx}(0,0)<0. (3.9)

Let gg be the truncated normal form (3.8). There exists a neighbourhood NN of x=0x=0 and μ0>0\mu_{0}>0 such that if μ(μ0,0)\mu\in(-\mu_{0},0) then ff has one fixed point in NN (x=0x=0 which is stable), and if μ(0,μ0)\mu\in(0,\mu_{0}) then ff has three fixed points in NN (x=0x=0 which is unstable and two stable fixed points). Moreover, there exists a neighbourhood MM of y=0y=0, a C1C^{1} function ν(μ)\nu(\mu), and continuous functions a(μ)a(\mu) and b(μ)b(\mu) with

ν(0)=0,ν(0)=fxμ(0,0),a(0)=(3fxxxxx10fxxx23fxxxx28fxxx3)|(0,0),b(0)=6fxxx(fxxxx4fxxx+fxxμ2fxμ)|(0,0),\begin{array}[]{c}\nu(0)=0,\quad\nu^{\prime}(0)=f_{x\mu}(0,0),\\ a(0)=\mathopen{}\mathclose{{}\left(\frac{3f_{xxxxx}}{10f_{xxx}^{2}}-\frac{3f_{xxxx}^{2}}{8f_{xxx}^{3}}\middle)}\right|_{(0,0)},\quad b(0)=\sqrt{\frac{6}{-f_{xxx}}}\mathopen{}\mathclose{{}\left(\frac{f_{xxxx}}{4f_{xxx}}+\frac{f_{xx\mu}}{2f_{x\mu}}\middle)}\right|_{(0,0)},\end{array} (3.10)

such that with g~(y,μ)=g(y,ν(μ),a(μ),b(μ))\tilde{g}(y,\mu)=g(y,\nu(\mu),a(\mu),b(\mu)),

  1. i)

    if μ(μ0,μ0){0}\mu\in(-\mu_{0},\mu_{0})\setminus\{0\} then f|Nf|_{N} and g~|M\tilde{g}|_{M} are Cr1C^{r-1}-conjugate on the basins of attraction/repulsion of their corresponding fixed points, and

  2. ii)

    if μ=0\mu=0 then f|Nf|_{N} is C1C^{1}-conjugate to g~|M\tilde{g}|_{M}.

Finally we treat period-doubling for which

yn+1=g(yn,ν,a)=ynνyn+yn3+ayn5.y_{n+1}=g(y_{n},\nu,a)=-y_{n}-\nu y_{n}+y_{n}^{3}+ay_{n}^{5}\,. (3.11)
Theorem 3.4.

(Supercritical period-doubling bifurcation) Suppose ff is CrC^{r}, r7r\geq 7, satisfying (3.4) and

fx(0,0)=1,(3fxx2+2fxxx)|(0,0)>0,andfxμ(0,0)<0.f_{x}(0,0)=-1,\quad\mathopen{}\mathclose{{}\left(3f_{xx}^{2}+2f_{xxx}\middle)}\right|_{(0,0)}>0,\quad\textrm{and}\quad f_{x\mu}(0,0)<0. (3.12)

Let gg be the truncated normal form (3.11). There exists a neighbourhood NN of x=0x=0 and μ0>0\mu_{0}>0 such that for all μ(μ0,μ0)\mu\in(-\mu_{0},\mu_{0}) ff has one fixed point in NN (x=0x=0 which is stable for μ<0\mu<0 and unstable for μ>0\mu>0), and if μ(0,μ0)\mu\in(0,\mu_{0}) then ff has a stable period-22 solution in NN. Moreover, there exists a neighbourhood MM of y=0y=0, a C1C^{1} function ν(μ)\nu(\mu), and a continuous function a(μ)a(\mu) with

ν(0)=0,ν(0)=fxμ(0,0),a(0)=1(3fxx2+2fxxx)2(454fxx4+392fxx2fxxx+9fxxfxxxx+65fxxxxx)|(0,0),\begin{split}\nu(0)&=0,\quad\nu^{\prime}(0)=-f_{x\mu}(0,0),\\ a(0)&=\frac{1}{\mathopen{}\mathclose{{}\left(3f_{xx}^{2}+2f_{xxx}}\right)^{2}}\mathopen{}\mathclose{{}\left(\frac{45}{4}f_{xx}^{4}+\frac{39}{2}f_{xx}^{2}f_{xxx}+9f_{xx}f_{xxxx}+\frac{6}{5}f_{xxxxx}\middle)}\right|_{(0,0)},\end{split} (3.13)

such that with g~(y,μ)=g(y,ν(μ),a(μ))\tilde{g}(y,\mu)=g(y,\nu(\mu),a(\mu)),

  1. i)

    if μ(μ0,0)\mu\in(-\mu_{0},0) then f|Nf|_{N} and g~|M\tilde{g}|_{M} are Cr1C^{r-1}-conjugate on NN,

  2. ii)

    if μ=0\mu=0 then f|Nf|_{N} is C1C^{1}-conjugate to g~|M\tilde{g}|_{M}, and

  3. iii)

    if μ(0,μ0)\mu\in(0,\mu_{0}) then f|Nf|_{N} and g~|M\tilde{g}|_{M} are Cr1C^{r-1}-conjugate on the basins of repulsion of their fixed points, and Cr1C^{r-1}-conjugate on the basins of attraction of their stable period-22 solutions.

In the case of the period-22 solution the basin of attraction is all points in N\{0}N\backslash\{0\}.

4 The transcritical bifurcation

The transcritical bifurcation provides an instructive first example of our approach. Following most textbooks we treat the case in which the bifurcation occurs at μ=0\mu=0 and x=0x=0 is constrained to be a fixed point for all values of μ\mu in a neighbourhood of 0. To make the main idea of our approach clear, we will not specify neighbourhoods and other details for the local results to be true (again, this follows the standard textbook approach). In the next section when the saddle-node bifurcation is described it will be necessary to be careful about how local neighbourhoods are defined.

Suppose ff is CrC^{r} (r4r\geq 4) satisfying (3.4). A transcritical bifurcation occurs at (x,μ)=(0,0)(x,\mu)=(0,0) assuming

fx(0,0)=1,fxμ(0,0)0,andfxx(0,0)0.f_{x}(0,0)=1,\quad f_{x\mu}(0,0)\neq 0,\quad\textrm{and}\quad f_{xx}(0,0)\neq 0. (4.1)

By the transformations xxx\to-x and/or μμ\mu\to-\mu if necessary we may assume

fxx(0,0)<0,andfxμ(0,0)>0.f_{xx}(0,0)<0,\quad\textrm{and}\quad f_{x\mu}(0,0)>0. (4.2)

The standard normal form (or truncated normal form) for this bifucation up to reversal of the xx-direction is xx+x(νx)x\mapsto x+x(\nu-x), see Table 1. We will add a cubic term and look for functions ν(μ)\nu(\mu) and a(μ)a(\mu) for which (3.5) is not just a convenient form, but a map that is (locally) differentiably conjugate to ff. We cannot expect to obtain a differentiable conjugacy on the whole of the neighbourhood we are working on, unless μ=0\mu=0, because there are two fixed points; but there will be two open sets whose union is the whole neighbourhood and such that on each of these sets the dynamics is differentiably conjugate to the corresponding set. This formalizes the idea that it is not just the location of fixed points, but the details of the dynamics which is captured by the normal form, and that this is the result of a differentiable change of coordinates. The functions ν(μ)\nu(\mu) and a(μ)a(\mu) are solutions of explicit equations and the proof of their existence follows from the Implicit Function Theorem, so no new technical apparatus needs to be introduced for this part of the analysis.

4.1 Step 1: the standard skeleton

By definition x=0x=0 is a fixed point for all μ\mu. A standard application of the Implicit Function Theorem shows that there is a unique Cr1C^{r-1} curve of non-trivial fixed points x(μ)x(\mu) (see e.g. [4, 17]). By a routine calculation (see Appendices B and C for details),

x(μ)=2fxμfxx|(0,0)μ13fxx3(4fxxxfxμ26fxxμfxμfxx+3fxμfxx2)|(0,0)μ2+O(μ3).x(\mu)=-\frac{2f_{x\mu}}{f_{xx}}\bigg{|}_{(0,0)}\mu-\frac{1}{3f_{xx}^{3}}\mathopen{}\mathclose{{}\left(4f_{xxx}f_{x\mu}^{2}-6f_{xx\mu}f_{x\mu}f_{xx}+3f_{x\mu}f_{xx}^{2}}\right)\Big{|}_{(0,0)}\mu^{2}+O(\mu^{3}). (4.3)

The derivative of the map evaluated at the origin (i.e. the multiplier of the fixed point x=0x=0) is

D0(μ)=1+fxμ(0,0)μ+12fxμμ(0,0)μ2+O(μ3).D_{0}(\mu)=1+f_{x\mu}(0,0)\mu+\frac{1}{2}f_{x\mu\mu}(0,0)\mu^{2}+O(\mu^{3}). (4.4)

Similarly the multiplier of x(μ)x(\mu) is

D1(μ)=1fxμ(0,0)μ+(2fxxxfxμ23fxx212fxμμ)|(0,0)μ2+O(μ3),D_{1}(\mu)=1-f_{x\mu}(0,0)\mu+\mathopen{}\mathclose{{}\left(\frac{2f_{xxx}f_{x\mu}^{2}}{3f_{xx}^{2}}-\frac{1}{2}f_{x\mu\mu}\middle)}\right|_{(0,0)}\mu^{2}+O(\mu^{3}), (4.5)

and both D0D_{0} and D1D_{1} are Cr1C^{r-1} functions.

4.2 Step 2: fixed points of the normal form

The normal form (3.5) has

gxν(0,0)=1,gxx(0,0)=2,gxxx(0,0)=12a,g_{x\nu}(0,0)=1,\quad g_{xx}(0,0)=-2,\quad g_{xxx}(0,0)=12a,

and all other derivatives are zero. Thus expressions for the fixed points of gg and their multipliers can be read off from the previous subsection. The multiplier of y=0y=0 is

d0(ν,a)=1+ν,d_{0}(\nu,a)=1+\nu, (4.6)

with no error terms. The non-trivial fixed point is

y(ν)=ν+aν2+O(ν3),y(\nu)=\nu+a\nu^{2}+O(\nu^{3}),

with multiplier

d1(ν,a)=1+ν2y+3ay2.d_{1}(\nu,a)=1+\nu-2y+3ay^{2}. (4.7)

4.3 Step 3: multiplier equivalence

A necessary condition for the existence of a differentiable conjugacy between two maps is that the multipliers at corresponding fixed points are equal, i.e.

d0(ν,a)=D0(μ),d1(ν,a)=D1(μ).d_{0}(\nu,a)=D_{0}(\mu),\quad d_{1}(\nu,a)=D_{1}(\mu).

We can view this as a pair of equations to be solved for ν\nu and aa in terms of μ\mu. The first of these equations yields an immediate relationship between ν\nu and μ\mu:

ν(μ)=fx(0,μ)1=fxμ(0,0)μ+12fxμμ(0,0)μ2+O(μ3).\nu(\mu)=f_{x}(0,\mu)-1=f_{x\mu}(0,0)\mu+\frac{1}{2}f_{x\mu\mu}(0,0)\mu^{2}+O(\mu^{3}). (4.8)

The second equation also needs to be satisfied, and this is where the new normal form parameter aa comes in. Let

D(a,μ)=d1(ν(μ),a)D1(μ)=(afxμ22fxxxfxμ23fxx2)|(0,0)μ2+O(μ3),D(a,\mu)=d_{1}(\nu(\mu),a)-D_{1}(\mu)=\mathopen{}\mathclose{{}\left(af^{2}_{x\mu}-\frac{2f_{xxx}f_{x\mu}^{2}}{3f_{xx}^{2}}\middle)}\right|_{(0,0)}\mu^{2}+O(\mu^{3}),

so multipliers at the non-trivial fixed points are equal if D(a,μ)=0D(a,\mu)=0. The Implicit Function Theorem cannot be applied to this equation directly so we use the standard trick and consider the zeros of

G(a,μ)={D(a,μ)μ2μ0122Dμ2(a,0)μ=0.G(a,\mu)=\begin{cases}\frac{D(a,\mu)}{\mu^{2}}&\mu\neq 0\\ \frac{1}{2}\frac{\partial^{2}D}{\partial\mu^{2}}(a,0)&\mu=0.\end{cases}

This is now is well-defined locally and Cr3C^{r-3} with

Gμ(a,0)=163Dμ3(a,0).\frac{\partial G}{\partial\mu}(a,0)=\frac{1}{6}\frac{\partial^{3}D}{\partial\mu^{3}}(a,0).

The function GG is amenable to a standard application of the Implicit Function Theorem provided we choose a(0)=a0a(0)=a_{0} such that G(a0,0)=0G(a_{0},0)=0 and ensure GG is at least C1C^{1}, i.e. r4r\geq 4. This implies

a0=2fxxx23fxx2|(0,0),a_{0}=\frac{2f^{2}_{xxx}}{3f_{xx}^{2}}\bigg{|}_{(0,0)}, (4.9)

and since

Ga(a0,0)=fxμ(0,0)20,\frac{\partial G}{\partial a}(a_{0},0)=f_{x\mu}(0,0)^{2}\neq 0,

the Implicit Function Theorem guarantees a unique branch of Cr3C^{r-3} solutions transversely through (a0,0)(a_{0},0).

4.4 Step 4: differentiable conjugacies

If μ=0\mu=0 then the map ff is xx+12fxxx2+O(x3)x\mapsto x+\frac{1}{2}f_{xx}x^{2}+O(x^{3}) and so it is differentiably conjugate to xx+x2x\mapsto x+x^{2} (the normal form (3.5) with ν=0\nu=0) by Theorem 2.4 [10, 14, 16, 18]. This is the source of the common view of normal form theory: the non-hyperbolic cases, having only one fixed point, are smoothly conjugate to the normal form on an open neighbourhood of the fixed point; there is no need for conjugacies on different subsets of the neighbourhood.

Suppose all the conditions described hold. If μ>0\mu>0 then there is a neighbourhood NN of x=0x=0 such that if μ(μ0,μ0)\{0}\mu\in(-\mu_{0},\mu_{0})\backslash\{0\} there are two fixed points x1<x2x_{1}<x_{2} in NN. Similarly there a neighbourhood WW of y=0y=0 such that the modified normal form has corresponding fixed points y1<y2y_{1}<y_{2} in WW if ν0\nu\neq 0. Moreover there are Cr3C^{r-3} functions ν(μ)\nu(\mu) and a(μ)a(\mu) such that by Belitskii’s Theorem (Theorem 2.2) for each μ\mu locally there is a Cr1C^{r-1}-conjugacy between the two maps at corresponding values of μ\mu and ν\nu on N{x<x2}N\cap\{x<x_{2}\} and N{x>x1}N\cap\{x>x_{1}\}; these sets are the basins of attraction and repulsion of the fixed points in NN.

Remark: Although the differentiable conjugacy is on two intervals if μ0\mu\neq 0, rather than one for the non-hyperbolic case μ=0\mu=0, it can be smoother on its domain of definition. There are obstructions to making the local differentiable conjugacy C2C^{2} in the non-hyperbolic case which are not present in the hyperbolic cases [18].

It could be argued that the expressions here are complicated by the fact that we chose to have a coefficient of unity on the x2x^{2}-term of the normal form. This does indeed complicate the calculation of the connection between the two maps, but retains the simplicity of the normal form as far as possible and we prefer not to add further constants into the normal form.

5 The saddle-node bifurcation

In this section we provide an alternative approach to the saddle-node bifurcation theorem. This relies on the standard approach to the existence of fixed points using the Implicit Function Theorem (IFT) but then uses the results of §2 to create a differentiable conjugacy on different neighbourhoods of the bifurcation point.

Suppose

xn+1=f(xn,μ),f(0,0)=0,fx(0,0)=1,x_{n+1}=f(x_{n},\mu),\quad f(0,0)=0,\quad f_{x}(0,0)=1, (5.1)

where ff is CrC^{r} with r4r\geq 4. If fμ(0,0)f_{\mu}(0,0) and fxx(0,0)f_{xx}(0,0) are both non-zero, the standard genericity conditions for the saddle-node bifurcation, then by a change of the sign of xx and μ\mu where necessary we may assume that

fxx(0,0)<0,fμ(0,0)>0.f_{xx}(0,0)<0,\quad f_{\mu}(0,0)>0. (5.2)

5.1 Step 1: the standard skeleton

We start with a standard result regarding the fixed points of ff, though usually the Implicit Function Theorem is used to obtain μ(x)\mu(x) instead of x(μ)x(\mu). See Appendix D for the full calculation.

Lemma 5.1.

Consider (5.1) satisfying (5.2). There is a neighbourhood N0N_{0} of (0,0)(0,0) such that for (x,μ)N0(x,\mu)\in N_{0} the only fixed points of (5.1) are two branches in μ0\mu\geq 0 which can be written as functions of m0m\geq 0, m2=μm^{2}=\mu, with, for k{1,2}k\in\{1,2\},

xk(m)=(1)k2fμfxx|(0,0)m+(fμfxxx3fxμfxx3fxx2)|(0,0)m2+O(m3).x_{k}(m)=(-1)^{k}\sqrt{\frac{-2f_{\mu}}{f_{xx}}}\Bigg{|}_{(0,0)}m+\mathopen{}\mathclose{{}\left(\frac{f_{\mu}f_{xxx}-3f_{x\mu}f_{xx}}{3f_{xx}^{2}}\middle)}\right|_{(0,0)}m^{2}+O(m^{3}). (5.3)

Moreover, their multipliers are

fx(xk(m),m2)=1+(1)k+12fμfxx|(0,0)m23fμfxxxfxx|(0,0)m2+O(m3).f_{x}(x_{k}(m),m^{2})=1+(-1)^{k+1}\sqrt{-2f_{\mu}f_{xx}}\,\big{|}_{(0,0)}m-\frac{2}{3}\frac{f_{\mu}f_{xxx}}{f_{xx}}\bigg{|}_{(0,0)}m^{2}+O(m^{3}). (5.4)

5.2 Step 2: fixed points of the normal form

The normal form (3.1) has

g(0,0)=0,gy(0,0)=1,gν(0,0)=1,gyy(0,0)=2,gyyy(0,0)=6a.g(0,0)=0,\quad g_{y}(0,0)=1,\quad g_{\nu}(0,0)=1,\quad g_{yy}(0,0)=-2,\quad g_{yyy}(0,0)=6a.

So applying the results of the previous section we have for ν=n2\nu=n^{2}, n0n\geq 0, fixed points

yk(n)=(1)kn+12an2+O(n3),y_{k}(n)=(-1)^{k}n+\frac{1}{2}an^{2}+O(n^{3}),

for k{1,2}k\in\{1,2\}. Moreover from (5.4) their multipliers are

gy(yk(n),n2)=1+(1)k+12n+2an2+O(n3).g_{y}(y_{k}(n),n^{2})=1+(-1)^{k+1}2n+2an^{2}+O(n^{3}). (5.5)

5.3 Step 3: multiplier equivalence

The two equations that equate the multipliers of the corresponding fixed points of ff and gg are

fx(xk(m),m2)=gy(yk(n),n2),k=1,2.f_{x}(x_{k}(m),m^{2})=g_{y}(y_{k}(n),n^{2}),\quad k=1,2.

We wish to solve these equations to obtain n=n(m)n=n(m) and a=a(m)a=a(m). However, the Implicit Function Theorem cannot be applied directly to these equations as the first derivatives vanish, so we use a standard trick (e.g. [9]) and set n(m)=mp(m)n(m)=mp(m). Let

Kk(a,p,m)=gy(yk(pm),(pm)2)fx(xk(m),m2),k=1,2.K_{k}(a,p,m)=g_{y}\!\mathopen{}\mathclose{{}\left(y_{k}(pm),(pm)^{2}}\right)-f_{x}(x_{k}(m),m^{2}),\quad k=1,2.

Then our problem is to solve these equations for solutions a(m)a(m) and p(m)p(m). Yet the Implicit Function Theorem cannot be applied directly to the equations K1=0K_{1}=0 and K2=0K_{2}=0, as these have a similar structure, so we instead consider the combination K1=0K_{1}=0 and K1+K2=0K_{1}+K_{2}=0. Set

P(a,p,m)={K1(a,p,m)mifm0,K1m(a,p,m)ifm=0.P(a,p,m)=\begin{cases}\frac{K_{1}(a,p,m)}{m}&\textrm{if}~{}m\neq 0,\\ \frac{\partial K_{1}}{\partial m}(a,p,m)&\textrm{if}~{}m=0.\end{cases}

Then from (5.4) and (5.5)

P(a,p,m)=2p2fμfxx|(0,0)+(2ap2+2fμfxxx3fxx)|(0,0)m+O(m2).P(a,p,m)=2p-\sqrt{-2f_{\mu}f_{xx}}\,\big{|}_{(0,0)}+\mathopen{}\mathclose{{}\left(2ap^{2}+\frac{2f_{\mu}f_{xxx}}{3f_{xx}}\middle)}\right|_{(0,0)}m+O(m^{2}).

Thus P(a,p0,0)=0P(a,p_{0},0)=0 if p(0)=p0p(0)=p_{0} with

p0=122fμfxx|(0,0)0.p_{0}=\frac{1}{2}\sqrt{-2f_{\mu}f_{xx}}\,\big{|}_{(0,0)}\neq 0. (5.6)

Similarly write

4Q(a,p,m)={K1+K2m2ifm0,122m2(K1+K2)ifm=0.4Q(a,p,m)=\begin{cases}\frac{K_{1}+K_{2}}{m^{2}}&\textrm{if}~{}m\neq 0,\\ \frac{1}{2}\frac{\partial^{2}}{\partial m^{2}}(K_{1}+K_{2})&\textrm{if}~{}m=0.\end{cases}

From (5.4) and (5.5),

Q(a,p,m)=ap2+fμfxxx3fxx|(0,0)+O(m),Q(a,p,m)=ap^{2}+\frac{f_{\mu}f_{xxx}}{3f_{xx}}\bigg{|}_{(0,0)}+O(m),

and so Q(a0,p0,0)=0Q(a_{0},p_{0},0)=0 if

a0=1p02(fμfxxx3fxx)|(0,0)=2fxxx3fxx2|(0,0).a_{0}=-\frac{1}{p_{0}^{2}}\mathopen{}\mathclose{{}\left(\frac{f_{\mu}f_{xxx}}{3f_{xx}}\middle)}\right|_{(0,0)}=\frac{2f_{xxx}}{3f_{xx}^{2}}\bigg{|}_{(0,0)}. (5.7)

We now look for solutions to the pair P(a,p,m)=0P(a,p,m)=0 and Q(a,p,m)=0Q(a,p,m)=0 through (a0,p0)(a_{0},p_{0}). This pair is at least C1C^{1} because K1K_{1} and K2K_{2} are Cr1C^{r-1}, so PP and QQ are Cr2C^{r-2} and Cr3C^{r-3} respectively, and by assumption r4r\geq 4. For the matrix of partial derivatives,

det([PaPpQaQp])=2p020,\det\!\mathopen{}\mathclose{{}\left(\begin{bmatrix}\frac{\partial P}{\partial a}&\frac{\partial P}{\partial p}\\ \frac{\partial Q}{\partial a}&\frac{\partial Q}{\partial p}\end{bmatrix}}\right)=-2p_{0}^{2}\neq 0,

so the Implicit Function Theorem can indeed be applied resulting in unique local Cr3C^{r-3} solutions a(m)a(m) and p(m)p(m) with a(0)=a0a(0)=a_{0} and p(0)=p0p(0)=p_{0}.

5.4 Step 4: differentiable conjugacies

The previous subsections establish the conditions that allow Belitskii’s Theorem (Theorem 2.2) to be applied directly to give the following corollary if μ>0\mu>0.

Corollary 5.2.

There exist X0>0X_{0}>0 and M0>0M_{0}>0 such that if 0<μ<M00<\mu<M_{0} and x[X0,X0]x\in[-X_{0},X_{0}] then the map xn+1=f(xn,μ)x_{n+1}=f(x_{n},\mu) with ff being CrC^{r}, r4r\geq 4, satisfying (5.1) and (5.2) has a stable fixed point x1(μ)x_{1}(\mu) and an unstable fixed point x2(μ)x_{2}(\mu) in [X0,X0][-X_{0},X_{0}]. Moreover there exists a Cr2C^{r-2} change of parameter ν(μ)\nu(\mu) and a Cr2C^{r-2} function a(μ)a(\mu) such that the map is differentiably conjugate to yn+1=ν(μ)+ynyn2+a(μ)yn3y_{n+1}=\nu(\mu)+y_{n}-y_{n}^{2}+a(\mu)y_{n}^{3} on the basin of attraction of x1x_{1} in [X0,X0][-X_{0},X_{0}] and the basin of attraction of the corresponding fixed point of the normal form on a suitably chosen interval [Y0,Y0][-Y_{0},Y_{0}], and another differentiable conjugacy on the basin of repulsion of x2x_{2}.

Now we need to consider the case μ<0\mu<0. The issue here is the number of iterates the right hand end-point of the neighbourhood of x=0x=0 takes to leave the neighbourhood.

Lemma 5.3.

Suppose that the conditions on ff of Corollary 5.2 hold. Then there exist X0>0X_{0}>0, N>0N>0 and M1>0M_{1}>0 such that fN(X0,M1)=X0f^{N}(X_{0},-M_{1})=-X_{0} and there exists a unique increasing sequence μn(M1,0)\mu_{n}\in(-M_{1},0) such that fn(X0,μn)=X0f^{n}(X_{0},\mu_{n})=-X_{0} with μn0\mu_{n}\to 0 as nn\to\infty. Let Y0Y_{0}, 𝒱1\mathcal{V}_{1} and νn\nu_{n} be equivalent quantities for the normal form map (3.1). Then there exists a CC^{\infty} function ν:[M1,0)[𝒱1,0)\nu:[-M_{1},0)\to[-\mathcal{V}_{1},0) with ν(μn)=νn\nu(\mu_{n})=\nu_{n} for all n>Nn>N such that the normal form with a(μ)=a0a(\mu)=a_{0} defined by (5.7) on [Y0,Y0][-Y_{0},Y_{0}] is differentiably conjugate to ff on [X0,X0][-X_{0},X_{0}].

Proof.

First note that X0X_{0} and M1M_{1} can be chosen so that fμ(x,μ)f_{\mu}(x,\mu) and fx(x,μ)f_{x}(x,\mu) are both positive and f(x,μ)<xf(x,\mu)<x for all (x,μ)[X0,X0]×[M1,0)(x,\mu)\in[-X_{0},X_{0}]\times[-M_{1},0). Thus by the mean value theorem

f(x,μ~1)<f(x,μ~2)ifμ~1<μ~2;f(x1,μ)<f(x2,μ)ifx1<x2;and sofn(x,μ~1)<fn(x,μ~2)ifμ~1<μ~2,n1.\begin{array}[]{rll}f(x,\tilde{\mu}_{1})&<f(x,\tilde{\mu}_{2})&\textrm{if}~{}\tilde{\mu}_{1}<\tilde{\mu}_{2};\\ f(x_{1},\mu)&<f(x_{2},\mu)&\textrm{if}~{}x_{1}<x_{2};\ \ \textrm{and\ so}\\ f^{n}(x,\tilde{\mu}_{1})&<f^{n}(x,\tilde{\mu}_{2})&\textrm{if}~{}\tilde{\mu}_{1}<\tilde{\mu}_{2},\ \ n\geq 1.\end{array} (5.8)

These imply that there exists N>0N>0 such that fN(X0,M1)X1f^{N}(X_{0},-M_{1})\leq-X_{1}. If the inequality is strict, then fN(X0,0)>0f^{N}(X_{0},0)>0 and the intermediate value theorem imply that there exists μN>M1\mu_{N}>-M_{1} such that fN(X0,μN)=X0f^{N}(X_{0},\mu_{N})=-X_{0}. Redefining M1M_{1} by μN=M1\mu_{N}=-M_{1} implies that the statement about M1M_{1} is true. The existence of the values μn\mu_{n}, n>Nn>N follow by a similar argument, using the intermediate value theorem inductively to show that fn+1(X0,μn)<X0f^{n+1}(X_{0},\mu_{n})<-X_{0} and fn+1(X0,0)>0>X0f^{n+1}(X_{0},0)>0>-X_{0} implies that there exists μn+1>μn\mu_{n+1}>\mu_{n} such that fn+1(X0,μn+1)=X0f^{n+1}(X_{0},\mu_{n+1})=-X_{0}. The uniqueness follows from the third inequality of (5.8).

Of course, the analogous statements hold equally for the saddle-node normal form map on [Y0,Y0][-Y_{0},Y_{0}], so for each μ(μn,μn+1)\mu\in(\mu_{n},\mu_{n+1}) the map is differentiably conjugate to the saddle-node map for any ν(νn,νn+1)\nu\in(\nu_{n},\nu_{n+1}) using the construction of the sketch proof of Theorem 2.3 with initial intervals (f(X0),X0)(f(X_{0}),X_{0}) and (g(Y0),Y0)(g(Y_{0}),Y_{0}).

Now let ν:[M1,0)[𝒱1,0)\nu:[-M_{1},0)\to[-\mathcal{V}_{1},0) be any CC^{\infty} function such that ν(μn)=νn\nu(\mu_{n})=\nu_{n} and note that limμ0ν(μ)=0\lim_{\mu\uparrow 0}\nu(\mu)=0. For each μ\mu in [M1,0)[-M_{1},0) the map ff is differentiably conjugate to the normal form with parameters ν(μ)\nu(\mu) and a0a_{0}. ∎

If μ=0\mu=0 then the map is differentiably conjugate to the normal form map by standard results for non-hyperbolic fixed points, Theorem 2.4.

6 The pitchfork bifurcation

As in the case of the transcritical bifurcation we make the simplifying assumption (3.4) that x=0x=0 is a fixed point of ff for all sufficiently small values of μ\mu. This enables us to write

xn+1=f(xn,μ)=xn+xnK(xn,μ)x_{n+1}=f(x_{n},\mu)=x_{n}+x_{n}K(x_{n},\mu) (6.1)

with

K(0,0)=Kx(0,0)=0,Kμ(0,0)>0,Kxx(0,0)<0.K(0,0)=K_{x}(0,0)=0,\quad K_{\mu}(0,0)>0,\quad K_{xx}(0,0)<0. (6.2)

These are equivalent to the constraints (3.9) on ff and assume a change in the sign of μ\mu has possibly been applied. (Note the analysis for the subcritical pitchfork bifurcation is essentially the same, but in that case fxμfxxx>0f_{x\mu}f_{xxx}>0.)

6.1 Step 1: the standard skeleton

Fixed points of (6.1) are x=0x=0 and solutions to K(x,μ)=0K(x,\mu)=0. The function K(x,μ)K(x,\mu) satisfies the same conditions as f(x,μ)xf(x,\mu)-x in the saddle-node bifurcation setting except has one less degree of differentiability. So for μ>0\mu>0 we set μ=m2\mu=m^{2} and in Lemma 5.4 replace derivatives of ff with those of KK to obtain Cr2C^{r-2} non-trivial fixed points

xk(m)=(1)k2KμKxx|(0,0)m+(KμKxxx3KxμKxx3Kxx2)|(0,0)m2+O(m3),x_{k}(m)=(-1)^{k}\sqrt{\frac{-2K_{\mu}}{K_{xx}}}\Bigg{|}_{(0,0)}m+\mathopen{}\mathclose{{}\left(\frac{K_{\mu}K_{xxx}-3K_{x\mu}K_{xx}}{3K_{xx}^{2}}\middle)}\right|_{(0,0)}m^{2}+O(m^{3}), (6.3)

for k{1,2}k\in\{1,2\}. The cubic term in (6.3) will be needed below and a derivation of its coefficient is outlined in Appendix E. The multiplier of the trivial fixed point x=0x=0 is

fx(0,μ)=1+K(0,μ)=1+fxμ(0,0)μ+12fxμμ(0,0)μ2+O(μ3).f_{x}(0,\mu)=1+K(0,\mu)=1+f_{x\mu}(0,0)\mu+\frac{1}{2}f_{x\mu\mu}(0,0)\mu^{2}+O(\mu^{3}). (6.4)

Similarly the multipliers of xk(m)x_{k}(m) are

fx(xk(m),m2)=1+xk(m)Kx(xk(m),m2),f_{x}(x_{k}(m),m^{2})=1+x_{k}(m)K_{x}(x_{k}(m),m^{2}),

since K(xk(m),m2)K(x_{k}(m),m^{2}) is identically zero by definition. By using (6.3) and re-expressing the multipliers in terms of the derivatives of ff,

fx(xk(m),m2)=12fxμ(0,0)m2+(1)kBm3+Cm4+O(m5),f_{x}(x_{k}(m),m^{2})=1-2f_{x\mu}(0,0)m^{2}+(-1)^{k}Bm^{3}+Cm^{4}+O(m^{5}), (6.5)

where

B=3fμx8fxxx3(fxμfxxxx+2fxxxfxxμ)|(0,0),B=\sqrt{\frac{-3f_{\mu x}}{8f^{3}_{xxx}}}(f_{x\mu}f_{xxxx}+2f_{xxx}f_{xx\mu})\Big{|}_{(0,0)}, (6.6)

and CC is a function of the derivatives of ff given in Appendix E.

6.2 Step 2: fixed points of the normal form

The corresponding normal form gg, given by (3.8), has trivial fixed point y=0y=0 with multiplier

gy(0,ν)=1+ν.g_{y}(0,\nu)=1+\nu. (6.7)

For the non-trivial fixed points of gg, we assume ν>0\nu>0 and set ν=n2\nu=n^{2}, then apply the formula (6.3) to gg to obtain

yk(n)=(1)kn+b2n2+O(n3).y_{k}(n)=(-1)^{k}n+\frac{b}{2}n^{2}+O(n^{3}). (6.8)

It should not come as a surprise that we need coefficents on two nonlinear terms. This is because there are three fixed points if ν>0\nu>0 and so three multipliers need to be matched. We achieve this by solving for ν\nu, aa, and bb in the matching equations. Possibly the surprising choice for our normal form is yn5y_{n}^{5} rather than say yn4y_{n}^{4}. This is because if a yn4y_{n}^{4} term is included then the equations for the coefficients at μ=0\mu=0 are quadratic rather than linear. By separating out the orders of the terms in the normal form we can solve for b0b_{0} at order m3m^{3} and then for a0a_{0} at m4m^{4} without needing to solve nonlinear equations. This does mean however that the fixed points need to be computed to third order. As mentioned above this calculation is outlined in Appendix E. The result for the normal form is

yk(n)=(1)kn+b2n2+(1)k18(4a+b2)n3+O(n4),y_{k}(n)=(-1)^{k}n+\frac{b}{2}n^{2}+(-1)^{k}\frac{1}{8}(4a+b^{2})n^{3}+O(n^{4}), (6.9)

and the multipliers are

gy(yk(n),n2)=12n2+(1)k+1bn3+12(4ab2)n4+O(n5).g_{y}(y_{k}(n),n^{2})=1-2n^{2}+(-1)^{k+1}bn^{3}+\frac{1}{2}(4a-b^{2})n^{4}+O(n^{5}). (6.10)

6.3 Step 3: multiplier equivalence

Equating the multipliers (6.4) and (6.7) of the trivial fixed points gives a simple relationship for ν\nu as function of μ\mu:

ν=K(0,μ)=fxμ(0,0)μ+12fxμμ(0,0)μ2+O(μ3).\nu=K(0,\mu)=f_{x\mu}(0,0)\mu+\frac{1}{2}f_{x\mu\mu}(0,0)\mu^{2}+O(\mu^{3}). (6.11)

By substituting this into (6.10) we eliminate nn so now the multipliers of the non-trivial fixed points of gg are

Dk(a,b,m)\displaystyle D_{k}(a,b,m) =12fxμ(0,0)m2+(1)k+1bfxμ(0,0)32m3\displaystyle=1-2f_{x\mu}(0,0)m^{2}+(-1)^{k+1}bf_{x\mu}(0,0)^{\frac{3}{2}}m^{3}
+(12(4ab2)fxμ(0,0)2fxμμ(0,0))m4+O(m5).\displaystyle\quad+\mathopen{}\mathclose{{}\left(\frac{1}{2}(4a-b^{2})f_{x\mu}(0,0)^{2}-f_{x\mu\mu}(0,0)}\right)m^{4}+O(m^{5}). (6.12)

To equate the multipliers at corresponding fixed points we match (6.5) and (6.12) for each k{1,2}k\in\{1,2\}. That is, we seek zeros of

Jk(a,b,m)\displaystyle J_{k}(a,b,m) =Dk(a,b,m)fx(xk(m),m2)\displaystyle=D_{k}(a,b,m)-f_{x}(x_{k}(m),m^{2})
=(1)k+1(bfxμ(0,0)32+B)m3\displaystyle=(-1)^{k+1}\mathopen{}\mathclose{{}\left(bf_{x\mu}(0,0)^{\frac{3}{2}}+B}\right)m^{3}
+(12(4ab2)fxμ(0,0)2fxμμ(0,0)C)m4+O(m5),\displaystyle\quad+\mathopen{}\mathclose{{}\left(\frac{1}{2}(4a-b^{2})f_{x\mu}(0,0)^{2}-f_{x\mu\mu}(0,0)-C}\right)m^{4}+O(m^{5}), (6.13)

for k{1,2}k\in\{1,2\}. To use the Implicit Function Theorem we will adopt the strategy in §5 and define

R(a,p,m)={J1m3ifm0,13!3J1m3ifm=0,R(a,p,m)=\begin{cases}\frac{J_{1}}{m^{3}}&\textrm{if}~{}m\neq 0,\\ \frac{1}{3!}\frac{\partial^{3}J_{1}}{\partial m^{3}}&\textrm{if}~{}m=0,\end{cases}

and

S(a,p,m)={J1+J2m4ifm0,14!4m4(J1+J2)ifm=0.S(a,p,m)=\begin{cases}\frac{J_{1}+J_{2}}{m^{4}}&\textrm{if}~{}m\neq 0,\\ \frac{1}{4!}\frac{\partial^{4}}{\partial m^{4}}(J_{1}+J_{2})&\textrm{if}~{}m=0.\end{cases}

By (6.13),

R(a,b,m)=bfxμ(0,0)32B+O(m),S(a,b,m)=(4ab2)fxμ(0,0)22fxμμ(0,0)2C+O(m),\begin{split}R(a,b,m)&=bf_{x\mu}(0,0)^{\frac{3}{2}}-B+O(m),\\ S(a,b,m)&=(4a-b^{2})f_{x\mu}(0,0)^{2}-2f_{x\mu\mu}(0,0)-2C+O(m),\end{split} (6.14)

and these are Cr5C^{r-5} and Cr6C^{r-6} respectively because (6.3) is Cr2C^{r-2}. We can solve R(a0,b0,0)=S(a0,b0,0)=0R(a_{0},b_{0},0)=S(a_{0},b_{0},0)=0 for a0a_{0} and b0b_{0} by using (6.14) and our formulas for BB (6.6) and CC (given in Appendix E). The result is that a0a_{0} and b0b_{0} are given by the values in (3.10). At (a0,b0,0)(a_{0},b_{0},0),

det([RaRbQaQb])=4fxμ(0,0)720,\det\!\mathopen{}\mathclose{{}\left(\begin{bmatrix}\frac{\partial R}{\partial a}&\frac{\partial R}{\partial b}\\ \frac{\partial Q}{\partial a}&\frac{\partial Q}{\partial b}\end{bmatrix}}\right)=-4f_{x\mu}(0,0)^{\frac{7}{2}}\neq 0,

so by the Implicit Function Theorem there exist locally unique Cr6C^{r-6} functions a(m)a(m) and b(m)b(m) with a(0)=a0a(0)=a_{0} and b(0)=b0b(0)=b_{0} such that if μ>0\mu>0 then R(a(m),b(m),m)=S(a(m),b(m),m)=0R(a(m),b(m),m)=S(a(m),b(m),m)=0. With this the corresponding fixed points of ff and gg have the same multipliers for sufficiently small values of μ>0\mu>0.

6.4 Step 4: differentiable conjugacies

Since the multipliers are the same, the μ>0\mu>0 part of Theorem 3.3 follows from Theorem 2.2. For μ<0\mu<0 we only need to impose (6.11) to match the multipliers of the trivial fixed points and this case too follows from Theorem 2.2. Finally the μ=0\mu=0 part of Theorem 3.3 follows from Theorem 2.4 with p=3p=3.

7 The period-doubling bifurcation

Period-doubling bifurcations occur as a multiplier of a fixed point (possibly of an iterate of a map) passes through 1-1, so restricted to the one-dimensional centre manifold we have a decreasing map. The only periodic orbits of a decreasing map have periods one or two, and there is at most one fixed point. Within an open interval that maps into itself there is precisely one fixed point.

If ff is a decreasing map with a fixed point, then f2f^{2} is an increasing map and so the results of §2 can be applied to the second iterate. Monotonicity implies that fixed points of f2f^{2} which are not fixed points of ff come in pairs which are images of each other under ff, and if there are nn hyperbolic orbits of period two then these are ordered so that

zn<<z1<z0<z1<<znz_{-n}<\dots<z_{-1}<z_{0}<z_{1}<\dots<z_{n}

with f(zk)=zkf(z_{-k})=z_{k}, k=n,,nk=-n,\dots,n. As in §2 we write z(n+1)=z_{-(n+1)}=-\infty, zn+1=z_{n+1}=\infty, and Uk=(zk1,zk+1)U_{k}=(z_{k-1},z_{k+1}), k=n,,nk=-n,\dots,n. The monotonic nature of ff implies that f(U0)=U0f(U_{0})=U_{0}, f(Uk)=Ukf(U_{k})=U_{-k}, 0<|k|<n0<|k|<n, and f(U(n+1))Un+1f(U_{-(n+1)})\subseteq U_{n+1} and f(Un+1)U(n+1)f(U_{n+1})\subseteq U_{-(n+1)}. Belitskii’s Theorem (Theorem 2.2) implies that for any two maps ff and gg with the same structure of periodic points, multipliers of f2f^{2} at the periodic points and sign of f2(x)xf^{2}(x)-x on each corresponding interval UkU_{k}, the second iterates f2f^{2} and g2g^{2} are smoothly conjugate on UkU_{k}. The first question for the period-doubling bifurcation is therefore to determine whether a differentiable conjugacy between f2f^{2} and g2g^{2} implies a differentiable conjugacy between ff and gg. This question has been answered in detail in [13] for more general maps allowing the fixed points of f2f^{2} to be non-hyperbolic (and even non-isolated).

We will start with some preliminary remarks. First note that if f2f^{2} and g2g^{2} are differentiably conjugate on some domains then

f2=h1g2h=h1g(hh1)gh=(h1gh)2f^{2}=h^{-1}\circ g^{2}\circ h=h^{-1}\circ g\circ(h\circ h^{-1})\circ g\circ h=(h^{-1}\circ g\circ h)^{2}

in other words f2=w2f^{2}=w^{2} where w=h1ghw=h^{-1}\circ g\circ h is differentiably conjugate to gg. This function ww can be used to show that gg and ff are differentiably conjugate.

Theorem 7.1.

Suppose that ff and gg are CrC^{r} strictly decreasing functions, r1r\geq 1, and f2f^{2} and g2g^{2} satisfy the conditions of Theorem 2.2. Let UkU_{k} be the intervals (zk1,zk+1)(z_{k-1},z_{k+1}) defined above and VkV_{k} the corresponding intervals for gg. Then if 1kn1\leq k\leq n there exists h^:UkUkVkVk\hat{h}:U_{-k}\cup U_{k}\to V_{-k}\cup V_{k} which is CrC^{r} on each component such that h^f=gh^\hat{h}\circ f=g\circ\hat{h}, i.e. ff and gg are CrC^{r} conjugate on corresponding pairs of intervals. Moreover, ff and gg are also CrC^{r} conjugate on U0U_{0}.

Proof.

Fix k>0k>0. Let h:UkUkVkVkh:U_{-k}\cup U_{k}\to V_{-k}\cup V_{k} be the CrC^{r} conjugacy between f2f^{2} and g2g^{2} of Belitskii’s Theorem (Theorem 2.2) and let w=h1ghw=h^{-1}\circ g\circ h. Then, as noted above, f2=w2f^{2}=w^{2}. Define h1:UkUkUkUkh_{1}:U_{-k}\cup U_{k}\to U_{-k}\cup U_{k} by

h1(x)=x,xUk,h1(x)=wf1(x),xUk.h_{1}(x)=x,\ \ \ x\in U_{k},\quad h_{1}(x)=w\circ f^{-1}(x),\ \ \ x\in U_{-k}.

Note that f1:UkUkf^{-1}:U_{-k}\to U_{k} and w:UkUkw:U_{k}\to U_{-k} so h1(Uk)=Ukh_{1}(U_{k})=U_{k} and h1(Uk)=Ukh_{1}(U_{-k})=U_{-k}. Then since f(x)Ukf(x)\in U_{-k} if xUkx\in U_{k} and f(x)Ukf(x)\in U_{k} if xUkx\in U_{-k} (k>0k>0) then

ifxUkthenh1f(x)=f(x)Uk,and\textrm{if}\ x\in U_{-k}\ \ \textrm{then}\ \ h_{1}\circ f(x)=f(x)\in U_{k},\quad\textrm{and}
ifxUkthenh1f(x)=wf1f(x)=w(x)Uk.\quad\textrm{if}\ x\in U_{k}\ \ \textrm{then}\ \ h_{1}\circ f(x)=w\circ f^{-1}\circ f(x)=w(x)\in U_{-k}.

Similarly (remember k>0k>0)

ifxUkthenwh1(x)=w(x)Uk,and\textrm{if}\ x\in U_{k}\ \ \textrm{then}\ \ w\circ h_{1}(x)=w(x)\in U_{-k},\quad\textrm{and}
ifxUkthenwh1(x)=w2f1(x)=f2f1(x)=f(x)Uk.\textrm{if}\ x\in U_{-k}\ \ \textrm{then}\ \ w\circ h_{1}(x)=w^{2}\circ f^{-1}(x)=f^{2}\circ f^{-1}(x)=f(x)\in U_{k}.

Hence wh1=h1fw\circ h_{1}=h_{1}\circ f. Thus ff is CrC^{r} conjugate to ww which is CrC^{r} conjugate to gg.

In the case of the remaining interval, W0W_{0} which contains the fixed point z0z_{0} of ff there is an added complication: the conjugating function h1h_{1} is defined on W0{xz0}W_{0}\cap\{x\geq z_{0}\} and W0{x<z0}W_{0}\cap\{x<z_{0}\} but the CrC^{r} differentiability needs to extend to the point z0z_{0} itself. This involves a further technicality described in detail in [13]: the functions xx and wf1w\circ f^{-1} to be equal up to CrC^{r} terms at the origin, which is enough to imply that ff and ww are CrC^{r} conjugate. Details of this part of the proof can be found in [13] and we will not go through the argument here. ∎

Having established the foundations of decreasing maps, we can move on to the period-doubling bifurcation. As above we assume x=0x=0 is a fixed point for all small μ\mu (3.4). This allows us to write

xn+1=f(xn,μ)=xn+xnP(xn,μ).x_{n+1}=f(x_{n},\mu)=-x_{n}+x_{n}P(x_{n},\mu). (7.1)

For a period-doubling bifurcation we require

fx(0,0)=1,(3fxx2+2fxxx)|(0,0)0,fxμ(0,0)0.f_{x}(0,0)=-1,\quad\mathopen{}\mathclose{{}\left(3f_{xx}^{2}+2f_{xxx}\middle)}\right|_{(0,0)}\neq 0,\quad f_{x\mu}(0,0)\neq 0. (7.2)

We shall choose to work with maps ff giving a supercritical period-doubling bifurcation and non-trivial fixed points existing for μ>0\mu>0 which means

(3fxx2+2fxxx)|(0,0)>0,fxμ(0,0)<0,\mathopen{}\mathclose{{}\left(3f_{xx}^{2}+2f_{xxx}\middle)}\right|_{(0,0)}>0,\quad f_{x\mu}(0,0)<0, (7.3)

as in (3.12). As with the pitchfork bifurcation, the subcritical case can be treated almost identically.

7.1 Step 1: the standard skeleton

The trivial fixed point x=0x=0 has multiplier

fx(0,μ)=1+fxμ(0,0)μ+12fxμμ(0,0)μ2+O(μ3).f_{x}(0,\mu)=-1+f_{x\mu}(0,0)\mu+\frac{1}{2}f_{x\mu\mu}(0,0)\mu^{2}+O(\mu^{3}). (7.4)

The second iterate f2f^{2} is increasing, at least locally. From (7.1) we can write

xn+2=xn+xnG(xn,μ),x_{n+2}=x_{n}+x_{n}G(x_{n},\mu),

where

G(x,μ)=P(x,μ)+(1+P(x,μ))P(x+xP(x,μ),μ).G(x,\mu)=-P(x,\mu)+(-1+P(x,\mu))P\big{(}-x+xP(x,\mu),\mu\big{)}.

From this formula we find that

Gxx(0,0)=13(3fxx2+2fxxx)|(0,0)<0,Gμ(0,0)=2fxμ(0,0)>0.\begin{split}G_{xx}(0,0)&=-\frac{1}{3}\mathopen{}\mathclose{{}\left(3f_{xx}^{2}+2f_{xxx}\middle)}\right|_{(0,0)}<0,\\ G_{\mu}(0,0)&=-2f_{x\mu}(0,0)>0.\end{split} (7.5)

Non-trivial fixed points of f2f^{2} (these are period-two points of ff) satisfy G(x,μ)=0G(x,\mu)=0. In view of (7.5) the problem of solving for these fixed points is the same as in the pitchfork case. Thus f2f^{2} for μ>0\mu>0 has non-trivial fixed points xk(m)x_{k}(m), for k{1,2}k\in\{1,2\} and with μ=m2\mu=m^{2}, given by (6.3), but with GG instead of KK.

The subsequent manipulations are now equivalent to those of §6 although there are some interesting aspects of the iterated map in terms of dependence on μ\mu rather than m=μm=\sqrt{\mu}. These are described in Appendix F.

In particular the points x1(m)x_{1}(m) and x2(m)x_{2}(m) have the same multiplier because they form a period-two solution for ff. For brevity we denote this multiplier D(m)D(m). This is a Cr2C^{r-2} function of mm with first few terms

D(m)=1+4fxμ(0,0)m2+Mm4+O(m5),D(m)=1+4f_{x\mu}(0,0)m^{2}+Mm^{4}+O(m^{5}), (7.6)

where a formula for MM is given in Appendix F.

7.2 Step 2: periodic orbits of the normal form

The normal form (3.11) has trivial fixed point y=0y=0 with multiplier

gy(0,ν)=1ν.g_{y}(0,\nu)=-1-\nu. (7.7)

The second iterate g2g^{2} is close to the normal form of the (supercritical) pitchfork bifurcation. For ν>0\nu>0 it has two non-trivial fixed points yk(n)y_{k}(n), for k{1,2}k\in\{1,2\} and with ν=n2\nu=n^{2}. By applying the general formula (7.6) to the normal form we find that the multiplier of each yk(n)y_{k}(n), write it as d(a,n)d(a,n), is

d(a,n)=14n2+4(1a)n4+O(n5).d(a,n)=1-4n^{2}+4(1-a)n^{4}+O(n^{5}). (7.8)

7.3 Step 3: multiplier equivalence

By equating the multipliers (7.4) and (7.7) of the trivial fixed points of ff and gg, we obtain ν\nu as a function of μ\mu with

ν=fxμ(0,0)μ12fxμμ(0,0)μ2+O(μ3),\nu=-f_{x\mu}(0,0)\mu-\frac{1}{2}f_{x\mu\mu}(0,0)\mu^{2}+O(\mu^{3}), (7.9)

and recall fxμ(0,0)<0f_{x\mu}(0,0)<0 by assumption.

Next we equate the multipliers of the non-trivial fixed points of f2f^{2} and g2g^{2}. Already n=n(m)n=n(m) via (7.9), so our task is to solve V(a,m)=d(a,n(m))D(m)V(a,m)=d(a,n(m))-D(m) for aa in terms of mm. By subtracting (7.8) from (7.6) and using (7.9),

V(a,m)=(4(1a)fxμ(0,0)2+2fxμμ(0,0)M)m4+O(m5).V(a,m)=\mathopen{}\mathclose{{}\left(4(1-a)f_{x\mu}(0,0)^{2}+2f_{x\mu\mu}(0,0)-M}\right)m^{4}+O(m^{5}).

Thus we define

W(a,m)={V(a,m)m4ifm0,14!4Vm4ifm=0.W(a,m)=\begin{cases}\frac{V(a,m)}{m^{4}}&\textrm{if}~{}m\neq 0,\\ \frac{1}{4!}\frac{\partial^{4}V}{\partial m^{4}}&\textrm{if}~{}m=0.\end{cases}

This function is Cr6C^{r-6} and W(a0,0)=0W(a_{0},0)=0 if

a0=1+2fxμμ(0,0)M4fxμ(0,0)2.a_{0}=1+\frac{2f_{x\mu\mu}(0,0)-M}{4f_{x\mu}(0,0)^{2}}. (7.10)

Since Wa(a0,0)=4fxμ(0,0)20\frac{\partial W}{\partial a}(a_{0},0)=-4f_{x\mu}(0,0)^{2}\neq 0 and r7r\geq 7, the Implicit Function Theorem implies the existence of a unique Cr6C^{r-6} function a(m)a(m), with a(0)=a0a(0)=a_{0}, such that W(a(m),m)=0W(a(m),m)=0 for all sufficiently small values of mm.

7.4 Step 4: differentiable conjugacies

We can now complete the proof of Theorem 3.4. For μ>0\mu>0 we have identified functions ν(μ)\nu(\mu) and a(m)a(m) (which can be reinterpreted as a function of μ\mu) such that, locally, the fixed points of f2f^{2} and g2g^{2} have the same multipliers. Thus there is a differentiable conjugacy with the dynamics on the interval with the origin removed, and on the interval between the points of period two by Belitskii’s Theorem (Theorem 2.2) and Theorem 7.1. Moreover, the formulas (3.13) follow from (7.9) and (7.10) where MM is given in Appendix F.

If μ<0\mu<0 there is a local differentiable conjugacy between ff and gg by Sternberg’s Theorem and the extension of Taken’s Theorem to the decreasing case.

8 Conclusion

In this paper we have shown how the reasonable expectation that truncated normal forms provide information that is more than simply topological is realised. By introducing one or two extra terms in the most simple ‘normal forms’ (Table 1) we have shown that the resulting maps are typically locally differentiably conjugate to the general maps under consideration. These additional terms and their coefficients satisfy simple equations which mean that they can be calculated explicitly (at least from a numerical point of view). This amounts to a differentiable conjugacy on basins of attraction and repulsion, so the different invariant regions have their own differentiable conjugacies. Global differentiable conjugacies are unusual because of the multiple conditions on multipliers that need to hold (see [7] for an interesting example), so the reduction to local conjugacies is natural.

A calculation of the coefficients of the new terms we have introduced in practical problems should give some sense of how far the map is from the standard truncated normal forms of the literature, and hence they provide additional information about how close the bifurcation behaves to that of the standard form. A similar analysis is possible in the continuous time case, and we will report on this separately [6].

The differentiably conjugate normal forms we consider are not unique. We have chosen the standard truncated normal forms to have coefficients which are as simple as possible; we could have chosen coefficients that meant they were as close as possible to the Taylor series of the general system, though this adds extra special coefficients to the normal forms. Equally, there is an element of choice about the additional terms used.

Our belief is that the calculation of these higher order coefficients and their dependency on parameters should become a natural part of investigating important bifurcations; they give a more nuanced description of the dynamics than topological equivalence used hitherto.

Acknowledgements

The authors were supported by Marsden Fund contract MAU1809, managed by Royal Society Te Apārangi.

Appendix A Sketch proof of Belitskii’s Theorem

Sternberg [15] proves that for every hyperbolic fixed point xkx_{k} of ff there exists a neighbourhood UU of xkx_{k} and a neighbourhood VV of 0 such that ff on UU is differentiably conjugate to the linear map λx\lambda x on VV where λ=f(xk)1\lambda=f^{\prime}(x_{k})\neq 1. Belitskii [2] uses a slight generalization of the push-forward argument of the previous theorem to extend this to a diffeomorphism on the whole of Uk=(xk1,xk+1)U_{k}=(x_{k-1},x_{k+1}).

Fix kk and suppose f(x)x>0f(x)-x>0 on (xk,xk+1)(x_{k},x_{k+1}), so xkx_{k} is unstable and orbits are strictly increasing in (xk,xk+1)(x_{k},x_{k+1}). Suppose aU(xk,xk+1)a\in U\cap(x_{k},x_{k+1}), so f1(a)U(xk,xk+1)f^{-1}(a)\in U\cap(x_{k},x_{k+1}) but f(a)f(a) may not be in U(xk,xk+1)U\cap(x_{k},x_{k+1}). By the definition of UU, hh is continuously differentiable at aa and we will extend hh to (a,f(a))(a,f(a)) by defining

h(x)=(ghf1)(x),x(a,f(a)).h(x)=\mathopen{}\mathclose{{}\left(g\circ h\circ f^{-1}}\right)\!(x),\quad x\in(a,f(a)).

Thus for x(a,f(a))x\in(a,f(a))

h(x)=g(h(f1(x)))h(f1(x))f(f1(x)),h^{\prime}(x)=\frac{g^{\prime}(h(f^{-1}(x)))h^{\prime}(f^{-1}(x))}{f^{\prime}(f^{-1}(x))}, (A.1)

and

limxah(x)=g(h(f1(a))h(f1(a))f(f1(a)).\lim_{x\downarrow a}h^{\prime}(x)=\frac{g^{\prime}(h(f^{-1}(a))h^{\prime}(f^{-1}(a))}{f^{\prime}(f^{-1}(a))}. (A.2)

But in (f1(a),a)(f^{-1}(a),a), hf=ghh\circ f=g\circ h and hh is differentiable as it is in UU, so

h(f(x))f(x)=g(h(x))h(x),h^{\prime}(f(x))f^{\prime}(x)=g^{\prime}(h(x))h^{\prime}(x),

and so to evaluate the limit of h(a)h^{\prime}(a) from below we consider the limit of this equation with xf1(a)x\to f^{-1}(a) from below, giving the same expression as the right hand side of (A.2). Hence hh is differentiable at aa and is differentiable by construction on (a,f(a))(a,f(a)). Thus the neighbourhood on which hh is a diffeomorphism can be extended out to the open interval with upper limit f(a)f(a). The same argument on (f(a),f2(a))(f(a),f^{2}(a)) shows that hh can be extended as a diffeomporphism to an open interval with upper bound f2(a)f^{2}(a), and then by induction to the open interval with upper bound limifi(a)=xk+1\lim_{i\to\infty}f^{i}(a)=x_{k+1}.

The argument if f(x)x<0f(x)-x<0 and on the interval (xk1,xk)(x_{k-1},x_{k}) is analogous.

\square

Note that in general the differentiable conjugacy cannot be extended beyond UkU_{k}. This is because the convergence rates of iterates of λx\lambda x (or its inverse) do not generally match the convergence rates of other fixed points of the map when these exist. Belitskii and others (see [13]) have developed invariants which determine whether the conjugacies can be extended to include more fixed points, but since these conditions are not generic we will not pursue this possibility. Theorem 2.2 does not deal with the case in which there are no fixed points.

Appendix B Calculations for the Transcritical Bifurcation

Here we derive formulas for the fixed points of ff and their multipliers in the transcritical bifurcation case. This is done by directly manipulating power series. In the next section we illustrate how the calculations can instead be done by implicit differentiation.

We write the map as f(x,μ)=x+xH(x,μ)f(x,\mu)=x+xH(x,\mu) where

H(x,μ)=c1x+c2μ+c3x2+c4μx+c5μ2+O((|x|+|μ|)3),H(x,\mu)=c_{1}x+c_{2}\mu+c_{3}x^{2}+c_{4}\mu x+c_{5}\mu^{2}+O\!\mathopen{}\mathclose{{}\left((|x|+|\mu|)^{3}}\right), (B.1)

with c1<0c_{1}<0 and c2>0c_{2}>0. In terms of the derivatives of ff,

c1=12fxx(0,0),c2=fxμ(0,0),c3=16fxxx(0,0),c_{1}=\frac{1}{2}f_{xx}(0,0),\quad c_{2}=f_{x\mu}(0,0),\quad c_{3}=\frac{1}{6}f_{xxx}(0,0),

and so on. Fixed points are x=0x=0 and x(μ)x(\mu) solving H(x(μ),μ)=0H(x(\mu),\mu)=0. Since HH is Cr1C^{r-1} and c10c_{1}\neq 0, the Implicit Function Theorem guarantees a unique local Cr1C^{r-1} solution

x(μ)=c2c1μ+(c22c3c13+c2c4c12c5c1)μ2+O(μ3),x(\mu)=-\frac{c_{2}}{c_{1}}\,\mu+\mathopen{}\mathclose{{}\left(-\frac{c_{2}^{2}c_{3}}{c_{1}^{3}}+\frac{c_{2}c_{4}}{c_{1}^{2}}-\frac{c_{5}}{c_{1}}}\right)\mu^{2}+O(\mu^{3}), (B.2)

where the coefficients are obtained by matching terms in a power series. In terms of ff the coefficients are,

c2c1=2fxμfxx|(0,0)-\frac{c_{2}}{c_{1}}=-\frac{2f_{x\mu}}{f_{xx}}\bigg{|}_{(0,0)}

and

c22c3c13+c2c4c12c5c1=13fxx3(4fxxxfxμ26fxxμfxμfxx+3fxμμfxx2)|(0,0).-\frac{c_{2}^{2}c_{3}}{c_{1}^{3}}+\frac{c_{2}c_{4}}{c_{1}^{2}}-\frac{c_{5}}{c_{1}}=-\frac{1}{3f_{xx}^{3}}\mathopen{}\mathclose{{}\left(4f_{xxx}f_{x\mu}^{2}-6f_{xx\mu}f_{x\mu}f_{xx}+3f_{x\mu\mu}f_{xx}^{2}}\right)\Big{|}_{(0,0)}.

The derivative of the map is

fx(x,μ)\displaystyle f_{x}(x,\mu) =1+H(x,μ)+xHx(x,μ)\displaystyle=1+H(x,\mu)+xH_{x}(x,\mu)
=1+2c1x+c2μ+3c3x2+2c4μx+c5μ2+O((|x|+|μ|)3).\displaystyle=1+2c_{1}x+c_{2}\mu+3c_{3}x^{2}+2c_{4}\mu x+c_{5}\mu^{2}+O\!\mathopen{}\mathclose{{}\left((|x|+|\mu|)^{3}}\right). (B.3)

We evaluate this at the fixed points to obtain

fx(0,μ)\displaystyle f_{x}(0,\mu) =1+c2μ+c5μ2+O(μ3),\displaystyle=1+c_{2}\mu+c_{5}\mu^{2}+O(\mu^{3}), (B.4)
fx(x(μ),μ)\displaystyle f_{x}(x(\mu),\mu) =1c2μ+(c22c3c12c5)μ2+O(μ3).\displaystyle=1-c_{2}\mu+\mathopen{}\mathclose{{}\left(\frac{c_{2}^{2}c_{3}}{c_{1}^{2}}-c_{5}}\right)\mu^{2}+O(\mu^{3}). (B.5)

Once again we can write these in terms of ff and its derivatives:

fx(0,μ)\displaystyle f_{x}(0,\mu) =1+fxμ(0,0)μ+12fxμμ(0,0)μ2+O(μ3),\displaystyle=1+f_{x\mu}(0,0)\mu+\frac{1}{2}f_{x\mu\mu}(0,0)\mu^{2}+O(\mu^{3}), (B.6)
fx(x(μ),μ)\displaystyle f_{x}(x(\mu),\mu) =1fxμ(0,0)μ+(2fxμ2fxxx3fxx212fxμμ)|(0,0)μ2+O(μ3).\displaystyle=1-f_{x\mu}(0,0)\mu+\mathopen{}\mathclose{{}\left(\frac{2f_{x\mu}^{2}f_{xxx}}{3f_{xx}^{2}}-\frac{1}{2}f_{x\mu\mu}\middle)}\right|_{(0,0)}\mu^{2}+O(\mu^{3}). (B.7)

Appendix C Transcritical Bifurcation: implicit differentiation

Since many textbooks use implict differentiation to determine coefficients of expansions in bifurcation problems, for comparison here we repeat the first steps of the analysis of the transcritical bifurcation using this method.

Assume there exists a solution x(μ)x(\mu) to f(x,μ)x=0f(x,\mu)-x=0. By differentiating this equation with respect to μ\mu we obtain

fxx+fμx=0.f_{x}x^{\prime}+f_{\mu}-x^{\prime}=0.

At the origin fx(0,0)=1f_{x}(0,0)=1 and fμ(0,0)=0f_{\mu}(0,0)=0 so this equation is automatically satisfied. Differentiating again gives

fxxx 2+2fxμx+fxx′′+fμμx′′=0,f_{xx}x^{\prime\,2}+2f_{x\mu}x^{\prime}+f_{x}x^{\prime\prime}+f_{\mu\mu}-x^{\prime\prime}=0,

and evaluating at μ=0\mu=0 (giving fμμ(0,0)=0f_{\mu\mu}(0,0)=0 because the origin is constrained to be a fixed point), either

x(0)=0orx(0)=2fxμfxx|(0,0).x^{\prime}(0)=0\quad\textrm{or}\quad x^{\prime}(0)=-\frac{2f_{x\mu}}{f_{xx}}\bigg{|}_{(0,0)}.

The first possibility is the value for the trivial fixed point, the second describes x(0)x^{\prime}(0) for the nontrivial fixed point and matches the coefficient of μ\mu given in the previous section. Finally, differentiating again gives

fxxxx 3+3fxxμx 2+3fxxxx′′+3fxμμx+3fxμx′′+fμμμ+fxx′′′x′′′=0.f_{xxx}x^{\prime\,3}+3f_{xx\mu}x^{\prime\,2}+3f_{xx}x^{\prime}x^{\prime\prime}+3f_{x\mu\mu}x^{\prime}+3f_{x\mu}x^{\prime\prime}+f_{\mu\mu\mu}+f_{x}x^{\prime\prime\prime}-x^{\prime\prime\prime}=0.

By substituting the expression for x(0)x^{\prime}(0) into this equation and noting that fμμμ(0,0)=0f_{\mu\mu\mu}(0,0)=0 we recover the second coefficient given above.

Calculations of the multipliers can be achieved in the same way.

Appendix D Calculations for the Saddle-node Bifurcation

We write the map as f(x,μ)=x+H(x,μ)f(x,\mu)=x+H(x,\mu) where

H(x,μ)=c2μ+c3x2+c4μx+c5μ2+c6x3+,H(x,\mu)=c_{2}\mu+c_{3}x^{2}+c_{4}\mu x+c_{5}\mu^{2}+c_{6}x^{3}+\cdots, (D.1)

with c2=fμ(0,0)>0c_{2}=f_{\mu}(0,0)>0 and c3=12fxx(0,0)<0c_{3}=\frac{1}{2}f_{xx}(0,0)<0. To find fixed points of ff we solve H(x,μ)=0H(x,\mu)=0. Since c20c_{2}\neq 0 the Implicit Function Theorem could immediately be used to solve H=0H=0 for μ\mu. But we wish to solve for xx, and this requires a little more work.

We first assume μ0\mu\geq 0 and write μ=m2\mu=m^{2}. Then write x=mzx=mz and define

G(z,m)={H(mz,m2)m2,m0,122m2H(mz,m2),m=0.G(z,m)=\begin{cases}\frac{H(mz,m^{2})}{m^{2}},&m\neq 0,\\ \frac{1}{2}\frac{\partial^{2}}{\partial m^{2}}H(mz,m^{2}),&m=0.\end{cases}

Since HH is CrC^{r}, this function is Cr2C^{r-2} and using (D.1) we obtain

G(z,m)=c2+c3z2+c4zm+c6z3m+O(m2).G(z,m)=c_{2}+c_{3}z^{2}+c_{4}zm+c_{6}z^{3}m+O(m^{2}). (D.2)

Since c30c_{3}\neq 0 the Implicit Function Theorem can be applied to obtain z=z(m)z=z(m) solving G(z,m)=0G(z,m)=0 provided we choose z(0)=z0z(0)=z_{0} such that G(z0,0)=0G(z_{0},0)=0. There are two choices, z0=±c2c3z_{0}=\pm\sqrt{\frac{-c_{2}}{c_{3}}}, and with either z(m)z(m) is Cr2C^{r-2}.

By multiplying each z(m)z(m) by mm we obtain the desired fixed points, call them x1(m)x_{1}(m) and x2(m)x_{2}(m). These are Cr1C^{r-1} and by using (D.2) and matching terms of power series we readily arrive at

xk(m)=(1)kc2c3m+c2c6c3c42c32m2+O(m3),x_{k}(m)=(-1)^{k}\sqrt{\frac{-c_{2}}{c_{3}}}\,m+\frac{c_{2}c_{6}-c_{3}c_{4}}{2c_{3}^{2}}\,m^{2}+O(m^{3}), (D.3)

for k{1,2}k\in\{1,2\}. By substituting c4=fμx(0,0)c_{4}=f_{\mu x}(0,0) and c6=16fxxx(0,0)c_{6}=\frac{1}{6}f_{xxx}(0,0) (also c2c_{2} and c3c_{3} given above) we obtain the expression for xk(m)x_{k}(m) given in the main article.

By (D.1), the derivative of the map is

fx(x,m2)=1+2c3x+c4m2+3c6x2+O((|x|+|m|)3),\displaystyle f_{x}(x,m^{2})=1+2c_{3}x+c_{4}m^{2}+3c_{6}x^{2}+O\!\mathopen{}\mathclose{{}\left((|x|+|m|)^{3}}\right), (D.4)

and by substituting (D.3)

fx(xk(m),m2)=1+2(1)k+1c2c3m2c2c6c3m2+O(m3).f_{x}(x_{k}(m),m^{2})=1+2(-1)^{k+1}\sqrt{-c_{2}c_{3}}\,m-\frac{2c_{2}c_{6}}{c_{3}}\,m^{2}+O(m^{3}). (D.5)

Appendix E Calculations for the Pitchfork Bifurcation

The map is f(x,μ)=x+xK(x,μ)f(x,\mu)=x+xK(x,\mu) and we write

K(x,μ)=c2μ+c3x2+c4μx+c5μ2+c6x3+c7μx2+c8x4+,K(x,\mu)=c_{2}\mu+c_{3}x^{2}+c_{4}\mu x+c_{5}\mu^{2}+c_{6}x^{3}+c_{7}\mu x^{2}+c_{8}x^{4}+\cdots, (E.1)

with c2=fxμ(0,0)>0c_{2}=f_{x\mu}(0,0)>0 and c3=16fxxx(0,0)<0c_{3}=\frac{1}{6}f_{xxx}(0,0)<0. In (E.1) we have included only the terms that are fourth order or lower in xx and mm, where μ=m2\mu=m^{2}.

The trivial fixed point is x=0x=0; the non-trivial fixed points, valid for small μ>0\mu>0, are xk(m)x_{k}(m), k{1,2}k\in\{1,2\}, satisfying K(xk(m),m2)=0K(x_{k}(m),m^{2})=0. This last equation is identical to that in the saddle-node case, so by importing (D.3) we have

xk(m)=(1)kc2c3m+c2c6c3c42c32m2+(1)kLm3+O(m4),x_{k}(m)=(-1)^{k}\sqrt{\frac{-c_{2}}{c_{3}}}\,m+\frac{c_{2}c_{6}-c_{3}c_{4}}{2c_{3}^{2}}\,m^{2}+(-1)^{k}Lm^{3}+O(m^{4}), (E.2)

for some LL\in\mathbb{R}. For the pitchfork case we unfortunately need a formula for LL, so substitute (E.2) into K(xk(m),m2)K(x_{k}(m),m^{2}) to obtain

K(xk(m),m2)\displaystyle K(x_{k}(m),m^{2}) =[2(1)kc3c2c3L+(c2c6c3c4)24c33+c2c4c6c3c422c32\displaystyle=\Bigg{[}2(-1)^{k}c_{3}\sqrt{\frac{-c_{2}}{c_{3}}}L+\frac{(c_{2}c_{6}-c_{3}c_{4})^{2}}{4c_{3}^{3}}+\frac{c_{2}c_{4}c_{6}-c_{3}c_{4}^{2}}{2c_{3}^{2}}
+c53c2c6(c2c6c3c4)2c33c2c7c3+c22c8c32]m4+O(m5).\displaystyle\quad+c_{5}-\frac{3c_{2}c_{6}(c_{2}c_{6}-c_{3}c_{4})}{2c_{3}^{3}}-\frac{c_{2}c_{7}}{c_{3}}+\frac{c_{2}^{2}c_{8}}{c_{3}^{2}}\Bigg{]}m^{4}+O(m^{5}). (E.3)

We then set the m4m^{4} coefficient to zero to obtain

L=12c2c3[5c22c624c32+3c2c4c62c32c424c3+c5c2c7c3+c22c8c32].L=\frac{1}{2\sqrt{-c_{2}c_{3}}}\mathopen{}\mathclose{{}\left[-\frac{5c_{2}^{2}c_{6}^{2}}{4c_{3}^{2}}+\frac{3c_{2}c_{4}c_{6}}{2c_{3}^{2}}-\frac{c_{4}^{2}}{4c_{3}}+c_{5}-\frac{c_{2}c_{7}}{c_{3}}+\frac{c_{2}^{2}c_{8}}{c_{3}^{2}}}\right].

We now evaluate the multipliers of the fixed points. The derivative of the map is

fx(x,m2)\displaystyle f_{x}(x,m^{2}) =1+K(x,m2)+xKx(x,m2)\displaystyle=1+K(x,m^{2})+xK_{x}(x,m^{2})
=1+c2m2+3c3x2+2c4m2x+c5m4+4c6x3+3c7m2x2+5c8x4\displaystyle=1+c_{2}m^{2}+3c_{3}x^{2}+2c_{4}m^{2}x+c_{5}m^{4}+4c_{6}x^{3}+3c_{7}m^{2}x^{2}+5c_{8}x^{4}
+O((|x|+|m|)5).\displaystyle\quad+O\!\mathopen{}\mathclose{{}\left((|x|+|m|)^{5}}\right).

We evaluate this at the fixed points to obtain (after simplification involving substituting in the above formula for LL):

fx(0,m2)\displaystyle f_{x}(0,m^{2}) =1+c2m2+c5m4+O(m5),\displaystyle=1+c_{2}m^{2}+c_{5}m^{4}+O(m^{5}), (E.4)
fx(xk(m),m2)\displaystyle f_{x}(x_{k}(m),m^{2}) =12c2m2+(1)kBm3+Cm4+O(m5),\displaystyle=1-2c_{2}m^{2}+(-1)^{k}Bm^{3}+Cm^{4}+O(m^{5}), (E.5)

where

B\displaystyle B =c2c33(c2c6+c3c4),\displaystyle=\sqrt{\frac{-c_{2}}{c_{3}^{3}}}(c_{2}c_{6}+c_{3}c_{4}), (E.6)
C\displaystyle C =3c22c622c33+c2c4c6c32+c422c32c5+2c22c10c32.\displaystyle=-\frac{3c_{2}^{2}c_{6}^{2}}{2c_{3}^{3}}+\frac{c_{2}c_{4}c_{6}}{c_{3}^{2}}+\frac{c_{4}^{2}}{2c_{3}}-2c_{5}+\frac{2c_{2}^{2}c_{10}}{c_{3}^{2}}. (E.7)

These are easily rewritten in terms of the derivatives of ff at (x,μ)=(0,0)(x,\mu)=(0,0) by using (E.1).

Appendix F Calculations for the Period-doubling Bifurcation

The map is f(x,μ)=x+xP(x,μ)f(x,\mu)=-x+xP(x,\mu) and we write

P(x,μ)=b1x+b2μ+b3x2+b4μx+b5μ2+b6x3+b7μx2+b8x4+,P(x,\mu)=b_{1}x+b_{2}\mu+b_{3}x^{2}+b_{4}\mu x+b_{5}\mu^{2}+b_{6}x^{3}+b_{7}\mu x^{2}+b_{8}x^{4}+\cdots, (F.1)

where, as in the pitchfork case, we have included only the terms that are fourth order or lower in xx and mm, where μ=m2\mu=m^{2}. The trivial fixed point is x=0x=0 with multiplier

fx(0,m2)=1+b2m2+b5m4+O(m5).f_{x}(0,m^{2})=-1+b_{2}m^{2}+b_{5}m^{4}+O(m^{5}). (F.2)

By direct calculations we obtain f2(x,μ)=x+xG(x,μ)f^{2}(x,\mu)=x+xG(x,\mu) where

G(x,μ)=c2μ+c3x2+c4μx+c5μ2+c6x3+c7μx2+c8x4+,G(x,\mu)=c_{2}\mu+c_{3}x^{2}+c_{4}\mu x+c_{5}\mu^{2}+c_{6}x^{3}+c_{7}\mu x^{2}+c_{8}x^{4}+\cdots, (F.3)

with

c2=2b2=2fxμ>0,c3=2(b12+b3)=16(3fxx2+2fxxx)<0,c4=b1b2=12fxxfxμ,c5=b222b5=fxμ2+fxμμ),c6=b1(b12+b3)=124fxx(3fxx2+2fxxx),c7=2b74b1b4+2b12b2+4b2b3=112(3fxxfxxμ+6fxx2fxμ+8fxμfxxx8fxxxμ),c8=2b106b1b6b12b3+3b32=160fxxxxx18fxxfxxxx+112fxxx2124fxx2fxxx,\begin{split}c_{2}&=-2b_{2}=-2f_{x\mu}>0,\\ c_{3}&=-2(b_{1}^{2}+b_{3})=-\frac{1}{6}(3f_{xx}^{2}+2f_{xxx})<0,\\ c_{4}&=-b_{1}b_{2}=-\frac{1}{2}f_{xx}f_{x\mu}\,,\\ c_{5}&=b_{2}^{2}-2b_{5}=f_{x\mu}^{2}+f_{x\mu\mu})\,,\\ c_{6}&=b_{1}(b_{1}^{2}+b_{3})=\frac{1}{24}f_{xx}(3f_{xx}^{2}+2f_{xxx}),\\ c_{7}&=-2b_{7}-4b_{1}b_{4}+2b_{1}^{2}b_{2}+4b_{2}b_{3}\\ &=\frac{1}{12}(3f_{xx}f_{xx\mu}+6f_{xx}^{2}f_{x\mu}+8f_{x\mu}f_{xxx}-8f_{xxx\mu})\,,\\ c_{8}&=-2b_{10}-6b_{1}b_{6}-b_{1}^{2}b_{3}+3b_{3}^{2}\\ &=-\frac{1}{60}f_{xxxxx}-\frac{1}{8}f_{xx}f_{xxxx}+\frac{1}{12}f_{xxx}^{2}-\frac{1}{24}f_{xx}^{2}f_{xxx}\,,\end{split} (F.4)

where all derivatives of ff are evaluated at (x,μ)=(0,0)(x,\mu)=(0,0). The non-trivial fixed points of f2f^{2} are given by (E.2) with (E). They have the same multiplier, call it D(m)D(m), given by (E.5). By substituting (F.4) into (E.5) we obtain

D(m)=1+4b2m2+Mm4+O(m5),\displaystyle D(m)=1+4b_{2}m^{2}+Mm^{4}+O(m^{5}), (F.5)

where the m3m^{3} term has vanished because c2c6+c3c4=0c_{2}c_{6}+c_{3}c_{4}=0, and

M=4b5b22(b12+b3)2(b14+5b12b34b32+12b1b6+4b8).M=4b_{5}-\frac{b_{2}^{2}}{(b_{1}^{2}+b_{3})^{2}}\mathopen{}\mathclose{{}\left(b_{1}^{4}+5b_{1}^{2}b_{3}-4b_{3}^{2}+12b_{1}b_{6}+4b_{8}}\right). (F.6)

The normal form gg has b2=1b_{2}=-1, b3=1b_{3}=1, and b8=ab_{8}=a. By substituting these into the above formulas we find that the trivial fixed point of gg has multiplier 1ν-1-\nu and the non-trivial fixed points of g2g^{2} have multiplier d(a,n)=14n2+4(1a)n4+O(n5)d(a,n)=1-4n^{2}+4(1-a)n^{4}+O(n^{5}) (where ν=n2\nu=n^{2}). By matching the multipliers of the trivial fixed points we obtain

ν=b2μb5μ2+O(μ3).\nu=-b_{2}\mu-b_{5}\mu^{2}+O(\mu^{3}). (F.7)

By using this and equating the multipliers of the non-trivial fixed points we obtain

0=(4(1a)b22+4b5M)m4+O(m5).0=\mathopen{}\mathclose{{}\left(4(1-a)b_{2}^{2}+4b_{5}-M}\right)m^{4}+O(m^{5}).

In order for the m4m^{4} term to vanish we must have

a\displaystyle a =1+4b5M4b22\displaystyle=1+\frac{4b_{5}-M}{4b_{2}^{2}}
=1(b12+b3)2(54b14+134b12b3+3b1b6+b8)+O(m)\displaystyle=\frac{1}{(b_{1}^{2}+b_{3})^{2}}\mathopen{}\mathclose{{}\left(\frac{5}{4}b_{1}^{4}+\frac{13}{4}b_{1}^{2}b_{3}+3b_{1}b_{6}+b_{8}}\right)+O(m)
=1(3fxx2+2fxxx)2(454fxx4+392fxx2fxxx+9fxxfxxxx+65fxxxxx)|(0,0).\displaystyle=\frac{1}{\mathopen{}\mathclose{{}\left(3f_{xx}^{2}+2f_{xxx}}\right)^{2}}\mathopen{}\mathclose{{}\left(\frac{45}{4}f_{xx}^{4}+\frac{39}{2}f_{xx}^{2}f_{xxx}+9f_{xx}f_{xxxx}+\frac{6}{5}f_{xxxxx}\middle)}\right|_{(0,0)}.

References

  • [1] D.K. Arrowsmith and C.M. Place, An Introduction to Dynamical Systems, CUP, Cambridge, 1990.
  • [2] G.R. Belitskii (1986) Smooth classification of one-dimensional diffeomorphisms with hyperbolic fixed points, Sibirskii Matematicheskii Zhurnal, 27, pp. 25–27. (Translated in Siberian Mathematical Journal, 27, pp. 801–804).
  • [3] B. Blackadar (2015) A general implicit/inverse function theorem, arXiv:1509.06025v3.
  • [4] R.L. Devaney, An Introduction to Chaotic Dynamical Systems, (2nd Edition), Addison-Wesley, Redwood, 1989.
  • [5] P. Glendinning, Stability, Instability and Chaos: An Introduction to the Theory of Nonlinear Differential Equations, CUP, Cambridge, 1994.
  • [6] P.A. Glendinning and D.J.W. Simpson (2022) Normal forms for saddle-node bifurcations: Takens’ coefficient and applications to climate models, in preparation.
  • [7] P. Glendinning and S. Glendinning (2021) Smooth conjugacy of difference equations derived from elliptic curves, J. Diff. Equat. Appl. 27, pp. 1419–1433.
  • [8] J. Guckenheimer and P. Holmes, Nonlinear Oscillations, Dynamical Systems and Bifurcations of Vector Fields, Appl. Math. Sci. vol 42, Springer, New York, 1983.
  • [9] G. Iooss and D.D. Joseph, Elementary Stability and Bifurcation Theory, UTM, Springer, New York, 1980.
  • [10] M. Kuczma, B. Choczewski and R. Ger, Iterative Functional Equations, CUP, Cambridge, 1990.
  • [11] Y.A. Kuznetsov, Elements of Applied Bifurcation Theory, Appl. Math. Sci. vol 112, Springer, New York, 1995.
  • [12] J. Montaldi, Singularities, Bifurcations and Catastrophes, CUP, Cambridge, 2021.
  • [13] A.G. O’Farrell and M. Roginskaya (2009) Reducing conjugacy in the full diffeomorphism group of \mathbb{R} to conjugacy in the subgroup of orientation-preserving maps, J. Math. Sci., 158, pp. 895-–898.
  • [14] A.G. O’Farrell and M. Roginskaya (2011) Conjugacy of real diffeomorphisms. A survey, St. Petersburg Math. J., 22, pp. 1–40.
  • [15] S. Sternberg (1957) Local CnC^{n} transformations of the real line, Duke Math. J., 24, pp. 97–102.
  • [16] F. Takens (1973) Normal forms for certain singularities of vectorfields, Ann. Inst. Fourier, 23, pp. 163–195.
  • [17] S. Wiggins, Introduction to Applied Nonlinear Dynamical Systems and Chaos, (2nd Edition), Texts in Appl. Math. 2, Springer, New York, 2003.
  • [18] T.R. Young (1997) CkC^{k} conjugacy of 1-D diffeomorphisms with periodic points, Proc. AMS, 125, pp. 1987–1995.