Past exam of the flows, fluctuations and complexity course of the University of Oxford / 2016 / 3 / b

For $r>0$, the origin always exists. Its derivative $r-1$ makes it attracting for $0<r<1$ and repelling for $r>1$. Nonzero equilibria solveThey occur in symmetric pairs. On the first positive lobe $0<x<\pi$, the sinc function decreases from one to zero, giving one positive and one negative nonzero equilibrium for $0<r<1$. Both are repelling, since $f^{\prime }=\sin x/x-\cos x>0$ there. Near $r=1$,The unstable branches meet the stable origin in a subcritical pitchfork bifurcation. At $r=1$ the origin is still nonlinearly repelling because the leading term is $+x^3/6$. For $1<r\le 2$ it is the only equilibrium.

For each higher positive-sine lobe $2n\pi <x<(2n+1)\pi$, $n\ge 1$, the sinc function has a single positive maximum at $a_n$, whereIf $0<r<r_n$, that lobe has two roots: the smaller positive root is attracting and the larger is repelling, because $f^{\prime }=-xd(\sin x/x)/dx$. Their negative counterparts have the same stability. At $r=r_n$ the pair on each side merges in a saddle-node bifurcation; the double equilibria are semistable. For $r>r_n$ that lobe contributes none. The first such threshold is about $0.128375$.

For $n\gg 1$, put $b_n=(2n+1/2)\pi$; expanding near the sine maximum gives $a_n=b_n-b_n^{-1}+O(b_n^{-3})$ and $r_n\simeq 1/b_n$. Away from bifurcation values, the exact counting rule for $0<r<1$ and its small-$r$ estimate areAt a saddle-node threshold, count each merged positive or negative equilibrium once rather than twice. Infinitely many thresholds accumulate at $r=0$, consistent with the infinitely many equilibria in solution.