Abstract
By using a jump transformation associated to the Romik map, we define a new continued fraction algorithm called odd-odd continued fraction, whose principal convergents are rational numbers of odd denominators and odd numerators. Among others, it is proved that all the best approximating rationals of odd denominators and odd numerators of an irrational number are given by the principal convergents of the odd-odd continued fraction algorithm and vice versa.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
One main topic of Diophantine approximation studies the approximation of an irrational number by rational numbers. Given an irrational number x, we call a rational p/q a best approximation of x if
Here, and in the whole paper, by convention, when we write a rational number p/q, we always assume that \(p \in {\mathbb {Z}}\), \(q \in {\mathbb {N}}\) and p and q are coprime. The celebrated Lagrange Theorem (see [17, Chapter II] and [12, Section 6]) states that the best approximations of an irrational number x are the convergents, i.e., the finite truncations of the regular continued fraction (RCF) of x:
where \(d_0\in {\mathbb {Z}}\) and \(d_j\in {\mathbb {N}}\), for \(j\ge 1\). More precisely, a rational p/q is a best approximation of an irrational x if and only if it is one of the convergents:
Let \({\mathbb {H}}= \{z\in {\mathbb {C}}: {{\,\mathrm{Im}\,}}(z)>0\}\) be the upper half-plane. The group \(\text {SL}_2({\mathbb {R}})\) acts on \({\mathbb {H}}\) as isometries defined by
There is a close connection between the geodesics on the modular surface \(\text {SL}_2({\mathbb {Z}})\backslash {\mathbb {H}}\) and the RCF algorithm (e.g. [22]). Especially, the orbit \(\text {SL}_2({\mathbb {Z}})(\infty )={\mathbb {Q}}\) corresponds to a unique cusp of \(\text {SL}_2({\mathbb {Z}})\backslash {\mathbb {H}}\). Let
Then \(\Theta \) is a subgroup of \(\text {SL}_2({\mathbb {Z}})\) of index 3 and the quotient space \(\Theta \backslash {\mathbb {H}}\) is a hyperbolic surface with two cusps corresponding to the orbits \(\Theta (\infty )\) and \(\Theta (1)\) of \(\infty \) and 1. Kraaikamp–Lopes [14] and Boca–Merriman [4] found that the geodesics on \(\Theta \backslash {\mathbb {H}}\) is strongly related to the even integer continued fraction (EICF) introduced by Schweiger [19, 20], which is a continued fraction with even integers such that
where \(b_0\in 2{\mathbb {Z}}\), \(b_i \in 2{\mathbb {N}}\) for \(i\ge 1\) and \(\eta _i \in \{ -1, +1\}\).
We classify rational numbers into two classes by the orbits \(\Theta (\infty )\) and \(\Theta (1)\). If \(p/q\in \Theta (\infty )\), then p and q are of different parity. If \(p/q \in \Theta (1)\), then p and q are both odd. We call a rational number in \(\Theta (\infty )\) an \(\infty \)-rational and a rational number in \(\Theta (1)\) a 1-rational. The proportion of odd/even, even/odd and odd/odd in the RCF convergents was investigated by Moeckel [15]. Further, the asymptotic density of the RCF convergents whose denominators and numerators satisfying congruence equations was obtained by Jager-Liadet [10].
Short and Walker [23] defined a best \(\infty \)-rational approximation of x by a rational \(p/q\in \Theta (\infty )\) satisfying
and showed that the best \(\infty \)-rational approximations are convergents of EICF.
Our motivation of the paper is to study the best 1-rational approximations of an irrational number defined as follows.
Definition 1.1
For \(x\in {\mathbb {R}}\setminus {\mathbb {Q}}\), \(p/q \in \Theta (1)\) is a best 1-rational approximation of x if
We introduce a new continued fraction, called the odd-odd continued fraction (OOCF, see Sect. 2) of the form
where \(a_n \in {\mathbb {N}}\), and \(\varepsilon _n \in \{1,-1\}\) for \(a_n \ge 2\) and \(\varepsilon _n = 1\) for \(a_n = 1\). Our first main theorem is the following.
Theorem 1.2
A fraction p/q is a best 1-rational approximation of an irrational number x if and only if it is one of the principal convergents of the odd-odd continued fraction of x.
For RCF, Lagrange and Euler proved that an irrational number has eventually periodic RCF if and only if it is a quadratic irrational. (See [17, Chapter III-§1] and [12, Section 10]). For OOCF, we have the following second main theorem.
Theorem 1.3
An eventually periodic OOCF expansion converges to an \(\infty \)-rational or a quadratic irrational. Moreover, a quadratic irrational has an eventually periodic OOCF expansion.
We also investigate the relation between the OOCF and the RCF. We show that for any real number x, the principal convergents of its OOCF are intermediate convergents of its RCF (Theorem 5.2). Further, we can convert RCF expansions into OOCF expansions (Theorem 5.3).
Our paper is organized as follows. In Sect. 2, we introduce the OOCF algorithm and give some basic properties of OOCFs. In Sect. 3 we study the principal convergents of OOCFs, and prove Theorem 1.3. Sect. 4 is devoted to the proof of Theorem 1.2. The relations between the OOCF expansions and the RCF expansions are described in the last section.
2 Odd-odd continued fraction algorithm
It is known that the partial quotients \(d_j=d_j(x)\) of the RCF of an irrational number x as in (1) can be generated by the Gauss map \(G: [0,1] \rightarrow [0,1]\) defined by
where \(\{ \cdot \}\) is the fractional part. In fact, for an irrational x we have \(d_j(x) = \lfloor 1/G^{j-1}(x) \rfloor \) for \(j\ge 1\) with \(\lfloor \cdot \rfloor \) being the integer part. Further, Gauss map is a jump transformation associated to the Farey map defined by
In general, let \(U: [0,1]\rightarrow [0,1]\) be a map and E be a subset of [0, 1]. The first hitting time of \(x\in [0,1]\) to E is defined by
A map \(J:[0,1]\rightarrow [0,1]\) is called the jump transformation associated to U with respect to E (e.g. [21, Chapter 19]) if
We can easily check that G is the jump transformation associated to F with respect to \(E=\{0\}\cup (1/2,1]\). In fact,
We also note that \(n_E(x)+1\) is exactly the first partial quotient \(a_1\) of the RCF expansion of x.
Similar to the RCF, the partial quotients of EICF in (2) can be obtained by the EICF map \(T_\mathrm {EICF}:[0,1]\rightarrow [0,1]\) defined by
The map \(T_\mathrm {EICF}\) turns out to be a jump transformation of the following Romik map
introduced by Romik in [18]. In fact, letting \(E_1:=\{0\}\cup [1/3,1]\), we have
The Romik map was used to investigate an algorithm generating the Pythagorean triples by multiplying matrices [1,2,3, 7, 8]. Some number theoretical properties of the Romik map were recently shown in [5, 6]. Panti [16] studied the connection of the Romik map with the billiards in the hyperbolic plane.
Instead of \(E_1\), we choose \(E_2 = [0, 1/2]\cup \{1\}\) and define \(T_\mathrm {OOCF}:[0,1]\rightarrow [0,1]\), called the odd-odd continued fraction (OOCF) map, by the jump transformation associated to the Romik map R with respect to \(E_2\), i.e.,
By simple calculation, we have
The graph of \(T_{\text {OOCF}}\) is shown in Fig. 1.
Using \(T_{\text {OOCF}}\), we can induce an OOCF expansion of \(x\in [0,1]\). For convenience, let \(T:=T_{\text {OOCF}}\). We partition [0, 1] into the subintervals defined by
By (6), if \(x\ne 1\), then
Thus, for all \(x \notin \bigcup _{i =0}^{n-1} T^{-i}( \{ 1 \} )\)
where
In particular, if \(x=0\), then \(T(0)=0\) and we have
Thus, 0 has a unique infinite OOCF expansion: \(0=[\![(2,-1), (2,-1), \cdots ]\!]= [\![(2,-1)^\infty ]\!]\). If \(x = \frac{k}{k+1} \in B(k,1) \cap B(k+2,-1)\) for some \(k \ge 1\). Then \(T(x) = 0\) and we have both choices in (8):
Hence, a rational number \(x={k \over k+1}\) has two infinite OOCF expansions: \(x=[\![(k+2, -1),(2,-1)^\infty ]\!]\) and \(x=[\![(k, 1),(2,-1)^\infty ]\!]\). Furthermore, for any \(x\in T^{-n}(\{0\})\) with some \(n\ge 2\), we can apply the iteration (8) \(n-1\) times, and then write \(1-T^{n-1}(x)\) in two different ways. Therefore, any \(x\in \bigcup _{n\ge 1} T^{-n}(\{0\})\) has two infinite OOCF expansions ending with \((2,-1)^\infty \).
Let \(x={2k-1 \over 2k+1} \in B(k+1,-1) \cap B(k,1)\) for some \(k \ge 1\). Then \(T(x) = 1 \) and
Thus \(x={2k-1 \over 2k+1}\) has two finite OOCF expansions: \(x=[\![(k+1,-1)]\!]\) and \(x=[\![(k,1)]\!]\). Furthermore, for any \(x \in T^{-n} ( \{ 1\})\) with some \(n \ge 1\) and \(x \ne 1 \), we can apply the iteration (8) \(n-1\) times, and then write \(1-T^{n-1}(x)\) in two different ways. Therefore, any \(x\in \bigcup _{n\ge 0} T^{-n} (\{ 1 \} ) \setminus \{ 1\}\) has two finite OOCF expansions which differ at the last partial quotient.
Note that for a rational m/n, the denominator of \(T_{\text {OOCF}}(m/n)\) is strictly less than n. Note also that \(T_{\text {OOCF}}\) sends a 1-rational to a 1-rational and an \(\infty \)-rational to an \(\infty \)-rational. Thus if m/n is a 1-rational, then \(T_{\text {OOCF}}^N(m/n)=1\) for some \(N\ge 1\), while if m/n is a non-zero \(\infty \)-rational, then \(T_{\text {OOCF}}^N(m/n)=0\) for some \(N\ge 1\). Hence any 1-rational and \(\infty \)-rational belongs to \(T_{\text {OOCF}}^{-N}(\{1\})\) and \(T_{\text {OOCF}}^{-N} (\{ 0 \})\) for some \(N\ge 1\) respectively. Finally, we note that
Then for any \(x\in [0,1] \setminus {\mathbb {Q}}\), we can iterated (9) infinitely and uniquely to get its OOCF expansion:
where \(a_n \in {\mathbb {N}}\) and \(\varepsilon _n \in \{1,-1\}\) for \(a_n \ge 2\) and \(\varepsilon _n = 1\) for \(a_n = 1\).
We denote the OOCF expansion of x by
and call \((a_n,\varepsilon _n)\) the n-th partial quotients of x in its OOCF expansion. By the above discussion, we have the following proposition.
Proposition 2.1
The following properties hold.
-
(1)
Any non-zero \(\infty \)-rational has exactly two infinite OOCF expansions ending with \((2,-1)^\infty \).
-
(2)
Each 1-rational has exactly two finite OOCF expansions which differ only in the last partial quotient.
-
(3)
Every irrational has a unique infinite OOCF expansion.
To end this section, we remark that the two maps \(T_{\text {OOCF}}\) and \(T_{\text {EICF}}\) are conjugate. Define \(f:[0,1]\rightarrow [0,1]\) by \(f(x) := \dfrac{1-x}{1+x}.\) Then the map \(T_{\text {OOCF}}\) is conjugate to \(T_{\text {EICF}}\) via f, i.e.,
Schweiger [19] proved that \(T_{\text {EICF}}\) admits an ergodic absolutely continuous invariant measure: \(d\mu :=\dfrac{dx}{1-x^2}\). Thus, the measure \(f^{-1}_*\mu \) is an ergodic absolutely continuous invariant measure with respect to \(T_\mathrm {OOCF}\). Denote by \(y = f(x)\). We have
Hence, we have the following conclusion.
Proposition 2.2
The map \(T_\mathrm {OOCF} : [0,1] \rightarrow [0,1]\) preserves an infinite ergodic absolutely continuous invariant measure \(\dfrac{1}{x}dx.\)
We also remark that the infinity of the absolutely continuous invariant measure comes from the fact that the map \(T_\mathrm {OOCF}\) has 0 as an indifferent fixed point.
3 Convergents of the odd-odd continued fraction algorithm
For OOCF, we have three types of convergents by truncating the OOCF in three different places. We will investigate the basic properties of such convergents of OOCF.
Let \(x\in (0,1)\) be a real number such that
For \(n\ge 1\), the n-th principal convergent of OOCF is defined by
We denote
and call them the n-th sub-convergent and n-th pseudo-convergent, respectively.
To study the convergents of a continued fraction, we have the following general lemma proved by induction (see [13, p. 3] for details).
Lemma 3.1
Consider a general infinite continued fraction and its truncated continued fraction of the form
where \(g_n\in {\mathbb {Z}}\) and \(|e_n|=1\). Then the following matrix relation holds:
Consequently, we have the following recursive formulas:
where \(r_{-1}=1\), \(s_{-1}=0\), \(r_0=g_0\) and \(s_0=1\).
Denote the inverse of \(T_{\text {OOCF}}|_{B(a_n,\varepsilon _n)}\) by \(f_{(a_n,\varepsilon _n)}\). Then by (8), we have
The map \(f_{(a_n,\varepsilon _n)}\) corresponds to a linear fractional map on the upper half-plan \({\mathbb {H}}\) given by the matrix
By Lemma 3.1, we have
and
These mean that under the linear fractional map of the matrix \(A_{(a_1,\varepsilon _1)}A_{(a_2,\varepsilon _2)}\cdots A_{(a_n,\varepsilon _n)}\), the images of 1, \(\infty \) and 0 are \(p_n/q_n\), \(p_n'/q_n'\) and \(p_n''/q_n''\), respectively.
Since \(A_{(a_1,\varepsilon _1)}A_{(a_2,\varepsilon _2)}\cdots A_{(a_n,\varepsilon _n)}\) is contained in \(\Theta \) or \(\begin{pmatrix}0&{}1\\ 1&{}0\end{pmatrix}\Theta \), we deduce the following proposition.
Proposition 3.2
We have
We remark that the name of odd-odd continued fraction comes from the fact that the principal convergents \({p_n}/{q_n}\) are 1-rationals, i.e., of odd denominators and odd numerators. We also remark that by Proposition 3.2, any finite OOCF is a 1-rational.
By (13) and (14), we have the following recursive relations of the three types of convergents.
Lemma 3.3
Let \(p_0'=1\), \(q_0'=0\), \(p_0=1\) and \(q_0=1\). We have the following recursive formulas:
Further,
Moreover, letting \(p_{-1}=-1, q_{-1}=1\) and \(\varepsilon _0=1\), we have the recursive formulas for the principal convergents
Note that \(2a_{n}+\varepsilon _{n}-1\ge 2\) for all \(n\in {\mathbb {N}}\). Since \(q_1\ge 2q_0+\varepsilon _0q_{-1}=3>q_0\), by (17), we have
By (13) and the second assertion of (16), we have
Thus, by noting \(\text {det}(A_{(a_i,\varepsilon _i)}) =\varepsilon _i\), we have
Denote by
We can show inductively that
By (16), we have
Thus,
The following theorem gives the convergence of our OOCF.
Theorem 3.4
For all \(x\in [0,1]\), the OOCF expansion of x converges to x.
Proof
Let \(\xi _n = {1-\zeta _n \over 1+ \zeta _n}\). By (21) and (19), we have
Since \(|\varepsilon _{n}|=1\) and \(|\xi _{n+1}|\le 1\), by (18), we have
Again by (18), \(q_n\rightarrow \infty \) as \(n\rightarrow \infty \), which concludes \(p_n/q_n\rightarrow x\) as \(n\rightarrow \infty \). \(\square \)
Lemma 3.5
For all \(x\in (0,1)\), x is between \(p_n/q_n\) and \(p''_n/q''_n\).
Proof
The equations (13) and (14) imply that \(p_n'q_n''-p_n''q_n' = \varepsilon _1\cdots \varepsilon _n.\) Thus, by (20),
which means that \(x-p_n/q_n\) and \(x-p''_n/q''_n\) has opposite signs by comparing with (22). \(\square \)
With the above preparations, we can now show the following lemma.
Lemma 3.6
The following statements hold.
-
(1)
The n-th principal convergent \(p_{n}/q_{n}\) is between \(p'_n/q'_n\) and \(p''_n/q''_n\).
-
(2)
The \((n-1)\)-th principal convergent \(p_{n-1}/q_{n-1}\) is not between \(p'_{n}/q'_{n}\) and \(p''_{n}/q''_{n}\).
-
(3)
The three distinct convergents \(p_n/q_n\), \(p_{n}'/q_{n}'\) and \(p_{n}''/q_{n}''\) are in the half closed interval \(I_{n-1}\) of endpoints \(p_{n-1}/q_{n-1}\) and \(p_{n-1}''/q_{n-1}''\) which contains \(p_{n-1}''/q_{n-1}''\) but does not contain \(p_{n-1}/q_{n-1}\).
Proof
The first two assertions follow from (16) and the fact that for two rationals a/b and c/d such that \(bd>0\), if \(a/b \le c/d\), then
For (3), by Lemma 3.3, we have
Since \(a_{n}-1\ge 0\) and \(a_{n}+\varepsilon _{n}-1\ge 0\), both \(p_{n}'/q_{n}'\) and \(p_{n}''/q''_{n}\) are in \(I_{n-1}\). By the first assertion, \(p_n/q_n\) is also in \(I_{n-1}\). \(\square \)
Now, we are ready to prove Theorem 1.3.
Proof of Theorem 1.3
If x has an eventually periodic OOCF, then there exist distinct positive integers i and j such that \(T^i(x)=T^j(x)\). Since \(T^i\) and \(T^j\) are linear fractional maps, \(T^i(x)\) is either 0 or a quadratic irrational. In the former case x is an \(\infty \)-rational, while in the latter case x is a quadratic irrational.
For the second assertion, let x be a quadratic irrational between 0 and 1 such that \(\alpha _1x^2+\beta _1x+\gamma _1=0\) where \(\alpha _1\), \(\beta _1\) and \(\gamma _1\) are coprime integers. By (20), we have for all \(i\ge 1\),
For \(i\ge 1\), let
Then
Since \(|q_i'p_i''-q_i''p_i'|=1\), we can check that
On the other hand, we also have \(|(x-p_i'/q_i')+(p_i''/q_i''-x)|=1/q_i'q_i''.\) Thus, by Lemma 3.5 and the fact that \(p_i/q_i\) is between \(p_i'/q_i'\) and \(p_i''/q_i''\), we deduce that \(x-p_i'/q_i'\) and \(x-p_i''/q_i''\) have opposite signs. Thus, \(|q_i'x-p_i'|<1/q_i''\) and \(|p_i''-q_i''x|<1/q_i'.\) Hence, there are \(|\delta |<1\) and \(|\lambda |<1\) such that
By plugging (26) in (23), we derive the following expressions
By (28), we have \(|\beta _{i+1}| \le 2(|2\alpha _1|+|\beta _1|)+|2\alpha _1|\), thus the coefficient \(\beta _{i+1}\) is bounded. If \(q_i''\ge q_i'\), then by (27), we have \(|\alpha _{i+1}|<2|\alpha _1|+|\beta _1|+|\alpha _1|\). Thus, \(\alpha _{i+1}\) is bounded. Further, by (25), \(\gamma _{i+1}\) is bounded. Similarly, if \(q_i''<q_i'\), then by (29), \(\gamma _{i+1}\) is bounded since \(|\gamma _{i+1}|<2|\alpha _1|+|\beta _1|+|\alpha _1|\). Moreover, by (25), \(\alpha _{i+1}\) is also bounded. Thus in all cases, the coefficients of the equation (24) are all bounded. Therefore, \(\{\zeta _i\}_{i\in {\mathbb {N}}}\) has only finitely many values which means that \(\zeta _n=\zeta _m\) for some m and n. Therefore, the OOCF expansion of x is eventually periodic. \(\square \)
Remark 3.7
From the proof of Proposition 2.1-(1), we see that if x is an \(\infty \)-rational, then its OOCF ends with \((2,-1)^\infty \) and thus there exists \(n_0\ge 0\) such that \(\zeta _{n+1}=0\) for all \(n\ge n_0\). Hence, by (20), we have \(x=p''_n/q''_n\) for all \(n\ge n_0\).
At the end of this section, let us discuss the relation between the OOCF convergents of a number x and the EICF convergents of \(1-x\).
We denote the EICF expansion in (2) by a sequence in a double angle bracket:
The n-th EICF convergent is denoted by
By Lemma 3.1, we have the following matrix relation:
Since each matrix in (30) belongs to \(\Theta \cup \begin{pmatrix}0&{}1\\ 1&{}0\end{pmatrix}\Theta \), each EICF convergent \(p^E_n/q^E_n\) is an \(\infty \)-rational.
Observe that if \(p_n^E(x)/q_n^E(x)\) is of type even/odd, then \(1-p_n^E(x)/q_n^E(x)\) is 1-rational. If \(p_n^E(x)/q_n^E(x)\) is of type odd/even, then \(1-p_n^E(x)/q_n^E(x)\) is still of type odd/even.
Proposition 3.8
Let \(x\in (0,1)\). All rationals of type odd/odd in \(\{1-p_n^E(1-x)/q_n^E(1-x): n\ge 1 \}\) are best 1-rational approximations of x, and hence are OOCF principal convergents of x.
Proof
For each \(n\ge 0\), denote by \(P_n/Q_n:=1-p_n^E(1-x)/q_n^E(1-x)\). We have
By the theorem of Short and Walker (see (3); also [23, Theorem 5]), for any \(a/b\in \Theta (\infty )\) such that \(1\le b\le q_n^E(1-x)\) and \(a/b\not =p_n^E(1-x)/q_n^E(1-x)\),
For any \(c/d\in \Theta (1)\) such that \(1\le d\le Q_n\) and \(c/d\not =P_n/Q_n\), we have
Thus \(|P_n-Q_nx|<|(1-x)d-(d-c)|=|c-dx|\), which means that \(P_n/Q_n\) is a best 1-rational approximation of x. \(\square \)
The next proposition describes a connection between the principal convergents of OOCF and EICF. Recall that \(f(x) = \frac{1-x}{1+x}\) is the conjugacy map defined in Sect. 2.
Proposition 3.9
Let \(x\in (0,1)\). There is a 1-1 correspondence between the partial quotients of OOCF of x and that of EICF of f(x). In particular, \(p_n^E(f(x))/q_n^E(f(x))=f(p_n(x)/q_n(x))\) for all \(n \ge 1\).
Proof
Since
there is a 1-1 correspondence \(\phi \) between the partial quotients of OOCF and EICF as follows:
Thus, for \(x=[\![(a_n,\varepsilon _n)_{n\in {\mathbb {N}}}]\!]\), the EICF expansion of f(x) is \({{\,\mathrm{\langle \!\langle }\,}}\phi (a_n,\varepsilon _n)_{n\in {\mathbb {N}}}{{\,\mathrm{\rangle \!\rangle }\,}}\). Considering the finite expansions, we obtain the second assertion. \(\square \)
4 Best 1-rational approximation
In this section, we prove Theorem 1.2. Recall that \({\mathbb {H}}\) is the upper half-plane. The boundary of \({\mathbb {H}}\) is \({\mathbb {R}}_{\infty }={\mathbb {R}}\cup \{\infty \}\). Denote by \(C_{a/b}\) the horocycle of \({\mathbb {H}}\) based at a/b whose Euclidean radius is \((2b^2)^{-1}\) and \(C_\infty \) the line \(\{z=x+i\in {\mathbb {H}}:x\in {\mathbb {R}}\}\) (see Fig. 2). We call \(C_{a/b}\) a Ford circle. The radius of \(C_{a/b}\) is denoted by \(\text {rad}(C_{a/b})\). We remark that two Ford circles \(C_{a/b}\) and \(C_{c/d}\) are adjacent to each other if and only if \(|ad-bc|=1.\) Let \(R_{a/b}(x)\) be the Euclidean radius of the horocycle based at x tangent to \(C_{a/b}\). Then by Pythagorean theorem,
Thus
Since the Ford circles are not overlapped each other, we have
With these preparations, we are ready to prove our Theorem 1.2.
Proof of Theorem 1.2
Given \(x\in {\mathbb {R}}\setminus {\mathbb {Q}}\), let us consider its n-th principal convergent \(p_n/q_n\) and its n-th pseudo-convergent \(p''_n/q''_n\). Let \(a/b\in \Theta (1)\) such that \(a/b\not =p_n/q_n\) and \(1\le b\le q_n\). Then
By (13) and (14), the Ford circles \(C_{p_n/q_n}\) and \(C_{p''_n/q''_n}\) are tangent to each other. By Lemma 3.5, x is between \(p_n/q_n\) and \(p''_n/q''_n\), then
Let \(I_n\) be the closed interval of endpoints \(p_n/q_n\) and \(p''_n/q''_n\). Since \(\text {rad}(C_{r/s})\le \text {rad}(C_{p_n/q_n})\) for any \(r/s\in I_n\cap {\mathbb {Q}}\), we deduce from (33) (as shown in Fig. 3) that \(a/b\not \in I_n\). Then we have
By (34) and (35), we have \(R_{p_n/q_n}(x) < R_{a/b}(x)\). Hence by (31), \(p_n/q_n\) is a best 1-rational approximation of x.
Conversely, assume that \(a/b\in \Theta (1)\) is not a principal convergent of OOCF of x. Then there are consecutive principal convergents \(p_{n-1}/q_{n-1}\) and \(p_{n}/q_{n}\) such that \(q_{n-1} \le b < q_{n}\) and \(a/b\not =p_{n-1}/q_{n-1}.\) Thus,
By (13) and (14), \(C_{{p_{n-1}}/{q_{n-1}}}\) and \(C_{{p_{n}}/{q_{n}}}\) are tangent to both \(C_{{p_{n}'}/{q_{n}'}}\) and \(C_{{p_{n}''}/{q_{n}''}}\). Without loss of generality, we assume that \(p_{n-1}/q_{n-1}<p_{n}'/q_{n}'<p_{n}''/q_{n}''\) (see Fig. 4). By (36), \(a/b\not \in [p'_{n}/q'_{n},p''_{n}/q''_{n}]\). Now we will show that \(R_{p_{n-1}/q_{n-1}}(x)<R_{a/b}(x)\) which by (31), implies that a/b is not a best 1-rational approximation of x. We distinguish three cases.
-
(1)
If \(a/b < p_{n-1}/q_{n-1} \), then obviously \(R_{p_{n-1}/q_{n-1}}(x)<R_{a/b}(x)\).
-
(2)
Now assume \(a/b > p_{n}''/q_{n}''\). We note that, for \(r/s\in {\mathbb {Q}}\) and t, \(t'\in {\mathbb {R}}\),
$$\begin{aligned} |t-r/s|<|t'-r/s| \text { implies that }R_{r/s}(t)<R_{r/s}(t').\end{aligned}$$(37)Then we have
$$\begin{aligned} R_{{p_{n-1}}/{q_{n-1}}}(x)<R_{{p_{n-1}}/{q_{n-1}}}(p_{n}''/q_{n}'') =\text {rad}(C_{p_n''/q_n''}) \le R_{a/b}(p_{n}''/q_{n}'') <R_{a/b}(x).\nonumber \\ \end{aligned}$$(38)The first and last inequalities in (38) follow from (37) and the fact \(p_{n-1}/q_{n-1}<x<p''_{n}/q''_{n}<a/b\). The equality in (38) holds since \(C_{p''_n/q''_n}\) and \(C_{p_{n-1}/q_{n-1}}\) are tangent to each other. The second last inequality in (38) follows from (32).
-
(3)
Finally, let \(a/b \in (p_{n-1}/q_{n-1},p_{n}'/q_{n}')\). Denote by C and \(C'\) the horocycles based at x tangent to \(C_{a/b}\) and \(C_{p_{n-1}/q_{n-1}}\), respectively (see Fig. 4). Since the tangent point of C and \(C_{a/b}\) is an interior point of the area bounded by \(C_{p_{n-1}/q_{n-1}}\), \(C_{p_{n}'/q_{n}'}\) and the real line, we conclude that C intersects \(C_{p_{n-1}/q_{n-1}}\). Thus, C is larger than \(C'\), i.e, \(R_{p_{n-1}/q_{n-1}}(x)<R_{a/b}(x)\).
\(\square \)
5 Relation with the regular continued fraction
For simplicity, we denote a RCF as in (1) by \([d_0;d_1,d_2,\cdots ,d_j,\cdots ]\). For \(1\le j \le d_{n}\) and for \(n\ge 1\), the fractions
are called the intermediate convergents (see [12, Section 6] and [17, p.36]). Kraaikamp and Lopes [14] showed that the convergents of EICF are intermediate convergents of RCF. In this section, we show that the OOCF principal convergents are also intermediate convergents of RCF.
The following lemma tells us how the piecewise inverses of OOCF act on RCF expansions.
Lemma 5.1
Let \(x=[0;d_1,d_2,\cdots ]\). Then, the RCF expansion of \(f_{(a,\varepsilon )}(x)\) is as follows:
Proof
If \(\varepsilon =1\), then
If \(\varepsilon =-1\), then
\(\square \)
Applying Lemma 5.1, we have the following theorem.
Theorem 5.2
The OOCF principal convergents of x are intermediate convergents of x.
Proof
Let \(x=[0; d_1,d_2,\cdots ]=[\![(a_1,\varepsilon _1),(a_2,\varepsilon _2),\cdots ]\!]\). Note that
By Lemma 5.1, x and \(p_k/q_k\) have the same prefix in their RCF expansions, except for the last partial quotient of \(p_k/q_k\). Thus, \(p_k/q_k\) is an intermediate convergent of x. \(\square \)
Next, we show that we can convert RCF expansions into OOCF expansions. Before we state the theorem, let us introduce the following notations:
Theorem 5.3
We can convert RCF expansions into OOCF expansions by the following relations:
Proof
Noting \(\frac{1}{1+\tau }=1-\frac{1}{1+\frac{1}{\tau }}\), we have
If \(\tau \in [\frac{1}{2},1)\), then \(\tau =\frac{1}{1+G(\tau )}\). If \(\tau \in [0,\frac{1}{2})\), then
Thus \(F(\tau )=\frac{1}{[\tau ^{-1}]-1+G(\tau )}\) if \(\tau \in [0,\frac{1}{2})\) and \(F(\tau )=G(\tau )\) if \(\tau \in (\frac{1}{2},1)\). In the case of \(d_1=1\), we have
Similarly, if \(d_1=2\), then
If \(d_1\ge 3\), i.e., \(x\in (0,\frac{1}{3})\), then
Note that there are \(n\in {\mathbb {N}}\) and \(r\in \{0,1\}\) such that \(d_1-1 = 2n+r\). Since \(T_{\text {OOCF}}(x)=[0;d_1-2,G(x)]\), by repeating the process in (41), we have
Then we can complete the proof by (39) and (40). \(\square \)
Since \(p^R_n/q^R_n\) is a best approximation, if \(p^R_n/q^R_n\) is a 1-rational, then \(p^R_n/q^R_n\) is a best 1-rational approximation. Thus, by Theorem 1.2, \(p^R_n/q^R_n\) is an OOCF convergent. Now we check when an intermediate convergent is an OOCF convergent. Keita [11] proved the following propostion.
Proposition
(Keita, Proposition 1.2 in [11]) We have
By the above proposition and Theorem 5.2, if \(p^R_{n-1}/q^R_{n-1}\) is a 1-rational, then \(p^R_{n,j}/q^R_{n,j}\) is not an OOCF principal convergent for any \(1\le j < d_n\). If \(p^R_{n-1}/q^R_{n-1}\) is an \(\infty \)-rational and \(p^R_{n,j}/q^R_{n,j}\) is a 1-rational, then \(p^R_{n,j}/q^R_{n,j}\) is an OOCF principal convergent.
Change history
25 July 2022
Missing Open Access funding information has been added in the Funding Note.
References
Alperin, R.C.: The modular tree of Pythagoras. Am. Math. Mon. 112(9), 807–816 (2005)
Barning, F.J.M.: On Pythagorean and quasi-Pythagorean triangles and a generation process with the help of unimodular matrices. Math. Cent. Amsterdam Afd. Zuivere Wisk. 1963(ZW–011), 37 (1963)
Berggren, B.: Pytagoreiska triangular. Tidskr. Elementär Mat. Fys. Kemi. 17, 129–139 (1934)
Boca, F.P., Merriman, C.: Coding of geodesics on some modular surfaces and applications to odd and even continued fractions. Indag. Math. 29(5), 1214–1234 (2018)
Cha, B., Kim, D.H.: Intrinsic Diophantine approximation of a unit circle and its Lagrange spectrum (2019) (available at arXiv:1903.02882)
Cha, B., Kim, D.H.: Number theoretical properties of Romik’s dynamical system. Bull. Korean Math. Soc. 57(1), 251–274 (2020)
Cha, B., Nguyen, E., Tauber, B.: Quadratic forms and their Berggren trees. J. Number Theory 185, 218–256 (2018)
Conrad, K.: Pythagorean descent. (2007) (available at http://www.math.uconn.edu/~kconrad/blurbs/linmultialg/descentPythag.pdf)
Ito, S.: Algorithms with mediant convergence and their metrical theory. Osaka J. Math. 26(3), 557–578 (1989)
Jager, H., Liardet, P.: Distributions arithmétiques des dénominateurs de convergents de fractions continues. Indag. Math. 91(2), 181–197 (1988)
Keita, A.: Continued fractions and parametric geometry of numbers. J. Théor. Nr. Bordx. 29(1), 129–135 (2017)
Khinchin, A.Y.: Continued Fractions, Translated from the 3rd (1961) Russian ed., Reprint of the 1964 Translation. Dover Publications, Mineola (1997)
Kraaikamp, C.: A new class of continued fraction expansions. Acta Arith. 57(1), 1–39 (1991)
Kraaikamp, C., Lopes, A.: The theta group and the continued fraction expansion with even partial quotients. Geom. Dedicata. 59(3), 293–333 (1996)
Moeckel, R.: Geodesics on modular surfaces and continued fractions. Ergod. Thoery Dyn. Syst. 2(1), 69–83 (1982)
Panti, G.: Billiards on pythagorean triples and their Minkowski functions. Discret. Contin. Dyn. Syst. 40(7), 4341–4378 (2020)
Rockett, A.M., Szüsz, P.: Continued Fractions. World Scientific Publishing Co., Singapore (1992)
Romik, D.: The dynamics of Pythagorean triples. Trans. Am. Math. Soc. 360(11), 6045–6064 (2008)
Schweiger, F.: Continued fractions with odd and even partial quotients. Arbeitsber. Math. Inst. Univ. Salzburg. 4, 59–70 (1982)
Schweiger, F.: On the approximation by continued fractions with odd and even partial quotients. Arbeitsber. Math. Inst. Univ. Salzburg. 1(2), 105–114 (1984)
Schweiger, F.: Ergodic Theory of Fibred Systems and Metric Number Theory. Oxford University Press, Oxford (1995)
Series, C.: The modular surface and continued fractions. J. Lond. Math. Soc. s2–31(1), 69–80 (1985)
Short, I., Walker, M.: Even-integer continued fractions and the Farey tree. In: Symmetries in Graphs, Maps, and Polytopes Workshop (Springer Proc. in Math. Stat. 159), pp. 287–300. Springer, (2016)
Acknowledgements
We thank the referee for her/his valuable remarks and suggestions which significantly improve the presentation of the paper. D. K. and S. L. were supported by the National Research Foundation of Korea (NRF-2018R1A2B6001624). S. L. also acknowledges the support of the Centro di Ricerca Matematica Ennio de Giorgi and of UniCredit Bank R &D group for financial support through the Dynamics and Information Theory Institute at the Scuola Normale Superiore.
Funding
Open access funding provided by Scuola Normale Superiore within the CRUI-CARE Agreement.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by H. Bruin.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Kim, D.H., Lee, S.B. & Liao, L. Odd-odd continued fraction algorithm. Monatsh Math 198, 323–344 (2022). https://doi.org/10.1007/s00605-022-01704-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-022-01704-2