--- title: Superoptimal Continued Fraction Expansions url: https://www.emergentmind.com/topics/superoptimal-continued-fraction-expansions type: topic --- # Superoptimal Continued Fraction Expansions Superoptimal continued fraction expansions are continued-fraction constructions optimized against an explicit notion of approximation quality. In the asymptotic theory of special functions, a depth-\(k\) continued fraction is called *superoptimal* or *fastest possible of depth \(k\)* when, among all admissible continued fractions of that depth, it maximizes the decay order of the remainder \(E_k(x)\) as \(x\to\infty\) [1508.00176]. In the metric theory of irrational numbers, a possibly non-regular expansion with convergents \(P_k/Q_k\) is called \((\varepsilon,C)\)-superoptimal when every convergent satisfies a uniform approximation-coefficient bound \(Q_k^2|x-P_k/Q_k|\le\varepsilon\) and the selected subsequence advances at least \(C\)-times as fast as the ordinary continued fraction [2508.19743]. A related Diophantine usage appears in closed-form continued fractions for cubic Laurent series and cubic irrationals, where explicit expansions yield infinitely many better-than-expected rational approximations for certain families [2211.08663]. ## 1. Terminology and formal definitions The literature suggests two distinct technical meanings of *superoptimal*, unified by an extremal viewpoint but attached to different ambient problems. | Setting | Object being expanded | Optimization criterion | |---|---|---| | Asymptotic special-function setting | \(f(x)\) on \((0,\infty)\) | Maximize the asymptotic convergence order \(R(E_k)\) at fixed depth \(k\) | | Irrational-number setting | \(x\in \mathbb R\setminus\mathbb Q\) | Enforce \(\Theta(x,P_k/Q_k)\le\varepsilon\) and \(\liminf n(k)/k\ge C\) | | Cubic Laurent-series setting | Explicit algebraic Laurent series and cubic irrationals | Produce closed-form expansions and very good rational approximations | In the asymptotic setting, one assumes \[ \lim_{x\to\infty}x^{-\nu}f(x)=c\neq 0,\qquad \nu\in\mathbb Z_{\ge 0}, \] says that \(f\) is of order \(x^\nu\), and writes \(R(f(x)):=\nu\). One then seeks \[ \CF^{(k)}(x)=\Phi_0(x)+\MC^{(1)}(x)+\MC^{(2)}(x)+\cdots+\MC^{(k)}(x), \] where \(\Phi_0\) is a polynomial of degree \(\nu\), each correction \(\MC^{(j)}\) is a partial continued-fraction layer of Type-I or Type-II, and \[ E_k(x)=f(x)-\CF^{(k)}(x),\qquad R(E_k(x))=\sup\{\mu:E_k(x)=O(x^{-\mu})\}. \] The approximant is superoptimal if \(R(E_k(x))\) is maximal among all continued fractions of depth \(k\) [1508.00176]. In the irrational-number setting, if \(P_k/Q_k\) are the reduced convergents of a generalized continued fraction for \(x\), and \(p_n/q_n\) are the convergents of the ordinary continued fraction, the approximation-coefficient is \[ \Theta\bigl(x,\tfrac PQ\bigr)=Q^2\bigl|x-\tfrac PQ\bigr|. \] For the unique \(n(k)\) with \(q_{n(k)}\le Q_k1\) such that \[ \ell=\lim_{x\to\infty}x^\lambda\bigl(f(x)-f(x+1)\bigr)\in\mathbb R, \] then \[ \lim_{x\to\infty}x^{\lambda-1}f(x)=\frac{\ell}{\lambda-1}. \] The proof sketch given in the source writes \(f(x)=\sum_{m\ge x}[f(m)-f(m+1)]\), compares this with a Riemann sum, and then applies the limit hypothesis [1508.00176]. This lemma converts information about the discrete difference \(f(x)-f(x+1)\) into information about the actual order of \(f(x)\). For continued-fraction optimization, that conversion is crucial because the remainder after a correction step is typically easier to analyze through a transformed difference than directly. The companion device is the Mortici-transformation. With \[ E_k(x)=f(x)-\bigl(\Phi_0(x)+\MC^{(k)}(x)\bigr), \] the transformation rewrites the error-rate of \(\CF^{(k)}\) into the convergence-rate of a single log-difference; in the paper this is recorded as formula (4.23). The significance is computational: asymptotic bookkeeping becomes the analysis of one logarithmic expression rather than a direct treatment of the full remainder. This is the mechanism used repeatedly to certify that each correction-step maximizes the exponent of the remainder and that no faster expansion of the same depth exists [1508.00176]. A plausible implication is that the multiple-correction method and the Mortici-transformation form a paired methodology: the first proposes correction layers, and the second proves their optimality. ## 4. Special-function realizations: unit-ball volumes, Gamma quotients, and conjectures The principal applications in the special-function direction concern the volume of the unit ball and ratios of Gamma functions. Writing \(\Omega_n\) for the volume of the unit ball in \(\mathbb R^n\), Theorem 3 gives a superoptimal continued fraction for \(\Omega_{n+1}/\Omega_n\) with odd-square numerators \((2m-1)^2\) and denominator block \(2(2n+1)\), while Theorem 4 gives the dual expansion for \(\Omega_{n-1}/\Omega_n\) with denominator block \(2n+1\) and leading factor \(1/\pi\) [1508.00176]. The optimality proof is structural rather than ad hoc. At each correction-step, Mortici’s lemma is used to verify that no further cancellation of asymptotic terms is possible, and the continued fraction is therefore fastest possible. From the first two approximants, the paper also derives sharp double inequalities for \(\Omega_n\). Theorem 2 gives Gosper–Ramanujan-type bounds for all integers \(n\ge 24\), and an additional upper bound for \(n\ge 20\); these are obtained by bounding the first-error terms \(E_0\) and \(E_1\) via telescoping and Hermite–Hadamard inequalities [1508.00176]. A second family of examples refines Ramanujan’s continued fractions for Gamma-quotients. For \[ P= \frac{\Gamma\!\bigl(\tfrac14(x+l+n+1)\bigr)\, \Gamma\!\bigl(\tfrac14(x-l+n+1)\bigr)\, \Gamma\!\bigl(\tfrac14(x+l-n+1)\bigr)\, \Gamma\!\bigl(\tfrac14(x-l-n+1)\bigr)} {\Gamma\!\bigl(\tfrac14(x+l+n+3)\bigr)\, \Gamma\!\bigl(\tfrac14(x-l+n+3)\bigr)\, \Gamma\!\bigl(\tfrac14(x+l-n+3)\bigr)\, \Gamma\!\bigl(\tfrac14(x-l-n+3)\bigr)}, \] Theorem 5 states that \[ P= \frac{1}{(x-l-n+1)/2} +\cfrac{(1-n^2)(1-l^2)}{2(x-l-n+1)+ \cfrac{(3-n^2)(3-l^2)}{2(x-l-n+1)+\cdots}}. \] Setting \(l=0\) yields Theorem 6: \[ \frac{\Gamma\bigl(\tfrac12(x+n+1)\bigr)\,\Gamma\bigl(\tfrac12(x-n+1)\bigr)} {\Gamma\bigl(\tfrac12(x+n+3)\bigr)\,\Gamma\bigl(\tfrac12(x-n+3)\bigr)} = \frac{1}{2(x-n+1)} +\cfrac{(1-n^2)}{2(x-n+1)+ \cfrac{(3-n^2)}{2(x-n+1)+\cdots}}, \] valid for \(\Re(x)>0\) or odd integer \(n\). Each step of the multiple-correction, tested via the Mortici-transformation, maximizes the exponent of the remainder, so no faster expansion exists [1508.00176]. The paper closes with three conjectures on further Gamma-ratio continued fractions: for \(\Gamma(x+3)/\Gamma(x+1)\), for \(\Gamma(x+2)/\Gamma(x+1)\), and for \(\Gamma(x+\eta)\Gamma(x+1-\eta)/\Gamma(x+1)\). Each conjecture is supported by computing the first six-to-ten continued-fraction layers via symbolic software, observing simple patterns in \(\kappa_m,\lambda_m\), and checking them against the Mortici-transformation up to a high order. A rigorous proof would require verifying that no further cancellation of asymptotic terms is possible, which is exactly the condition for fastest-possible convergence [1508.00176]. ## 5. Superoptimal expansions of irrationals via inducing on the Gauss map For irrational numbers, the modern superoptimality framework is dynamical. Sanderson’s construction induces on Nakada’s natural extension of the Gauss map, \[ \Omega=[0,1)\times[0,1],\qquad \mathcal G:\Omega\to\Omega, \] with unique absolutely-continuous invariant probability \(\bar\nu_G\), and uses \[ g(x,y)=\frac{y}{1+xy}. \] If \(\mathcal G^n(x,0)=(x_n,y_n)\), then \[ \Theta\!\bigl(x,\tfrac{p_{n-1}}{q_{n-1}}\bigr)=g(x_n,y_n). \] This identity links approximation quality directly to the induced orbit [2508.19743]. Theorem 2.1 states: if \(\Delta\subset\Omega\) is a continuity-set for \(\bar\nu_G\) satisfying \[ \Delta\subset\{(x,y):g(x,y)\le\varepsilon\}, \qquad 0<\bar\nu_G(\Delta)\le \frac1C, \] then for almost every \(x\in(0,1)\) the contraction-expansion produced by inducing on \(\Delta\) is \((\varepsilon,C)\)-superoptimal. The proof combines the pointwise control \(g\le\varepsilon\) on returns to \(\Delta\) with Birkhoff’s theorem for the return frequency, yielding the approximation bound and the speed condition \(\liminf n(k)/k\ge C\) [2508.19743]. The same ergodic framework yields quantitative growth laws. A classical theorem of Lévy gives \[ \lim_{n\to\infty}\frac1n\log q_n=\frac{\pi^2}{12\log 2}, \qquad \lim_{n\to\infty}\frac1n\log\bigl|x-\tfrac{p_n}{q_n}\bigr| =-\frac{\pi^2}{6\log 2}. \] Corollary 2.2 then shows that for the \(\Delta\)-induced expansion, \[ \lim_{k\to\infty}\frac1k\log Q_k =\frac{\pi^2}{12\log2\,\bar\nu_G(\Delta)}, \qquad \lim_{k\to\infty}\frac1k\log\Bigl|x-\tfrac{P_k}{Q_k}\Bigr| =-\frac{\pi^2}{6\log2\,\bar\nu_G(\Delta)}. \] In particular, \[ \bigl|x-\tfrac{P_k}{Q_k}\bigr|=O(e^{-\kappa k}), \qquad \kappa=\frac{\pi^2}{6\log2\,\bar\nu_G(\Delta)}>0. \] Since \(\bar\nu_G(\Delta)\) can be made small by choosing \(\Delta\) small, the convergence can be made arbitrarily fast [2508.19743]. This formulation differs sharply from the special-function setting. The optimization is not over depth-\(k\) cancellations of asymptotic terms, but over induced regions \(\Delta\) that control both the approximation coefficient and the relative speed of the chosen convergent subsequence. ## 6. Contraction algorithms, explicit examples, and comparison with ordinary continued fractions The algorithmic core of the irrational-number theory is Seidel’s contraction theorem. Given an increasing sequence of indices \(\{n_k\}\) in the ordinary continued fraction of \(x\), one may contract out all other convergents and produce a generalized continued fraction whose convergents are exactly \(p_{n_k}/q_{n_k}\). In Sanderson’s construction one takes \[ n_k=j_{k+1}-1, \] where \(j_{k+1}\) is the \(\mathcal G\)-hitting time of \((x,0)\) into \(\Delta\) [2508.19743]. Proposition 3.1 then expresses the partial numerators \(\alpha_k\) and denominators \(\beta_k\) of the contracted expansion through the return matrix \[ M_\Delta(z_k)= \begin{pmatrix} r_k & p_k\\ s_k & q_k \end{pmatrix}, \] accumulated during the first return. The resulting formulas are \[ \alpha_{k+1}=\frac{(-1)^{j(\mathcal G_\Delta(z_k))+1}s_k}{s(\mathcal G_\Delta(z_k))}, \qquad \beta_{k+1}=q_k+\frac{s_k\,r(\mathcal G_\Delta(z_k))}{s(\mathcal G_\Delta(z_k))}. \] The paper emphasizes that no prior knowledge of the simple continued fraction of \(x\) is needed: one follows the forward orbit in \(\Delta\), records the sub-rectangle reached, and writes down \(\alpha,\beta\). A basic concrete family is obtained from \[ \Delta=\{(x,y):0\le y\le 1/b\},\qquad b\in\mathbb N,\ b>1. \] In this case \[ \bar\nu_G(\Delta)=\frac{\log(1+1/b)}{\log 2}, \] and \(\Delta\subset\{g\le 1/b\}\), so for almost every \(x\) the induced expansion is \[ \Bigl(1/b,\ \log2/\log(1+1/b)\Bigr)\text{-superoptimal}. \] For \(b=2\), the paper obtains the so-called Fibonacci continued-fractions. When \(\mathcal G_\Delta^k(x,0)\) lands in the subregion corresponding to a word \(W\) of \(1\)’s of length \(n\) and next digit \(a\ge 2\), the return matrix becomes \[ M_\Delta= \begin{pmatrix} F_n & aF_n+F_{n-1}\\ F_{n+1} & aF_{n+1}+F_n \end{pmatrix}, \] with \(F_n\) the \(n\)-th Fibonacci number. For the numerical example \(x=\pi-3\approx 0.14159\), the first visited subregions are indexed by \[ n=0,a=7;\qquad n=0,a=15;\qquad n=1,a=292;\dots \] and the resulting expansion begins \[ x=[\,0\;;\,1/7,\;1/16,\;-\tfrac1{881/3},\;\dots], \] with convergents \[ \frac PQ=0,\ \frac17,\ \frac{16}{113},\ \frac{14093}{99532},\dots, \] each satisfying \(Q^2|x-P/Q|\le 1/2\) [2508.19743]. The comparison with the regular continued fraction is explicit. Ordinary continued fractions satisfy \[ \Bigl|x-\frac{p_n}{q_n}\Bigr|<\frac1{a_{n+1}q_n^2}\le \frac1{q_n^2}, \] and on average \(\log q_n\sim (\pi^2/(12\log2))\,n\). By contrast, a \((\varepsilon,C)\)-superoptimal expansion satisfies the uniform bound \[ \Bigl|x-\frac{P_k}{Q_k}\Bigr|\le \frac{\varepsilon}{Q_k^2}, \] and has average denominator growth \[ \log Q_k\sim \frac{\pi^2}{12\log2\,\bar\nu_G(\Delta)}\,k. \] Since \(\bar\nu_G(\Delta)\le 1/C\), one obtains \[ \lim_{k\to\infty}\frac{n(k)}{k}=\frac1{\bar\nu_G(\Delta)}\ge C. \] Thus, by choosing \(\Delta\) suitably, one can make the uniform error constant \(\varepsilon\) arbitrarily small and the speed-factor \(C\) arbitrarily large [2508.19743]. ## 7. Closed-form cubic expansions and broader Diophantine scope A related but not identical usage of the superoptimal theme appears in Badziahin’s work on cubic Laurent series. That paper constructs continued fraction expansions for several families of Laurent series in \(\mathbb Q[[t^{-1}]]\), stating that this is the first result of this kind since Gauss derived the continued fraction expansion for \((1+t)^r\), \(r\in\mathbb Q\), in 1813 [2211.08663]. Six closed-form “Gauss-type” continued-fraction expansions are produced. In each family, one proves by Newton-Puiseux plus a Riccati-equation argument that there is a unique Laurent-series solution \(x(t)\in\mathbb Q[[t^{-1}]]\) of the cubic algebraic equation of positive degree, and then checks by induction, via the transform \(\phi_{a,\beta}:x\mapsto 1/(x-a/\beta)\), that the partial quotients and multipliers follow a simple periodic-template pattern. Convergence near \(t=\infty\) is verified by a non-Archimedean analogue of Pringsheim’s criterion in \(\mathbb Q[[t^{-1}]]\) [2211.08663]. Theorem 3 states that every real cubic irrational \(\xi\) admits a closed-form continued fraction: there exists a Möbius transformation \[ \mu(x)=\frac{cx+d}{ux+v}, \qquad u,v,c,d\in\mathbb Z,\quad ad-bc=\pm 1, \] such that \(\mu(\xi)\) is exactly the solution of one of the “№4”-type equations and hence admits the explicit continued-fraction expansion of Family №4. In particular, every real cubic irrational has an explicit closed-form continued-fraction expansion [2211.08663]. The Diophantine applications are more specific. Theorem 2 asserts that for any \[ \tau<3+\frac{15\ln 2}{24}\approx 3.4332 \] there exists an effectively computable \(c>0\) such that for every \(N>0\) there are infinitely many real cubic irrationals \(\xi\) with naïve height \(H(\xi)\) for which \[ \|q\xi\|< \bigl(H(\xi)^{\tau}\,q\,\exp(c\sqrt{\ln q})\bigr)^{-1} \] has more than \(N\) solutions \(q\in\mathbb N\). The exposition describes these as infinite families of “superoptimal” approximations, and contrasts them with the generic exponent \(2\) from Dirichlet and the Roth-limit \(2+\varepsilon\) [2211.08663]. Theorem 1 gives a fully explicit lower bound for \(\|q\xi\|\) for the unique real solution \(\xi>\sqrt a\) of \[ 3x^3-3tx^2-3ax+at=0 \] under the condition \(t^2>9a\), with explicit constants \(\tau_1,\tau_2,c_1,c_2,c_3\). The source states that, for fixed \(a,t\), this is a genuine improvement over Liouville’s bound \(|\xi-p/q|\gg q^{-3}\) [2211.08663]. This broader usage suggests that *superoptimal continued fraction expansions* now names a family of extremal constructions rather than a single rigid definition. In one branch, the extremality is asymptotic and depth-constrained; in another, it is metric and ergodic; in a third, it appears through closed-form algebraic expansions that generate unusually strong rational approximation phenomena. Source: https://www.emergentmind.com/topics/superoptimal-continued-fraction-expansions