Janet basis

In mathematics, a Janet basis is a normal form for systems of linear homogeneous partial differential equations (PDEs) that removes the inherent arbitrariness of any such system. It was introduced in 1920 by Maurice Janet.[1] It was first called the Janet basis by Fritz Schwarz in 1998.[2]

The left hand sides of such systems of equations may be considered as differential polynomials of a ring, and Janet's normal form as a special basis of the ideal that they generate. By abuse of language, this terminology will be applied both to the original system and the ideal of differential polynomials generated by the left hand sides. A Janet basis is the predecessor of a Gröbner basis introduced by Bruno Buchberger[3] for polynomial ideals. In order to generate a Janet basis for any given system of linear pde's a ranking of its derivatives must be provided; then the corresponding Janet basis is unique. If a system of linear pde's is given in terms of a Janet basis its differential dimension may easily be determined; it is a measure for the degree of indeterminacy of its general solution. In order to generate a Loewy decomposition of a system of linear pde's its Janet basis must be determined first.

Generating a Janet basis

Any system of linear homogeneous pde's is highly non-unique, e.g. an arbitrary linear combination of its elements may be added to the system without changing its solution set. A priori it is not known whether it has any nontrivial solutions. More generally, the degree of arbitrariness of its general solution is not known, i.e. how many undetermined constants or functions it may contain. These questions were the starting point of Janet's work; he considered systems of linear pde's in any number of dependent and independent variables and generated a normal form for them. Here mainly linear pde's in the plane with the coordinates ${\displaystyle x}$ and ${\displaystyle y}$ will be considered; the number of unknown functions is one or two. Most results described here may be generalized in an obvious way to any number of variables or functions.[4][5][6] In order to generate a unique representation for a given system of linear pde's, at first a ranking of its derivatives must be defined.

Definition A ranking of derivatives is a total ordering such that for any two derivatives ${\displaystyle \delta }$, ${\displaystyle \delta _{1}}$ and ${\displaystyle \delta _{2}}$, and any derivation operator ${\displaystyle \theta }$ the relations ${\displaystyle \delta \leq \theta \delta }$ and ${\displaystyle \delta _{1}\leq \delta _{2}\rightarrow \delta \delta _{1}\leq \delta \delta _{2}}$ are valid.

A derivative ${\displaystyle \delta _{2}}$ is called higher than ${\displaystyle \delta _{1}}$ if ${\displaystyle \delta _{2}>\delta _{1}}$. The highest derivative in an equation is called its leading derivative. For the derivatives up to order two of a single function ${\displaystyle z}$ depending on ${\displaystyle x}$ and ${\displaystyle y}$ with ${\displaystyle x>y}$ two possible order are

the ${\displaystyle LEX}$ order ${\displaystyle z_{xx}>z_{xy}>z_{x}>z_{yy}>z_{y}>z}$ and the ${\displaystyle GRLEX}$ order ${\displaystyle z_{xx}>z_{xy}>z_{yy}>z_{x}>z_{y}>z}$.

Here the usual notation ${\displaystyle \partial _{x}z=z_{x},\partial _{y}z=z_{y},\ldots }$ is used. If the number of functions is higher than one, these orderings have to be generalized appropriately, e.g. the orderings ${\displaystyle TOP}$ or ${\displaystyle POT}$ may be applied.[7] The first basic operation to be applied in generating a Janet basis is the reduction of an equation ${\displaystyle e_{1}}$ w.r.t. another one ${\displaystyle e_{2}}$. In colloquial terms this means the following: Whenever a derivative of ${\displaystyle e_{1}}$ may be obtained from the leading derivative of ${\displaystyle e_{2}}$ by suitable differentiation, this differentiation is performed and the result is subtracted from ${\displaystyle e_{1}}$. Reduction w.r.t. a system of pde's means reduction w.r.t. all elements of the system. A system of linear pde's is called autoreduced if all possible reductions have been performed.

The second basic operation for generating a Janet basis is the inclusion of integrability conditions. They are obtained as follows: If two equations ${\displaystyle e_{1}}$ and ${\displaystyle e_{2}}$ are such that by suitable differentiations two new equations may be obtained with like leading derivatives, by cross-multiplication with its leading coefficients and subtraction of the resulting equations a new equation is obtained, it is called an integrability condition. If by reduction w.r.t. the remaining equations of the system it does not vanish it is included as a new equation to the system.

It may be shown that repeating these operations always terminates after a finite number of steps with a unique answer which is called the Janet basis for the input system. Janet has organized them in terms of the following algorithm.

Janet's Algorithm Given a system of linear differential polynomials ${\displaystyle S\equiv \{e_{1},e_{2},\ldots \}}$, the Janet basis corresponding to ${\displaystyle S}$ is returned.

S1: (Autoreduction) Assign ${\displaystyle S:=\operatorname {Autoreduce} (S)}$

S2: (Completion) Assign ${\displaystyle S:=\operatorname {CompleteSystem} (S)}$

S3: (Integrability conditions) Find all pairs of leading terms ${\displaystyle v_{i}}$ of ${\displaystyle e_{i}}$ and ${\displaystyle v_{j}}$ of ${\displaystyle e_{j}}$ such that differentiation w.r.t. a nonmultiplier ${\displaystyle x_{i_{k}}}$ and multipliers ${\displaystyle x_{j_{1}},\ldots ,x_{j_{l}}}$ leads to

${\displaystyle {\frac {\partial v_{i}}{\partial x_{i_{k}}}}={\frac {\partial ^{p_{1}+\cdots +p_{l}}v_{j}}{\partial x_{j_{1}}^{p_{1}}\cdots \partial x_{j_{l}}^{p_{l}}}}}$

and determine the integrability conditions

${\displaystyle c_{i,j}=\operatorname {Lcoef} (e_{j})\cdot {\frac {\partial e_{i}}{\partial x_{i_{k}}}}-\operatorname {Lcoef} (e_{i})\cdot {\frac {\partial ^{p_{1}+\cdots +p_{l}}e_{j}}{\partial x_{j_{1}}^{p_{1}}\cdots \partial x_{j_{l}}^{p_{l}}}}}$

S4: (Reduction of integrability conditions). For all ${\displaystyle c_{i,j}}$ assign ${\displaystyle c_{i,j}:=\operatorname {Reduce} (c_{i,j},S)}$

S5: (Termination?) If all ${\displaystyle c_{i,j}}$ are zero return ${\displaystyle S}$, otherwise make the assignment ${\displaystyle S:=S\cup \{c_{i,j}\mid c_{i,j}\neq 0\}}$, reorder ${\displaystyle S}$ properly and goto S1

Here ${\displaystyle Autoreduce}$ is a subalgorithm that returns its argument with all possible reductions performed, ${\displaystyle Completion}$ adds certain equations to the system in order to facilitate determining the integrability conditions. To this end the variables are divides into multipliers and non-multipliers; details may be found in the above references. Upon successful termination a Janet basis for the input system will be returned.

Example 1 Let the system ${\displaystyle \left\{e_{1}\equiv z_{xy}-{\frac {x^{2}}{y^{2}}}z_{x}-{\frac {x-y}{y^{2}}}z=0,e_{2}\equiv z_{x}+{\frac {1}{x}}z_{y}+xz=0\right\}}$ be given with ordering ${\displaystyle GRLEX}$ and ${\displaystyle x>y}$. Step S1 returns the autoreduced system

${\displaystyle \left\{e_{3}\equiv z_{yy}+{\frac {1}{y^{2}}}(xy^{3}-x^{2}-y)z_{y}-{\frac {1}{y}}(x^{3}-x+y)z=0,e_{2}=z_{x}+{\frac {1}{y}}z_{y}+xz=0\right\}.}$

Steps S3 and S4 generate the integrability condition ${\displaystyle c_{3,2}\equiv {\frac {\partial e_{3}}{\partial x}}-{\frac {\partial ^{2}e_{2}}{\partial y^{2}}}}$ and reduces it to ${\displaystyle z=0}$, i.e. the Janet basis for the originally given system is ${\displaystyle \{z=0\}}$ with the trivial solution ${\displaystyle z=0}$.

The next example involves two unknown functions ${\displaystyle w}$ and ${\displaystyle z}$, both depending on ${\displaystyle x}$ and ${\displaystyle y}$.

Example 2 Consider the system

${\displaystyle {\begin{aligned}{\Big \{}&f_{1}\equiv w_{xx}-2z_{xy}-{\frac {1}{2x}}w_{x}+{\frac {1}{2x^{2}}}w=0,f_{2}\equiv w_{xy}-{\frac {1}{2}}z_{yy}-{\frac {1}{2x}}w_{y}-6x^{2}z_{x},\\[5pt]&f_{3}\equiv w_{yy}+4x^{2}w_{x}-8x^{2}z_{y}-8xw=0,f_{4}\equiv z_{xx}+{\frac {1}{2x}}z_{x}=0{\Big \}}\end{aligned}}}$

in ${\displaystyle GRLEX,w>z,x>y}$ ordering. The system is already autoreduced, i.e. step S1 returns it unchanged. Step S3 generates the two integrability conditions

${\displaystyle c_{1,2}\equiv {\frac {\partial f_{1}}{\partial y}}-{\frac {\partial f_{2}}{\partial x}}{\text{ and }}c_{2,3}\equiv {\frac {\partial f_{2}}{\partial y}}-{\frac {\partial f_{3}}{\partial x}}.}$

Upon reduction in step S4 they are

${\displaystyle c_{1,2}=z_{xyy}-6xz_{x}=0,c_{2,3}=z_{yyy}+3x^{2}z_{xy}-24xz_{y}-12w=0.}$

In step S5 they are included into the system and the algorithms starts again with step S1 with the extended system. After a few more iterations finally the Janet basis

${\displaystyle \left\{z_{y}+{\frac {1}{2x}}w=0,z_{x}=0,w_{y}=0,w_{x}-{\frac {1}{x}}w=0\right\}}$

is obtained. It yields the general solution ${\displaystyle z=C_{1}-C_{2}x,w=2C_{2}y}$ with two undetermined constants ${\displaystyle C_{1}}$ and ${\displaystyle C_{2}}$.

Application of Janet bases

The most important application of a Janet basis is its use for deciding the degree of indeterminacy of a system of linear homogeneous partial differential equations. The answer in the above Example 1 is that the system under consideration allows only the trivial solution. In the second Example 2 a two-dimensional solution space is obtained. In general, the answer may be more involved, there may be infinitely many free constants in the general solution; they may be obtained from the Loewy decomposition of the respective Janet basis.[8] Furthermore, the Janet basis of a module allows to read off a Janet basis for the syzygy module.[5]

Janet's algorithm has been implemented in Maple.[9]

External links

• www.alltypes.de – Implementation of Janet's basis

References

1. M. Janet, Les systèmes d'équations aux dérivées partielles, Journal de mathématiques pures et appliquées 8 ser., t. 3 (1920), pages 65–123.
2. F. Schwarz, "Janet Bases for Symmetry Groups", in: Gröbner Bases and Applications; Lecture Notes Series 251, London Mathematical Society, pages 221–234 (1998); B. Buchberger and F. Winkler, Edts.
3. B. Buchberger, Ein algorithmisches Kriterium fuer die Loesbarkeit eines algebraischen Gleichungssystems, Aequ. Math. 4, 374–383(1970).
4. F. Schwarz, Algorithmic Lie Theory for Solving Linear Ordinary Differential Equations, Chapman & Hall/CRC, 2007 Chapter 2.
5. W. Plesken, D. Robertz, Janet's approach to presentations and resolutions for polynomials and linear pdes, Archiv der Mathematik 84, pages 22–37, 2005.
6. T. Oaku, T. Shimoyama, A Gröbner Basis Method for Modules over Rings of Differential Operators, Journal of Symbolic Computation 18, pages 223–248, 1994.
7. W. Adams, P. Loustaunau, An introduction to Gröbner bases, American Mathematical Society, Providence, 1994.
8. F. Schwarz, Loewy Decomposition of Linear Differential Equations, Springer, 2013.
9. S. Zhang, Z. Li, An Implementation for the Algorithm of Janet bases of Linear Differential Ideals in the Maple System, Acta Mathematicae Applicatae Sinica, English Series, 20, pages 605–616 (2004)