Previous Up Next
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Lecture 16 Continued Fractions, Möbius Transformations and Cycles

We review interrelations between continued fractions, Möbius transformations and representations of cycles by 2× 2 matrices. This leads us to several descriptions of continued fractions through chains of orthogonal or touching horocycles. One of these descriptions was proposed in paper by A. Beardon and I. Short [28]. The approach is extended to several dimensions in a way which is compatible to the early propositions of A. Beardon based on Clifford algebras [22].

16.1 Introduction

Continued fractions remain an important and attractive topic of current research [158] [45] [149] [163]*§ E.3. A fruitful and geometrically appealing method considers a continued fraction as an (infinite) product of linear-fractional transformations from the Möbius group. see Sec. 16.2 of this paper for an overview, papers [274] [299] [285] [23] [300]*Ex. 10.2 and in particular [25] contain further references and historical notes. Partial products of linear-fractional maps form a sequence in the Moebius group, the corresponding sequence of transformations can be viewed as a discrete dynamical system [25, 249]. Many important questions on continued fractions, e.g. their convergence, can be stated in terms of asymptotic behaviour of the associated dynamical system. Geometrical generalisations of continued fractions to many dimensions were introduced recently as well [22] [149].

Any consideration of the Möbius group introduces cycles—the Möbius invariant set of all circles and straight lines. Furthermore, an efficient treatment cycles and Möbius transformations is realised through certain 2× 2 matrices, which we will review in Sec. 16.3, see also [300] [65]*§ 4.1 [100] [163]*§ 4.2 [185] [198]. Linking the above relations we may propose the main thesis of the present note:

Corollary 1 (Continued fractions and cycles) Properties of continued fractions may be illustrated and demonstrated using related cycles, in particular, in the form of respective 2× 2 matrices.

One may expect that such an observation has been made a while ago, e.g. in the book [300], where both topics were studied. However, this seems did not happened for some reasons. It is only the recent paper [28], which pioneered a connection between continued fractions and cycles. We hope that the explicit statement of the claim will stimulate its further fruitful implementations. In particular, Sec. 16.4 reveals all three possible cycle arrangements similar to one used in [28]. Secs. 16.516.6 shows that relations between continued fractions and cycles can be used in the multidimensional case as well.

As an illustration, we draw on Fig. 16.1 chains of tangent horocycles (circles tangent to the real line, see [28] and Sec. 16.4) for two classical simple continued fractions:

  e=2+
1

1+
1

2+
1

1+
1

1+…
  ,   π=3+
1

7+
1

15+
1

1+
1

292+…
  .

  
Figure 16.1: Continued fractions for e and π visualised. The convergence rate for π is pictorially faster.

One can immediately see, that the convergence for π is much faster: already the third horocycle is too small to be visible even if it is drawn. This is related to larger coefficients in the continued fraction for π.

Paper [28] also presents examples of proofs based on chains of horocycles. This intriguing construction was introduced in [28] ad hoc. Guided by the above claim we reveal sources of this and other similar arrangements of horocycles. Also, we can produce multi-dimensional variant of the framework.

16.2 Continued Fractions

We use the following compact notation for a continued fraction:

K(an|bn)=
a1

b1+
a2

b2+
a3

b3+…
=
a1
b1
0pt+
a2
b2
0pt+
a3
b3
0pt+…. (1)

Without loss of generality we can assume aj≠ 0 for all j. The important particular case of simple continued fractions, with an=1 for all n, is denoted by K(bn)=K(1|bn). Any continued fraction can be transformed to an equivalent simple one.

It is easy to see, that continued fractions are related to the following linear-fractional (Möbius) transformation, cf. [274, 299, 285, 23]:

Sn=s1∘ s2∘ …∘ sn,    where   sj(z)= 
aj
bj+z
. (2)

These Möbius transformation are considered as bijective maps of the Riemann sphere $ℂ^_$=ℂ∪{∞} onto itself. If we associate the matrix (

  ab
cd

) to a liner-fractional transformation za z+b/c z+d, then the composition of two such transformations corresponds to multiplication of the respective matrices. Thus, relation (2) has the matrix form:



    Pn−1Pn
    Qn−1Qn


=


    0a1
    1b1




    0a2
    1b2




    0an
    1bn


. (3)

The last identity can be fold into the recursive formula:



    Pn−1Pn
    Qn−1Qn


=


    Pn−2Pn−1
    Qn−2Qn−1




    0an
    1bn


. (4)

This is equivalent to the main recurrence relation:

    Pn=bnPn−1+anPn−2
    Qn=bnQn−1+anQn−2
,    n=1,2,3,…,  with
P1=a1,P0=0,
Q1=b1,Q0=1.
(5)

The meaning of entries Pn and Qn from the matrix (3) is revealed as follows. Möbius transformation (2)–(3) maps 0 and ∞ to

Pn
Qn
=Sn(0),        
Pn−1
Qn−1
=Sn(∞). (6)

It is easy to see that Sn(0) is the partial quotient of (1):

Pn
Qn
= 
a1
b1
0pt+
a2
b2
0pt+…+
an
bn
 . (7)

Properties of the sequence of partial quotients {Pn/Qn} in terms of sequences {an} and {bn} are the core of the continued fraction theory. Equation (6) links partial quotients with the Möbius map (2). Circles form an invariant family under Möbius transformations, thus their appearance for continued fractions is natural. Surprisingly, this happened only recently in [28].

16.3 Möbius Transformations and Cycles

If M=(

  ab
cd

) is a matrix with real entries then for the purpose of the associated Möbius transformations M: zaz+b/cz+d we may assume that detM=± 1. The collection of all such matrices form a group. Möbius maps commute with the complex conjugation zz. If detM>0 then both the upper and the lower half-planes are preserved; if det M <0 then the two half-planes are swapped. Thus, we can treat M as the map of equivalence classes zz, which are labelled by respective points of the closed upper half-plane. Under this identification we consider any map produced by M with detM =± 1 as the map of the closed upper-half plane to itself.

The characteristic property of Möbius maps is that circles and lines are transformed to circles and lines. We use the word cycles for elements of this Möbius-invariant family [339, 198, 185]. We abbreviate a cycle given by the equation

k(u2+v2)−2lv−2nu+m=0 (8)

to the point (k,l,n,m) of the three dimensional projective space P3. The equivalence relation zz is lifted to the equivalence relation

(k,l,n,m)∼(k,l,−n,m) (9)

in the space of cycles, which again is compatible with the Möbius transformations acting on cycles.

The most efficient connection between cycles and Möbius transformations is realised through the construction, which may be traced back to [300] and was subsequently rediscovered by various authors [65]*§ 4.1 [100] [163]*§ 4.2, see also [185, 198]. The construction associates a cycle (k,l,n,m) with the 2× 2 matrix C=(

  l+i  nm
  kl+in

), see discussion in [198]*§ 4.4 for a justification. This identification is Möbius covariant: the Möbius transformation defined by M=(

ab
cd

) maps a cycle with matrix C to the cycle with matrix MCM−1. Therefore, any Möbius-invariant relation between cycles can be expressed in terms of corresponding matrices. The central role is played by the Möbius-invariant inner pro­duct [198]*§ 5.3:

⟨ C,G   ⟩=ℜ tr(C
S
), (10)

which is a cousin of the product used in GNS construction of C*-algebras. Notably, the relation:

⟨ C,S   ⟩=0   or     km′+mk′−2nn′−2ll′=0, (11)

describes two cycles C=(k,l,m,n) and S =(k′,l′,m′,n′) orthogonal in Euclidean geometry. Also, the inner product (10) expresses the Descartes–Kirillov condition [163]*Lem. 4.1(c) [198]*Ex. 5.26 of C and S to be externally tangent:

⟨ C+S ,C+S   ⟩ =0   or  (l+l′)2+(n+n′)2 −(m+m′)(k+k′)=0, (12)

where the representing vectors C=(k,l,n,m) and S =(k′,l′,m′,n′) from P3 need to be normalised by the conditions ⟨ C,C ⟩=1 and ⟨ S ,S ⟩=1.

16.4 Continued Fractions and Cycles

Let M=(

  ab
cd

) be a matrix with real entries and the determinant detM equal to ± 1, we denote this by δ=detM. As mentioned in the previous section, to calculate the image of a cycle C under Möbius transformations M we can use matrix similarity MCM−1. If M= (

  Pn−1Pn
  Qn−1Qn

) is the matrix (3) associated to a continued fraction and we are interested in the partial fractions Pn/Qn, it is natural to ask:

Which cycles C have transformations MCM−1 depending on the first (or on the second) columns of M only?

It is a straightforward calculation with matrices1 to check the following statements:

Lemma 2 The cycles (0,0,1,m) (the horizontal lines v=m) are the only cycles, such that their images under the Möbius transformation (
    ab
cd
) are independent from the column (
    b
d
). The image associated to the column (
a
c
) is the horocycle (c2m,acm,δ,a2m), which touches the real line at a/c and has the radius 1 /mc2.

In particular, for the matrix (4) the horocycle is touching the real line at the point Pn−1/Qn−1=Sn(∞) (6).

Lemma 3 The cycles (k,0,1,0) (with the equation k(u2+v2)−2v=0) are the only cycles, such that their images under the Möbius transformation (
ab
cd
) are independent from the column (
    a
c
). The image associated to the column (
b
d
) is the horocycle (d2k,bdk,δ,b2k), which touches the real line at b/d and has the radius 1 /kd2.

In particular, for the matrix (4) the horocycle is touching the real line at the point Pn/Qn=Sn(0) (6). In view of these partial quotients the following cycles joining them are of interest.

Lemma 4 A cycle (0,1,n,0) (any non-horizontal line passing 0) is transformed by (2)–(3) to the cycle (2QnQn−1, PnQn−1+QnPn−1n,2PnPn−1), which passes points Pn/Qn=Sn(0) and Pn−1/Qn−1=S(∞) on the real line.

The above three families contain cycles with specific relations to partial quotients through Möbius transformations. There is one degree of freedom in each family: m, k and n, respectively. We can use the parameters to create an ensemble of three cycles (one from each family) with some Möbius-invariant interconnections. Three most natural arrangements are illustrated by Fig. 16.2. The first row presents the initial selection of cycles, the second row—their images after a Möbius transformation (colours are preserved). The arrangements are as follows:



Figure 16.2: Various arrangements for three cycles. The first row shows the initial position, the second row—after a Möbius transformation (colours are preserved).
The left column shows the arrangement used in the paper [28]: two horocycles touching, the connecting cycle is passing their common point and is orthogonal to the real line.
The central column presents two orthogonal horocycles and the connecting cycle orthogonal to them.
The horocycles in the right column are again orthogonal but the connecting cycle passes one of their intersection points and makes 45 with the real axis.

  1. The left column shows the arrangement used in the paper [28]: two horocycles are tangent, the third cycle, which we call connecting, passes three points of pair-wise contact between horocycles and the real line. The connecting cycle is also orthogonal to horocycles and the real line. The arrangement corresponds to the following values m=2, k=2, n=0. These parameters are uniquely defined by the above tangent and orthogonality conditions together with the requirement that the horocycles’ radii agreeably depend from the consecutive partial quotients’ denominators: 1/2Qn−12 and 1/2Qn2 respectively. This follows from the explicit formulae of image cycles calculated in Lemmas 2 and 3.
  2. The central column of Fig. 16.2 presents two orthogonal horocycles and the connecting cycle orthogonal to them. The initial cycles have parameters m=√2, k=√2, n=0. Again, these values follow from the geometric conditions and the alike dependence of radii from the partial quotients’ denominators: √2/2Qn−12 and √2/2Qn2.
  3. Finally, the right column have the same two orthogonal horocycles, but the connecting cycle passes one of two horocycles’ intersection points. Its mirror reflection in the real axis satisfying (9) (drawn in the dashed style) passes the second intersection point. This corresponds to the values m=√2, k=√2, n=± 1. The connecting cycle makes the angle 45 at the points of intersection with the real axis. It also has the radius √2/2| Pn/QnPn−1/Qn−1 | =√2/21/| QnQn−1 |—the geometric mean of radii of two other cycles. This again repeats the relation between cycles’ radii in the first case.

Three configurations have fixed ratio √2 between respective horocycles’ radii. Thus, they are equally suitable for the proofs based on the size of horocycles, e.g. [28]*Thm. 4.1.

On the other hand, there is a tiny computational advantage in the case of orthogonal horocycles. Let we have the sequence pj of partial fractions pj=Pj/Qj and want to rebuild the corresponding chain of horocycles. A horocycle with the point of contact pj has components (1,pj, nj, pj2), thus only the value of nj need to be calculated at every step. If we use the condition “to be tangent to the previous horocycle”, then the quadratic relation (12) shall be solved. Meanwhile, the orthogonality relation (2) is linear in nj.

16.5 Multi-dimensional Möbius maps and cycles

It is natural to look for multidimensional generalisations of continued fractions. A geometric approach based on Möbius transformation and Clifford algebras was proposed in [22]. The Clifford algebra Cl(n) is the associative unital algebra over ℝ generated by the elements e1,…,en satisfying the following relation:

  eiej + ejei=−2δij,

where δij is the Kronecker delta. An element of Cl(n) having the form x=x1e1+…+xnen can be associated with the vector (x1,…,xn)∈ℝn. The reversion aa* in Cl(n) [65]*(1.19(ii)) is defined on vectors by x*=x and extended to other elements by the relation (ab)*=b*a*. Similarly the conjugation is defined on vectors by x=−x and the relation ab=bā. We also use the notation | a |2=aā≥ 0 for any product a of vectors. An important observation is that any non-zero vectors x has a multiplicative inverse: x−1=x/| x |2.

By Ahlfors [3] (see also [22]*§ 5 [65]*Thm. 4.10) a matrix M= (

  ab
cd

) with Clifford entries defines a linear-fractional transformation of ℝn if the following conditions are satisfied:

  1. a, b, c and d are products of vectors in ℝn;
  2. ab*, cd*, c*a and d*b are vectors in ℝn;
  3. the pseudodeterminant δ:=ad*bc* is a non-zero real number.

Clearly we can scale the matrix to have the pseudodeterminant δ=± 1 without an effect on the related linear-fractional transformation. Define, cf. [65]*(4.7)

M=


  d*b*
c*a*


    and     M*=


  db
cā


. (13)

Then MMI and MM*, where κ=1 or −1 depending either d is a product of even or odd number of vectors.

To adopt the discussion from Section 16.3 to several dimensions we use vector rather than paravector formalism, see [65]*(1.42) for a discussion. Namely, we consider vectors x∈ℝn+1 as elements x=x1e1+…+xnen+xn+1 en+1 in Cl(n+1). Therefore we can extend the Möbius transformation defined by M= (

  ab
cd

) with a,b,c,dCl(n) to act on ℝn+1. Again, such transformations commute with the reflection R in the hyperplane xn+1=0:

  R:  x1e1+…+xnen+xn+1en+1  ↦   x1e1+…+xnenxn+1en+1.

Thus we can consider the Möbius maps acting on the equivalence classes xR(x).

Spheres and hyperplanes in ℝn+1—which we continue to call cycles—can be associated to 2× 2 matrices [100] [65]*(4.12):

kxxlxxl+m=0   ↔    C=


    lm
    kl


, (14)

where k, m∈ℝ and l∈ℝn+1. For brevity we also encode a cycle by its coefficients (k,l,m). A justification of (4) is provided by the identity:

  

    1x



    lm
    kl




    x
1


= kxxlxxl+m,   since  x=−x  for  x∈ℝn. 

The identification is also Möbius-covariant in the sense that the transformation associated with the Ahlfors matrix M sends a cycle C to the cycle MCM* [65]*(4.16). The equivalence xR(x) is extended to spheres:

  


    lm
    kl


 ∼    


    R(l)m
    kR(l)


since it is preserved by the Möbius transformations with coefficients from Cl(n).

Similarly to (10) we define the Möbius-invariant inner product of cycles by the identity ⟨ C,S ⟩=ℜ tr(CS ), where ℜ denotes the scalar part of a Clifford number. The orthogonality condition ⟨ C,S ⟩=0 means that the respective cycle are geometrically orthogonal in ℝn+1.

16.6 Continued fractions from Clifford algebras and horocycles

There is an association between the triangular matrices and the elementary Möbius maps of ℝn, cf. (2):



    01
1b


:    x ↦ (x+b)−1 ,  where x=x1e1+…+xnen, b=b1e1+… bnen, (15)

Similar to the real line case in Section 16.2, Beardon proposed [22] to consider the composition of a series of such transformations as multidimensional continued fraction, cf. (2). It can be again represented as the the product (3) of the respective 2× 2 matrices. Another construction of multidimensional continued fractions based on horocycles was hinted in [28]. We wish to clarify the connection between them. The bridge is provided by the respective modifications of Lem. 24.

Lemma 5 The cycles (0,en+1,m) (the “horizontal” hyperplane xn+1=m) are the only cycles, such that their images under the Möbius transformation (
ab
cd
) are independent from the column (
    b
d
). The image associated to the column (
a
c
) is the horocycle (−m| c |2, −macen+1,m| a |2), which touches the hyperplane xn+1=0 at ac/| c |2 and has the radius 1 /m| c |2.
Lemma 6 The cycles (k,en+1,0) (with the equation k(u2+v2)−2v=0) are the only cycles, such that their images under the Möbius transformation (
ab
cd
) are independent from the column (
    a
c
). The image associated to the column (
b
d
) is the horocycle (k| d |2,kbden+1,−kb b), which touches the hyperplane xn+1=0 at bd/| d |2 and has the radius 1 /k| d |2.

The proof of the above lemmas are reduced to multiplications of respective matrices with Clifford entries.

Lemma 7 A cycle C=(0,l,0), where l=x+ren+1 and 0≠ x∈ℝn, r∈ℝ, that is any non-horizontal hyperplane passing the origin, is transformed into MCM*=(c xd+dxc, a xd+bxcr en+1, a xb+ bxā). This cycle passes points ac/| c |2 and bd/| d |2.

If x= cd, then the centre of

  MCM*=(2
c
2
d
2, ac
d
2+bd
c
2, (ac)(db)+(bd)(cā))

is 1/2(ac/| c |2+bd/| d |2)+ δ r/2| c |2| d |2en+1, that is, the centre belongs to the two-dimensional plane passing the points ac/| c |2 and bd/| d |2 and orthogonal to the hyperplane xn+1=0.

Proof. We note that en+1 x=−x en+1 for all x∈ℝn. Thus, for a product of vectors dCl(n) we have en+1 d=d* en+1. Then

    cen+1d+dēn+1c=(cd*dc*)en+1=(cd*−(cd*)*)en+1=0,

due to the Ahlfors condition 2. Similarly, a en+1b+ bēn+1ā=0 and a en+1d+bēn+1c=(ad*bc*) en+1en+1.

The image MCM* of the cycle C=(0,l,0) is (c ld+dlc, a ld+blc, a lb+ bla). From the above calculations for l=x+ren+1 it becomes (c xd+dxc, a xd+bxcr en+1, a xb+ bxā). The rest of statement is verified by the substitution.


Thus, we have exactly the same freedom to choose representing horocycles as in Section 16.4: make two consecutive horocycles either tangent or orthogonal. To visualise this, we may use the two-dimensional plane V passing the points of contacts of two consecutive horocycles and orthogonal to xn+1=0. It is natural to choose the connecting cycle (drawn in blue on Fig. 16.2) with the centre belonging to V, this eliminates excessive degrees of freedom. The corresponding parameters are described in the second part of Lem. 7. Then, the intersection of horocycles with V are the same as on Fig. 16.2.

Thus, the continued fraction with the partial quotients PnQn/| Qn |2∈ℝn can be represented by the chain of tangent/orthogonal horocycles. The observation made at the end of Section 16.4 on computational advantage of orthogonal horocycles remains valid in multidimensional situation as well.

As a further alternative we may shift the focus from horocycles to the connecting cycle (drawn in blue on Fig. 16.2). The part of the space ℝn encloses inside the connecting cycle is the image under the corresponding Möbius transformation of the half-space of ℝn cut by the hyperplane (0,l,0) from Lem. 7. Assume a sequence of connecting cycles Cj satisfies the following two conditions, e.g. in Seidel–Stern-type theorem [28]*Thm 4.1:

  1. for any j, the cycle Cj is enclosed within the cycle Cj−1;
  2. the sequence of radii of Cj tends to zero.

Under the above assumption the sequence of partial fractions converges. Furthermore, if we use the connecting cycles in the third arrangement, that is generated by the cycle (0,x+en+1,0), where ||x||=1, x∈ℝn, then the above second condition can be replaced by following

  1. the sequence of xn+1(j) of (n+1)-th coordinates of the centres of the connecting cycles Cj tends to zero.

Thus, the sequence of connecting cycles is a useful tool to describe a continued fraction even without a relation to horocycles.

Summing up, we started from multidimensional continued fractions defined through the composition of Möbius transformations in Clifford algebras and associated to it the respective chain of horocycles. This establishes the equivalence of two approaches proposed in [22] and [28] respectively.

.


1
This calculation can be done with the help of the tailored Computer Algebra System (CAS) as described in [198]*App. B[186].
site search by freefind advanced

Last modified: October 28, 2024.
Previous Up Next