Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complex Continued Fractions

Updated 15 December 2025
  • Complex continued fractions are representations of complex numbers via iterative algorithms using partial quotients from discrete subrings like the Gaussian integers.
  • They exhibit rapid convergence with exponential denominator growth, offering optimal approximations and significant insights into Diophantine properties.
  • Studies reveal periodic expansions for quadratic surds, linking symbolic dynamics, ergodic theory, and geometric structures on modular orbifolds.

A complex continued fraction is a representation of a complex number as an iterated rational function with partial quotients in a discrete subring of C\mathbb{C}. The most intensively studied setting is where partial quotients are Gaussian integers, especially as introduced by Hurwitz. The study of these expansions, their convergence and metrical properties, their Diophantine and dynamical aspects, and their generalizations to other rings, forms a rich and active area in modern number theory and ergodic theory.

1. Foundational Algorithms and Definitions

For a discrete subring RCR \subset \mathbb{C}, such as Z[i]\mathbb{Z}[i], the Hurwitz algorithm defines, for zCz\in\mathbb{C}, the sequence of partial quotients as follows. Let [z][z] denote the nearest RR-element to zz (by independent rounding for real and imaginary parts if R=Z[i]R = \mathbb{Z}[i]), with a fundamental domain F\mathfrak{F} such that z[z]Fz - [z] \in \mathfrak{F}. The complex Gauss map T:FFT:\mathfrak{F}\rightarrow\mathfrak{F} is then

T(z)={z1[z1]if z0, 0if z=0.T(z) = \begin{cases} z^{-1} - [z^{-1}] &\text{if } z \ne 0, \ 0 &\text{if } z=0. \end{cases}

The partial quotients an(z)a_n(z) are defined recursively as a1(z)=[z1]a_1(z) = [z^{-1}], an(z)=a1(Tn1(z))a_n(z) = a_1(T^{n-1}(z)), yielding the expansion

z=[0;a1,a2,]=1a1+1a2+,z = [0; a_1, a_2, \ldots] = \cfrac{1}{a_1 + \cfrac{1}{a_2 + \cdots}},

where anRa_n \in R and an2|a_n| \geq \sqrt{2} in the Hurwitz model. Convergents pn/qnp_n/q_n are defined by the two-term recurrences

pn=anpn1+pn2,qn=anqn1+qn2,p_n = a_n p_{n-1} + p_{n-2},\qquad q_n = a_n q_{n-1} + q_{n-2},

with p2=1p_{-2}=1, p1=0p_{-1}=0, q2=0q_{-2}=0, q1=1q_{-1}=1 (Dani, 2015, Bugeaud et al., 2023). The expansion exists and is unique for zCQ(i)z \in \mathbb{C} \setminus \mathbb{Q}(i) (García-Ramos et al., 2023).

Generalizations exist for all Euclidean rings of complex quadratic integers, such as the Eisenstein integers and four further rings, by adapting the nearest-integer and fundamental domain (Baumgartner et al., 2024, Dani et al., 2021).

2. Convergence, Approximation, and Growth

The convergence theory for complex continued fractions mirrors the real case: the convergents pn/qnp_n/q_n satisfy

limnpnqn=z,zpn/qn<1qn2\lim_{n \to \infty} \frac{p_n}{q_n} = z,\qquad |z - p_n/q_n| < \frac{1}{|q_n|^2}

for zQ(i)z \notin \mathbb{Q}(i), with qn|q_n| growing exponentially at rate ψn\psi^{n} for some ψ>1\psi>1 (Bugeaud et al., 2023, Dani et al., 2021, Dani et al., 2011). Under mild conditions on the algorithm (e.g., the fundamental set is contained in a disk of radius r<1r < 1), these properties extend to a broad class of continued fractions for complex numbers, with the nnth convergent approximating zz optimally among fractions with qqn|q| \leq |q_n|, up to a constant factor (Dani et al., 2021, Martin, 2019).

In the Hurwitz model, the partial quotients necessarily satisfy an2|a_n| \geq \sqrt{2} and the convergence is quadratic in qn|q_n| (Bugeaud et al., 2023). Explicit best-approximation bounds are available: zpn/qn<1/(qn2an+11/2),|z - p_n/q_n| < 1/(|q_n|^2 |a_{n+1}| - 1/2), and 'badly approximable' zz are characterized by bounded partial quotients (Robert, 2018, Dani et al., 2021).

3. Periodicity, Quadratic Surds, and Symbolic Dynamics

The characterization of periodic continued fraction expansions is a direct analog of the Lagrange theorem for real continued fractions: zCz \in \mathbb{C} not rational over Q(i)\mathbb{Q}(i) has an ultimately periodic continued fraction expansion (under, e.g., the Hurwitz or Eisenstein algorithm) if and only if zz is a quadratic surd—that is, zz satisfies a quadratic equation over RR (Dani, 2015, Bugeaud et al., 2023, Yasutomi, 2024, Robert, 2018). For Hurwitz continued fractions, a purely periodic expansion corresponds to a pair (z,z)(z,z') (where zz' is the Galois conjugate) both lying in the fundamental domain (Yasutomi, 2024).

The space of admissible sequences of partial quotients forms a non-closed shift space; for Hurwitz continued fractions, admissibility is governed by non-occurrence of certain finite forbidden blocks, resulting in a subshift of finite type under additional regularity conditions (García-Ramos et al., 2023, Dani et al., 2011). The regular sequences and their closure support symbolic dynamics, with connections to coding theory and the Borel hierarchy (García-Ramos et al., 2023). The natural extension of the Gauss map in two coordinates yields an invertible system describing the distributional and periodicity properties of expansions in dynamical terms (Abrams, 2019, Yasutomi, 2024).

4. Metric and Extremal Properties

The ergodic theory of (Hurwitz) complex continued fractions yields a full metrical and statistical theory paralleling the real case: the Gauss map is ergodic with respect to an absolutely continuous invariant measure (the 'complex Gauss measure'), and the digit sequence (an)(a_n) is ψ\psi-mixing (Kirsebom, 2022, Bugeaud et al., 2023, Baumgartner et al., 2024, Lukyanenko et al., 2018). The maximal partial quotient in the first NN digits, MN(z)=maxnNan(z)M_N(z) = \max_{n\leq N} |a_n(z)|, satisfies a Fréchet law: limNP(MNCyN)=exp(y2)\lim_{N\to\infty} \mathbb{P}(M_N \leq C y \sqrt{N}) = \exp(-y^{-2}) for an explicit CC. The same law governs maximal excursions in the corresponding geodesic flow in real hyperbolic 3-space quotients (Bianchi orbifolds) associated to the ring of definition (Kirsebom, 2022, Baumgartner et al., 2024).

The frequency of large digits, as well as the distribution of the kk-th largest digit and related extreme values, follow a Poisson law with index $2$, reflecting the two-dimensionality of the complex field (Kirsebom, 2022, Baumgartner et al., 2024). Hausdorff dimension computations for sets where the digits are large infinitely often, or tend to infinity, exhibit precise phase transitions: the set E={z:limnan(z)=}E = \{z : \lim_{n\to\infty} |a_n(z)| = \infty\} has Hausdorff dimension $1$, or half the dimension of C\mathbb{C}, generalizing Good's theorem from the real case (Robert, 2018, Bugeaud et al., 2023).

5. Transcendence, Normality, and Special Number Classes

Complex continued fractions provide Diophantine criteria for transcendence: if the sequence of partial quotients has low combinatorial complexity (finite repetition exponent) and is non-periodic, then the corresponding number is transcendental (Robert, 2018, García-Ramos et al., 2023). This parallels results for the real case by Bugeaud and Kim. Furthermore, there exist explicit transcendental numbers in C\mathbb{C} with bounded Hurwitz partial quotients (García-Ramos et al., 2023).

For normality, the analogue of Borel's normal numbers in the complex setting is defined via the frequency of occurrences of finite blocks in the expansion, equidistributed according to the complex Gauss measure. The set of Hurwitz-normal numbers forms a Π30\Pi_3^0-complete set in the Borel hierarchy and is not a GδG_\delta or FσF_\sigma set (García-Ramos et al., 2023).

6. Generalizations, Higher Rings, and Open Directions

The theory extends beyond Gaussian integers to Eisenstein integers and the remaining Euclidean rings of imaginary quadratic integers (Baumgartner et al., 2024). For non-Euclidean imaginary quadratic rings, continued fraction expansions can still be algorithmically constructed using admissible digit sets and modified covering or reduction conditions, with essentially all fundamental metric and approximation properties—such as exponential convergence, periodic expansions for quadratics, and best approximation up to constants—still holding (Martin, 2019).

A geometric interpretation links the continued fraction process to the dynamics of geodesics on modular (or Bianchi) orbifolds and to best-approximation theory within lattices over RR (Chevallier, 2021, Lukyanenko et al., 2018). Finite building properties, natural extensions, and Markov partitions are essential in understanding the symbolic and measure-theoretic structure of the digit maps (Abrams, 2019). Connections to the theory of values of binary quadratic forms and to broader dynamical systems appear in recent research (Dani et al., 2011).

Key unresolved questions include explicit computation of Hausdorff dimensions as a function of growth rates for digits, the relation with dynamical Artin–Mazur zeta functions, the metric structure of restricted or bounded digit sets, and Diophantine properties in higher-dimensional or hyperbolic lattices (Bugeaud et al., 2023).

7. Summary Table: Key Algorithms and Features

Algorithm / Setting Fundamental Domain Partial Quotients Key Properties
Hurwitz (Gaussian) Unit square Z[i]\mathbb{Z}[i] Existence, uniqueness, quadratic convergence
Eisenstein (Euclidean) Regular hexagon Eisenstein integers Analogous to Hurwitz, explicit recurrences
Non-Euclidean Quadratic Modified domains Admissible BOB \subset O Exponential convergence up to constants
Natural Extension (2-dim.) Product domains As above Invariant measure, ergodicity

Every setting depends crucially on the geometric properties of the underlying domain and digit maps, with periodic expansions encoding algebraic information (quadratic surds), and metrical theorems yielding detailed statistical and Diophantine information (Baumgartner et al., 2024, Bugeaud et al., 2023, Martin, 2019).


This overview reflects the current rigorous understanding of complex continued fractions, their algorithmic and geometric underpinnings, ergodic properties, Diophantine applications, and metrical theory, as established in contemporary research (Bugeaud et al., 2023, Kirsebom, 2022, Baumgartner et al., 2024, García-Ramos et al., 2023, Dani et al., 2021, Dani, 2015, Yasutomi, 2024, Lukyanenko et al., 2018, Robert, 2018, Martin, 2019, Abrams, 2019, Robert, 2018, Chevallier, 2021, Dani et al., 2011, O'Sullivan, 20 Aug 2025).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Complex Continued Fractions.