Umbral calculus

Last updated January 28, 2024

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 and are sometimes called Blissard's symbolic method.^[1] They are often attributed to Édouard Lucas (or James Joseph Sylvester), who used the technique extensively.^[2]

Short history

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 systematic correspondence techniques of the calculus of finite differences.

The 19th-century umbral calculus

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).

Umbral Taylor series

In differential calculus, the Taylor series of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. That is, a real or complex-valued function f (x) that is infinitely differentiable at $a$ can be written as:

$f(x)=\sum _{n=0}^{\infty }{\frac {f^{(n)}(a)}{n!}}(x-a)^{n}$

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](a)}{k!}}(x-a)_{k}

where

(x-a)_{k}=(x-a)(x-a-1)(x-a-2)\cdots (x-a-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

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 z defined by

L(z^{n})=B_{n}(0)=B_{n}.

Then, using the definition of the Bernoulli polynomials and the definition and linearity of L, one can write

{\begin{aligned}B_{n}(x)&=\sum _{k=0}^{n}{n \choose k}B_{n-k}x^{k}\\&=\sum _{k=0}^{n}{n \choose k}L\left(z^{n-k}\right)x^{k}\\&=L\left(\sum _{k=0}^{n}{n \choose k}z^{n-k}x^{k}\right)\\&=L\left((z+x)^{n}\right)\end{aligned}}

This enables one to replace occurrences of $B_{n}(x)$ by $L((z+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:

{\begin{aligned}\sum _{k=0}^{n}{n \choose k}B_{n-k}(y)x^{k}&=\sum _{k=0}^{n}{n \choose k}L\left((z+y)^{n-k}\right)x^{k}\\&=L\left(\sum _{k=0}^{n}{n \choose k}(z+y)^{n-k}x^{k}\right)\\&=L\left((z+x+y)^{n}\right)\\&=B_{n}(x+y).\end{aligned}}

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₁L₂ of linear functionals defined by

\left\langle L_{1}L_{2}|x^{n}\right\rangle =\sum _{k=0}^{n}{n \choose k}\left\langle L_{1}|x^{k}\right\rangle \left\langle L_{2}|x^{n-k}\right\rangle .

When polynomial sequences replace sequences of numbers as images of yⁿ 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.^[3] 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.^[4]

Notes

↑
- Blissard, John (1861). "Theory of generic equations". The Quarterly Journal of Pure and Applied Mathematics. 4: 279–305.
↑ E. T. Bell, "The History of Blissard's Symbolic Method, with a Sketch of its Inventor's Life", The American Mathematical Monthly45:7 (1938), pp. 414–421.
↑ 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 .
↑ G.-C. Rota and J. Shen, "On the Combinatorics of Cumulants", Journal of Combinatorial Theory, Series A, 91:283–304, 2000.

Related Research Articles

In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the polynomial $(x + y) n$ into a sum involving terms of the form $ax b y c$ , where the exponents $b$ and $c$ are nonnegative integers with $b + c = n$ , and the coefficient $a$ of each term is a specific positive integer depending on $n$ and $b$ . For example, for $n = 4$ ,

In mathematics, an integral is the continuous analog of a sum, which is used to calculate areas, volumes, and their generalizations. Integration, the process of computing an integral, is one of the two fundamental operations of calculus, the other being differentiation. Integration was initially used to solve problems in mathematics and physics, such as finding the area under a curve, or determining displacement from velocity. Usage of integration expanded to a wide variety of scientific fields thereafter.

In mathematics, a set $B$ of vectors in a vector space $V$ is called a basis if every element of $V$ may be written in a unique way as a finite linear combination of elements of $B$ . The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to $B$ . The elements of a basis are called basis vectors.

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 plays a central role in finite difference methods for the numerical solution of differential equations, especially boundary value problems.

In mathematics, the (signed and unsigned) Lah numbers are coefficients expressing rising factorials in terms of falling factorials and vice versa. They were discovered by Ivo Lah in 1954. Explicitly, the unsigned Lah numbers $are given by the formula involving the binomial coefficient$

In probability and statistics, a Bernoulli process is a finite or infinite sequence of binary random variables, so it is a discrete-time stochastic process that takes only two values, canonically 0 and 1. The component Bernoulli variablesX_i are identically distributed and independent. Prosaically, a Bernoulli process is a repeated coin flipping, possibly with an unfair coin. Every variable X_i in the sequence is associated with a Bernoulli trial or experiment. They all have the same Bernoulli distribution. Much of what can be said about the Bernoulli process can also be generalized to more than two outcomes ; this generalization is known as the Bernoulli scheme.

In mathematics, a recurrence relation is an equation according to which the $th term of a sequence of numbers is equal to some combination of the previous terms. Often, only previous terms of the sequence appear in the equation, for a parameter that is independent of; this number is called the order of the relation. If the values of the first numbers in the sequence have been given, the rest of the sequence can be calculated by repeatedly applying the equation.$

In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Unlike an ordinary series, the formal power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers.

In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by non-negative integers $in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities$

In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence $(p n (x) : n = 0, 1, 2, 3, ...)$ of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are named for Isador M. Sheffer.

In mathematics, the Bernoulli polynomials, named after Jacob Bernoulli, combine the Bernoulli numbers and binomial coefficients. They are used for series expansion of functions, and with the Euler–MacLaurin formula.

In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or flats. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice.

Invariant theory is a branch of abstract algebra dealing with actions of groups on algebraic varieties, such as vector spaces, from the point of view of their effect on functions. Classically, the theory dealt with the question of explicit description of polynomial functions that do not change, or are invariant, under the transformations from a given linear group. For example, if we consider the action of the special linear group SL_n on the space of n by n matrices by left multiplication, then the determinant is an invariant of this action because the determinant of A X equals the determinant of X, when A is in SL_n.

In mathematics, a linear differential equation is a differential equation that is defined by a linear polynomial in the unknown function and its derivatives, that is an equation of the form

In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence $satisfying the identity$

In mathematics, a Newtonian series, named after Isaac Newton, is a sum over a sequence $written in the form$

In mathematics, the Stirling polynomials are a family of polynomials that generalize important sequences of numbers appearing in combinatorics and analysis, which are closely related to the Stirling numbers, the Bernoulli numbers, and the generalized Bernoulli polynomials. There are multiple variants of the Stirling polynomial sequence considered below most notably including the Sheffer sequence form of the sequence, $, defined characteristically through the special form of its exponential generating function, and the Stirling (convolution) polynomials,, which also satisfy a characteristic ordinary generating function and that are of use in generalizing the Stirling numbers to arbitrary complex-valued inputs. We consider the " convolution polynomial " variant of this sequence and its properties second in the last subsection of the article. Still other variants of the Stirling polynomials are studied in the supplementary links to the articles given in the references.$

In mathematics, and more specifically in analysis, a holonomic function is a smooth function of several variables that is a solution of a system of linear homogeneous differential equations with polynomial coefficients and satisfies a suitable dimension condition in terms of D-modules theory. More precisely, a holonomic function is an element of a holonomic module of smooth functions. Holonomic functions can also be described as differentiably finite functions, also known as D-finite functions. When a power series in the variables is the Taylor expansion of a holonomic function, the sequence of its coefficients, in one or several indices, is also called holonomic. Holonomic sequences are also called P-recursive sequences: they are defined recursively by multivariate recurrences satisfied by the whole sequence and by suitable specializations of it. The situation simplifies in the univariate case: any univariate sequence that satisfies a linear homogeneous recurrence relation with polynomial coefficients, or equivalently a linear homogeneous difference equation with polynomial coefficients, is holonomic.

In additive number theory and combinatorics, a restricted sumset has the form

Most of the terms listed in Wikipedia glossaries are already defined and explained within Wikipedia itself. However, glossaries like this one are useful for looking up, comparing and reviewing large numbers of terms together. You can help enhance this page by adding new terms or writing definitions for existing ones.

References

Bell, E. T. (1938), "The History of Blissard's Symbolic Method, with a Sketch of its Inventor's Life", The American Mathematical Monthly , Mathematical Association of America, 45 (7): 414–421, doi:10.1080/00029890.1938.11990829, ISSN 0002-9890, JSTOR 2304144
Roman, Steven M.; Rota, Gian-Carlo (1978), "The umbral calculus", Advances in Mathematics , 27 (2): 95–188, doi: 10.1016/0001-8708(78)90087-7 , ISSN 0001-8708, MR 0485417
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.
Roman, Steven (1984), The umbral calculus, Pure and Applied Mathematics, vol. 111, London: Academic Press Inc. [Harcourt Brace Jovanovich Publishers], ISBN 978-0-12-594380-2, MR 0741185 . Reprinted by Dover, 2005.
Roman, S. (2001) [1994], "Umbral calculus", Encyclopedia of Mathematics , EMS Press

External links

Weisstein, Eric W. "Umbral Calculus". MathWorld .
A. Di Bucchianico, D. Loeb (2000). "A Selected Survey of Umbral Calculus" (PDF). Electronic Journal of Combinatorics . Dynamic Surveys. DS3. Archived from the original (PDF) on 2012-02-24.
Roman, S. (1982), The Theory of the Umbral Calculus, I

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] 
Blissard, John (1861). "Theory of generic equations". The Quarterly Journal of Pure and Applied Mathematics. 4: 279–305.

[mwvA] Blissard, John (1861). "Theory of generic equations". The Quarterly Journal of Pure and Applied Mathematics. 4: 279–305.

[2] E. T. Bell, "The History of Blissard's Symbolic Method, with a Sketch of its Inventor's Life", The American Mathematical Monthly45:7 (1938), pp. 414–421.

[3] 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 .

[4] G.-C. Rota and J. Shen, "On the Combinatorics of Cumulants", Journal of Combinatorial Theory, Series A, 91:283–304, 2000.

[1]

[2]

[3]

[4]