# Umbral calculus

﻿
Umbral calculus

In mathematics before the 1970s, the term "umbral calculus" was understood to mean the surprising similarities between otherwise unrelated polynomial equations, and certain shadowy techniques that can be used to 'prove' them. These techniques were introduced by John Blissard in 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. [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.]

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

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" is understood primarily to mean the study of Sheffer sequences, including polynomial sequences of binomial type and Appell sequences.

The 19th-century umbral calculus

That method is a notational device 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 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

:$\left(x+y\right)^n=sum_\left\{k=0\right\}^n\left\{nchoose k\right\}x^\left\{n-k\right\} y^k$

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

:$B_n\left(x+y\right)=sum_\left\{k=0\right\}^n\left\{nchoose k\right\}B_\left\{n-k\right\}\left(x\right) y^k.$

Compare also the ordinary derivative

:$frac\left\{d\right\}\left\{dx\right\} x^n = nx^\left\{n-1\right\}$

to a very similar-looking relation on the Bernoulli polynomials: :$frac\left\{d\right\}\left\{dx\right\} B_n\left(x\right) = nB_\left\{n-1\right\}\left(x\right).$

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\left(x\right)=sum_\left\{k=0\right\}^n \left\{nchoose k\right\}b^\left\{n-k\right\}x^k=\left(b+x\right)^n,$

and then differentiating, one gets the desired result:

:$B_n\text{'}\left(x\right)=n\left(b+x\right)^\left\{n-1\right\}=nB_\left\{n-1\right\}\left(x\right).,$

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

Umbral Taylor's series

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 \left[f\right]$ of a polynomial function "f",

:$f\left(x\right)=sum_\left\{k=0\right\}^inftyfrac\left\{Delta^k \left[f\right] \left(0\right)\right\}\left\{k!\right\}\left(x\right)_k$

where

:$\left(x\right)_k=x\left(x-1\right)\left(x-2\right)cdots\left(x-k+1\right)$

is the Pochhammer symbol 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 forward difference equation.The similarity to Taylor series is explored in the theory of time scale calculus.

Bell and Riordan

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

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\left(0\right)= B_n.,$

Then one can write

:$B_n\left(x\right)=sum_\left\{k=0\right\}^n\left\{nchoose k\right\}B_\left\{n-k\right\}x^k=sum_\left\{k=0\right\}^n\left\{nchoose k\right\}L\left(y^\left\{n-k\right\}\right)x^k=Lleft\left(sum_\left\{k=0\right\}^n\left\{nchoose k\right\}y^\left\{n-k\right\}x^k ight\right)=L\left(\left(y+x\right)^n\right),$

etc. 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 "L"1"L"2 of linear functionals defined by

:$langle L_1 L_2 mid x^n angle = sum_\left\{k=0\right\}^n \left\{n choose k\right\}langle L_1 mid x^k angle langle L_2 mid x^\left\{n-k\right\} angle.$

When polynomial sequences replace sequences of numbers as images of "y""n" 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. 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.

References

* Steven Roman and Gian-Carlo Rota, "The Umbral Calculus", "Advances in Mathematics", volume 27, pages 95–188, (1978).
* G.-C. Rota, D. Kahaner, and A. Odlyzko, "Finite Operator Calculus," Journal of Mathematical Analysis and its Applications, vol. 42, no. 3, June 1973. Reprinted in the book with the same title, Academic Press, New York, 1975.
* Steven Roman, "The Umbral Calculus", Dover Publications, 2005, ISBN 0-486-44129-3.

*
* [http://www.combinatorics.org/Surveys/ds3.pdf A Selected Survey of Umbral calculus, by A. di Bucchianico and D. Loeb (34-page pdf)]

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Calculus (disambiguation) — Calculus is Latin for pebble, and has a number of meanings in English: In mathematics and computer science Calculus , in its most general sense, is any method or system of calculation. To modern theoreticians the answer to the question what is a… …   Wikipedia

• Umbral — is derived from the Latin umbra , meaning shadow . It is also the Spanish word for threshold , and sometimes used as a surname in that language.Umbral may refer to: *Umbral calculus *Umbra *Francisco Umbral *Umbra (World of Darkness) …   Wikipedia

• Función umbral — En matemáticas, una función umbral (más conocida en inglés como threshold function) es una función booleana monótona ƒ : {0,1}n → {0,1}, donde existen n+1 reales no negativos w1, w2, ..., wn, t tales que:[1] Mediante esta función es pos …   Wikipedia Español

• Finite difference — A finite difference is a mathematical expression of the form f(x + b) − f(x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences… …   Wikipedia

• Calcul Symbolique — En mathématiques, avant les années 1970, le terme calcul symbolique (en anglais, umbral calculus , ce qui se traduit par calcul obscur ) était compris comme signifiant les similarités surprenantes entre des équations polynômiales non reliées… …   Wikipédia en Français

• Calcul symbolique — En mathématiques, avant les années 1970, le terme calcul symbolique (en anglais, umbral calculus , ce qui se traduit par calcul obscur ) était compris comme signifiant les similarités surprenantes entre des équations polynômiales non reliées… …   Wikipédia en Français

• Appell sequence — In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence { p n ( x )} n = 0, 1, 2, ... satisfying the identity:{d over dx} p n(x) = np {n 1}(x),and in which p 0( x ) is a non zero constant.ExamplesAmong the… …   Wikipedia

• Calcul ombral — En mathématiques, le calcul ombral est le nom d un ensemble de techniques de calcul formel qui, avant les années 1970, était plutôt appelé en français calcul symbolique. Il s agit de l étude des similarités surprenantes entre certaines formules… …   Wikipédia en Français

• Binomial type — In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by { 0, 1, 2, 3, ... } in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities:p n(x+y)=sum… …   Wikipedia

• Pochhammer symbol — In mathematics, the Pochhammer symbol introduced by Leo August Pochhammer is the notation (x)n, where n is a non negative integer. Depending on the context the Pochhammer symbol may represent either the rising factorial or the falling factorial… …   Wikipedia