Search arXivSearch

arXiv · 2603.12425

A geometric proof of Lagrange's theorem for continued fractions

Abstract

For regular continued fractions (CFs), points with finite expansions are exactly the rationals and, by Lagrange's theorem, points with eventually-periodic expansions are exactly the roots of non-degenerate quadratic equations with integer coefficients. We extend both results to proper and discrete Iwasawa CFs, including real, complex, 3D, quaternionic, octonionic, and Heisenberg CFs. Namely, the following three conditions are equivalent for a point $p$: $p$ has a finite expansion, $p\in \mathcal M(\infty)$ for the appropriate modular group $\mathcal M$, and $p$ is a fixed point of a parabolic transformation in $\mathcal M$. Eventually-periodic points correspond exactly to fixed points of loxodromic elements of $\mathcal M$, which can be interpreted as roots of non-degenerate quadratics using the Clifford Algebra formalism of Ahlfors. In particular, this provides a new geometric proof of Lagrange's theorem for nearest-integer real CFs and Hurwitz complex CFs. Lastly, we comment on generalizations of the identity $i+1/i=0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Lukyanenko, Joseph Vandehey. 2026-03-12. A geometric proof of Lagrange's theorem for continued fractions. https://arxiv.org/abs/2603.12425

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT