Complexity of Janet basis of a D-module
Alexander Chistov, Dima Grigoriev

TL;DR
This paper establishes a double-exponential upper bound on the degree and complexity of Janet bases for D-modules, extending known bounds from polynomial modules to a more general non-commutative setting.
Contribution
It provides the first known double-exponential bound for Janet bases of D-modules, highlighting a significant complexity result in non-commutative algebra.
Findings
Double-exponential upper bound on degree and complexity
Generalization from polynomial modules to D-modules
Bound cannot be derived directly from commutative case
Abstract
We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a -module. This generalizes a well known bound on the complexity of a Gr\"obner basis of a module over the algebra of polynomials. We would like to emphasize that the obtained bound can not be immediately deduced from the commutative case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Advanced Numerical Analysis Techniques
Complexity of Janet basis of a -module
Alexander Chistov
Steklov Institute of Mathematics,
Fontanka 27, St. Petersburg 191023, Russia
Dima Grigoriev
CNRS, IRMAR, Université de Rennes
Beaulieu, 35042, Rennes, France
http://perso.univ-rennes1.fr/dmitry.grigoryev
Abstract
We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a -module. This generalizes a well known bound on the complexity of a Gröbner basis of a module over the algebra of polynomials. We would like to emphasize that the obtained bound can not be immediately deduced from the commutative case.
Introduction
Let be the Weyl algebra (or the algebra of differential operators ). Denote for brevity , . Any –module is called –module. It is well known that an –module which is a submodule of a free finitely generated -module has a Janet basis. Historically, it was first introduced in [9]. In more recent times of developing computer algebra Janet bases were studied in [5], [13], [10]. Janet bases generalize Gröbner bases which were widely elaborated in the algebra of polynomials (see e. g.[3]). For Gröbner bases a double-exponential complexity bound was obtained in [12], [6] relying on [1] and which was made more precise (with a self–contained proof) in [4].
Surprisingly, no complexity bound on Janet bases was established so far; in the present paper we fill this gap and prove a double-exponential complexity bound. On the other hand, a double-exponential complexity lower bound on Gröbner bases [12], [14] provides by the same token a bound on Janet bases.
There is a folklore opinion that the problem of constructing a Janet basis is easily reduced to the commutative case by considering the associated graded module, and, on the other hand, in the commutative case [6], [12], [4] the double–exponential upper bound is well known. But it turns out to be a fallacy! From a known system of generators of a -module one can not obtain immediately any system of generators (even not necessarily a Gröbner basis) of the associated graded module. The main problem here is to construct such a system of generators of the graded module. It may have the elements of degrees , see the notation below. Then, indeed, to the last system of generators of big degrees one can apply the result known in the commutative case and get the bound . So new ideas specific to non–commutative case are needed.
We are interested in the estimations for Janet bases of -submodules of . The Janet basis depends on the choice of the linear order on the monomials (we define them also for ). In this paper we consider the most general linear orders on the monomials from . They satisfy conditions (a) and (b) from Section 1 and are called admissible. We prove the following result.
THEOREM 1
For any admissible linear order on the monomials from any -submodule of generated by elements of degrees at most (with respect to the filtration in the corresponding algebra, see Section 1 and Section 9) has a Janet basis with the degrees and the number of its elements less than
[TABLE]
We prove in detail this theorem for the case of the Weyl algebra . The proof for the case of the algebra of differential operators is similar. It is sketched in Section 9. ¿From Theorem 1 we get that the Hilbert function , see Section 1, of the -submodule from this theorem is stable for and the absolute values of all coefficients of the Hilbert polynomial of are bounded from above by , cf. e.g., [12]. This fact follows directly from (10), Lemma 12 from Appendix 1, Lemma 2 and Theorem 2. We mention that in [7] the similar bound was shown on the leading coefficient of the Hilbert polynomial.
Now we outline the plan for the proof of Theorem 1. The main tool in the proof is a homogenized Weyl algebra (or respectively, a homogenized algebra of differential operators ). It is introduced in Section 3 (respectively, Section 9). The algebra (respectively ) is generated over the ground field by , (respectively over the field by ). Here is a new homogenizing variable. In the algebra (respectively ) relations (12) Section 3 (respectively (50) Section 9) hold for these generators in .
We define the homogenization of the module . It is a –submodule of . The main problem is to estimate the degrees of a system of generators of . These estimations are central in the paper. They are deduced from Theorem 2 Section 7. This theorem is devoted to the problem of solving systems of linear equations over the ring ; we discuss it below in more detail.
The system of generators of gives a system of generators of the graded –module corresponding to . But is a polynomial ring. Hence using Lemma 12 Appendix 1 we get a double–exponential bound on the stabilization of the Hilbert function of and the absolute values of the coefficients of the Hilbert polynomial of . Therefore, the similar bound holds for the stabilization of the Hilbert functions of and the coefficients of the Hilbert polynomial of , see Section 2.
But the Hilbert functions of the modules and coincide, see Section 3. Hence the last bound holds also for the stabilization of the Hilbert functions of and the coefficients of the Hilbert polynomial of . In Section 5 we introduce the linear order on the monomials from induced by the initial linear order on the monomials from (the homogenizing variable is the least possible in this ordering). Further, we define the Janet basis of with respect to the induced linear order on the monomials. Such a basis can be obtained by the homogenization of the elements of a Janet basis of with respect to the initial linear order, see Lemma 3.
Let be the monomial module (i.e., the module which has a system of generators consisting of monomials) generated by the greatest monomials of all the elements of the module , see Section 4. Let , see Section 4, be the module over the polynomial ring generated by all the monomials from (they are considered now as elements of ). Then the Hilbert functions of the modules and coincide. Thus, we have the same as above double–exponential estimation for the stabilization of the Hilbert functions of and the coefficients of the Hilbert polynomial of . Now using Lemma 13 we get the estimation on the monomial system of generators of , hence also of . This gives the bound for the degrees of the elements of the Janet bases of and hence also for the required Janet basis of , and proves Theorem 1.
The problem of solving systems of linear equations over the homogenized algebra is central in this paper, see Theorem 2. It is studied in Sections 5–7. A similar problem over the Weyl algebra (without a homogenization) was considered in [7]. The principal idea is to try to extend the well known method due to G.Hermann [8] which was elaborated for the algebra of polynomials, to the homogenized Weyl algebra. There are two principal difficulties on this way. The first one is that in the method of G.Hermann the use of determinants is essential which one has to avoid dealing with non-commutative algebras. The second is that one needs a kind of the Noether normalization theorem in the situation under consideration. So it is necessary to choose the leading elements in the analog of the G.Hermann method with the least , where is a homogenizing variable, see Section 3.
The obtained bound on the degree of a Janet basis implies a similar bound on the complexity of its constructing. Indeed, by Corollary 1 (it is formulated for the case of Weyl algebra but the analogous corollary holds for the case of algebra of differential operators) one can compute the linear space of all the elements of degrees bounded from above by . Further, by Theorem 1 the module , see Section 1, is generated by all the elements with of degrees bounded from above by . Hence one can compute a system of generators of and a Janet basis of solving linear systems over of size bounded from above (just by the enumeration of all monomials of degrees at most which are possible generators of ). If one needs to construct the reduced Janet basis it is sufficient to apply additionally Remark 1 Section 4.
For the sake of self–containedness in Appendix 1, see Lemma 12, we give a short proof of the double–exponential estimation for stabilization of the Hilbert function of a graded module over a homogeneous polynomial ring. A conversion of Lemma 12 also holds, see Appendix 1 Lemma 13. It is essential for us. The proof of Lemma 13 uses the classic description of the Hilbert function of a homogeneous ideal in via Macaulay constants and the constant introduced in [4]. In Appendix 2 we give an independent and instructive proof of Proposition 1 which is similar to Lemma 13. In some sence Proposition 1 is even more strong than Lemma 13 since to apply it one does not need a bound for the stabilization of the Hilbert function. Of course, the reference to Proposition 1 can be used in place of Lemma 13 in our paper.
1 Definition of the Janet basis
Let , , be a Weyl algebra over a field of zero–characteristic. So is defined by the following relations
[TABLE]
By (1) any element can be uniquely represented in the form
[TABLE]
where all and only a finite number of are nonzero. Denote for brevity to the set of all nonnegative integers and
[TABLE]
So are multiindices. By definition the degree of
[TABLE]
Let be a left -module given by its generators , , and relations
[TABLE]
where and all . We assume that for all . By (4) we have the exact sequence
[TABLE]
of left -modules. Denote . If then is a left ideal of and . In the general case is generated by the elements
[TABLE]
For an integer put
[TABLE]
So now , , are filtered modules with filtrations , , , , respectively and the sequence of homomorphisms of vector spaces
[TABLE]
induced by (5) is exact for every . The Hilbert function of the module is defined by the equality
[TABLE]
Each element of can be uniquely represented as an -linear combination of elements , herewith are multiindices, see (3), and the nonzero monomial is at the position , . So every element can be represented in the form
[TABLE]
The elements will be called monomials.
Consider a linear order on the set of all the monomials or which is the same on the set of triples , , . If put
[TABLE]
see (7). Set
[TABLE]
for every . Let us define the leading monomial of the element by the formula
[TABLE]
where . Put . Hence if . For if we shall write . We shall require additionally that
- (a)
for all multiindices for all if and then . 2. (b)
for all multiindices for all if then .
Conditions (a) and (b) imply that for all for every nonzero if then , i.e., the considered linear order is compatible with the products. Any linear order on monomials satisfying (a) and (b) will be called admissible.
Set
[TABLE]
So is an ideal of . By definition the family of elements of is a Janet basis of the module if and only if
, i.e., the submodule of generated by coincides with .
Further, the Janet basis of is reduced if and only if the following conditions hold.
does not contain a smaller Janet basis of , 2. 3)
. 3. 4)
the coefficient from of every monomial , , is . 4. 5)
Let be representation (2) for , . Then for all for all and multiindices the monomial .
Since the ring is Noetherian for considered there exists a Janet basis. Further the reduced Janet basis of is uniquely defined.
2 The graded
module corresponding to a –module
Put for and
[TABLE]
The structure of the algebra on induces the structure of a graded algebra on . So we have is an algebra of polynomials with respect to the variables , . Further, and are graded -modules. From (6) we get the exact sequences
[TABLE]
The Hilbert function of the module is defined as follows
[TABLE]
Obviously
[TABLE]
for every .
Denote for an arbitrary by the image of in .
LEMMA 1
Assume that is a system of generators of . Let , . Suppose that for every
[TABLE]
Then is a system of generators of the -module .
PROOF This is straightforward.
So it is sufficient to construct a system of generators of satisfying (11).
3 Homogenization of the Weyl algebra
Let be a new variable. Consider the algebra given by the relations
[TABLE]
The algebra is Noetherian similarly to the Weyl algebra . By (12) an element can be uniquely represented in the form
[TABLE]
where all and only a finite number of are nonzero. Let be multiindices, see (3). Denote for brevity
[TABLE]
By definition the degrees of
[TABLE]
Set . If then put
[TABLE]
For every put
[TABLE]
Similarly one defines and for an arbitrary –matrix with coefficients from . More precisely, one consider here as a vector with entries.
The element is homogeneous if and only if implies , i.e., if and only if is a sum of monomials of the same degree . The homogeneous degree of a nonzero homogeneous element is its degree. The homogeneous degree of [math] is not defined ([math] belongs to all the homogeneous components of , see below).
The -th homogeneous component of is the -linear space
[TABLE]
for every integer . Now is a graded ring with respect to the homogeneous degree. By definition the ring is a homogenization of the Weyl algebra .
We shall consider the category of finitely generated graded modules over the ring . Such a module is a direct sum of its homogeneous components , where . are integers. Every is a finite dimensional -linear space and for all integers . If and are two finitely generated graded -modules then is a morphism (of degree [math]) of the graded modules if and only if is a morphism of -modules and for every integer .
The element (respectively ) is called to be the term if and only if for some , integer and (respectively ), .
Let be an arbitrary element of the Weyl algebra represented as a sum of terms and . One can take here, for example, representation (3) for . Then we define the homogenization by the formula
[TABLE]
By (1), (12) the right part of the last equality does not depend on the chosen representation of as a sum of terms. Hence is defined correctly. If then is obtained by substituting in . Hence for every we have , and for every the element , where .
For an element put and
[TABLE]
Similarly one defines and the homogenization for an arbitrary –matrix with coefficients from . More precisely, one consider here as a vector with entries. Hence if then for all .
The -th homogeneous component of is
[TABLE]
For an -linear subspace put to be the least linear subspace of containing the set . If is a (finitely generated) -submodule of then is a (finitely generated) graded submodule of . The graduation on is induced by the one of .
For an element put . For a subset put . If is a -linear space then is also a -linear space. If is a finitely generated graded submodule of then is finitely generated submodule of .
Now is a graded submodule of . Further, . Let be the -th homogeneous component of . Then
[TABLE]
and (17) induces the isomorphism . Set . Hence is a graded -module and we have the exact sequence
[TABLE]
The -th homogeneous component of
[TABLE]
by the isomorphism . We have the exact sequences
[TABLE]
By definition the Hilbert function of the module is
[TABLE]
By (19) we have for every , i.e., the Hilbert functions of and coincide.
LEMMA 2
Let be a system of homogeneous generators of the -module . Then
[TABLE]
is a system of generators of -module .
PROOF By (17) . Now the required assertion follows from Lemma 1. The lemma is proved.
4 The Janet bases of a module and of
its homogenization
Each element of can be uniquely represented as an -linear combination of elements , herewith , are multiindices, see (3), and the nonzero monomial is at the position , . So every element can be represented in the form
[TABLE]
and only a finite number of are nonzero. The elements will be called monomials.
Let us replace everywhere in Section 1 after the definition of the Hilbert function the ring , the monomials , the multiindices , , , triples , , the module and so on by the ring , monomials , the pairs , , (they are used without parentheses), quadruples , , the homogenization and so on respectively. Thus, we get the definitions of , for , new conditions (a) and (b) which define admissible linear order on the monomials of , new conditions 1)–5), the definitions of the Janet basis and reduced Janet basis of . For example, the new conditions (a) and (b) are
- (a)
for all indices , all multiindices for all if , and then . 2. (b)
for all indices , all multiindices for all if then .
The Janet basis of is homogeneous if and only if it consists of homogeneous elements from .
Let be an admissible linear order on the monomials from , or which is the same, on the triples , see Section 1. So satisfies conditions (a) and (b). Let us define the linear order on the monomials or, which is the same, on the quadruples . This linear order is induced by on the triples and will be denoted again by . Namely, for two quadruples and put if and only if , or but . Notice that this induced linear order satisfies conditions (a) and (b) (in the new sense).
REMARK 1
If is a Janet basis of (respectively homogeneous Janet basis of ) satisfying 1)–4) then there are the unique (respectively ), , such that
[TABLE]
is a reduced Janet basis of (respectively reduced homogeneous Janet basis of ), cf. [3].
LEMMA 3
Let be a (reduced) Janet basis of with respect to the linear order . Then is a (reduced) homogeneous Janet basis of the module with respect to the induced linear order . Conversely, let be a (reduced) homogeneous Janet basis of the module with respect to the induced linear order . Then is a (reduced) Janet basis of with respect to the linear order .
PROOF This follows immediately from the definitions.
Let and the module be as above. Then there is the unique element such that
[TABLE]
and if then . The element is called the normal form of with respect to the module . We shall denote . Obviously is a linear subspace.
Let be the polynomial ring in the variables . Each monomial can be considered also as an element of . Denote by the graded submodule of generated by all the monomials such that there is with . The Hilbert functions
[TABLE]
Let us replace in the definition of the normal form above by respectively. Thus, for we get the definition of the normal form , cf. [4]. Obviously, is a linear subspace. Since the ideals and are generated by the same monomials we have . Hence the Hilbert functions
[TABLE]
coincide. Therefore, see Section 3,
[TABLE]
5 Bound on the kernel of a matrix
over the homogenized Weyl algebra
LEMMA 4
Let and be integers. Let be a matrix where are homogeneous elements for all . Let , , for all . Assume that there are integers , , and , , such that
[TABLE]
for all nonzero , and additionally (hence , for all ), . Then there are homogeneous elements such that ,
[TABLE]
all nonzero have the same degree depending only on and
[TABLE]
Besides that, if all do not depend on (i.e., they can be represented as sums of monomials which do not contain ) then one can choose also satisfying additionally the same property. Finally, dividing by an appropriate power of one can assume without loss of generality that .
PROOF We shall assume without loss of generality that . At first suppose that that for all nonzero . Consider the linear mapping
[TABLE]
If
[TABLE]
then the kernel of (26) is nonzero. But (27) holds if
[TABLE]
Further, (28) is true if . The last inequality follows from . Hence also from . Notice that . Thus, the existence of is proved, and even more all nonzero have the same degree which does not depend on . Notice that in the considered case we prove a more strong inequality for all .
Suppose that do not depend on . We represent , , where all do not on . Let . Obviously in this case one can replace by .
Let us return to general case of arbitrary . We shall reduce it to the considered one. Namely, multiplying the -th equation of system (24) to we shall suppose without loss of generality that all are equal. Let us substitute for in (24). Now the degrees of all the nonzero coefficients of the obtained system coincide. Thus, we get the required reduction and estimation (25). The lemma is proved.
REMARK 2
Lemma 4 remains true if one replaces in its statement condition (24) by
[TABLE]
The proof is similar.
REMARK 3
Let the elements be from Lemma 4. Notice that there are integers , , and , , such that
[TABLE]
for all nonzero , and . Namely, , .
6 Transforming a matrix with coefficients from to the
trapezoidal form
Let be the matrix from Lemma 4 but now are arbitrary. Hence (23) holds. Let where be the columns of the matrix (notice that in Lemma 1 and Lemma 2 are rows of size ; so now we change the notation). By definition are linearly independent over from the right (or just linearly independent if it will not lead to an ambiguity) if and only if for all the equality implies . By (23) in this definition one can consider only homogeneous . For an arbitrary family from Lemma 4 (with arbitrary ) one can choose a maximal linearly independent from the right subfamily of . It turns out that does not depend on the choice of a subfamily. More precisely, we have the following lemma.
LEMMA 5
Let , , where are homogeneous elements. Suppose that there are integers , , such that for all the degree . Assume that , , are linearly independent over from the right. Then , and if there are such that , , are linearly independent over from the right.
PROOF The proof is similar to the case of vector spaces over a field and we leave it to the reader.
We denote and call it the rank from the right of . In the similar way one can define rank from the left of . Denote it by . It is not difficult to construct examples when . The aim of this section is to prove the following result.
LEMMA 6
Let be the matrix with homogeneous coefficient from satisfying (23), see above. Suppose that for all . Assume that . Let and be linearly independent. Hence . Then there is a matrix with homogeneous entries and a square permutation matrix of size satisfying the following properties.
- (i)
All the nonzero elements for have the same degree depending only on and
[TABLE] 2. (ii)
Set the matrix . Then the matrix
[TABLE]
where is a diagonal matrix with columns and each , , is nonzero. 3. (iii)
* for all , .*
Besides that, if all (and hence all ) do not depend on (i.e., they can be represented as sums of monomials which do not contain ) then one can choose also satisfying additionally the same property. Finally, dividing by an appropriate power of one can assume without loss of generality that for every .
PROOF At first we shall show how to construct and such that (ii) and (iii) hold. We shall use a kind of Gauss elimination and Lemma 4. Namely, we transform the matrix . At the beginning we put
[TABLE]
We shall perform some -linear transformations of columns and permutations of rows of the matrix and replace each time by the obtained matrix. These transformation do not change the rank from the right of the family of columns of . At the end we get a matrix satisfying the required properties (ii), (iii).
We have . If , i.e, is an empty matrix, then this is the end of the construction: is an empty matrix. Suppose that . Let us choose indices , such that . Permuting rows and columns of we shall assume without loss of generality that .
By Lemma 4 we get elements of degrees at most such that , , and for every . Set , and to be the diagonal matrix. Put
[TABLE]
to be the square matrix with rows. We replace by . Now
[TABLE]
where has columns and
[TABLE]
(for the new matrix ).
Let us apply recursively the described construction to the matrix in place of . So using only linear transformations of columns with indices and permutation of rows with indices we transform to the form
[TABLE]
where is a permutation matrix and is a square matrix with rows (it transforms ), the matrix is a diagonal matrix with columns, and all the elements are nonzero. We shall assume without loss of generality that is the identity matrix. We replace by . Conditions (ii) and (iii) hold for the obtained and, more than that, by (iii) applied recursively for (in place of ), and (31) the same equalities are satisfied for the new obtained matrix .
Let where denotes transposition. By Lemma 4 there are nonzero elements of degrees at most
[TABLE]
such that and for all . Let and be the identity matrix of size . Put
[TABLE]
Let us replace by . Put , where the matrix has columns. Recall that without loss of generality is the identity permutation. We have . These Gauss elimination transformations of do not change the rank from the right of the family of columns of . It can be easily proved using the recursion on , cf. Lemma 8 below. Now the matrix satisfies required conditions (ii), (iii) and .
Let us change the notation. Denote the obtained matrix by . Let where is the -th column of . Our aim now is to prove the existence of the matrix satisfying (i)–(iii). By Lemma 4 for every there are homogeneous elements , , such that ,
[TABLE]
and estimations for degrees (30) hold. Put the matrix . Let where is the -th column of . Hence .
LEMMA 7
For every we have
[TABLE]
Further, for every there are nonzero homogeneous elements such that .
PROOF Consider the matrix with rows and columns. By Lemma 4 there are homogeneous elements (they depend on ) such that and the following property holds. Denote , . Then
[TABLE]
(we don’t need at present any estimation on degrees from Lemma 4; only the existence of ). Denote by the submatrix consisting of the first rows of the matrix . Multiplying (35) to from the left we get
[TABLE]
But is a diagonal matrix with nonzero elements on the diagonal, see (ii) (for in place of ). Hence by (33) and (36) for every . Now implies and . Therefore, (34) holds. Put and . We have by (36). The lemma is proved.
Let us return to the proof of Lemma 6. Now (i)–(iii) are satisfied by Lemma 7. The last assertions of Lemma 6 are proved similarly to the ones of Lemma 4. Lemma 6 is proved.
7 An algorithm for solving linear systems with
coefficients from .
Let . Let all nonzero be homogeneous elements of the degree for an integer . Suppose that for an integer . Let be the matrix with rows and columns from the statement of Lemma 6 (but now and are arbitrary). So for all . Let be unknowns. Consider the linear system
[TABLE]
or, which is the same,
[TABLE]
Denote
[TABLE]
The similar notations will be used for other vectors and matrices. In this section we shall describe an algorithm for solving linear systems over and prove the following theorem.
THEOREM 2
Suppose that system (37) has a solution over . One can represent the set of all solutions of (37) over in the form
[TABLE]
where is a -submodule of all the solutions of the homogeneous system corresponding to (37) (i.e., system (37) with all ) and is a particular solution of (37). Moreover, the following assertions hold.
- (A)
One can choose such that , where is an integer bounded from above by (and depends only on and ). The degree is bounded from above by . 2. (B)
There exists a system of generators of of degrees bounded from above by . The number of elements of this system of generators is bounded from above by .
Besides that, if all and do not depend on (i.e., they can be represented as sums of monomials which do not contain ) then and all the generators of the module also satisfy this property.
PROOF Let . Permuting equations of (37) we shall assume without loss of generality that are linearly independent from the right over . Let be the matrices from Lemma 6. Similarly to the proof of Lemma 6 we shall assume without loss of generality that . Denote by the submatrix of consisting of the first columns of , i.e., . By Lemma 4 there are nonzero elements of degrees at most (32) such that and for all . Set to be the diagonal matrix. Let . Then by Lemma 6 (iii) . Let . Then is a matrix with coefficients from and
[TABLE]
where is a diagonal matrix with homogeneous coefficients from and all the elements on the diagonal are nonzero and equal, i.e., for every . Besides that, . Further, . We have , since, otherwise, system (37) does not have a solution. Obviously . Denote . Hence . Consider the linear system
[TABLE]
LEMMA 8
Suppose that system (37) has a solution over . Then linear system (39) is equivalent to (37), i.e., the sets of solutions of systems (39) and (37) over coincide.
PROOF The system is equivalent to (37) by Lemma 5. System (39) is equivalent to since the ring does not have zero–divisors. The lemma is proved.
REMARK 4
Since and by Lemma 6 for every there are homogeneous such that and and all , are bounded from above by . Put , . Then system (37) has a solution if and only if system (39) has a solution and for all . This follows from Lemma 8 and Lemma 5. But in what follows for our aims it is sufficient to use only Lemma 8.
REMARK 5
Assume that for all , i.e., the elements of the matrix do not depend on . Then by Lemma 4 and the described construction all the elements of the matrices also do not depend on .
By Lemma 4 and Remark 2 for every there are homogeneous elements , , such that
[TABLE]
all the degrees , , , are bounded from above by
[TABLE]
and . Hence for every since .
Denote . So is a nonzero homogeneous element and . Set . We need an analog of the Noether normalization theorem from commutative algebra, cf. also Lemma 3.1 [7].
LEMMA 9
There is a linear automorphism of the algebra
[TABLE]
such that all , . If then one can choose additionally , all for and for .
PROOF Recall that . Hence at first it is not difficult to construct a linear automorphism such that ,
[TABLE]
and contains a monomial with and , i.e., . After that one can find an automorphism such that ,
[TABLE]
and contains a monomial with a coefficient . Put . We leave to prove the last assertion to the reader. The lemma is proved.
We apply the automorphism . In what follows to simplify the notation we shall suppose without loss of generality that . So contains a monomial with a coefficient , where . It follows from here that
[TABLE]
Let be a solution of (39). Then (42) implies that one can uniquely represent
[TABLE]
where , the degrees for all , . Again by (42) one can uniquely represent
[TABLE]
where , the degrees for all , . Finally, by (42) for all , , , one can uniquely represent
[TABLE]
where , the degrees for all considered . Put
[TABLE]
Therefore,
[TABLE]
Let us introduce new unknowns , . By (43)–(45) system (37) is reduced to the linear system
[TABLE]
More precisely, any solution of system (37) is given by (43), (44) where are arbitrary and is a solution of system (45) over (we underline that here this solution may depend on although one can restrict oneself by solutions which do not depend on ). Note that all and are homogeneous elements of and there are integers , , , , such that and for all , . This follows immediately from the described construction.
Now all the coefficients of system (46) do not depend on . As we have proved if the coefficients of (37) do not depend on then the coefficients of (46) also do not depend on , and hence in the last case they do not depend on .
If the coefficients of (46) depend on we perform an automorphism , , , . Now the coefficients of system (46) do not depend on (but depend on ). After that we apply our construction recursively to system (46).
The final step of the recursion is (although in the statement of theorem , see Section 1; we are interested only in Weyl algebras). In this case . Hence using (44) for we get the required and for .
Thus, by the recursive assumption we get a particular solution , , of system (46), an integer (in place of from assertion (A)) such that
[TABLE]
and a system of generators
[TABLE]
of the module of solutions of the homogeneous system corresponding to (46). Notice that if the coefficients of (37) do not depend on then is a module over the homogenization of the Weyl algebra of . But obviously in the last case (48) gives also a system of generators of the -module of solutions of the homogeneous system corresponding to (46). Put
[TABLE]
Then is a particular solution of (37). Put
[TABLE]
Then . Hence , , is a system of generators of the module . By (47) and the definitions of , and we have . Put .
LEMMA 10
All the degrees , , , and , see above, are bounded from above by , the degrees are bounded from above , the degrees , are bounded from above by . Further, all , are bounded from below by . Finally, in system (46) the number of equations is bounded from above by and the number of unknowns is bounded from above by .
PROOF This follows immediately from the described construction.
Let us return to the proof of Theorem 2. Applying Lemma 10 and recursively assertions (A) and (B) for the formulas giving and we get (A) and (B) from the theorem. The last assertion (related to the case when all and do not depend on ) has been already proved. The theorem is proved.
8 Proof of Theorem 1 for Weyl algebra
Let be the matrix from Section 1. We shall suppose without loss of generality that the vectors , , are linearly independent over the field . We have . This implies .
Put the matrix . Let us define the graded submodules of
[TABLE]
We have the exact sequence of graded -modules
[TABLE]
Further, for every and . Since is Noetherian there is such that . So to construct a system of generators of it is sufficient to compute the least such that and to find a system of generators of .
LEMMA 11
* for some bounded from above by . There is a system of generators of the module such that and all the degrees , , are bounded from above by .*
PROOF Let us show that the module for . Let . Consider system (37). By assertion (A) of Theorem 2 there is a particular solution of (37) such that . Hence . The required assertion is proved. Hence .
Let us replace in (37) by , where are new unknowns. Then applying (B) from Theorem 2 to this new homogeneous linear system with respect to all unknowns , we get the required estimations for the number of generators of and the degrees of these generators. The lemma is proved.
COROLLARY 1
Let , , be from the beginning of the section and the integer be from Lemma 3. Then for every integer the –linear space
[TABLE]
PROOF By Lemma 3 we have . Taking the affine parts we get (49). The corollary is proved.
Now everything is ready for the proof of Theorem 1. By Lemma 11 and Lemma 1 there is a system of generators of the module with degrees bounded from above by . By Lemma 12 from Appendix 1 the Hilbert function is stable for . By (10) Section 2 the Hilbert function is stable for all .
Consider the linear order on the monomials from which is induced by the linear order on the monomials from , see Section 4. Then the monomial submodule is defined, see Section 4, where is the polynomial ring. By (22) Section 4 the Hilbert function is stable for all . Hence all the coefficients of the Hilbert polynomial of are bounded from above . Therefore, according to (31) the module has a system of generators with degrees . This means, see Section 4, that the module has a system of generators with degrees . Therefore, the degrees of all the elements of the Janet basis of with respect to the induced linear order are bounded from above by . Hence by Lemma 3 Section 4 the same is true for the Janet basis of the module with respect to the linear order on the monomials from . Theorem 1 is proved for Weyl algebra.
9 The case of algebra of differential operators
Denote by the algebra of differential operators. Recall that and hence relations (1) are satisfied. Further, each element can be uniquely represented in the form
[TABLE]
where all and is a field of rational functions over . Let us replace everywhere in Section 1 and Section 2 , , , , , , , , , by , , , , , , , , , respectively. Thus, we get the definition of the Janet basis and all other objects from Section 1 for the case of the algebra of differential operators.
We define the homogenization of similarly to , see Section 3. Namely, given by the relations
[TABLE]
Further, the considerations are similar to the case of the Weyl algebra with minor changes. We leave them to the reader. For example, Theorem 2 for the case of the algebra of differential operators is the same. One need only to replace everywhere in its statement , and by , and respectively. Thus, one can prove Theorem 1 for the case when is an algebra of differential operators (but now it is ). Theorem 1 is proved completely.
One can consider more general algebra of differential operators. Let be a field with derivatives . Then is the algebra of differential operators and similarly one can define its homogenization by means of adding the variable satisfying the relations
[TABLE]
for all and any element where denotes the result of the application of to . Following the proof of Theorem 1 one can deduce the following statement.
REMARK 6
A similar bound to Theorem 1 holds for .
Appendix 1: Degrees of generators
of a graded module over a polynomial ring and its Hilbert function.
We give a short proof of the following result, cf. [1], [12], [6], [4].
LEMMA 12
Let be a graded submodule over the graded polynomial ring , and is given by a system of generators of degrees less than . Then the Hilbert function is stable for . Further, all the coefficients of the Hilbert polynomial of are bounded from above by .
PROOF Denote . Let be a linear form in general position. Denote by the kernel of the morphism of multiplication to . We have . Hence solving a linear system over , we get that has a system of generators with degrees bounded from above by . Let be an arbitrary associated prime ideal of the module such that . Since is in general position we have . Hence is not an associated prime ideal of . Therefore, for all sufficiently big . So for sufficiently big and all . Hence where . Solving a linear system over the ring we get an estimation for denominators from of all . Since all and are homogeneous we can suppose without loss of generality that all the denominators are . Thus, we get an upper bound for . Namely, is bounded from above by .
Therefore, the sequence
[TABLE]
is exact for . But is a module over a polynomial ring of . Hence by the inductive assumption the Hilbert function is stable for . Therefore, (51) implies that the Hilbert function is stable for .
Obviously for the values are bounded from above by . Hence by the Newton interpolation all the coefficients of the Hilbert polynomial of are bounded from above by . The lemma is proved.
We need also a conversion of Lemma 12.
LEMMA 13
Let be a graded submodule over the graded polynomial ring . Assume that the Hilbert function is stable for and all absolute values of the coefficients of the Hilbert polynomial of the module are bounded from above by for some integer . Then has a system of generators with degrees .
PROOF Let us choose to be the reduced Gröbner basis of with respect to an admissible linear order on the monomials from , cf. the definitions from Section 1 and Section 4. The degree of a monomial from is defined similarly to Section 1 and Section 4. We shall suppose additionally that the considered linear order is degree compatible, i.e., for any two monomials if then . For every the greatest monomial is defined. Further the monomial ideal is generated by all , . Now is a minimal system of generators of and for every . The values of Hilbert functions coincide for all . Thus, replacing by we shall assume in what follows in the proof that is a monomial module.
For every denote by the -th direct summand of . Put , . Then since is a monomial module. Further, for every there is such that . Let us identify . Then is a homogeneous monomial ideal. The case is not excluded for some . For the Hilbert functions we have
[TABLE]
If for some then for every . In this case the ideal is generated by . Hence in (52) for the values one can omit this index in the sum from the right part. Therefore, in this case the proof is reduced to a smaller . So we shall assume without loss of generality that , .
Further, we use the exact description of the Hilbert function of a homogeneous ideal, see [4] Section 7. Namely there are the unique integers such that
[TABLE]
for all sufficiently big and
[TABLE]
This description (without constants ) is originated from the classical paper [11]. The integers are called the Macaulay constants of the ideal . Besides that,
[TABLE]
for every , see [4] Section 7. By Lemma 7.2 [4] for all if then . Hence it is sufficient to prove that all , , are bounded from above by .
By (52) and (53) the coefficient at , , of the Hilbert polynomial of is
[TABLE]
where is an integer and , , is a polynomial with integer coefficients with . Moreover, and absolute values of all the coefficients of all the polynomials are bounded from above by, say, . Denote , . By the condition of the lemma all the coefficients of the Hilbert polynomial of are bounded from above by . Hence from (56) one can recursively estimate . Namely, , . Hence . Notice that for every .
Now let . By (55) if for some then , i.e., is less than the bound for the stabilization of the Hilbert function of . Thus, by (54). Hence is bounded from above by .
We have for every . This implies . Denote by the -th coefficient of the Hilbert polynomial of the module . Now for at least one . Hence by the condition of the lemma. This implies that is bounded from above by . Therefore, is bounded from above by . The lemma is proved.
Appendix 2: Bound on the Gröbner basis of a monomial module via
the coefficients of its Hilbert polynomial
Denote by the disjoint union of copies of the semigrid . A subset of which intersects each disjoint copy of by a semigroup closed with respect to addition of elements from is called an ideal of . Any ideal in has a unique finite Gröbner basis , denote . Clearly, corresponds to a monomial submodule in the free module . The degree of an element is defined as . The degree of a subset in is defined as the maximum of the degrees of its elements. The Hilbert function equals to the number of vectors such that . Then for suitable , integers where the degree . Denote .
PROPOSITION 1
(cf. [6], [12], [4]). The degree of does not exceed .
PROOF An -cone we call a subset of a -th copy of in for a certain of the form
[TABLE]
for suitable . The degree of (57) we define as (note that this definition is different from the one in [4]). By a predessesor of (57) we mean each -cone in the same -th copy of of the type
[TABLE]
for some , provided that . Fix an arbitrary linear order on -cones compatible with the relation of predessesors.
By inverse recursion on we fill gradually (as a union) by -cones. For the base we start with . Assume that a current union of -cones is already constructed (at the very beginning we put ) and an -cone of the form (57) with is the least one (with respect to the fixed linear order on -cones) which is contained in not being a subset of . Observe that each predessesor of this -cone was added to at earlier steps of its construction. Since the total number of -cones added to does not exceed we deduce that the degree of every such -cone is less than (taking into account that the very first -cone added to has the degree [math]).
For the recursive step assume that the current is a union of all possible -cones, -cones,…,-cones and perhaps, some -cones. This can be expressed as . Again as in the base take the least -cone of the form (57) which is contained in not being a subset of . Observe that each predessesor of the type (58) of this -cone is contained in an appropriate -cone , , such that was added to at earlier steps of its constructing and . Hence
[TABLE]
The described construction terminates when . Denote by the number of -cones added to and by the maximum of their degrees. We have seen already that .
Now by inverse induction on we prove that . To this end we introduce a relevant semilattice on cones. Let be a family of cones of the form (57) where . By an -piece we call an -cone being the intersection of a few cones from . All the pieces constitute a semilattice with respect to the intersection and with maximal elements from . We treat also as a partially ordered set with respect to the inclusion relation. Clearly, the depth of is less than . Our nearest purpose is to bound from above the size of . For the sake of simplifying the bound we assume (and this will suffice for our goal in the sequel) that for and when , although one could write a bound in general in the same way. Besides that we assume that th