- Open Access
Difference-differential operators for basic adaptive discretizations and their central function systems
© Birk et al.; licensee Springer 2012
- Received: 31 December 2011
- Accepted: 25 July 2012
- Published: 4 September 2012
The concept of inherited orthogonality is motivated and an optimality statement for it is derived. Basic adaptive discretizations are introduced. Various properties of difference operators which are directly related to basic adaptive discretizations are looked at. A Lie-algebraic concept for obtaining basic adaptive discretizations is explored. Some of the underlying moment problems of basic difference equations are investigated in greater detail.
- Orthogonal Polynomial
- Continuous Solution
- Adjacent Node
- Hermite Polynomial
- Moment Problem
The wide area of ordinary differential equations and various types of ordinary difference equations is always closely connected to special function systems. Essential contributions have been added through the last century linking concepts of functional analysis to the world of differential equations and difference equations.
Difference equations are usually understood in the sense of equidistant differences. However, new and attractive discretizations, like adaptive discretizations come in. The intention of this article is to address specific problems which are related to so-called basic adaptive discretizations: Starting from conventional difference and differential equations, we move on to basic difference equations.
In Section 2, we motivate creating new types of orthogonal polynomials from a given orthogonal polynomial system. Ingredients like tripolynomial function classes, node integrals, and some properties of the classical Hermite polynomials are revised.
Section 3 addresses the concept of inherited orthogonality - transferring orthogonality from one generation of orthogonal polynomials to the next one. It contains an optimality statement for computing properties which links two different generations of functions.
In Section 4, the concept of basic adaptive discretization is presented and the underlying Lie-algebra structure of discrete Heisenberg algebras is given.
Having worked on special functions related to differential equations, we explore in some more detail the world of discrete functions being related to basic adaptive discretizations in Section 5. There, we look in greater detail at solutions of underlying moment problems.
Let us briefly mention some preceding work:
Reference  was an important starting point to initiate results of this present article. Reference  refers to the ladder operator formalism in discrete Schrödinger theory. A wide survey of results stemming from discrete Schrödinger theory is provided through . In discrete Schrödinger theory, basic special functions like q-hypergeometric functions resp. related orthogonal polynomials play a prominent role when solving the underlying Schrödinger difference equations. Central properties of these functions are outlined for instance in [4, 5]. The application of basic difference equations to formulating discrete diffusion processes has been addressed in [6, 7].
The main philosophy of this section shall be as follows:
Given a sequence of orthogonal polynomials, let us take one particular of its family members and call it father polynomial. We are interested in the calculation of the node integrals for this father polynomial.
Calculating the moments of the respective positivity parts of the father polynomial, one obtains all information on further systems of orthogonal polynomials which are based on the father polynomial.
We call them daughter polynomials. They oscillate between the nodes of the father polynomial. The higher the index of a daughter polynomial in the new class of orthogonal polynomials gets, the wilder is the daughter polynomial ‘dancing’: All its nodes are located between the nodes of the father polynomial, i.e., the higher the oscillations of a particular daughter polynomial get, the more nodes of the daughter polynomial can be found between the nodes of the original father polynomial.
In order to proceed into this direction, let us put some ingredients together.
Definition 2.1 Let be an orthogonal polynomial system where for the degree is given by j. By , we understand the set of all function systems which are collinear with the elements of F. Note that 0 shall be excluded from this set. We call the tripolynomial function class of the function system F.
Let be a polynomial of degree k with at least two zeros. The zeros of the polynomials shall be denoted by where , they are also called nodes.
We call two nodes of the polynomial adjacent if there exists no further node of p between these two nodes.
The nodes shall be arranged such that and are adjacent. Without loss of generality, such an arrangement is always possible in view of the given conditions.
node integrals of the polynomial p.
To see how the orthogonality and its oscillations are inherited from one generation to the next, we will combine the stated ingredients to formulate the corresponding analytic statements which will appear in Theorem 3.2. This theorem will contain an existence and optimality statement for predicting some properties of daughter polynomials: In the case of the Hermite polynomials, this can be done in an optimal way, i.e., there one can find an optimal way for calculating the node integrals from the original father polynomials. Let us briefly summarize some of their classical properties which will play an important role when deriving new results in the next section:
Lemma 2.2 (Properties of the classical Hermite polynomials)
The bracket notation at the different coefficients indicates that the coefficients depend indeed on a fixed chosen number and from in . Due to their importance, these coefficients deserve a special name which will be given by the following.
Definition 3.1 (Structure coefficients)
The coefficients stemming from the procedure specified in (14) through (16) are called structure coefficients of the polynomial .
The structure coefficients depend on the fixed value of the power on the left-hand side of (16) as well as on the fixed value of the power of the polynomial index of - moreover they depend additionally on the counting index k. The number k starts from the value 0 and runs from 1 through .
This identity is the starting point for a fascinating analytic path. One may ask the question of how to find an optimal algorithm linking the following three sequences of data:
the node integrals which can be obtained by direct integration:(18)
the values of all polynomials at two adjacent nodes of a special :(19)
the structure coefficients .
To get this procedure started, we assume j, k, m and n as suitably chosen indices.
This task can be approached on a more general level in the following theorem, leading even to an unexpected optimality statement.
Theorem 3.2 (New generations of orthogonality)
Each of the - without - changes its sign between and , i.e., is oscillatory between the integration boundaries and .
In the case of an orthogonal polynomial system, each of the polynomials contains information on a complete set of new orthogonal polynomials: Starting from , the orthogonality is inherited to the ().
In this context, we have the following Existence and Optimality Statement:
Moreover, the following Uniqueness Statement holds:
The Hermite polynomials are the only tripolynomial function class of analysis which shows an optimality property when calculating (22) using the data , while m is ranging in .
Proof (1) For a fixed value of the polynomial does not change its sign between two different adjacent nodes. The existence of nodes is guaranteed through the orthogonality properties of the whole polynomial sequence .
According to the orthogonality relations, (20) follows that the daughter polynomials must change their signs in the open interval . And according to general results on orthogonal polynomials , it follows moreover that the higher the index n gets the more oscillatory behaves.
Starting now from a tripolynomial function system with given orthogonality measure, each of its pairwise orthogonal polynomials inherits through the procedure outlined in (1) and (2) its orthogonality to the sequence .
In the case of the classical Hermite polynomials, one sees that thanks to their differential equation (5) and making use of the expansion (17), there is an optimal effort for calculating the node integrals of a particular Hermite polynomial from the evaluation of all other Hermite polynomials at the two fixed nodes of the particular polynomial.
The concept of optimality is closely tied to the differential equation (5): The fact that the derivative of a polynomial in a tripolynomial system is a multiple value of its predecessor is characteristic for the tripolynomial function class of Hermite polynomials - and only for them - as direct calculation shows. This yields the uniqueness statement. □
We have so far worked in this article on difference equations, namely orthogonal polynomial systems connecting members of a function family. They are solutions to a particular differential equation.
This is, for instance, one of the standard scenarios in conventional quantum mechanics where the Hermite functions, the Laguerre functions, and the Legendre functions play particular roles in different physical situations. The main spirit among these functions is always a continuous one. We now move to describing discretized function systems and to discovering the algebraic structures behind one special type of fancy discretization: the basic adaptive discretization.
Definition 4.1 (Basic adaptive discretization)
From these structures, it becomes apparent what the corresponding Lebesgue spaces are.
Remark 4.2 Let us concentrate on two different realizations of the Lebesgue integration measure , namely in the first case on a purely discrete measure and in the second case on a measure stemming from a set Ω with properties (23) having itself a positive Lebesgue measure, i.e., . This second case corresponds to piecewise-continuous realizations of the integration measure; we will refer to them also in the fifth chapter by the name basic layers.
in the piecewise-continuous basic layer case with .
In this sense, we speak of X as a formally symmetric operator.
Note that one can easily find the same adjointness relations (34) in the case of the integration measure (29) using similarly suitable domains for the three operators X, R, L.
Lemma 4.3 (Properties of some basic discretizers)
Deriving these properties, we have in detail made use of standard operator theoretical results on compactly defined linear operators with respect to star operations. □
Building all these structures from Lemma 4.3 and Remark 4.4 together, one obtains by elementary but tedious calculations the full structure of the underlying basic Heisenberg algebra which is going to reveal its beauty in the following Theorem 4.5. Note, in particular, that the Jacobi identity which is an essential ingredient to verifying the Lie-algebra structure can be addressed straight. This happens thanks to the associative behavior of the operators X, R, L in basic adaptive discretizations.
Theorem 4.5 (Lie-algebraic structures of basic Heisenberg relations)
with suitable nonnegative -coefficients and -coefficients. We want to investigate some specific moment problems related to it.
To do so, let us first have a look at the structures which will come in. Like in the previous section, we will always assume .
Definition 5.1 (Continuous structures in use)
provided the integral in (59) exists in all cases.
We are now going to formulate a technical result concerning solutions to (56) which will be a helpful tool to the investigations in the sequel.
Lemma 5.2 (Extension property for continuous solutions)
be given and let the function , as well as the function , be continuous and in particular in agreement with (56) resp. (60) where at most u or v exclusively is allowed to be the zero function in the sense of the Lebesgue integral.
Proof Rewriting (60) in the form of (56), one recognizes that the extension process from u together with v to f is standard. By conventional analytic arguments, the existence of all moments of f can be concluded. Hence, in particular, we have , where has to be specified since it does not come out of the extension process.
The choice of may in particular be arbitrary since this does not violate the property . By analytic standard arguments of integration, one may conclude that (62) and (63) are for all well defined. These observations practically conclude all steps while verifying the technical Lemma 5.2. □
Having shed some light on continuous solutions of the basic difference equation (60), let us now look at restrictions of the continuous solutions to special intervals. To do so, let us confine to subsets of the real axis for which the characteristic function is invariant under the shift operator R from (57) respectively its inverse. We have
Theorem 5.4 (Existence of basic layer solutions)
Here, we see that the specific structure of Ω does not influence the moment equality - what all moment equalities of type (76), however, have in common is the fact that Ω has a symmetry property specified by (67).
It is now clear what is the basic philosophy behind determining the moment functionals, so it becomes apparent how the proof in the more general situation of Theorem 5.4 works.
Remark 5.5 According to the assertions of Theorem 5.4 resp. Lemma 5.2, we see that the sequence of moment values is indeed a sequence of positive numbers. In particular, the nonautonomous difference equation (77) conserves this property.
A sufficient condition to ensure the nonnegativity of the numbers is provided by choosing the function f in Theorem 5.4 additionally as symmetric. If this condition is imposed, one can derive from all moments a sequence of orthogonal polynomials, being generated through the choice of f resp. Ω. Note, however, that this condition is not necessary.
There is another example for a sufficient condition: Choose the function f in Theorem 5.4 with the additional property , i.e. the function f is assumed as vanishing on the negative real axis. Under this condition, it can be guaranteed that all are positive.
Given now a positive symmetric continuous solution of (71), the question arises of how two moment sequences and may differ when . It may of course happen that already or resp. and . Therefore, the two sequences may develop in a different manner using the generation process through (77). The underlying orthogonal polynomials will also be different.
Let us now look briefly back on the special situation sketched out in proof of Theorem 5.4. Assume that , , , are four continuous positive solutions of (60) on . Having chosen Ω in a proper way, we learn from Eq. (77) that the sequence of all is in the considered case uniquely determined through the specification of the four values , , , .
Having solved this system of linear equations for determining α, β, γ, δ, one may check the positivity of the arising separately. Once this is verified, all other moments of are then determined through (77) and one can start constructing the underlying orthogonal polynomials.
This observation now directly motivates another aspect of the arising moment problems: Given two different symmetric positive continuous solutions and on two different basic layers and . Under which conditions will the two sequences and be the same? Or in other words: Under which conditions will be the related orthogonal polynomials the same? The following Corollary 5.6 of Theorem 5.4 sheds some more light to a systematic construction process for a rich variety of the demanded solutions:
Corollary 5.6 (Composing and combining basic layer solutions)
The necessary convergence checks arising from the imposed topological structures then have to be tackled separately.
So far, we have considered the situation of piecewise continuous solutions to (60). We would like to point out that the nonautonomous basic difference equation (60) has of course also purely discrete solutions which may stem from suitable projections on the continuous solutions that we have already considered. To do so, we put first together all discrete tools that we need:
Definition 5.7 (Discrete structures in use)
Note that we explicitly require the existence of these expressions for all by speaking of suitable functions f.
as direct inspection shows right away. Thus (89) provides a possible discrete analog of (67).
with suitable nonnegative -coefficients and -coefficients. Here, we assume that the value x is taken from the set (87). We thus look for discrete solutions of (60). The following Theorem 5.8 reveals a plenty of discrete solution structures. Some of the continuous scenarios will similarly appear.
Theorem 5.8 (Discrete solutions of the BDE)
- (1)Under these assertions, there exists to every pair of nonnegative real numbers with precisely one solution to (91) where the pair of positive numbers is assumed as fixed. The solution is fixed through the requirements(92)
Moreover, to each of these and all , there exists .
- (3)The action of all on both hand sides of (91) yields(93)
- (4)Let and be two sequences of positive numbers such that(95)
The existence of for all is according to the asymptotic behaviour of which is specified finally by using (56) - the argumentation follows standard results of converging sequences in analysis.
- (3)Let us address in particular the evaluation in more detail. To do so, let us concentrate on the right-hand side of the lattice, the proof for the situation on the left-hand side of the lattice being similar: We can show(98)
The result in (97) is a consequence of the linearity of all and the assertion of the pairwise disjointness in (95). Note in particular, that we have allowed in the assertions of Theorem 5.8 only finitely many superpositions of lattices in order to avoid more complicated convergence scenarios. □
Remark 5.9 Comparing the continuous scenario and the discrete scenario, we see that a continuous solution of (60) and a corresponding discrete solution of (91) may lead to the same momenta. This means they will in this case also lead to the same type of underlying orthogonal polynomials. In other words, these polynomials have piecewise continuous orthogonality measures on the one hand and purely discrete orthogonality measures on the other hand. According to the construction principles that we have outlined in the continuous and the discrete case, it even becomes clear that the underlying orthogonal polynomials may have orthogonality measures which are mixtures of a piecewise continuous and a purely discrete part. Let us summarize this amazing fact now in the following.
Corollary 5.10 (Mixture of continuous and discrete solutions)
Assume that we have chosen a, b, c, d such that for different integer i, j the sets and resp. and are pairwise disjoint.
Assume, moreover, that for two given positive numbers r, s the set constructed according to (87) is not contained in resp. .
We then can look for a solution fulfilling (60), being continuous on according to Theorem 5.4 and discrete on according to Theorem 5.8.
Special thanks are given to Harald Markum for arising the interest in relations between noncommutativity and discretization, in particular, in context of Lie algebras. His talk during the Easter Conference in Neustift/Novacella late March 2010 is appreciated in great detail. Discussions with him which followed during the Schladming Winter School 2011 have been of great scientific value. Moreover, special thanks are given to Michael Wilkinson for questions and encouraging words during the International Conference ‘Let’s Face Chaos Through Nonlinear Dynamics’ in Maribor in July 2011. Discussions with Sergei Suslov during a research period in Linz and Vienna in October 2011 are highly appreciated.
- Birk, L, Roßkopf, S, Ruffing, A: Die Magie der Hermite-Polynome und neue Phänomene der Integralberechnung. Pedagogical presentation GMM (2010)Google Scholar
- Berg C, Ruffing A: Generalized q -Hermite polynomials. Commun. Math. Phys. 2001, 223: 29–46. 10.1007/PL00005583MATHMathSciNetView ArticleGoogle Scholar
- Ruffing, A: Contributions to discrete Schrödinger theory. Habilitationsschrift, Fakultät für Mathematik, TU München (2006)Google Scholar
- Ey K, Ruffing A: The moment problem of discrete q -Hermite polynomials on different time scales. Dyn. Syst. Appl. 2004, 13: 409–418.MATHMathSciNetGoogle Scholar
- Ferreira JM, Pinelas S, Ruffing A: Nonautonomous oscillators and coefficient evaluation for orthogonal functions systems. J. Differ. Equ. Appl. 2009, 15(11–12):1117–1133. 10.1080/10236190902877764MATHMathSciNetView ArticleGoogle Scholar
- Marquardt T, Ruffing A: Modifying differential representations of Hermite functions and their impact on diffusion processes and martingales. Dyn. Syst. Appl. 2004, 13: 419–431.MATHMathSciNetGoogle Scholar
- Meiler M, Ruffing A: Constructing similarity solutions to discrete basic diffusion equations. Adv. Dyn. Syst. Appl. 2008, 3(1):41–51.MathSciNetGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.