![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
The regular representation of the radical of a differential ideal has various applications such as solving the membership problem, computing Taylor expansion of solutions, finding the Lie symmetries, and solving dynamical systems. Presently, there is no algorithm giving all regular representations for all possible values of the parameters for a polynomial differential ideal with parametric coefficients. In this article, we propose a new algorithm that computes all different regular representations with respect to all possible states of the parameters. Also, we present an efficient criterion to reduce some ineffectual computations. Implementing the algorithm in Maple and several examples reported in this article demonstrate the high efficiency of the algorithm.
PUBLIC INTEREST STATEMENT
Studying differential equations from an algebraic point of view is the main goal of the differential algebra. Computing regular representations for differential ideal generated by differential systems is an algebraic tool in this field that analyses the solutions of polynomial differential systems. In this article, we present a new algorithm that computes regular representations for parametric differential systems that has various applications such as biological modeling, dynamical systems, etc.
1. Introduction
Differential algebra was initially founded in the early 20th century to study a system of ordinary or partial differential equations, from a totally algebraic point of view. This mathematical approach was developed by Ritt (Citation1950) and Kolchin (Citation1973) who also prepared a computational algebraic tool for solving partial differential equation (PDE) systems. The well-known Rosenfeld-Gröbner algorithm is one of the most important algorithms in this regard, which indeed can be considered as the beginning point of the computational differential algebra. This algorithm analyses a polynomial differential system in a differential algebraic mode and gives a regular representation of the radical differential ideal generated by this system. The algorithm has various applications for instance in Geometry (Sabzevari, Hashemi, Alizadeh, & Merker, Citation2016), finding the Lie symmetries of differential equations (Hydon, Citation2000) and theory of differential equations (Mansfield & Clarkson, Citation1997). The Rosenfeld-Gröbner algorithm was first described by Boulier (Citation1994) and improved by Boulier, Lazard, Ollivier, and Petitot (Citation1995) thereafter. The input of this algorithm is a polynomial differential system in a differential ring with constant coefficients while its output is a representation of radical of the differential ideal, generated by the input system, as a finite intersection of radical differential ideals. The computed representation allows testing membership in the radical of the ideal generated by given system and also computing Taylor expansions of solutions of this system (Boulier, Lazard, Ollivier, & Petitot, Citation2009).
As mentioned before, the input of this algorithm is a differential system with constant coefficients. However, sometimes, it is necessary to determine such a representation for a parametric differential system; a differential system that its coefficients depend on some parameters. For instance this system can be used for biological modelling (Boulier, Citation2007), dynamical systems (Harrington & Van Gorder, Citation2017; Jauberthie, Trave-Massuyes, & Verdiere, Citation2016) and so on. In this regard, even if the coefficients field is extended by these parameters, the output of the Rosenfeld-Gröbner algorithm may not include all of the representations for all possible values of the parameters. For example, consider the following differential system in which its coefficients depend on the parameters and
.
To simplify, we use indices:
In the extended coefficient field by the parameters, with respect to the orderly ranking with considering and the graded lexical order
, the output of the Rosenfeld-Gröbner algorithm for the system
is empty. But, is this system really inconsistent for arbitrary values of the parameters? It can be easily shown that the answer is “no”. This system has the following representations for different values of the parameters
and
. When
and
we have:
and also when and
we have:
Presently, there is no context which introduces an algorithm giving all representations for all possible values of the parameters for a parametric system. Although, Boulier (Citation2018) explains how the Rosenfeld-Gröbner algorithm can manage different types of the parameters .This context was written from our demand and it was never published.
The main goal of this article is to obtain the distinct representations for all possible values of the parameters. According to this viewpoint, a case is a set of polynomial equalities and inequalities over the parameters accepting the same representation. Here, we present an algorithm with branching style that its root vertex corresponds to the inputted system. The inputted system is a differential system whose coefficients depend on some parameters. This algorithm branches some vertices according to possible values of the parameters and outputs the distinct representation depending on these values of parameters. Moreover, in this algorithm we apply a new criterion which can detect and delete a chain of the redundant computations.
The remainder of this article is organised as follows. We give an introduction to differential algebra in Section 2. In Section 3, we briefly describe the Rosenfeld-Gröbner algorithm. Section 4 describes the new algorithm to decompose a parametric differential system. Finally, some examples are presented in Section 5.
2. Differential algebra
In this section, we review some preliminaries concept of differential algebra. More details can be found in (Hubert, Citation2000; Kolchin, Citation1973; Ritt, Citation1950; Sit, Citation2002). In the following, we assume that is a field of characteristic zero.
Definition 2.1. A differential ring is a commutative ring associated with a finite set of derivations
, which commute with each other and satisfy the following equalities:
where and
. In a special case, if
, then
is called an ordinary differential ring and if
, then
is called a partial differential ring.
A differential ideal of
is an ideal which is also closed under the action of derivations; i.e.,
for each
.
We will use to denote the free multiplicative semi-group generated by the set
. It is easy to see that the elements of
, which are called derivative operators of
, are in the form of
, where each
belongs to
and the sum
is the order of
.
For each , the smallest subset of
containing
, which is also stable under the action of
is denoted by:
We denote by (
) the smallest algebraic (resp. differential) ideal of
containing
. If
is a subring of
, using
(resp.
), we denote the smallest algebraic (resp. differential) subring of
containing
and
that are generated by
on
. As a simple fact, we apply an algebraic approach on differential ideals and subrings due to
and
.
Now, we present the following definition which has an important role in the main concepts.
Definition 2.2. Consider a differential ideal and a set of differential polynomials
from
. The saturation ideal of
by
is defined as follows:
where denotes the smallest multiplicative family of
which contains
.
In the sequel, we will deal with a differential polynomial ring that is a differential ring generated by
on
, where
is a differential field that for each
in
and each constant
in
we have
. In this ring, each
(resp.
) is called an indeterminate (resp. a derivative).
In the next definition, we recall the concept of ranking that will be used to compare derivatives. In fact, rankings in a differential ring play a similar role of monomial orderings in polynomial rings.
Definition 2.3. Let be a differential polynomial ring. Each ranking over
is an ordering
over
such that for each derivation
and
:
, and
implies
.
Orderings are divided into two different types: Rankings for which implies that
, which are called orderly, and those for which
concludes
, which are called elimination rankings.
Now, we introduce some terms of differential polynomials. Let be a differential polynomial and
be a ranking over
. The leader
of
is the highest derivative appearing in
with respect to
. If
and
is the degree of
in
, then the initial
is defined to be the coefficient of
in
. The separant
of
is the polynomial
. The rank of
is the monomial
, which is denoted by
. The rank of a set of polynomials is similarly the set of ranks of the elements of the set. Let
and
be two non-empty subsets of
. Assume that,
and
for all
,
. The set
is said to be of lower rank than
, when either there exist some
such that
and
for
or
and rank
for
. Two sets of polynomials that none of them is of lower rank than the other one are called of the same rank.
For any subset of
, we denote the set of the initials (resp. separants) of the elements of
by
(resp.
). Let now
. Then,
denotes the set of all the power products of the initials and the separants of the elements of
.
Definition 2.4. Consider two differential polynomials and
in the differential ring
and let
be the rank of
. Polynomial
is called partially reduced with respect to
if no proper derivative of
appears in
. Also, if the degree of
in
is less than
we say that
is algebraically reduced with respect to
. A polynomial
is called reduced with respect to the polynomial
if
is partially and algebraically reduced with respect to
.
A set is said to be autoreduced if any element of
is reduced with respect to any other element of the set. Also if the elements of
are pairwise partially reduced and the leaders of them are pairwise different, we say that
is differentially triangular.
One of the important procedures in the context of differential algebra is the way of reducing a differential polynomial with respect to an autoreduced set. Let be a differential polynomial and
be an autoreduced set. By Ritt’s algorithm of reduction (see Kolchin Citation1973), there exists a differential polynomial
and non-negative integers
and
such that
where and
denote the initial and the separant of
respectively, and
is reduced with respect to
. If
is just partially reduced with respect to
, then we can write
For the simplicity in notations, we denote by
(resp.
), if
is reduced (resp. partially reduced) with respect to
.
Now, we explain the concept of polynomial of two differential polynomials, which plays a similar role to
polynomial in algebraic polynomials ring. Before that, we need to know the definition of
(Boulier et al., Citation2009). Also, we should state that for each derivative
and
of the same differential indeterminate
, the least common derivative is denoted by
, which equals to
.
Definition 2.5. A set of differential polynomials is said to be a critical pair if
and
are distinct and the leaders of them have common derivatives. If
is a set of differential polynomials then
denotes the set of all the pairs which can be formed between any two elements of
.
Definition 2.6. Let be a critical pair and denote
,
and
. The
polynomial
of
and
is defined as follows:
If is a subset of
, then the set of all
denotes the set of all possible
polynomials which can be formed between any two elements of
.
Here, we give the definition of solved pairs, which was defined earlier by Boulier et al. (Citation2009) for the first time.
Definition 2.7. A critical pair is said to be solved by a differential system of equations and inequations
and
if there exists a derivative
such that:
where and
.
One can apply the following criterion (lemma 6 in Boulier et al., Citation2009) to recognise the solved pairs:
Lemma 2.8. Let be a critical pair such that
. If
is reduced to zero by a set
and
is a set of inequations containing
; then, the critical pair
is solved by the system
and
.
Definition 2.9. Let be a differential polynomial ring and
be a ranking over
. A differential system of equations
and inequations
of
is said to be a regular differential system with respect to
if:
is differentially triangular
contains the separants of the elements of
and it is partially reduced with respect to
All critical pairs of
are solved by the system
and
(coherent property)
The differential ideal is called the regular differential ideal defined by the system. Moreover, the system is considered inconsistent if
equals to
, and consistent otherwise.
At the end of this section, let us mention some properties and a brief explanation of Gröbner bases for an algebraic ideal (see Becker & Weispfenning, Citation1991; Cox, Little, & O’Shea, Citation1992), which is applied in the next sections. Consider as a polynomial ring and
as a term ordering over
. Note that the reduction in the polynomial ring is algebraic and the remainder of the reduction is denoted by
.
If is a Gröbner basis with respect to
for ideal
then we have:
, which means that
is also a generator for the ideal
.
If
is also reduced, then it is unique with respect to the ordering
; in other words, for an ideal, there is just one reduced Gröbner basis with respect to certain ordering.
The ideal
is equal to
(the system
has no answer) if and only if
or the reduced Gröbner basis is equal with the set
.
Note that having the following lemma (Boulier et al., Citation2009), even if the set of variables is infinite, Gröbner bases can be computed of finitely generated ideals of . So, we can compute Gröbner bases of (non-differential) ideals in differential polynomial rings.
Lemma 2.10. Let be an ideal of a ring
and
be transcendental over
. If
denotes the canonical ring homomorphism
, then
.
Consider the system of equations and inequations
of
. To get a Gröbner basis
of
, we just need to run the following steps:
Introduce a new set
of unknowns and rewrite each inequation
as
.
Compute a Gröbner basis
of the ideal generated with the set
with respect to any ordering that eliminates the
’s.
Construct
by selecting the members of
that do not involve
for any
(
).
3. Rosenfeld-Gröbner algorithm
In this section, we describe the Rosenfeld-Gröbner algorithm (see Boulier et al., Citation2009 for more details). Let , the Rosenfeld-Gröbner algorithm decomposes the differential radical ideal
as a finite intersection of regular differential ideals
’s:
Each regular differential ideal is presented by two sets of differential polynomial equations
and differential polynomial inequations
such that
. If
is a Gröbner basis for the saturation ideal
, so
reduces to zero a differential polynomial
if and only if
belongs to
. Although, the ideal membership problem is algorithmically undecidable (Umirbaev, Citation2016), this algorithm permits to test the membership in
.
This decomposition is not uniquely determined in general, not only because there might be redundant components (some of them may be contained in another) but also it depends on many choices made during its construction, such as the choice of ranking. The following theorem (Boulier et al., Citation2009) shows that there is such a decomposition for each system of differential polynomials.
Theorem 3.1. If ,
is a differential system in a differential polynomial ring
, then it is possible to compute finitely many consistent regular differential systems
,
(
) such that:
This decomposition may contain components redundant w.r.t. . Operations needed in this regard are addition, multiplication, differentiation and equality test with zero in the base field of
.
A lemma of D. Lazard (Boulier et al., Citation1995) shows particularly that the regular ideals are radical. The following theorem is a differential analogue to Hilbert’s theorem of zeros (Kolchin, Citation1973).
Theorem 3.2. (Theorem of zeros) Let be a differential polynomial ring over a differential field of characteristic zero and
be a differential ideal of
. A differential polynomial
vanishes on every solution of
in any differential field extension of
, if and only if
.
Corollary 3.3. A differential polynomial vanishes on every solution of a system of polynomial differential equations and inequations
if and only if
.
Here, we give a brief exposition of the current version of the Rosenfeld-Gröbner algorithm, which is presented in (Boulier et al., Citation2009). The input of this algorithm is a differential system of equations and inequations with a ranking and the output is a set of differential regular ideals. Since a differential regular ideal is differentially triangular and coherent, the algorithm reduces each polynomial equation with respect to others and constructs possible -polynomials, which can be formed between each pair of polynomials modulo processed polynomials. Then, the initials and the separants of the new polynomials are added to the set of inequations. Finally, to observe any solution, the current system is splitted by the following lemma which is a corollary of the theorem of zeros:
Lemma 3.4. If
is a differential system and
is a differential polynomial then,
This process continues until all systems are regular. Eventually, by the following Rosenfeld’s lemma (Rosenfeld, Citation1959), the consistent regular systems are detected and generated.
Theorem 3.5. (Rosenfeld’s lemma) If ,
is a regular differential system of a differential polynomial ring
for a ranking
then, every differential polynomial in
that is partially reduced with respect to
, belongs to
.
By Rosenfeld’s lemma, if and only if
. It concludes that we can verify whether the regular differential system of equations
and inequations
is inconsistent, by verifying whether the reduced Gröbner basis of algebraic ideal
equals to
.
The complete sub-algorithm of this algorithm is based on two criteria which detect unnecessary pairs. These criteria are the analogues of the first and second Buchberger criteria (Buchberger, Citation1979) established in computing Gröbner bases for ideals.
Proposition 3.6. Let and
be two differential polynomials in the one differential indeterminate
such that
and
. If they are linear, homogeneous, with constant coefficients, and
, then
will be reduced to zero with respect to
.
Proposition 3.7. Let and
be a differential system and
be the triple of differential polynomials such that the separants of
’s belong to
and they satisfy in conditions C:
the leaders
have common derivatives and are pairwise different,
is a derivative of
and
one of the following conditions holds:
1. is not a derivative of
()
2 or
3. and
4. and
If the critical pairs and
are solved by
and
, then the critical pair
is also solved by this system.
Now, we present the general form of the algorithm. In each quadruple the sets
and
contain the equations already processed, the non processed equations, the inequations and the possible critical pairs of the processed equations that have to be solved.
Algorithm 3.1. The Rosenfeld-Gröbner algorithm
Input: The system and
and a ranking
.
Output: The regular systems and
s.th
.
Begin
Set
while do
Select and remove a quadruple from
if then
Partially reduce the elements of pairwise
if the rank of was not modified then
Partially reduce the elements of w.r.t
if the reduced Gröbner basis of is not
then
end if
end if
else
if then
Select and remove from
else
Select and remove a critical pair from
end if
if then
else
(
and
are the initial and the rank of q, respectively)
(
is the separant of
)
Complete
end if
end if
end do
Return
End
Algorithm 3.2. The Complete sub-algorithm
Input: A quadruple and a reduced polynomial
w.r.t
Output: The refinement of with regard to
based on two propositions 3.6 and 3.7.
Begin
Set
Obtain
as follows:
a critical pair is not kept in
only if:
and
satisfy in the hypotheses of the Proposition 3.6 or
there exists a critical pair
in
such that
the triple satisfies in the conditions C of the Proposition 3.7.
as follows:
a critical pair is not kept in
only if:
there exist a critical pair
in
such that the triple
satisfies in the conditions C of the Proposition 3.7 and
is different from both and
.
Return
End
4. The statement of the main results
In this section, we deal with a differential system in which the coefficients depend on some parameters. We define the parametric differential ring as . In this ring, the coefficients of the differential polynomials are in the ring
. Here, we present a parametric-Rosenfeld-Gröbner algorithm that its input is a system of equations and inequations in the parametric differential ring
. This algorithm outputs all distinct representations for all possible values of the parameters. These representations are recognised by the pair
which contains equations and inequations in
. To be comparable, this pair is presented as Quasi-canonical which is defined as follows (Montes, Citation2002):
Definition 4.1. The pair is said to be
-quasi-canonical if it satisfies:
is the reduced Gröbner basis in
where
is the quotient field of
, with respect to the ordering
.
The inequations in
are algebraically reduced modulo
and are irreducible over
, where
is some intermediate field between
and the algebraic closure
. They are normalised in a canonical form in order to be recognised when compared.
.
The polynomials in
are square-free.
If some polynomial in
factors, no factor of it belongs to
.
If is in
, then we say that this pair is inconsistent.
It is necessary to mention the terms zero and non-zero differential conditions of a polynomial are the initial, separant or the factors of
that can be considered zero and non-zero, respectively. Each of these conditions is in
, it is called a parametric condition. Also, the terms new zero and new non-zero conditions are those which have not been considered yet. The Parametric-Rosenfeld-Gröbner algorithm has a tree structure that its root vertex corresponds to the sextuplet
, where
and
is the inputted system. This vertex is branched by the sub-algorithm Make-Tree I regarding zero and non-zero parametric and differential conditions of the polynomials of
, which are obtained by the sub-algorithms Find-New-DiffCondition and Find-New-ParCondition, and some new vertices are created. Each vertex
corresponds to a sextuplet
, where
is the set of all processed polynomials,
is the union of the set of inequations
with the non-zero differential conditions of the polynomials of
,
is set of all critical pairs of
that should be solved by the system
and
,
contains all polynomials that are not processed already, and
and
are respectively the zero and non-zero parametric conditions and are presented as
-quasi-canonical. The branching process continues until at a vertex
either the sub-algorithms Parametric-Consistency and Differential-Consistency recognise that the system
and
is inconsistent (in this case, the vertex
is called an inconsistent vertex), or both sets
and
are empty (in this case, the system
and
is regular and the vertex
is called a terminal vertex). Finally, the consistent regular systems are detected using Rosenfeld’s lemma that was stated in the previous section and outputted. Each set of outputted regular systems that contains a given parametric conditions makes a regular representation corresponding to these parametric conditions. The general structure of the algorithm is as follows.
Algorithm 4.1. The Parametric-Rosenfeld-Gröbner algorithm
Input: A differential system in
, a ranking
and a total ordering
Output: All distinct representations of for all possible value of parameters
Begin
Set root vertex
Make-Tree I (It starts to the branching recursively.)
At each vertex ,
, is stored in the variables table.
if is a terminal vertex then
if the reduced Gröbner basis of does not equal to
then
return
end if
end if
End
We now present the general structure of the recursive sub-algorithm Make-Tree I. The input of this sub-algorithm is a vertex corresponding to the sextuplet
. This algorithm creates some new branches when the sub-algorithm Find-New-ParCondition finds any new zero or non-zero parametric conditions. If there is not any parametric condition, then the sub-algorithm Make-Tree II is called for branching the vertex. Make-Tree II branches a vertex according to differential conditions of given polynomial. When any new vertex is created by these algorithms, then the algorithm Make-Tree I is called again and some other new branches are created. This process continues until the created vertex
is a terminal or inconsistent vertex.
Algorithm 4.2. The Make-Tree I sub-algorithm
Input: A vertex corresponding to the sextuplet
.
Output: Some new vertices.
Begin
if is a inconsistent vertex or a terminal vertex then
STOP
else
if then
Select and remove a critical pair from
and
else
Select and remove a polynomial from
and
end if
if then Make-Tree I
else
Find-New-ParCondition (It contains the refinement of
,
and
with the new zero and non-zero parametric conditions)
if there is no new parametric condition then
Make-Tree II
else
for each zero parametric condition do
Set
the new vertex
Make-Tree I ()
end do
if the set of non-zero conditions is not empty then
Set the new vertex
Make-Tree II ().
end if
end if
end if
End
This algorithm creates some new vertices according to zero and non-zero conditions. The first step is processing the parametric conditions of the given polynomial. The zero conditions are added one by one to the set of zero parametric conditions . Then, all processed polynomials
that are not algebraically reduced with respect to the new zero condition are moved to the set of unprocessed polynomials
. In this way, the new vertices are created and the algorithm Make-Tree I is called again for branching them. If the non-zero conditions set is not empty, then another new vertex is created by adding these conditions to the set
and the sub-algorithm Make-Tree II is called to process the differential conditions of the polynomial and branch the vertex.
The inputs of Make-Tree II are a vertex and a polynomial . The general form of this algorithm is as follows:
Algorithm 4.3. The Make-Tree II sub-algorithm
Input: A vertex and a polynomial
.
Output: Some new vertices.
Begin
Find-New-DiffCondition (It contains two set of zero and non-zero conditions.)
if there is no new differential condition then
Make-Tree I(Update
else if the set of non-zero conditions is empty then
for each zero condition do
Set the new vertex :
Make-Tree I
end do
else
Make-Tree I(Update
Let be the set of zero conditions
for down to
do
Set the new vertex :
Make-Tree I
end do
end if
End
Generally, in Make-Tree II there are two possibilities to create a new vertex:
When the polynomial
has some zero conditions, these conditions are imposed on the polynomial
. The result is a new polynomial with the zero conditions that are added to the set of non-processed polynomials
and non-zero conditions that are added to the set of inequations
.
When the polynomial
does not have any zero condition, the non-zero conditions (if there is any) are added to the set of inequations
, the polynomial
is added to the set of processed polynomial
and former members of the set
, and the set
is updated. This process is performed in the sub-algorithm update, which will be described later.
The parametric and differential conditions of a polynomial are obtained by the sub-algorithms Find-New-ParCondition and Find-New-DiffCondition, respectively. In the following, we explain these algorithms. The inputs of Find-New-ParCondition are a polynomial with two sets of the zero parametric conditions
and the non-zero parametric conditions
. This algorithm checks the initial of the polynomial
according to old zero and non-zero conditions and returns new conditions, which can be considered zero and non-zero. Before presenting this algorithm, it should be noted that the set of irreducible polynomials that are factors of the polynomials of
is denoted by
, which is normalised in a canonical. Also, for each polynomial in
, the notation
denotes the product of the factors of
, which are in
.
Algorithm 4.4. The Find-New-ParCondition sub-algorithm
Input: A polynomial and two sets of zero and non-zero conditions
and
.
Output: The refinement of ,
and
and also, zero and non-zero conditions of
.
Begin
set
while do
if then
(
and
are the initial and the rank of
, respectively)
Gröbner basis for
w.r.t
else
end if
end do
) minus
if then
return (as the zero and non-zero condition)
else
return (just as the zero condition)
end if
End
This algorithm checks the parametric coefficient of the initial of the polynomial ,
. When
is zero, it begins omitting iteratively the leading term of
. In the following, the parametric coefficient
, which is in
, is added to
in order to improve
and the new Gröbner basis is recomputed. Then, W is also improved. When
is not decidable regarding the set of zero and non-zero conditions
and
, then p is algebraically reduced with respect to
. The algorithm now computes the set
containing the irreducible factors of
that are not in
and returns it. If this is empty, it means that
is not zero and p does not have any new parametric condition. Otherwise, if p is not in
, so the set cond is as zero and non-zero parametric conditions of
. Otherwise, the set cond is as just zero parametric conditions of
, because the inputted polynomial of this algorithm comes from the set of equations and cannot be non-zero.
Now, we present the sub-algorithm Find-New-DiffCondition that computes the zero and non-zero differential conditions of a polynomial. The inputs of this algorithm are a differential polynomial and the set of inequations
. This sub-algorithm verifies the polynomial
and its initial and separant and finds the new zero and non-zero conditions regarding the set of inequations
. The following proposition which works as an efficient criterion in this algorithm helps to remove some ineffectual conditions.
Proposition 4.2. Let be a differential polynomial with the non-zero initial
and the separant
. Let also S be a set of differential inequations. If there is a member
such that it is reduced to zero with respect to
, then
cannot be zero.
Proof. Suppose not. Since for some we have
(the initial and the separant of
are non-zero and the reduction by
is possible), then for some integers
we have
, suggesting that for a non-zero polynomial
and a derivative
,
. Beacuse p is assumed to be zero,
should be zero as well, which contradicts the assumption.
Algorithm 4.5. The Find-New-DiffCondition sub-algorithm
Input: A polynomial and the set of inequations
.
Output: The zero and non-zero conditions regarding .
Begin
set
if is a product of distinct factors
then
for to
do
if or for each
,
then
Add to
end if
end do
else
for do (
and
are the initial and the separant of
)
if or for each
,
then
Add to
and
end if
end do
end if
Return
End
In the Find-New-DiffCondition algorithm if the inputted polynomial p is a product of distinct non-constant factors, then each of these factors may be a zero condition. However, some of these factors that satisfy the hypothesis of Proposition 4.2 cannot be zero and they are removed from zero conditions. It should be noted that in this algorithm we use two obvious ways to find the factors of the inputted polynomial . When
is a product of some polynomials, we consider these polynomials as its factors. For example, let the inputted polynomial be
,y, such that
,
and
are three factors of
. Also, when the greatest common divisor (gcd) of all terms of
does not belong to
, we consider it as a factor of
. For example, if the inputted polynomial is
, so
is the gcd of the two terms of
, suggesting that
and
are two factors of
.
Otherwise, the initial and the separant of , provided not being in
, should be considered zero and non-zero. However, each of them that satisfies in the hypothesis of Proposition 4.2 will be removed from zero conditions. When a polynomial
satisfies in Proposition 4.2, it means that there is a polynomial
in the set of inequations
such that it forces the polynomial
not be zero. In fact, this proposition plays an important role in the Parametric-Rosenfeld-Gröbner algorithm. As mentioned, this proposition decreases the number of zero conditions leads to a decrease in the number of ineffectual branches that will be made in the sub-algorithm Make-Tree II.
Now, we explain the general structure of the sub-algorithm Update. The input of this algorithm is a vertex corresponding to the sextuplet
, a polynomial
and non-zero conditions. This algorithm adds the new non-zero conditions to the set of inequations
and the new polynomial q to the set of processed polynomials
. Then based on two analogues of Buchberger’s criteria, it starts to make possible critical pairs between
and the other members of
and adds them to the set of critical pairs
. In this way, a new vertex that corresponds to the sextuplet
is created.
Algorithm 4.6. The Update sub-algorithm
Input: A vertex , a polynomial
and its non-zero conditions.
Output: A new vertex .
Begin
Set
Obtain
as follows:
a critical pair is not kept in
only if:
and
satisfy in the hypotheses of the Proposition 3.6 or
there exist a critical pair
in
such that
the triple satisfies the conditions C of the Proposition 3.7.
as follows:
a critical pair is not kept in
only if:
there exist a critical pair
in
such that the triple
satisfies in the conditions C of the Proposition 3.7 and
is different from both and
.
Return
End
If a polynomial in the set
is not reduced with respect to the new polynomial
, then it exits from the set
for reprocessing. Now, if
is not reduced with respect to
, then the critical pair
is added to the set
to recognise more solved critical pairs by the analogues of the Buchberger criteria; otherwise, it is added to the set
. The rest of the algorithm is based on two propositions 3.6 and 3.7.
Remark 1. This sub-algorithm is similar to the Complete sub-algorithm. For further information about this sub-algorithm, see the part of the article (Boulier et al., Citation2009).
Finally, we present the sub-algorithms Parametric-Consistency and Differential-Consistency, which check the termination conditions in the Make-Tree I algorithm. Parametric-Consistency checks the sets of zero and non-zero parametric conditions and
of a vertex
and returns
if the pair
is inconsistent. Otherwise, it returns a
-quasi-canonical representation of the pair
according the definition 4.1.
Algorithm 4.7. The Parametric-Consistency sub-algorithm
Input: The sets of zero and non-zero conditions and an ordering
.
Output: , if the pair
is inconsistent and the
-quasi-canonical
representation of , otherwise.
Begin
Set
if then
return
else
While do
Drop any factor of a
that belongs to
as well as multiple factors.
if then
Gröbner basis for
w.r.t
end if
end do
return and
end if
End
For more details and the proof of correctness of this algorithm, the reader can refer to (Montes, Citation2002).
Now, we explain another sub-algorithm for checking the consistency of the vertices, which is called Differential-Consistency sub-algorithm. For each vertex corresponding to the sextuplet
, if the output of the Parametric-Consistency is not
, then this vertex will be refined by the
-quasi-canonical representation of
and
. After that, Differential-Consistency sub-algorithm checks the consistency of this vertex regarding the differential conditions. According to this algorithm, this vertex is inconsistent if either a non-zero element of
appears among the equations
or
appears among the inequations
, or the system
and
satisfies in the following proposition. As mentioned in subsection
of (Boulier et al., Citation2009), using this proposition is not very CPU expensive and can point out inconsistencies.
Otherwise, it refines the vertex by reducing the set of inequations with respect to the set of processed equations
.
Proposition 4.3. Let and
be a system of equations and inequations such that the initials and the separants of the members of
belong to
. If there is a polynomial
such that
is reduced to
with respect to
, then the system
and
is inconsistent.
Proof. Let and for some
we have
. Then, for some integers
and
we have
. Thus, for some non-zero polynomials
and derivatives
we can write:
Since for each ,
and the coefficient of
is non-zero,
should be zero and so the system
and
is inconsistent.
Algorithm 4.8 The Differential-Consistency sub-algorithm
Input: A vertex corresponding to a sextuplet
.
Output: , if the system
and
is inconsistent and the refinement of
, otherwise.
Begin
if then
Return
else
if then
Return
else
Return (Refinement of data)
end if
end if
End
Now, we prove the correctness of the Parametric-Rosenfeld-Gröbner algorithm, but before that we need the following lemma.
Lemma 4.4. If
is a differential system and
is a product of two differential polynomials then:
Proof. We begin by showing that . Let
be a differential polynomial in
. According to the theorem of zeros, it suffices to show that
vanishes on every solution of the systems of
and
. Now, let
be a solution of these systems, then it also will be a solution of the system
. Therefore,
vanishes on
and it will belong to
. Conversely, let
be in
and
be a solution of the system
. We only need to show that
vanishes on
. Since
vanishes on
, so
or
vanishes on
. If
is so, then
will be a solution of the system
and
vanishes on
(since
). Similarly, if
vanishes on
, then
is so. Therefore
belongs to
and the proof is completed.
Theorem 4.5. Consider the parametric system and
in the parametric differential ring
, the term ordering
and the ranking
. The Parametric-Rosenfeld-Gröbner algorithm decomposes the
with a tree structure that at each terminal vertex
the pair
of parametric conditions is
-quasi-canonical for some field
, the system
and
is regular, and the systems corresponding to terminal vertices
with the same parametric conditions satisfy in:
for these conditions.
Proof. According to Parametric-Consistency, the pair at each terminal vertex
is
-quasi-canonical. Now, we prove that the systems corresponding to terminal vertices are regular. At each terminal vertex
, two sets
and
are empty, which means that all possible critical pairs between the members of
are solved with the system
and
. Also, as
is the set of critical pairs that should be solved and each member of
is reduced with respect to others. So, the set
is autoreduced and coherent. Furthermore, according to the Update sub-algorithm, when a new polynomial is added to
, the initial and separant of this is added to
so
contains all initials and separants of the members of
and the system
and
is regular. Now, it is the time to show the regular ideals corresponding with terminal vertices with the same conditions of the pair
satisfy in intended intersection according to this condition. As already noted, the sub-algorithm Make-Tree I firstly branches the vertex
with respect to zero and non-zero parametric conditions of a polynomial
, which are computed by the Find-New-ParCondition sub-algorithm, and makes new vertices with different parametric conditions. If this polynomial does not have any parametric condition, the Make-Tree II begins to branch the vertex by differential conditions of the polynomial and the parametric conditions of these new vertices are equal. So, it is sufficient that we show when a vertex
is branched by differential conditions of a polynomial, the radical ideal
equals to the intersection of radicals of saturation ideals corresponding to the created vertices. If the polynomial
is as a product of some polynomials, then Find-New-DiffCondition returns some zero conditions and Make-Tree II makes some new vertices by adding these conditions to the set of equations. According to the previous lemma, the radical of the saturation ideal of the system corresponding to the vertex
is equal to the intersections of radicals of saturation ideals corresponding to new vertices. Otherwise, Find-New-DiffCondition returns some conditions that should be considered zero and non-zero. In addition, according to Lemma 4.4, the radical of the saturation ideal of the system corresponding to the vertex
is also equal to the intersections of radicals of saturation ideals corresponding to the new vertices. So, the radical of the corresponding saturation ideal with the root vertex for each parametric condition is as the intersections of radicals of saturation ideals corresponding to terminal vertices with the same parametric conditions. Finally, since this ideals are regular and regular ideals are radical (Lazard’s lemma, see Boulier et al., Citation1995), the claim of the theorem is proved.
5. Example
In this section, we present the output of the Parametric-Rosenfeld-Gröbner algorithm for several examples in the differential ring considering the orderly ranking as
and elimination ranking as
for the graded lexical order
. The implementation of this algorithm in Maple is available at the address http://faculty.du.ac.ir/rahmani/software. The output of this algorithm is in the form of a discussion about the distinct representations of given system as an intersection of regular ideals for different cases of values of parameters. As stated in section
of (Boulier, Citation2018), DifferentialAlgebra packege of Maple permits to define parameters and makes such decompositions.
First consider the parametric differential system , also known as Lorenz system (Harrington & Van Gorder, Citation2017), with the orderly ranking.
Table describes the discussion of decomposing of system for different values of the parameters
,
and
. As can be seen, when the parameter
is considered non-zero, we have the following representation for the radical of ideal
for each arbitrary values of
and
:
Table 1. Discussion of the system (Lorenz system)
It is notable that if we substitute in this representation, then the first ideal will be inconsistent, suggesting that it is essential that this parameter is not zero. According to this table for the case
we have another representation as follows:
This representation is also independent of the values of and
.
Now, consider the Genesio-Tesi system (Harrington & Van Gorder, Citation2017) that contains three ODE equations and the orderly ranking.
The output of the Parametric-Rosenfeld-Gröbner algorithm contains only one case meaning that for each value of the parameters ,
and
we have the same representation as follows:
For arbitrary values of ,
and
the ideal of this representation is regular and consistent, so this representation can be used for all cases of the values of the parameters.
Finally, we discuss the following PDE system with the elimination ranking. Although this system has no physical significance, it has more distinct representations.
Table presents the decomposing of this system. The table shows all distinct representations for all possible values of the parameters. It means that for not mentioned cases there is no regular representation for the radical of ideal . For instance, in the case
, the system
is inconsistent so the output of Parametric-Rosenfeld-Gröbner algorithm does not contain this case.
Table 2. Discussion of system
6. Conclusion
We presented a new algorithm with branching style that examines the values of the parameters of the parametric differential system and returns all distinct regular representations for all possible values of these parameters. The branches of this algorithm are made by differential or parametric conditions of equations. When a vertex is branched by parametric conditions only the information of this vertex is needed to follow the branches below it, and no other information about the upper or lateral vertices is needed. Accordingly, this algorithm can be implemented in parallel such that all distinct representations are made individually and simultaneously in a time-saving manner. We also applied a new criterion for reducing the ineffectual branches made by differential conditions that should be processed in this algorithm.
Additional information
Funding
Notes on contributors
Sajjad Rahmany
The first author of this article is Shahnaz Fakouri. She is a Ph.D. student of pure mathematics in the computational algebra tendency at Damghan University, Iran. This article is a result of her Ph.D. thesis.
Other authors are Dr. Sajjad Rahmany and Dr. Abdolali Basiri. They are associate Professors of Computer Algebra at the University of Damghan, Iran. They received the Ph.D degrees at University of Pris 6. Their research interests include Gröbner basis and solving polynomials systems. They published more than 30 papers in international journals such as Theoretical Computer Science, Soft Computing, Information Sciences, JIFS and conference proceedings.
References
- Becker, T., & Weispfenning, V. (1991). Gröbner bases: A computational approach to commutative algebra, graduate texts in mathematics (Vol. 141). New York, NY: Springer.
- [Boulier, F.(1994). Étude et Implantation de Quelques Algorithmes en Algébre Différentielle ( PhD thesis). Université Lille I, 59655, Villeneuve d’Ascq, France.
- Boulier, F. (2007). Differential elimination and biological modelling, radon series on computational and applied mathematics. Gröbner Bases in Symbolic Analysis, 111-139.
- Boulier, F. (2018). The management of parameters in the MAPLE differentialalgebra package. working paper or preprint (never published). Retreived from https://hal.archives-ouvertes.fr/hal-01825191.
- Boulier, F., Lazard, D., Ollivier, F., & Petitot, M. (1995). Representation for the radical of a finitely generated differential ideal. In ISSAC’95, International Symposium on Symbolic and Algebraic Computation (pp. 158–166). Retrieved from http://hal.archives-ouvertes.fr/hal-00138020
- Boulier, F., Lazard, D., Ollivier, F., & Petitot, M. (2009). Computing representations for radicals of finitely generated differential ideals. Applications Algebra Engrg Commission Computation, 20, 273–321.
- Buchberger, B. (1979). A criterion for detecting unnecessary reductions in the construction of Gröbner bases, In symbolic and algebraic computation, EUROSAM’79, Internat. Symposium Marseille Lecture Notes in Computer Science, Springer, Berlin, 72, 3–21.
- Cox, D., Little, J., & O’Shea, D. (1992). Ideals, varieties and algorithms. an introduction to computational algebraic geometry and commutative algebra, undergraduate texts in mathematics. New York, NY: Springer.
- Harrington, H. A., & Van Gorder, R. A. (2017). Reduction of dimension for nonlinear dynamical systems. Nonlinear Dynam, 88, 715–734. doi:10.1007/s11071-016-3272-5
- Hubert, E. (2000). Factorization free decomposition algorithms in differential algebra. Journal Symbolic Computation, 29(4–5), 641–662.
- Hydon, P. E. (2000). Symmetry methods for differential equations. Cambridge: Cambridge University Press.
- Jauberthie, C., Trave-Massuyes, L., & Verdiere, N. (2016). set-membership identifiaility of nonlinear models and related parameter estimation properties. International Journal Applications Mathematical Computation Sciences, 26, 2083–8492. doi:10.1515/amcs-2016-0057
- Kolchin, E. R. (1973). Differential algebra and algebraic groups. New York, NY: Academic Press.
- Mansfield, E. L., & Clarkson, P. A. (1997). Applications of the differential algebra package diffgrob2 to classical symmetries of differential equations. Journal Symbolic Computation, 23, 517–533. doi:10.1006/jsco.1996.0105
- Montes, A. (2002). A new algorithm for discussing Gröbner bases with parameters. Journal Symbolic Computation, 33, 183–208. doi:10.1006/jsco.2001.0504
- Ritt, J. F. (1950). Differential algebra. New York, NY: Dover.
- Rosenfeld, A. (1959). Specializations in differential algebra. Transactions Amer Mathematical Social, 90, 394–407. doi:10.1090/S0002-9947-1959-0107642-2
- Sabzevari, M., Hashemi, A., Alizadeh, B. M., & Merker, J. (2016). Lie algebras of infinitesimal CR automorphisms of weighted homogeneous and homogeneous CR-Generic submanifolds of CN. FiloMat, 30(6), 1387–1411.
- Sit, W. Y. (2002). The Ritt-Kolchin theory for differential polynomials. In L. Guo, W. F. Keigher, P. J. Cassidy, & W. Y. Sit (Eds.), Differential algebra and related topics (pp. 1–70). World Scientific Publishing Co. Inc. Retrieved from https://doi.org/10.1142/9789812778437_0001
- Umirbaev, U. (2016). Algorithmic problems for differential polynomial algebras. Journal Algebra, 455, 77–92. doi:10.1016/j.jalgebra.2016.02.010