Ore_algebra, a Package for Skew Operators
Several algorithms for integration and summation have a natural description in terms of linear differential and difference operators, which in turn are well described by skew (or Ore) polynomials. This was the starting point for the Ore_algebra package.
Declaration of an Ore algebra
To work with an Ore algebra, we first have to declare it. The package creates a table that implements and remembers the operations in this algebra. Here is the example of the algebra of linear differential operators in the differential operator Dx with (rational) coefficients in x.
(This is the name of the table.)
Although the usual product in Maple is commutative, we use `*` to denote skew products, with the convention that powers of Dx are on the right.
Multiplication of operators is obtained by the function skew_product.
Remember that in skew algebras of linear operators, factorizations are seldom unique.
A First Application
(Univariate) Ore polynomial rings have a Euclidean algorithm. This is implemented in the following routines: skew_pdiv, skew_prem, skew_gcdex, and skew_elim. An extension to the multivariate case is available through Groebner bases computations (see Groebner and in particular Groebner[Basis] and Groebner[Reduce]).
Here we show how the package can be used to derive a proof of the Reed-Dawson identity:
for even n and 0 for odd n.
Let us introduce an algebra of linear recurrence operators in n and k. Sn and Sk denote the shift operators in n and k, respectively.
We compute first-order recurrences satisfied by the summand (which we denote by h).
We eliminate k between these operators by computing their greatest common right divisor.
The factor Sk−1 corresponds to taking a finite difference. Definite summation for k over all integers yields a telescoping series that collapses to 0. We therefore get:
Therefore, the sum Un satisfies
Now, the announced result follows from the initial conditions:
so that Un=0 for odd n.
so that V⁡p=U2⁢p is given by
which is binomial⁡2⁢p,p.
A More Advanced Application
Here we derive contiguity relations for the Gauss hypergeometric function. This function is known to Maple as:
It is ∑n=0∞un⁢zn for
When considering the summand, we introduce the following algebra:
The bivariate sequence u vanishes at both of the following operators:
(General algorithms exist to find such operators.)
From the previous first-order recurrences, we derive relations on f in the mixed differential difference algebra.
The equations are obtained by multiplication of the recurrences by zn, followed by summation over all non-negative n. Formally, this corresponds to changing Sn into 1z and n into z⁢Dz.
Therefore, we set
The linear differential operator Sa=z⁢Dza+1 is called a step-up operator. It relates the forward shift of f to derivatives of t by the following equation.
The elimination of Dz between this step-up operator and the differential equation yields a contiguity relation for f--a purely recurrence equation. It is obtained by the extended skew gcd algorithm:
In other words, the Gauss hypergeometric function satisfies the following equation:
More interestingly, the extended Euclidean algorithm yields a step-down operator for f - a relation between an inverse shift of f and its derivatives. This is obtained by computing an inverse of H modulo P.
From this result, we have GCD2⁢P+GCD3⁢numer⁡H=GCD1 and GCD4⁢P+GCD5⁢numer⁡H=0. In particular,
is the step-down operator:
An algorithm is also available to compute (one-sided) Groebner bases in Ore algebras. This is demonstrated in the presentation of the Groebner package.
Return to Index for Example Worksheets
Download Help Document