Umbral calculus

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics before the 1970s, the term umbral calculus referred to the surprising similarity between seemingly unrelated polynomial equations and certain shadowy techniques used to 'prove' them. These techniques were introduced by John Blissard (1861) and are sometimes called Blissard's symbolic method. They are often attributed to Édouard Lucas (or James Joseph Sylvester), who used the technique extensively.[1]

In the 1930s and 1940s, Eric Temple Bell attempted to set the umbral calculus on a rigorous footing.

In the 1970s, Steven Roman, Gian-Carlo Rota, and others developed the umbral calculus by means of linear functionals on spaces of polynomials. Currently, umbral calculus refers to the study of Sheffer sequences, including polynomial sequences of binomial type and Appell sequences, but may encompass in its penumbra systematic correspondence techniques of the calculus of finite differences.

The 19th-century umbral calculus[edit]

The method is a notational procedure used for deriving identities involving indexed sequences of numbers by pretending that the indices are exponents. Construed literally, it is absurd, and yet it is successful: identities derived via the umbral calculus can also be properly derived by more complicated methods that can be taken literally without logical difficulty.

An example involves the Bernoulli polynomials. Consider, for example, the ordinary binomial expansion (which contains a binomial coefficient):

(y+x)^n=\sum_{k=0}^n{n\choose k}y^{n-k} x^k

and the remarkably similar-looking relation on the Bernoulli polynomials:

B_n(y+x)=\sum_{k=0}^n{n\choose k}B_{n-k}(y) x^k.

Compare also the ordinary derivative

 \frac{d}{dx} x^n = nx^{n-1}

to a very similar-looking relation on the Bernoulli polynomials:

 \frac{d}{dx} B_n(x) = nB_{n-1}(x).

These similarities allow one to construct umbral proofs, which, on the surface, cannot be correct, but seem to work anyway. Thus, for example, by pretending that the subscript n − k is an exponent:

B_n(x)=\sum_{k=0}^n {n\choose k}b^{n-k}x^k=(b+x)^n,

and then differentiating, one gets the desired result:

B_n'(x)=n(b+x)^{n-1}=nB_{n-1}(x).\,

In the above, the variable b is an "umbra" (Latin for shadow).

See also Faulhaber's formula.

Umbral Taylor series[edit]

Similar relationships were also observed in the theory of finite differences. The umbral version of the Taylor series is given by a similar expression involving the k 'th forward differences \Delta^k [f] of a polynomial function f,

f(x)=\sum_{k=0}^\infty\frac{\Delta^k [f](0)}{k!}(x)_k

where

(x)_k=x(x-1)(x-2)\cdots(x-k+1)

is the Pochhammer symbol used here for the falling sequential product. A similar relationship holds for the backward differences and rising factorial.

This series is also known as the Newton series or Newton's forward difference expansion. The analogy to Taylor's expansion is utilized in the calculus of finite differences.

Bell and Riordan[edit]

In the 1930s and 1940s, Eric Temple Bell tried unsuccessfully to make this kind of argument logically rigorous. The combinatorialist John Riordan in his book Combinatorial Identities published in the 1960s, used techniques of this sort extensively.

The modern umbral calculus[edit]

Another combinatorialist, Gian-Carlo Rota, pointed out that the mystery vanishes if one considers the linear functional L on polynomials in y defined by

L\left(y^n\right)= B_n(0)= B_n.\,

Then one can write


\begin{align}
B_n(x)
&=\sum_{k=0}^n{n\choose k}B_{n-k}x^k
&& \text{applying the definition of Bernoulli polynomials}
\\
&= \sum_{k=0}^n{n\choose k}L\left(y^{n-k}\right)x^k
&& \text{applying the above definition}
\\
&= L\left(\sum_{k=0}^n{n\choose k}y^{n-k}x^k\right)
&& \text{since L is linear}
\\
&= L\left((y+x)^n\right).&&
\end{align}

This enables one to replace occurrences of B_n(x) by L((y+x)^n), that is, move the n from a subscript to a superscript (the key operation of umbral calculus). For instance, we can now prove that

B_n(y+x)=\sum_{k=0}^n{n\choose k}B_{n-k}(y) x^k

by expanding the right-hand side as

\sum_{k=0}^n{n\choose k}B_{n-k}(y) x^k = \sum_{k=0}^n{n\choose k}L\left((2y)^{n-k}\right) x^k = L\left(\sum_{k=0}^n{n\choose k}(2y)^{n-k} x^k\right) = L\left((2y+x)^n\right) = B_n(x+y).

Rota later stated that much confusion resulted from the failure to distinguish between three equivalence relations that occur frequently in this topic, all of which were denoted by "=".

In a paper published in 1964, Rota used umbral methods to establish the recursion formula satisfied by the Bell numbers, which enumerate partitions of finite sets.

In the paper of Roman and Rota cited below, the umbral calculus is characterized as the study of the umbral algebra, defined as the algebra of linear functionals on the vector space of polynomials in a variable x, with a product L1L2 of linear functionals defined by

\langle L_1 L_2 \mid x^n \rangle = \sum_{k=0}^n {n \choose k}\langle L_1 \mid x^k\rangle \langle L_2 \mid x^{n-k} \rangle.

When polynomial sequences replace sequences of numbers as images of yn under the linear mapping L, then the umbral method is seen to be an essential component of Rota's general theory of special polynomials, and that theory is the umbral calculus by some more modern definitions of the term.[2] A small sample of that theory can be found in the article on polynomial sequences of binomial type. Another is the article titled Sheffer sequence.

Rota later applied umbral calculus extensively in his paper with Shen to study the various combinatorial properties of the cumulants.[3]

See also[edit]

Notes[edit]

  1. ^ E. T. Bell, "The History of Blissard's Symbolic Method, with a Sketch of its Inventor's Life", The American Mathematical Monthly 45:7 (1938), pp. 414–421.
  2. ^ Rota, G. C.; Kahaner, D.; Odlyzko, A. (1973). "On the foundations of combinatorial theory. VIII. Finite operator calculus". Journal of Mathematical Analysis and Applications 42 (3): 684. doi:10.1016/0022-247X(73)90172-8. 
  3. ^ G.-C. Rota and J. Shen, "On the Combinatorics of Cumulants", Journal of Combinatorial Theory, Series A, 91:283–304, 2000.

References[edit]

External links[edit]