Janet basis

Last updated

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]

Contents

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 PDEs a ranking of its derivatives must be provided; then the corresponding Janet basis is unique. If a system of linear PDEs 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 PDEs its Janet basis must be determined first.

Generating a Janet basis

Any system of linear homogeneous PDEs 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 PDEs in any number of dependent and independent variables and generated a normal form for them. Here mainly linear PDEs in the plane with the coordinates and 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 PDEs, 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 , and , and any derivation operator the relations and are valid.

A derivative is called higher than if . The highest derivative in an equation is called its leading derivative. For the derivatives up to order two of a single function depending on and with two possible order are

the LEX order and the GRLEX order .

Here the usual notation is used. If the number of functions is higher than one, these orderings have to be generalized appropriately, e.g. the orderings or may be applied. [7] The first basic operation to be applied in generating a Janet basis is the reduction of an equation w.r.t. another one . In colloquial terms this means the following: Whenever a derivative of may be obtained from the leading derivative of by suitable differentiation, this differentiation is performed and the result is subtracted from . Reduction w.r.t. a system of PDEs means reduction w.r.t. all elements of the system. A system of linear PDEs 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 and 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 , the Janet basis corresponding to is returned.

S1: (Autoreduction) Assign
S2: (Completion) Assign
S3: (Integrability conditions) Find all pairs of leading terms of and of such that differentiation w.r.t. a nonmultiplier and multipliers leads to
and determine the integrability conditions
S4: (Reduction of integrability conditions). For all assign
S5: (Termination?) If all are zero return , otherwise make the assignment , reorder properly and goto S1

Here is a subalgorithm that returns its argument with all possible reductions performed, 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

be given with ordering GRLEX and . Step S1 returns the autoreduced system

Steps S3 and S4 generate the integrability condition and reduces it to , i.e. the Janet basis for the originally given system is with the trivial solution .

The next example involves two unknown functions and , both depending on and .

Example 2: Consider the system

in GRLEX, ordering. The system is already autoreduced, i.e. step S1 returns it unchanged. Step S3 generates the two integrability conditions

Upon reduction in step S4 they are

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

is obtained. It yields the general solution with two undetermined constants and .

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]

Related Research Articles

<span class="mw-page-title-main">Cauchy–Riemann equations</span> Chacteristic property of holomorphic functions

In the field of complex analysis in mathematics, the Cauchy–Riemann equations, named after Augustin Cauchy and Bernhard Riemann, consist of a system of two partial differential equations which form a necessary and sufficient condition for a complex function of a complex variable to be complex differentiable.

In mathematics, an equation is a mathematical formula that expresses the equality of two expressions, by connecting them with the equals sign =. The word equation and its cognates in other languages may have subtly different meanings; for example, in French an équation is defined as containing one or more variables, while in English, any well-formed formula consisting of two expressions related with an equals sign is an equation.

<span class="mw-page-title-main">Partial differential equation</span> Type of differential equation

In mathematics, a partial differential equation (PDE) is an equation which computes a function between various partial derivatives of a multivariable function.

In mathematics, a partial derivative of a function of several variables is its derivative with respect to one of those variables, with the others held constant. Partial derivatives are used in vector calculus and differential geometry.

In mathematics, the Laplace operator or Laplacian is a differential operator given by the divergence of the gradient of a scalar function on Euclidean space. It is usually denoted by the symbols , (where is the nabla operator), or . In a Cartesian coordinate system, the Laplacian is given by the sum of second partial derivatives of the function with respect to each independent variable. In other coordinate systems, such as cylindrical and spherical coordinates, the Laplacian also has a useful form. Informally, the Laplacian Δf (p) of a function f at a point p measures by how much the average value of f over small spheres or balls centered at p deviates from f (p).

In continuum mechanics, the infinitesimal strain theory is a mathematical approach to the description of the deformation of a solid body in which the displacements of the material particles are assumed to be much smaller than any relevant dimension of the body; so that its geometry and the constitutive properties of the material at each point of space can be assumed to be unchanged by the deformation.

In Riemannian or pseudo-Riemannian geometry, the Levi-Civita connection is the unique affine connection on the tangent bundle of a manifold that preserves the (pseudo-)Riemannian metric and is torsion-free.

Linear elasticity is a mathematical model of how solid objects deform and become internally stressed due to prescribed loading conditions. It is a simplification of the more general nonlinear theory of elasticity and a branch of continuum mechanics.

In mathematics and its applications, a Sturm–Liouville problem is a second-order linear ordinary differential equation of the form:

Second-order linear partial differential equations (PDEs) are classified as either elliptic, hyperbolic, or parabolic. Any second-order linear PDE in two variables can be written in the form

In mathematics, the method of characteristics is a technique for solving partial differential equations. Typically, it applies to first-order equations, although more generally the method of characteristics is valid for any hyperbolic partial differential equation. The method is to reduce a partial differential equation to a family of ordinary differential equations along which the solution can be integrated from some initial data given on a suitable hypersurface.

<span class="mw-page-title-main">Differential equation</span> Type of functional equation (mathematics)

In mathematics, a differential equation is an equation that relates one or more unknown functions and their derivatives. In applications, the functions generally represent physical quantities, the derivatives represent their rates of change, and the differential equation defines a relationship between the two. Such relations are common; therefore, differential equations play a prominent role in many disciplines including engineering, physics, economics, and biology.

In mathematics, differential algebra is, broadly speaking, the area of mathematics consisting in the study of differential equations and differential operators as algebraic objects in view of deriving properties of differential equations and operators without computing the solutions, similarly as polynomial algebras are used for the study of algebraic varieties, which are solution sets of systems of polynomial equations. Weyl algebras and Lie algebras may be considered as belonging to differential algebra.

In mathematics, a first-order partial differential equation is a partial differential equation that involves only first derivatives of the unknown function of n variables. The equation takes the form

In numerical analysis, finite-difference methods (FDM) are a class of numerical techniques for solving differential equations by approximating derivatives with finite differences. Both the spatial domain and time domain are discretized, or broken into a finite number of intervals, and the values of the solution at the end points of the intervals are approximated by solving algebraic equations containing finite differences and values from nearby points.

A parabolic partial differential equation is a type of partial differential equation (PDE). Parabolic PDEs are used to describe a wide variety of time-dependent phenomena, including heat conduction, particle diffusion, and pricing of derivative investment instruments.

In differential calculus, there is no single uniform notation for differentiation. Instead, various notations for the derivative of a function or variable have been proposed by various mathematicians. The usefulness of each notation varies with the context, and it is sometimes advantageous to use more than one notation in a given context. The most common notations for differentiation are listed below.

The derivation of the Navier–Stokes equations as well as its application and formulation for different families of fluids, is an important exercise in fluid dynamics with applications in mechanical engineering, physics, chemistry, heat transfer, and electrical engineering. A proof explaining the properties and bounds of the equations, such as Navier–Stokes existence and smoothness, is one of the important unsolved problems in mathematics.

The Cauchy momentum equation is a vector partial differential equation put forth by Cauchy that describes the non-relativistic momentum transport in any continuum.

In the study of differential equations, the Loewy decomposition breaks every linear ordinary differential equation (ODE) into what are called largest completely reducible components. It was introduced by Alfred Loewy.

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 Series251, 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. 1 2 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)