]> Continued Fractions - Hyperbolic Trigonometric Functions

Hyperbolic Trigonometric Functions

We derive some continued fraction expansions for hyperbolic trigonometric functions.

Theorem: If a0 ,ak+b0 for all integers k, and

P = k=0 1 k!a k(a+b)(2 a+b)...(ak+b) Q = k=0 1 k!a k(a+b)(2 a+b)...(a(k+1 )+b)

then

PQ~ k=1 (ak+b 1 1 0 )

Proof: By induction

k=1 n(ak+b 1 1 0 )=(f n f n1 g n g n1 )

where

f n = k=0 n2 (nk k) r=k+1 nk(ar+b) g n = k=0 n1 2 (nk1 k) r=k+2 nk(ar+b)

Then define u n,k by

f n(a+b)(2 a+b)...(an+b) = k=0 n2 (nk)(nk1 )...(n2 k+1 )(a(k+1 )+b)...(a(nk)+b)(a+b)(2 a+b)...(an+b)k! = k=0 n2 (1 kn)(1 k+1 n)...(1 2 k1 n)(1 k1 n+ban)...(1 +ban)(a+b)(2 a+b)...(an+b)a kk! = k=0 n2 u n,k(a+b)(2 a+b)...(an+b)a kk!

As n, u n,k1 for fixed k hence f n(a+b)...(an+b)P and similarly, g n(a+b)...(an+b)Q.

Corollary: For nonzero x,y,

k=1 ((2 k1 )y x x 0 )~cothxy

and

(i 0 0 1 ) k=1 ((2 k1 )y ix ix 0 )~cotxy

Proof: Use the theorem with a=2 y/x,b=y/x to find k=1 (ak+b 1 1 0 )~cosh(x/y)sinh(x/y). Multiplying each matrix by x completes the proof.

Example: Set x=1 and we have

k=1 ((2 k1 )y 1 1 0 )~coth1 y

In particular, when y is a positive integer, we have coth1 y=[y;3 y,5 y,...].

Theorem: If m,n are positive integers then e m/n is irrational.

Proof: Since coshm/nsinhm/n=e 2 m/n+1 e 2 m/n1 is irrational, it follows e 2 m/n and hence e m/n are irrational.

Theorem: If x,y are nonzero then

cos(x/y)sin(x/y)~ k=1 ((1 ) k+1 (2 k1 )y x x 0 )

Proof: By the following identities:

(i 0 0 1 )(a ib ib 0 )(i 0 0 1 ) = (a b b 0 ) (i 0 0 1 )(a ib ib 0 )(i 0 0 1 ) = (a b b 0 ) (i 0 0 1 )(i 0 0 1 ) = (1 0 0 1 )

we have

(i 0 0 1 ){ k=1 2 n((2 k1 )y ix ix 0 )}(i 0 0 1 ) = (i 0 0 1 )(y ix ix 0 )(i 0 0 1 )×(i 0 0 1 )(3 y ix ix 0 )(i 0 0 1 )×... ~ (y x x 0 )(3 y x x 0 )(5 y x x 0 )... = k=1 2 n((1 ) k+1 (2 k1 )y x x 0 )

Theorem: If x,y are positive integers then

cos(x/y)sin(x/y)~(yx x x 0 ) k=2 {(1 1 1 0 )((2 k1 )y2 x x x 0 )}

Proof: We have the following identities:

1.

(a b b 0 )=(ab b b 0 )(1 0 1 1 )

2.

(1 0 1 1 )(a b b 0 )(1 0 1 1 )=(1 1 1 0 )(a2 b b b 0 )

3.

(1 0 1 1 )(a b b 0 )(1 0 1 1 )=(1 1 1 0 )(a2 b b b 0 )

4.

(1 0 1 1 )(1 0 1 1 )=(1 0 0 1 )

5.

(1 0 1 1 )(1 0 1 1 )=(1 0 0 1 )

which gives

k=1 2 n+1 ((1 ) k+1 (2 k1 )y x x 0 ) = (y x x 0 )(3 y x x 0 )(5 y x x 0 )... = (yx x x 0 )(1 0 1 1 )(3 y x x 0 )(1 0 1 1 )×(1 0 1 1 )(5 y x x 0 )... ~ (yx x x 0 )(1 1 1 0 )(3 y2 x x x 0 )×(1 0 1 1 )(5 y x x 0 )(1 0 1 1 )(1 0 1 1 )(7 y x x 0 )... ~ (yx x x 0 )(1 1 1 0 )(3 y2 x x x 0 )(1 1 1 0 )(5 y2 x x x 0 )×(1 0 1 1 )(7 y x x 0 )... ~ (yx x x 0 ) k=2 2 n+1 {(1 1 1 0 )((2 k1 )y2 x x x 0 )}(1 0 1 1 )

and similarly

k=1 2 n((1 ) k+1 (2 k1 )y2 x x x 0 ) = (yx x x 0 ) k=2 2 n{(1 1 1 0 )((2 k1 )y2 x x x 0 )}(1 0 1 1 )