www.pi314.net


History
Mathematicians
All formulas
Num. approx.
Softwares
Misc. math.
Digits
Poetry
Papers/videos
Delirium !
 Pi-Day
Images
Music
Links
Bibliography



Boris Gourévitch
The world of Pi - V2.57
modif. 13/04/2013

Google
Home Version history Guestbook Who I am Some pictures (fr) Acknowledgements Last modifications Contact

Cette page en français This page in English


9 Polygamma and Clausen

(case s  fixed integers, v = pq  , |x|= 1  )

An other look at the particular case of the function Y  ... We are starting to corner the problem !

9.1 Polygamma Functions

The polygamma functions are defined for m > 1  by the following relation :

              (1)m+1          oo  sum      1
Y(1,m + 1,v) = --m!--ym(v) =    ------m+1-
                            k=0 (k+ v)
(307)

So we are dealling with hypergeometric series :

                                                    (      m+1 fois         )
                                                           v,v,...,v,1
ym(v) = (- 1)m+1(m!)Y(1,m + 1,v) = (- 1)m+1(m!).m+2Fm+1  v+ 1,v+ 1,...,v+ 1 ,1
                                                        ------- -------
                                                            m+1 fois
(308)

We'll notice that for m  = 0  , the serie is not convergent, which is why we can use this definition.

However, if I've introduce the polygamma after their series is to make the link with what interest us here, we need to know that the usual definition of the polygamma are done using the famous Gamma function G(x) =  integral  oo  tx-1e-tdt
       0  . Hence the            ym  functions are in fact the m + 1  -th differention of the logarithm of the Gamma function :

       -dm+1-
ym(v) = dvm+1 ln(G(v))
(309)

and we can define y0(v) = G'(v)
        G(v)  which we also call the Digamma function. Why are we doing that by the way?

In fact, I started from the nice formula recalling the function Y  but it seems useful to quickly show why this is all linked to the function G  . Because, this famous hypergeometric serie gives most of the time only G  , even if it is hidden !

Let us start from the well know equality G(x + 1) = xG(x)  to confirm and remind us that the definition of Pochammer's symbol gives us for all n  in N

G(x-+-n+-1)
  G(x +1)   = (x + 1)n = (x+ 1)* (x + 2)*...* (x+ n)
(310)

giving the following formula

              G(x+-n-+1)-  (x-+n)!
G(x+ 1) = x! = (x + 1)n   = (x+ 1)n
(311)

Thanks to the never the less famous equivalence by Stirling extend to the non-integer factorial we have for n  near infinity

                                                                         V~ ----------
        n-->o o       (x+n) -(x+n) V~  --------- n--> oo  nxnn(1 + x)x(1+ x )n e-xe-n  2pn(1 + x)
G(x+ 1)   ~  (x+-n)----e-------2p(x-+-n)  ~   ---------n------n-------------------n--
                       (x + 1)n                               (x +1)n
(312)

by decomposing and sorting the n  . Then, we notice that (    )
 1+ xn x  n-- >   oo  1
         ------>  and that (    )          x n-->o o 
1 + xn n = en ln(1+ n)  ~ ex  and finaly that of course   n--> oo        V~ ---
n! ~  nne- n 2pn  thanks to Stirling. This leads us to

              x x -x n -n V~ ----              x
G(x+ 1) n-->o~ o  n-e-e-n-e----2pn-n-->o~ o --------n-n!--------
                  (x+ 1)n           (x+ 1)(x +2)...(x + n)
(313)

or

     n--> oo  -------nx-1n!------- n--> oo -------nxn!------
G(x)  ~   (x) (x + 1)...(x+ n - 1)  ~  (x)(x +1)...(x + n)
(314)

This gives us the logarithmic form of the Gamma function

              (                          )
                               sum n
ln (G(x)) = nl-->imo o  ln(n!)+ x ln(n)-   ln(x+ k)
                              k=0
(315)

which is equivalent to the formulation of the function by the infinite product of Weierstrass for friends. In fact, by taking into account that          sum n   1
g = nli-->m oo    k=0 k- ln(n)  , we can write

pict

From there, we can go in crazy direction (which will keep quiet the rigourous justification because we don't want to overload the page) and easily find the polygamma and digamma functions commonly defined. In fact the first diffirentiation gives

       G'(x)    1       sum  oo  ( 1    1)
y0(v) =-G(x) = - x-- g-     x+-k-- k-
                       k=1
(317)

then a second differentiation gives

        sum  oo ---1---
y1(v) =    (x + k)2
       k=0
(318)

and so on.

Basicly, you've understood it, here we are playing with the Gamma function and it's derivatives.

9.2 The digamma function

We have seen the definition of the digamma function above (317). It is only interesting in the fact that it involves some ln(2)  and some p  , it does not manage to associate the Euler's gamma constant. Hence, we get

   (  )
y0  1  = - g- 2 ln(2)
    2
(319)

   (  )
    1                 p-
y0  4  = - g- 3 ln(2)- 2
(320)

From the formula 317, the constant g  is simplified... We need to establish if this constant is homogeneous or not to p  or ln(2)   ? it's likely... According to the polygamma and the BBP formulae, we can say that if p  of order 1 and  p2  is of oder 2, then   g  is of order ”0  ” or below 1 in all cases...

At the rational points, the digamma function reveals it's intimacy thanks to the theorem on Gauss' digamma, which say that

  (  )                    (   )    [12( sum q-1)]   (     )  (    (  ))
y0  p  = -g - ln(2q)- p-cot pp-  + 2      cos  2pjp  ln  sin  jp-
    q                2      q        j=1        q            q
(321)

for p,q  (-  N  , 0 < p < q  .

We clearly see here the intervention of p  , always present in important places !

9.3 Polygamma of order m > 1

Plouffe but in evidence on his page numerous relation between the polygamma function of order m > 1  and the constants of order            m + 1  for rational parameters.

9.3.1 Link with the integrals of BBP formulae

Even if those relation were only put to light later on, they are nothing less than BBP formula with no powers          i
       1/q  . In fact, this comes down to taking a particular integral, and more precisely a = 1  in the formula 64.

 integral  1 m                        oo  (b-1            )        b-1     (     )
   ln--(y)P-(y)dy = (-1)m+1 m! sum    sum  -----al------ =  -1-- sum  al.ym  l-+1
 0    yb- 1                 i=0  l=0 (bi+ l+ 1)m+1     bm+1 l=0        b
(322)

For this reason, the proof of those formulae are done exactly done the same as in the paragraph dedicated to BBP formulae.

9.3.2 A graphical approach

Plouffe approached the linear relations from an other angle than that of classical formulae, it's the linear link. In fact, by systematically searching for relations for the polygamma of order m  > 1  taken with rationals values with some small denominators, we can constuct some schema synthetising the link between polygamma of the same order. We just need to follow the path of the line to observe which constant are linearly link between them.

Concerning notation, we'll notice that the differentiation of the digamma function is the polygamma function of order 2 :        Y'=  y
             1  to understand Plouffe's notation.

A first example is given with the constants p2  and G  (Catalan's constant) which is of order 2 as everyone knows :


pict


Here, we need to understand that the circuit between p2  , G  , and Y'(1)
   4 is closed since they form a triangle. Hence numerically, we have in fact

            (  )                 (  )
      2    ' 1              2      1
8G + p - Y   4  = 0 = 8G + p - y1  4
(323)

As Plouffe said it, note that if we introduced p2 V~ 2  , we would most likely find other diagrams of other branches of existing diagrams.

I also take his commenteries, only common sense, which indicates for example on the diagram we can not apparently find relations in Z  between p2  , G  , and Y'(1-)
    3 , but nothing say about it's validity in other domains, in fact with         p2 V~ 2  or other things of the kind.

The symetry that appears in this scheme (and sometime others) is often due to analytical formula of symetry, here for example, we have

  '      '        ---p2---
Y (x)+ Y  (1 - x) = sin2(px)
(324)

which gives a lot of rational relations at least for x = 1, 1, 1
    3 4 6  .

Finaly, a few liasion between rationals polygamma without p2  or G  are not recopied here, so to avoid some confusions in the diagrams.

Here are the other diagrams build by Plouffe  :

Order 2


pict



pict


Ordre 3


pict



pict



pict



pict



pict



pict



pict



pict



pict



pict



pict


9.3.3 Analytical translation 

Here are a few example of relation, where we see even the dilogarithm appear! We can find the set of relations discovered by Plouffe on this page and surf through the sections dedicated to Euler's gamma constant, or  z(3)  , etc...

Order 2

  (5 )     (1 )
y1  6  + y1  6  - 4p2 = 0
(325)

   (1 )      (5 )     (5 )      (2 )
8L2  6  + 8L2  6  + y1  6  - 5y1  3  = 0
(326)

           ( )      (  )      (  )
            1         1         2
-32G + 4y1  4  - 3y1  3  - 3y1  3  = 0
(327)

       (  )      (  )      ( )
        3         1         5
8G+ y1  4  - 6L2  6  - 6L2  6  = 0
(328)

  (  )     (  )
    1        3      2
y1  4  + y1  4  - 2p = 0
(329)

         (  )           (  )      (  )
           1      2       1         2
- 8G +y1   4  +3p  - 3y1  3  - 3y1  3  = 0
(330)

    ( )      ( )       ( )
     5        1         2
-y1  6  - y1  3  + 4y1  3  = 0
(331)

    (  )            (  )
     1      2         1
3y1  6  + 4p  - 15y1   3  = 0
(332)

     ( )       ( )     (  )     (  )
      1         3        5        1
-2y1  4  - 2y1  4  + y1  6  + y1  6  = 0
(333)

Order 3

     ( )      ( )      ( )
      1        1        5
-8y2  4  + y2  8  + y2  8  = 0
(334)

              ( )       (  )
    3 V~ -       1          2
-64p   3- 9y2  6  + 63y2  3  = 0
(335)

             (  )     (  )
               2       5
- 52z(3) - 9y2   3  +y2  6   = 0
(336)

                    (  )     (   )     (   )
  3 V~ -                1        1-        7-
8p   3+ 52z(3)- 54y2  3  + y2  12  + y2  12  = 0

         (  )     (  )
- 4p3 - y2  1  + y2  3  = 0
           4        4

among others...

Proof Here is the proof af a formula, for example :

The most well know must be

            (1 )
8G + p2 - Y' -   = 0
             4
(337)

Proof. The proof here uses the serie and the integral representation. We can already note that 

pict

according to the equivalent integral form (see 322), or in equivalent serie

  (  )     sum  oo             sum  oo      k
Y'  1  = 8    ---1----+ 8   --(--1)--
    4     k=0 (1 + 2k)2    k=0(1+ 2k)2
(339)

The right hand side is the definition of Catalan's constant     sum         k
G =  o o k=0 ((1-+12)k)2   . For the lest hand side, two option are possible, we can either go through the integral forms to find well known dilogarithms

pict

We can also see all of this more directly by manipulating Euler's serie

 sum  oo  1   sum  oo -1---   oo  sum  ---1----
    k2 =    (2k)2 +    (2k+ 1)2
k=1     k=1       k=1
(341)

by cutting the serie among the even and the odd, i.e.

 sum  oo            sum  oo       sum  oo       2    2    2
    ---1----=    -1 - 1    1-=  p-- p--= p--
k=1 (2k + 1)2   k=1k2   4k=1 k2   6    24    8
(342)

From here, we have   (  )
Y'  14 = y1 = 8p82+ 8G  and the said relation _

This kind of easy but characteristic is found in all relations of this section. We mess around with the serie, or we go back to the integrals (or a mixture of the two). It's often easier than for the BBP formulae strictly speaking because the cconsidered integral is always between 0 and 1 (in it's usual form)

9.4 Kölbig's combination

A powerful approach comes from a promotor article by K.S. Kölbig [15] who puts in relation the polygamma and Clausen functions. A little demonstration needs to be done !

9.4.1 Clausen's Functions

Clausen's functions are defined by series which already seems interesting !

            sum  oo  cos(kx)             sum  oo  sin(kx)
Cl2n+1(x) =    -2n+1--et Cl2n(x) =   ---2n-
           k=1 k                  k=1  k
(343)

We have in fact straight away

pict

The asymetry of the definition (why not consider  sum o o k=1 cos(2kxn)
       k   ?) comes from the fact that for opposite parities, the formulae can only be calculated explicitely by diverse classical method of integration and analysisp... For example, we have

 oo  sum  cos(kx)-  p2-  1     1 2
     k2   =  6 - 2px + 4x
k=1
(345)

or even

 sum  oo  sin(kx)  p2    1      1
    ---3--=  --x-  -px2 +-- x3
k=1   k      6     2     12
(346)

It's a lovely mathematical problem to understand why it does not work so well in both cases! It's a similar problems to the one that concern the odd and even values of Riemann's function z  .

A classical result (since there exist some !) is that

    (p)
Cl2  2- = G
(347)

which is a good way to link those two constants !

Clausen's functions are know that they can be express in functions of known constant uniquely for a little number of the value of x  . Which is not very interesting normaly... But we are going to see that by using the polygamma functions, we can sometime links them to something else !

9.4.2 Kölbig's results.

Introduction To come to Kölbig's result, we can first of all notce that an integration gives

 oo                integral  t            q- 1
 sum  --q---tp+qn =    qxp-1-dx = - sum   e- 2pijpq ln(1 -e2pij1qt)
n=0p+ qn         0 1- xqn       j=0
(348)

by decompostition of the fraction in simpler elements. The relation is valid for 0 < p < q  . It's an other way to look at the BBP formulae, without no interest since in the demonstration, we are going to see for example that the nature of those constant that intervin are not determined by the coefficient p  , it being a simple weighting in front of the logarithm. It is said that the relation is thanks to Jensen and can be found by developing the logarithm ! Me, I don;t see where the difficulty was by passing through the decomposition in simple elements, but I could be wrong ?

Then, the continuity relation by Abel allows to write that for the digamma function,

pict

There we go.

Greater Orders In fact, Kölbig obtained very similar result, but on the differentiation on the digamma function, which we know are the polygamma. Instead of having some logarithm, we have some polylogarithm (logical!) and instead of a logarithm function of the complex exponential, we have polylog of the complex exponential, which we just know are Clausen's function according to 344 ! All of this is very coherant and gives the following Kölbig's relation

   (  )      (  )              q- 1
    p      (k)  p        k+1  k  sum   -2pijpq    ( 2pij1q)
yk  q  =  y    q  = (-1)   k!q     e     Lk+1  e
                               j=0
(350)

   (   )       (   )     ((  )k+1            q-1           (     ))
yk  - p  = y(k) - p  = k!   q     + (-1)k+1qk sum  e-2pijpqLk+1  e2pij1q
      q           q         p                j=0
(351)

which is directly proven by the definition of polylogarithm by summing on j   :

 sum  oo     q           q sum -1      p    (    1 )
   (p+-qn)k+1tp+qn =   e-2pijqLk+1 e2pijqt
n=0                 j=0
(352)

We can notice that we obtain the famous multiplication formula for the polylogarithm by letting p = q  in this equation, it's nice !

I won't go into the details of the nine page long proof in Kölbig's article by the principle is the following: Since the left hand side is real, we taje the real part of the right hand side and we calculate the differentiation of what appears. By considering the general inverse relation, and by using the fact that

                                       n
  ( 2pij1)       n  ( - 2pij1)    ( p )n sum [2](-1)kq2k |2k  | |B2k|       n-2k
Ln e   q  + (-1) Ln  e    q = -   iq      (n--2k)!| 2   -2| (2k)!(q- 2j)
                                      k=0
(353)

for 2j < q  , we finaly obtain that

Theorem 15 of Kölbig

For k,p,q  (-  N  , 0 < p < q  ,

pict

and the even orders, for k,p,q  (-  N  , 0 < p < q  ,

pict

where B2h  is the number of Bernoulli's indice 2h  .

Some applications Above (342), we have showed that

 '(1-)         2
Y   4  = y1 = p + 8G
(356)

but we can also note that we have

   ( )
    1             3
Y”  4  = y2 = -2p  - 56z(3)
(357)

which allows us to obtain the values for y1(1-± n)
    4 and y2(1-± n)
    4 from the recursion formulae

yk(1 +x) - yk(x) = (-1)k(k!)x-k-1
(358)

and with some thinking

                               k
yk (1 - x)- (-1)kyk(x) = (- 1)kp d-cot(px)
                              dxk
(359)

but the main interest in those formulae is to give some values for    ( )
y2k 13 ,     ( )
y2k  23 ,    ( )
y2k 16 ,    ( )
y2k 56 in function of well known constants ! For k  (-  N  ,

pict
pict

We hence find the relations (325), (331), (332), (335) and (336) given by Plouffe .


back to home page