Ordinals and recursively defined functions on the reals

Abstract

We determine sufficient conditions under which certain recursively defined functions are well defined for all real inputs. Given a function $f:\mathbb R\to\mathbb R$, call a decreasing sequence $x_1>x_2>x_3>\cdots$ &#34;$f$-bad&#34; if $f(x_1)>f(x_2)>f(x_3)>\cdots$, and call the function $f$ &#34;ordinal decreasing&#34; if there exist no infinite $f$-bad sequences. We prove the following result: Given ordinal decreasing functions $f,g_1,\ldots,g_k,s$ that are everywhere larger than $0$, define the recursive algorithm &#34;$M(x)$: if $x<0$ return $f(x)$, else return $g_1(-M(x-g_2(-M(x-\cdots-g_k(-M(x-s(x)))\cdots))))$&#34;. Then $M(x)$ halts and is ordinal decreasing for all $x \in \mathbb{R}$. The recursive algorithms $M$ and $M_n$ previously studied in the context of fusible numbers by Ericskon et al. (2022) and Bufetov et al. (2024), respectively, are special cases of this scheme. Moreover, given an ordinal decreasing function $f$, denote by $o(f)$ the ordinal height of the root of the tree of $f$-bad sequences. Then we prove that, for $k\ge 2$, the function $M(x)$ defined by the above algorithm satisfies $o(M)\leφ_{k-1}(γ+o(s)+1)$, where $γ$ is the smallest ordinal such that $\max\{o(s),o(f),o(g_1), \ldots, o(g_k)\} <φ_{k-1}(γ)$.