We know that given a rational number of the from p / q if we expand it in the decimal base that is an expansion in power of 10 and we know that coefficient is repeating after finite step. In other words, we can say that we need only finitely many coefficients to describe the rest. Let F ( z ) be a rational function that is F ( z ) = p ( z ) q ( z ) . I take the Taylor series expansion of F ( z ) at the point away from the pole (maybe in a local coordinate around the point). Say F ( z ) ∣ z = a ∑ t k ( z − a ) k My question is there any finite condition on the coefficient of t k ? That is we need only finitely many t k 's to determine the rest? If so what will be the proof?

Question

We know that given a rational number of the from   p      /    q if we expand it in the decimal base that is an expansion in power of 10 and we know that coefficient is repeating after finite step. In other words, we can say that we need only finitely many coefficients to describe the rest. Let   F  (  z  ) be a rational function that is   F  (  z  )  =            p      (      z      )              q      (      z      )      . I take the Taylor series expansion of   F  (  z  ) at the point away from the pole (maybe in a local coordinate around the point). Say  F  (  z  )      ∣    z    =  a  ∑      t    k    (  z  −  a      )    k  My question is there any finite condition on the coefficient of       t    k   ? That is we need only finitely many       t    k  &#039;s to determine the rest? If so what will be the proof?

cegielnikmzjkf · Accepted Answer

For simplicity of notation, we can consider a=0. Then we have            P      (      z      )              Q      (      z      )        =      ∑          n      =      0        ∞        c    n        z    n  or  P  (  z  )  =      ∑          n      =      0        ∞        c    n        z    n    Q  (  z  )if   Q  (  z  )  =      ∑          n      =      0        k        b    n        z    n  , the coefficient of       z    n   on the RH side for sufficiently high   n will be given by      ∑          j      =      0        k        b    j        c          n      −      j      When   n is greater than the degree of   P, this will be 0. So we can solve (assuming       b    0    ≠  0) to get      c    n    =  −      ∑          j      −      1        k              b      j              b      0            c          n      −      j      So, yes, rational functions have a recursion formula for their Taylor series coefficients, which holds for   n greater than the degrees of both   P and   Q.

We know that given a rational number of the from p <mrow class="MJX-TeXAtom-ORD"> / <

Answered question

Answer & Explanation

New Questions in Algebra II