Appell sequence

From HandWiki
Short description: Type of polynomial sequence

In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence [math]\displaystyle{ \{p_n(x)\}_{n=0,1,2,\ldots} }[/math] satisfying the identity

[math]\displaystyle{ \frac{d}{dx} p_n(x) = np_{n-1}(x), }[/math]

and in which [math]\displaystyle{ p_0(x) }[/math] is a non-zero constant.

Among the most notable Appell sequences besides the trivial example [math]\displaystyle{ \{x^n\} }[/math] are the Hermite polynomials, the Bernoulli polynomials, and the Euler polynomials. Every Appell sequence is a Sheffer sequence, but most Sheffer sequences are not Appell sequences. Appell sequences have a probabilistic interpretation as systems of moments.

Equivalent characterizations of Appell sequences

The following conditions on polynomial sequences can easily be seen to be equivalent:

  • For [math]\displaystyle{ n = 1, 2, 3,\ldots }[/math],
[math]\displaystyle{ \frac{d}{dx} p_n(x) = n p_{n-1}(x) }[/math]
and [math]\displaystyle{ p_0(x) }[/math] is a non-zero constant;
  • For some sequence [math]\displaystyle{ \{c_{n}\}_{n=0}^{\infty} }[/math] of scalars with [math]\displaystyle{ c_0 \neq 0 }[/math],
[math]\displaystyle{ p_n(x) = \sum_{k=0}^n \binom{n}{k} c_k x^{n-k}; }[/math]
  • For the same sequence of scalars,
[math]\displaystyle{ p_n(x) = \left(\sum_{k=0}^\infty \frac{c_k}{k!} D^k\right) x^n, }[/math]
where
[math]\displaystyle{ D = \frac{d}{dx}; }[/math]
  • For [math]\displaystyle{ n=0,1,2,\ldots }[/math],
[math]\displaystyle{ p_n(x+y) = \sum_{k=0}^n \binom{n}{k} p_k(x) y^{n-k}. }[/math]

Recursion formula

Suppose

[math]\displaystyle{ p_n(x) = \left(\sum_{k=0}^\infty {c_k \over k!} D^k\right) x^n = Sx^n, }[/math]

where the last equality is taken to define the linear operator [math]\displaystyle{ S }[/math] on the space of polynomials in [math]\displaystyle{ x }[/math]. Let

[math]\displaystyle{ T = S^{-1} = \left(\sum_{k=0}^\infty \frac{c_k}{k!} D^k\right)^{-1} = \sum_{k=1}^\infty \frac{a_k}{k!} D^k }[/math]

be the inverse operator, the coefficients [math]\displaystyle{ a_k }[/math] being those of the usual reciprocal of a formal power series, so that

[math]\displaystyle{ Tp_n(x) = x^n.\, }[/math]

In the conventions of the umbral calculus, one often treats this formal power series [math]\displaystyle{ T }[/math] as representing the Appell sequence [math]\displaystyle{ p_n }[/math]. One can define

[math]\displaystyle{ \log T = \log\left(\sum_{k=0}^\infty \frac{a_k}{k!} D^k \right) }[/math]

by using the usual power series expansion of the [math]\displaystyle{ \log(x) }[/math] and the usual definition of composition of formal power series. Then we have

[math]\displaystyle{ p_{n+1}(x) = (x - (\log T)')p_n(x).\, }[/math]

(This formal differentiation of a power series in the differential operator [math]\displaystyle{ D }[/math] is an instance of Pincherle differentiation.)

In the case of Hermite polynomials, this reduces to the conventional recursion formula for that sequence.

Subgroup of the Sheffer polynomials

The set of all Appell sequences is closed under the operation of umbral composition of polynomial sequences, defined as follows. Suppose [math]\displaystyle{ \{p_n(x) \colon n=0,1,2,\ldots\} }[/math] and [math]\displaystyle{ \{q_n(x) \colon n=0,1,2,\ldots\} }[/math] are polynomial sequences, given by

[math]\displaystyle{ p_n(x)=\sum_{k=0}^n a_{n,k}x^k \text{ and } q_n(x)=\sum_{k=0}^n b_{n,k}x^k. }[/math]

Then the umbral composition [math]\displaystyle{ p \circ q }[/math] is the polynomial sequence whose [math]\displaystyle{ n }[/math]th term is

[math]\displaystyle{ (p_n\circ q)(x)=\sum_{k=0}^n a_{n,k}q_k(x)=\sum_{0\le \ell \le k \le n} a_{n,k}b_{k,\ell}x^\ell }[/math]

(the subscript [math]\displaystyle{ n }[/math] appears in [math]\displaystyle{ p_n }[/math], since this is the [math]\displaystyle{ n }[/math]th term of that sequence, but not in [math]\displaystyle{ q }[/math], since this refers to the sequence as a whole rather than one of its terms).

Under this operation, the set of all Sheffer sequences is a non-abelian group, but the set of all Appell sequences is an abelian subgroup. That it is abelian can be seen by considering the fact that every Appell sequence is of the form

[math]\displaystyle{ p_n(x) = \left(\sum_{k=0}^\infty \frac{c_k}{k!} D^k\right) x^n, }[/math]

and that umbral composition of Appell sequences corresponds to multiplication of these formal power series in the operator [math]\displaystyle{ D }[/math].

Different convention

Another convention followed by some authors (see Chihara) defines this concept in a different way, conflicting with Appell's original definition, by using the identity

[math]\displaystyle{ {d \over dx} p_n(x) = p_{n-1}(x) }[/math]

instead.

See also

References

External links