Pochhammer symbol

From Wikipedia, the free encyclopedia

In mathematics, the Pochhammer symbol

(x) n or x (n),

introduced by Leo August Pochhammer, has two different meanings.

It is used in the theory of special functions to represent the rising sequential product, sometimes called the ("rising factorial" or "upper factorial")

$x^{(n)}=x(x+1)(x+2)\cdots(x+n-1)=\frac{(x+n-1)!}{(x-1)!},\,$

and it is used in combinatorics (Olver 1999, p. 101) to represent the falling sequential product (or "falling factorial" or "lower factorial")

$(x)_{n}=x(x-1)(x-2)\cdots(x-n+1)=\frac{x!}{(x-n)!}.\,$

To distinguish the two, the notations $x (n)$ and $(x) n$ are commonly used to denote the rising and falling sequential products, respectively. They are related by a difference in sign:

$(-x)^{(n)} = (-1)^n (x)_{n},\,$

where the left-hand side is a rising sequential product and the right-hand side is a falling sequential product. This notation will be used below.

The two are related to the genuine factorial function by the formula:

1 (n) = (n) n = n!.

The Pochhammer symbol has a generalized version called the generalized Pochhammer symbol, used in multivariate analysis. There is also a q-analogue, the q-Pochhammer symbol.

It is important to note, however, that $(x) n$ can also be used to denote the rising factorial.

1 Properties
2 Alternate notations
3 Relation to umbral calculus
4 Connection coefficients
5 See also
6 Note
7 References

[edit] Properties

The empty products x⁽⁰⁾ and (x)₀ are defined to be 1 in both cases.

The rising and falling factorials can be expressed in terms of a binomial coefficient:

$\frac{x^{(n)}}{n!} = {x+n-1 \choose n} \quad\mbox{and}\quad \frac{(x)_n}{n!} = {x \choose n}.$

Thus a large number of identities on the binomial coefficients carry over to the Pochhammer symbols.

It follows from these expressions that the product of n consecutive integers is divisible by n!. Furthermore, the product of four consecutive integers is a perfect square minus one.

The rising factorial can be extended to real values of n using the Gamma function provided x and x + n are not negative integers:

$x^{(n)}=\frac{\Gamma(x+n)}{\Gamma(x)},$

as can the falling factorial:

$(x)_n=\frac{\Gamma(x+1)}{\Gamma(x-n+1)}$ .

Rising and falling factorials obey an equation similar to the binomial theorem:

$(a + b)^{(n)} = \sum_{{j=0}}^n {n \choose j} (a)^{(n-j)}(b)^{(j)}$

$(a + b)_n = \sum_{{j=0}}^n {n \choose j} (a)_{n-j}(b)_{j}$

where the coefficients are the same as the ones in the binomial expansion.

A rising factorial can be expressed as a falling factorial that starts from the other end: a⁽ⁿ⁾ = (a + n − 1)_n.

[edit] Alternate notations

Another, less common notation was introduced by Ronald L. Graham, Donald E. Knuth and Oren Patashnik in their book Concrete Mathematics. They define, for the rising sequential product:

$x^{\overline{n}}=\frac{(x+n-1)!}{(x-1)!}$

and for the falling sequential product:

$x^{\underline{n}}=\frac{x!}{(x-n)!}.$

Other notations for the falling sequential product include P(x, n), ^xP_n, P_x,n, or _xP_n. (See permutation and combination). An alternate notation for the rising sequential product x⁽ⁿ⁾ is the less common (x)⁺_n.

Another notation of the falling sequential product using a function is:

$[f(x)]^{k/-h}=f(x)\cdot f(x-h)\cdot f(x-2h)\cdots f(x-(k+1)h),$

where −h is the decrement and k is the number of terms. The rising sequential product is written:

$[f(x)]^{k/h}=f(x)\cdot f(x+h)\cdot f(x+2h)\cdots f(x+(k-1)h).$

[edit] Relation to umbral calculus

The falling sequential product occurs in a formula which represents polynomials using the forward difference operator Δ and which is formally similar to Taylor's theorem of calculus. In this formula and in many other places, the falling sequential product (x)_k in the calculus of finite differences plays the role of x^k in differential calculus. Note for instance the similarity of

$\Delta x^{\underline{k}} = k x^{\underline{k-1}},$

and

D x k = k x k - 1,

(where D denotes differentiation with respect to x). The study of similarities of this type is known as umbral calculus. The general theory covering such relations, including the Pochhammer polynomials, is given by the theory of polynomial sequences of binomial type and by Sheffer sequences.

[edit] Connection coefficients

Since the falling sequential products are a basis of the polynomial ring, we can re-express the product of two of them as a linear combination of falling sequential products:

$x^{\underline{m}} x^{\underline{n}} = \sum_{k=0}^{m} {m \choose k} {n \choose k} k!\, x^{\underline{m+n-k}}.$

The connection coefficients have a combinatorial interpretation as the number of ways to identify (or glue together) k elements from a set of size m and a set of size n.

[edit] See also

Pochhammer k-symbol

[edit] Note

Pochhammer actually used (x)_n to denote the binomial coefficient (Knuth 1992).

[edit] References

Knuth, Donald E. (1992), “Two notes on notation”, American Mathematical Monthly 99 (5): 403–422, doi:10.2307/2325085, arXiv:math/9205211 .
Olver, Peter J. (1999), Classical Invariant Theory, Cambridge University Press, ISBN 0521558212 .

See also ebooksgratis.com: no banners, no cookies, totally FREE.

Pochhammer symbol

From Wikipedia, the free encyclopedia

Contents

[edit] Properties

[edit] Alternate notations

[edit] Relation to umbral calculus

[edit] Connection coefficients

[edit] See also

[edit] Note

[edit] References

Views

Navigation

Interaction

Search

Languages