Overview
A linear differential equation with polynomial coefficients, with , contains two quite different kinds of information. There is the operator , a finite piece of algebraic data living in the Weyl algebra ; and there are the functions that satisfy the equation, which may be polynomials, smooth functions, holomorphic functions, distributions, or objects with no classical meaning at all.
The algebraic theory of differential equations begins by separating the two. This page carries out the first half of that separation: to a system it attaches a single left -module , built entirely out of the operators and mentioning no function whatever. The second half - recovering the solutions in a chosen space by taking homomorphisms out of - is on the solutions page.
The construction is short, but it is not arbitrary. The left ideal is precisely the set of differential consequences of the system: the operators that can be deduced from the given ones by composing on the left and adding. Two systems with the same consequences give literally the same module, which is exactly the identification a solution theory ought to make. The module is what survives when a system is stripped of everything that depends on how it was written down.
What the module gains in return is that it is an object of a good category. It is finitely generated, indeed cyclic; it has a dimension and a multiplicity; it can be pushed and pulled along maps of affine spaces. Numerical facts about the original equation, such as how many independent solutions to expect, become invariants of .
Definition
Throughout, is a field of characteristic zero, , and is the -th Weyl algebra, generated by and subject to and the commuting relations among the 's and among the 's.
The module of a systemCoutinho, Ch. 6 §1
Let and consider the homogeneous linear system
Let be the left ideal of generated by the . The -module of the system (6.1) is the left -module
with its canonical generator . By construction for every , and is cyclic.
Degenerate case
if and only if , that is, if and only if is a differential consequence of the system. Such a system is inconsistent: since , its only solution in any -module is . For instance and generate the whole of , because .
Annihilator form of the same idea
If is any left -module and , the annihilator is a left ideal, and . So every cyclic module is the module of some system, and the system is recovered as any finite generating set of - which exists because is Noetherian.
Core Concepts
Why a left ideal and not a right or a two-sided one
If satisfies then satisfies for every operator , because . Nothing of the kind holds on the other side: from one cannot conclude , since need not be a solution. The set of operators that every solution of (6.1) must satisfy is therefore closed under left multiplication and addition, and that is exactly the definition of a left ideal.
Two-sided ideals are useless here for a sharper reason: is a simple ring, so its only two-sided ideals are and . Quotienting by the two-sided ideal generated by a non-zero would always give the zero module, destroying all information. The whole theory depends on working with one-sided ideals in a noncommutative ring.
What the module remembers, and what it forgets
The passage from the list to forgets the list and remembers the ideal. Adding a consequence to the system changes nothing: the system has the same ideal as . Multiplying an equation by a unit of , or replacing the list by any other generating set of , changes nothing either. This is the correct notion of equivalence for systems, and it is imposed automatically rather than by hand.
What is forgotten is any individual solution. is built from operators, and the same serves for polynomial solutions, smooth solutions and distributional solutions alike. To get solutions back one must name a target module and compute ; different choices of give genuinely different answers for the same .
The generator is the unknown function
It is useful to read the canonical generator as the unknown itself, subjected to the relations of the system and to nothing else. Formally, is the universal solution: it satisfies the system in , and every solution in every module is obtained from by a unique homomorphism. In this reading is the free object on one unknown modulo the equations, exactly as a group given by generators and relations is a free group modulo relations.
Construction and Proof
Two things need to be checked: that the construction has a universal property, and that nothing is lost when a module is turned back into a system.
Universal property of the canonical generator
Let with and let be the canonical generator. For every left -module and every with for , there is a unique homomorphism of left -modules with .
Proof
Uniqueness is immediate: , so is forced for every . For existence, define by ; this is a homomorphism of left modules because . Its kernel contains each , hence contains the left ideal they generate, hence contains . So factors through , and the induced map sends to .
Taking and arbitrary, this proposition is already the solution theorem of the next page in disguise: homomorphisms out of and solutions in are the same data. It also shows that does not depend on the choice of generators of , since the universal property mentions only .
From a module back to a system
Suppose is a cyclic left -module with generator . Then is a left ideal, and is left Noetherian, so for finitely many operators . The system has as its module. The dictionary is therefore a genuine two-way translation, at the cost of one choice: the generator.
A different generator gives a different ideal
Take as an -module. With the generator we get , so : the equation is .
But also generates , because . Its annihilator contains and , and in fact equals ; the system is now , . A dimension count confirms there is nothing more in the annihilator: the symbols and cut the associated graded ring down to the span of the monomials and , whose count in degree at most is , and is also , the dimension of the corresponding filtration piece of .
So one module carries two visibly different systems. The module is the invariant; the equations are a presentation of it.
Key Equations
An operator of acts on a function by the rule that gives the Weyl algebra its name:
the sum being finite; here is a multi-index and .
The ideal of consequences and the module are
Cyclicity is the statement that has a presentation with a single generator, that is an exact sequence
The universal property, which is proved above and exploited on the next page, reads
as -vector spaces, for every left -module .
For a single non-zero operator in one variable the invariants of can be written down. If is non-zero of Bernstein degree , so that its symbol is homogeneous of degree , then
Variable Definitions
- the ground field, of characteristic zero
- the polynomial ring , the default space of solutions
- the -th Weyl algebra over
- the operators of the system, elements of
- the left ideal of differential consequences
- the module of the system
- the canonical generator of , the universal unknown
- a chosen left -module in which solutions are sought
- the symbol of : its top-degree part with replaced by the commuting variable
- the dimension and the multiplicity of the module, computed from a good filtration
Properties and Behaviour
Finiteness
is cyclic, hence finitely generated, and since is left Noetherian is finitely generated, so is finitely presented. Every quotient and every submodule of is again finitely generated.
Dimension and multiplicity of a single equation
Let have Bernstein degree and let . Then and .
Sketch: the associated graded ring of for the Bernstein filtration is the polynomial ring in variables, which is a domain, so degrees add: . Hence , the associated graded of is the principal ideal , and is the coordinate ring of a hypersurface of degree in variables. Its Hilbert polynomial has degree and leading coefficient .
One variable is special
For and , the module has , so it is holonomic, with multiplicity equal to the Bernstein degree of . For a single non-trivial equation gives , so a single equation in several variables is never holonomic. This is the algebraic reason why one ordinary differential equation has a finite-dimensional solution space while one partial differential equation generally does not.
Adding equations can only shrink the module
If then there is a canonical surjection , and by (6.6) the solution space of the larger system embeds in that of the smaller one. Imposing more equations makes the module smaller and the solution space smaller, in the same direction - the correspondence between systems and modules is order reversing on ideals and order preserving on modules.
Examples and Special Cases
The polynomial ring
, . Then , with corresponding to the constant . Indeed every operator reduces modulo to a polynomial in , and the map is an isomorphism. See the polynomial module. Polynomial solutions of : the constants, a one-dimensional space.
An equation with no classical solution
, . The equation has no non-zero classical solution at all: not a polynomial, not a continuous function, not a smooth one, because a function vanishing away from the origin vanishes identically. Yet is a perfectly good non-zero module, with -basis the classes of , . Its solution appears once the target module is enlarged: the Dirac delta satisfies , and , so . This is worked out in the delta page and the microfunctions page.
The exponential
, . Again no non-zero polynomial solves , but does in the module of holomorphic functions. The module is a twist of by an automorphism of , and is simple.
Two commuting equations in two variables
, , . Then and . Polynomial solutions: the constants. Here two equations in two variables produce a holonomic module of dimension , whereas either equation alone would give dimension .
An equation with infinitely many independent solutions
, , the generator of infinitesimal rotations. A polynomial satisfies precisely when it is invariant under rotation, and over a field where this can be said cleanly the solutions are the polynomials in . The solution space is infinite-dimensional, in agreement with the corollary above: , so is not holonomic.
Worked Example
The Euler operator:
- Step 1 - the module and a basis
Fix and let , so the equation is . Put and , so that .
The Bernstein symbol of is , of degree . By (6.7), , whose monomial basis consists of the with and the with . Lifting, a -basis of is
Every mixed monomial reduces: , and .
- Step 2 - the Hilbert function, checked by hand
Filter by . Counting the basis elements of degree at most gives . Check the first three values directly.
: , dimension . : and because every non-zero element of has degree at least ; so . : has the six monomials , and ; so . The values match .
- Step 3 - dimension and multiplicity
The Hilbert polynomial is , of degree with leading coefficient . Hence and , confirming (6.7) with and . Since , the module is holonomic.
- Step 4 - polynomial solutions
By (6.6), is the space of with . Write ; then , so the equation says for every . Thus unless .
So the polynomial solution space is unless is a non-negative integer, in which case it is the line spanned by . A single one-dimensional module can therefore have solution space of dimension or depending on a parameter, while the module itself is non-zero for every .
- Step 5 - solutions elsewhere
Over , take instead with , where a branch of is defined. Then solves for every , and is one-dimensional for every . Enlarging the target module has changed the answer without changing .
is holonomic with and , independently of . Its polynomial solution space is one-dimensional when and zero otherwise; its solution space in holomorphic functions on a slit plane is one-dimensional for every . The module encodes the equation; the target module decides which solutions exist.
Applications and Industry Use
In a mathematics topic, this section covers downstream use inside mathematics, computing and engineering rather than a manufactured product.
Turning a system into a module is the step that makes symbolic computation with differential equations possible, because ideal membership in is decidable while asking whether a function is a solution is not.
- Deciding consequences. Whether an operator is a consequence of a system is the question , answered by a Gröbner basis computation in the Weyl algebra. Whether a system is contradictory is the question .
- Counting solutions in advance. The invariants and , and the holonomic rank after localising the coefficients, bound the number of independent solutions of the system near a generic point, without solving anything.
- Automatic proof of identities. Zeilberger's method works by attaching a module to a summand or integrand and manipulating the annihilating ideal; see Zeilberger's method and holonomic functions.
- Special functions. A special function is stored in computer algebra as a generator together with its annihilating ideal - that is, as a cyclic -module with a chosen generator - which is a finite and exact description of an object with no closed form.
- Linear systems theory. In the behavioural approach to multidimensional linear systems, a system of linear equations with operator coefficients is identified with the finitely presented module it presents, and system-theoretic properties such as controllability and autonomy become module-theoretic ones. The same translation, one level of generality up, is the one made here.
Design Considerations
For a mathematical object, design considerations are the modelling choices: which ring, which filtration, which category to work in.
Three modelling choices are made before the module is written down, and each is reversible only at a cost.
Which ring of operators
Working in keeps the coefficients polynomial and the ring Noetherian and simple, which is what makes the dimension theory work. Working instead in , with rational function coefficients, makes the ring a left and right Euclidean domain in the case and turns a holonomic module into a finite-dimensional vector space over whose dimension is the holonomic rank. The price is that all information carried by the singular locus is discarded. For analytic questions one moves further, to rings of operators with convergent or formal power series coefficients.
Which side
The convention here is left modules acting on functions, which forces left ideals. Right modules appear naturally for densities and for integration, and the transposition anti-automorphism converts one to the other; see side-changing functors. Mixing the conventions in one computation is the single most common source of sign errors.
One unknown or several
A system in a single unknown function gives a cyclic module. A system in several unknowns gives a quotient of a free module of higher rank, described by a presentation matrix; that is the subject of the presentation matrix page. Since every holonomic module is in fact cyclic, the distinction is one of convenience rather than of substance in the holonomic case.
Computational Notes
Read this as the manufacturing section of the template: how the object is actually built by machine, at what cost, and where the computation stops being decidable.
All the basic questions about reduce to Gröbner basis computations in the Weyl algebra, which is one of the few noncommutative rings where the theory works essentially as in the commutative case.
- Fix a monomial order on the compatible with the chosen filtration, and compute a Gröbner basis of from the given .
- Consistency: if and only if contains a unit, that is if and only if reduces to .
- Membership: is a consequence of the system if and only if reduces to modulo .
- Invariants: the leading terms of generate the associated graded ideal, so the Hilbert polynomial of the commutative quotient gives and directly.
- Solutions: polynomial and rational solutions of the system can be enumerated by further algorithms once the module is known to be holonomic.
Costs are those of Gröbner bases in variables, doubly exponential in the worst case. Implementations include the Dmodules package of Macaulay2, dmod.lib in Singular, the ore_algebra package in SageMath and HolonomicFunctions.m in Mathematica. A useful sanity check on any implementation: a reported dimension below for a non-zero module contradicts Bernstein's inequality and indicates a bug.
Limits of Validity
The construction is narrower than the phrase differential equation suggests, and the hypotheses matter.
- Linear only. Nonlinear equations have no left ideal of consequences: the set of operators annihilating a solution is not stable under the operations one would need. Nonlinear problems belong to differential algebra and to the theory of -schemes, not here.
- Homogeneous only. An inhomogeneous equation has a solution set that is a coset, not a subspace. Module theory handles it through the module together with a class in an group, or by enlarging the system; the naive quotient encodes only the homogeneous part.
- Polynomial coefficients. Equations with analytic or smooth coefficients are not operators in . The formalism transfers to the corresponding operator rings, but the finiteness statements that make the theory usable have to be re-proved there.
- Solutions require a target. does not mean the system has a non-zero solution. The equation gives a non-zero module and no classical solution at all. The module is a question, not an answer.
Failure Modes and Common Mistakes
Using the right ideal, or the two-sided ideal
Only left multiplication preserves solutions: implies , never . Forming or gives an object with no relation to the equation, and in the two-sided case the simplicity of makes the quotient for every non-zero . In an implementation, the check is whether the reduction routine multiplies candidate cofactors on the correct side.
Believing the module determines the equations
It determines the left ideal, given the generator. Change the generator and the ideal changes, as the example of generated by or by shows: the systems and present isomorphic modules. Any invariant of the equation that is to be read off the module must be checked to be independent of the presentation.
Reading the order of the operator as the number of solutions
For an ordinary equation of order with non-vanishing leading coefficient, the classical solution space near a non-singular point does have dimension . But the polynomial solution space can be smaller (it is for ), and in several variables the count fails completely: one equation in variables typically has an infinite-dimensional solution space. The invariant that generalises the order is the holonomic rank, not the order.
Forgetting that a system of one equation may already be inconsistent
Inconsistency is not a property of visibly contradictory equations. The system looks harmless but generates all of , since the commutator of the two generators is . Always test before interpreting a computed invariant of ; the zero module has every dimension convention attached to it and no content.
Historical Notes
The idea of studying a system of linear partial differential equations through the module it presents grew out of two traditions. On the analytic side, Ehrenpreis and Palamodov in the late 1950s and 1960s treated constant-coefficient systems by identifying them with modules over a polynomial ring and applying commutative algebra, culminating in the fundamental principle. On the formal side, Riquier, Janet and later Spencer had developed the involutive theory of over-determined systems, in which passing to the consequences of a system - completion to involution - is precisely the step that produces the ideal used here.
The variable-coefficient version required a noncommutative ring, and it appeared in Kashiwara's 1970 master's thesis, where the module attached to a system was made the primary object and the solution space became a group, with the derived functors carrying the rest of the information. Sato's algebraic analysis and the Sato-Kashiwara-Kawai theory of microfunctions gave the analytic counterpart. Independently, Bernstein's work on analytic continuation of made the Weyl algebra itself a subject of study.
The algebraic presentation used here, in which everything is done over with no sheaves and no analysis, is the one adopted in Coutinho's primer; it is the shortest honest route to the main theorems and the one that computer algebra systems implement.
Comparison
| Classical object | Module-theoretic object | Comment |
|---|---|---|
| Equation | Left ideal | the equation is the operator, up to left multiples |
| System | Left ideal | generators of the ideal are the equations |
| Differential consequence | Element of | left multiply and add |
| The system itself | Module | independent of how the system was written |
| The unknown function | Canonical generator | the universal solution |
| A solution in a space | Element of | one homomorphism per solution |
| Change of unknown | Change of generator of | changes the ideal, not the module |
| Order of the equation | Multiplicity, or holonomic rank | the order is not an invariant of |
| Inconsistent system | equivalently |
Key Takeaways
Key points
- A homogeneous linear system with polynomial coefficients determines the left ideal and the cyclic module .
- The left ideal is exactly the set of differential consequences of the system, because implies but not .
- The canonical generator is a universal solution: homomorphisms correspond bijectively to solutions of the system in .
- Every cyclic module arises this way, and the system is recovered from a finite generating set of the annihilator of a generator; changing the generator changes the system but not the module.
- exactly when , the algebraic form of inconsistency; a non-zero module still need not have solutions in a given target.
- For a single non-zero of Bernstein degree , has dimension and multiplicity : holonomic if and only if .
FAQs
Why quotient the whole Weyl algebra rather than take the set of solutions directly?
Because the set of solutions depends on where you look for them, and is often infinite-dimensional or empty, while the quotient is a finitely presented algebraic object that exists before any function space is chosen. All the classical solution spaces are then recovered from it as groups.
Is the module determined by the system, or the system by the module?
The system determines the module completely. The module determines the system only after a generator is chosen, and different generators give different, equally valid, systems presenting the same module.
What does it mean when the module is zero?
That is a consequence of the system, so the only solution in any module is . This is the algebraic form of an inconsistent system, and it can happen without any equation looking contradictory, since commutators of the given operators are also consequences.
Can inhomogeneous equations be handled the same way?
Not by the same quotient. The solution set of is a coset of the solution set of , so it is not a module. One standard device replaces the pair by a short exact sequence and records the inhomogeneity as an extension class; another enlarges the system so that the inhomogeneous term becomes one of the unknowns.
Does the construction need the coefficients to be polynomials?
The construction itself needs only a ring of operators. The theory needs more: over one has the Noetherian property, simplicity, and a dimension theory, and these are what turn the definition into theorems. Over rings of operators with smooth coefficients some of this fails.
How does the order of the equation show up in the module?
Not directly. The Bernstein degree of appears as the multiplicity of , and the order of appears as the holonomic rank after the coefficients are localised to rational functions. The order itself is not an invariant of the module, since a change of generator can change it.
Why is one partial differential equation so much worse behaved than one ordinary one?
Because has dimension . For this is , the holonomic value, and the solution space is finite-dimensional. For it exceeds , the module is not holonomic, and there is no finiteness theorem to appeal to - as the rotation operator , with its infinite-dimensional polynomial solution space, shows.
Where do distributions and hyperfunctions enter?
Only as choices of the target module . Nothing about changes when the target is enlarged, but the solution space can jump from zero to non-zero, which is what happens for when is enlarged to contain the Dirac delta.
References
- S. C. Coutinho, A Primer of Algebraic D-modules, London Mathematical Society Student Texts 33, Cambridge University Press, 1995 - Ch. 6 §1, with Theorem (6.1.2) and the exercises of Ch. 6 §4.
- M. Kashiwara, Algebraic Study of Systems of Partial Differential Equations, master's thesis, University of Tokyo 1970; English translation, Mémoires de la Société Mathématique de France 63, 1995.
- J.-E. Björk, Rings of Differential Operators, North-Holland Mathematical Library 21, North-Holland, 1979 - Ch. 1 and Ch. 5.
- R. Hotta, K. Takeuchi and T. Tanisaki, D-modules, Perverse Sheaves, and Representation Theory, Progress in Mathematics 236, Birkhäuser, 2008 - Ch. 1, for systems and their modules.
- M. Saito, B. Sturmfels and N. Takayama, Gröbner Deformations of Hypergeometric Differential Equations, Algorithms and Computation in Mathematics 6, Springer, 2000 - Ch. 1, for the algorithmic side.
- L. Ehrenpreis, Fourier Analysis in Several Complex Variables, Wiley-Interscience, 1970, and V. P. Palamodov, Linear Differential Operators with Constant Coefficients, Springer, 1970 - the constant-coefficient prehistory.
- U. Oberst, Multidimensional constant linear systems, Acta Applicandae Mathematicae 20 (1990), 1-175 - systems as finitely presented modules in control theory.
- Macaulay2
Dmodulespackage documentation, and Singulardmod.lib, for computing with . - ISO 80000-2:2019, Quantities and units - Part 2: Mathematics, International Organization for Standardization.
AI Suggested Questions
- Compute the annihilator in of the polynomial inside and compare the resulting system with .
- Show that is simple exactly when is not an integer, and describe the submodules otherwise.
- Verify that has dimension by computing its Hilbert polynomial.
- Give an example of two operators in that generate the unit left ideal without either being a unit.
- Work out the module attached to the Cauchy-Riemann system and identify the operator that annihilates both unknowns.
- Explain why the order of an operator is not an invariant of the module it presents, with an explicit change of generator.
- Compute and for and check the general formula.
