Overview
A system of linear differential equations with polynomial coefficients has already been converted into a single module on the previous page. That conversion deliberately discarded the functions. This page recovers them.
The recovery statement is short: for any left -module , the solutions of the system with values in are in natural bijection with the module homomorphisms . The bijection sends a homomorphism to its value on the canonical generator, and a solution to the unique homomorphism sending the generator to . It is linear over the ground field, so solution spaces are literally spaces.
Three things follow, and they are why the reformulation is worth making. First, the question where does this equation have solutions becomes the question which to choose, and ranges over a category rather than over an ad hoc list of function spaces; distributions, hyperfunctions and microfunctions enter as target modules on the same footing as polynomials. Second, the assignment is a contravariant functor, so maps between systems produce maps between solution spaces automatically, in the reversed direction. Third, that functor is left exact but not exact, and its first derived functor measures precisely the failure of an inhomogeneous equation to be solvable.
What the theorem does not do is produce solutions. It says nothing about whether is non-zero, or finite-dimensional. Both can fail, and the examples below show that both do.
Definition
Throughout has characteristic zero, is the polynomial module, and with , with canonical generator .
Solution space in a moduleCoutinho, Ch. 6 §1
Let be a left -module, not necessarily finitely generated, and let be a finitely generated left -module. The solution space of in is
the set of all homomorphisms of left -modules from to . It is a vector space over under pointwise addition and scalar multiplication.
Solutions are homomorphismsCoutinho (6.1.2)
Let be the module of the system , and let be any left -module. Then the map
is an isomorphism of -vector spaces. In particular, taking , the space of polynomial solutions of the system is isomorphic to .
Note
The finiteness assumptions are asymmetric on purpose. is finitely generated because it comes from a finite system; is not, and typically cannot be. The module over is not finitely generated, as Coutinho's Exercise 4.4 shows using Baire's theorem, and neither is the module of germs of holomorphic functions.
Core Concepts
The target module is a modelling decision
Classically one asks for solutions and then argues about what kind of object a solution is allowed to be. Here the kind is fixed first, by naming a left -module , and the answer is then determined. Enlarging can only enlarge the solution space, since an inclusion of -modules induces an injection of spaces. Every classical extension of the notion of solution - weak solutions, distributions, hyperfunctions - is an instance of enlarging .
Why generalised solutions are forced on us
The equation in one variable has no non-zero classical solution of any kind, because a function vanishing away from a point vanishes. Its module is nevertheless non-zero. The mismatch is resolved only by choosing a target in which an object concentrated at the origin exists; the Dirac delta is such an object, and it is constructed algebraically as a microfunction later in the chapter.
Solutions of the system, not of the module
It is worth keeping the two descriptions apart. The set depends on the chosen list of operators; the space depends only on . The theorem says they agree, and therefore that the solution set is an invariant of the module - equivalent systems have identical solution spaces in every target simultaneously.
Construction and Proof
The proof of the theorem is the universal property of a quotient, applied twice.
Proof of the theorem
The map is well defined. If is -linear then , so does lie in the stated solution set. Linearity in is immediate from the pointwise operations.
Injectivity. is generated by , so a homomorphism is determined by its value there: if then for every .
Surjectivity. Let satisfy for all . Define by . This is -linear because . Its kernel is a left ideal containing each , hence containing , so factors as with .
Why the correspondence is only -linear
carries no natural -module structure, and not even a -module structure. The obvious candidate fails: for and a homomorphism, the map defined by is not -linear, because
and the two agree for all only when annihilates the image. This is not a defect of the construction: it reflects the fact that the solution set of a differential equation is closed under addition and constant scalars but not under multiplication by functions.
What does act is smaller and larger at once. The ring acts on the left of by composition, and acts on the right. If happens to be an -bimodule for some ring , then is a right -module; the case gives the dual module and is the entry point to duality theory.
Functoriality
A homomorphism induces by , so is a contravariant functor. Concretely, if with , so that is the module of a larger system, then surjects onto and the induced map on solution spaces is the inclusion of the solutions of the larger system into those of the smaller one. Arrows between systems and arrows between solution spaces run in opposite directions.
Key Equations
For a cyclic module the whole theory reduces to evaluation at the generator:
For a single operator in one variable the free resolution is two terms long, because is a domain and right multiplication by is injective:
Applying and identifying with turns the resolution into a two-term complex given by the action of itself, so that
and all higher groups vanish. The kernel is the solution space of the homogeneous equation; the cokernel is the obstruction space for the inhomogeneous equation , which is solvable in for every precisely when that cokernel is zero.
Left exactness in general: for a short exact sequence of -modules,
Variable Definitions
- the -th Weyl algebra over a field of characteristic zero
- the left ideal generated by the operators of the system
- the module of the system, with canonical generator
- the target module in which solutions are sought
- the space of -linear maps , that is the solution space
- the first derived functor of Hom, the obstruction space for inhomogeneous problems
- the polynomial ring as a left -module
- the smooth real functions on an open set , a left -module
- the holomorphic functions on an open set , a left -module
- the module of microfunctions in one variable
Properties and Behaviour
Left exactness, and its failure to be exactness
For fixed the functor is additive, contravariant and left exact: it converts a short exact sequence into the exact sequence (6.13). It is exact for every if and only if is an injective -module, which the usual function modules are not.
An explicit failure of exactness
Take , and the exact sequence . Since is a domain, as a left module, so applying gives the complex
whose right-hand map is multiplication by : injective, with image . The cokernel is one-dimensional, so . Concretely: has a polynomial solution exactly when , and the single condition is the obstruction group.
Ordinary equations have finite-dimensional solution spacesCoutinho, Ch. 6 §4, Exercise 4.2
Let have order in . Then the space of polynomial solutions of has dimension at most ; in particular it is finite-dimensional.
Reason: if then is a non-zero polynomial and the only polynomial solution is . If , write with and pick with . Near the equation is an ordinary linear differential equation with analytic coefficients and non-vanishing leading coefficient, so its analytic solution space there has dimension exactly . Polynomial solutions inject into that space, since a polynomial vanishing to infinite order at is zero.
Partial equations need notCoutinho, Ch. 6 §4, Exercise 4.1
Let . The polynomials , , are all solutions of : applying the operator gives . They have distinct degrees, so they are linearly independent and the polynomial solution space is infinite-dimensional. In fact, in characteristic zero it is exactly , the invariants of the infinitesimal rotation.
This is consistent with the dimension theory: has , so it is not holonomic and no finiteness theorem applies.
The finiteness theorem that does hold
If and are both holonomic -modules then , and indeed every , is a finite-dimensional -vector space. This is proved in Björk and in Hotta-Takeuchi-Tanisaki rather than in the primer, and it is the correct generalisation of the one-variable statement above, since is holonomic and is holonomic for every non-zero . Nothing of the kind is available when fails to be holonomic.
Examples and Special Cases
A catalogue of targets
- , the polynomial module: the classical polynomial solutions.
- , formal power series: formal solutions, always at least as many as convergent ones.
- for open: holomorphic solutions, the natural target in one complex variable.
- for open, over : smooth solutions.
- a module of distributions, hyperfunctions or microfunctions: generalised solutions.
- : solutions with poles along , the setting of the Bernstein-Sato polynomial.
- itself: not a solution space in any classical sense, but the dual module, whose derived version drives duality theory.
Constants and de Rham cohomology
Take . Then (6.10) gives , the constants of . For this is , so .
For and the constants are again , but now is one-dimensional, spanned by the class of , which has no antiderivative in . That one dimension is the residue, and the computation is the algebraic de Rham cohomology of the punctured line.
A solution space that a bigger target creates
has . For or this kernel is zero, because both are domains. For it is one-dimensional. The worked example below carries out the computation.
Worked Example
Where does have a solution?
- Step 1 - the module and the general shape of the answer
The system is the single equation in one variable, so and , a non-zero module with -basis the classes of , . By (6.12), for every left -module ,
- Step 2 - polynomials and rational functions with poles at 0
: multiplication by is injective, so the solution space is . The cokernel is , one-dimensional.
: multiplication by is now bijective, being invertible with inverse multiplication by . So both the solution space and the obstruction space are . Enlarging the target from to has removed the obstruction without creating a solution.
- Step 3 - the quotient module, where the solution appears
Take , a left -module because is a submodule of . Its elements are classes of finite sums , and the classes of form a -basis.
Compute the action of on such a class:
since the constant lies in and dies in the quotient. The class is killed exactly when . Hence is one-dimensional.
- Step 4 - identify the solution
So has, up to scalars, exactly one solution in , namely the class of . Its annihilator in is : it is killed by , and no operator of lower complexity kills it, so . In the analytic setting the same computation produces the Dirac delta, which appears as the class of ; see the delta page and microfunctions.
Check the identification by hand: , so the classes for are, up to non-zero scalars, the basis of . Thus the cyclic submodule generated by is all of , and .
- Step 5 - read off what changed
The module was the same in all three computations. The solution space went , , ; the obstruction space went , , . Nothing about the equation changed - only the category in which one agreed to look.
For : with ; with ; and , spanned by the class of , which is the algebraic Dirac delta. Moreover as -modules.
Applications and Industry Use
In a mathematics topic, this section covers downstream use inside mathematics, computing and engineering rather than a manufactured product.
- Deciding solvability by computer. Since solution spaces are spaces, algorithms for polynomial and rational solutions of a system are algorithms computing for structured , and they run on the presentation of rather than on the equations as written.
- Holonomic rank and asymptotics. For a holonomic system, the dimension of the solution space in formal or convergent power series at a generic point equals the holonomic rank, which is computed from the module. This is how one predicts the number of independent special functions attached to a system before finding any of them.
- Integral transforms. The Fourier transform is an automorphism of , so it transports solution spaces between modules; a hard equation can be traded for an easy one by transporting the module rather than the functions.
- Riemann-Hilbert. Assigning to a holonomic module its solution complex in a suitable analytic target is the functor at the heart of the Riemann-Hilbert correspondence; the derived version, not just , is what makes the correspondence an equivalence.
- Engineering models. In the behavioural approach to linear systems, the solution set of a system of operator equations in a chosen signal space is exactly a space, and the choice of signal space - smooth, distributional, or discrete - is made explicitly for the same reasons as here.
Design Considerations
For a mathematical object, design considerations are the modelling choices: which ring, which filtration, which category to work in.
Choosing is the main design decision on this page, and the choices are not interchangeable.
| Target | What solutions mean | Typical difficulty |
|---|---|---|
| polynomial solutions | often zero; purely algebraic | |
| formal solutions | largest; convergence not addressed | |
| holomorphic solutions | sensitive to the shape of | |
| smooth real solutions | not finitely generated; analysis required | |
| distributions | weak solutions | existence theorems available |
| , microfunctions | singularity-level solutions | algebraically constructed as a direct limit |
A second decision is whether to work with alone or with the whole derived functor. For a single equation, and together already answer both the homogeneous and inhomogeneous questions, and stopping at discards the second. For systems, the full solution complex is the object that behaves well under the operations of the theory.
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.
Solution spaces are computed from a presentation of , never from the equations in raw form.
- Compute a Gröbner basis of in ; this gives a normal form for elements of and, by taking leading terms, its dimension and multiplicity.
- For polynomial solutions, bound the degree of a possible solution using the module invariants, then solve the resulting finite linear system over .
- For rational solutions, first compute the singular locus from the characteristic variety, bound the pole orders, and reduce again to linear algebra.
- For power series solutions at a point, compute the indicial equation from a Gröbner deformation and read off the exponents.
- For groups, build a free resolution of over and apply termwise; the resolution has length at most for holonomic .
The Dmodules package of Macaulay2 implements holonomic rank, restriction and computations of exactly this shape; dmod.lib in Singular and ore_algebra in SageMath cover overlapping ground. Note the practical asymmetry: computing is routine, while computing requires to be given by finite data, which excludes and all genuinely analytic targets.
Limits of Validity
- No existence is asserted. The theorem is a bijection between two possibly empty sets. It gives no reason for a solution to exist in a given target, and none of the classical existence theorems follow from it.
- No finite dimension in general. can be infinite-dimensional over , already for one equation in two variables. Finiteness requires holonomicity of both and , and that is a theorem beyond the primer.
- Homogeneous systems only. Inhomogeneous problems are not solution spaces of a module; they are questions about , or about a coset inside .
- No topology. All of this is algebra. Statements about approximate solutions, stability under perturbation, or convergence of formal solutions are invisible to and must be imported from analysis.
Failure Modes and Common Mistakes
Treating the solution space as a module over the functions
Solutions can be added and scaled by constants, not multiplied by polynomials: if then in general, because does not commute with . Correspondingly is only a -vector space. Code that stores solution spaces as modules over the coefficient ring will silently produce nonsense.
Confusing with
The subscript is the whole content. -linear maps form a huge space with no relation to the differential equation; the -linear ones are the solutions. When is presented by a matrix, this is the difference between solving a linear system over and solving one over .
Assuming a bigger target always gives more solutions
It does when the enlargement is an inclusion of -modules, since is left exact. It does not for quotients: passing from to is not an enlargement, yet the solution space of grows from to . The correct statement mentions the map, not the size.
Expecting the correspondence to be exact
Passing from a module to its solution space converts a surjection into an injection but need not convert an injection into a surjection. Deducing that every solution of a subsystem extends to a solution of the full system is the standard form of this error, and the discrepancy is precisely .
Historical Notes
Reading a solution as a homomorphism goes back to the constant-coefficient theory, where a system corresponds to a module over a polynomial ring and solutions in a signal space are homomorphisms into it; this is the algebraic core of the Ehrenpreis-Palamodov fundamental principle of the 1960s. The variable-coefficient version is due to Kashiwara, whose 1970 thesis made the solution complex, rather than the solution space, the object of study, and proved the finiteness theorems that make it usable.
The insistence that the derived functor and not merely carries the information is what later became the Riemann-Hilbert correspondence, established by Kashiwara and independently by Mebkhout around 1980. The elementary statement presented here, restricted to and to the Weyl algebra, is the entry point to that circle of ideas and is the form in which Coutinho's primer introduces it.
Comparison
| Question | Module-theoretic form | Answer for , |
|---|---|---|
| Which satisfy ? | ||
| Which admit ? | image of | |
| What obstructs ? | , detected by | |
| Higher obstructions? | for | all zero, the resolution has length one |
Key Takeaways
Key points
- For and any left -module , evaluation at the canonical generator is a -linear bijection from to the set of solutions of the system in .
- Solution spaces are vector spaces over only; they are not modules over or over the polynomial ring, because solutions are not closed under multiplication by functions.
- is contravariant and left exact; adding equations shrinks the module and shrinks the solution space.
- For one operator, and : homogeneous solutions and inhomogeneous obstructions in one formula.
- Solution spaces can be zero, finite-dimensional, or infinite-dimensional; one ordinary equation of order has at most independent polynomial solutions, while one partial equation may have infinitely many.
- Generalised solutions are not a new theory but a new target module, which is why distributions, hyperfunctions and microfunctions fit into the same statement.
FAQs
Why is the solution space only a vector space and not a module?
Because multiplying a solution by a function destroys the equation: involves derivatives of and does not vanish. Formally, fails to commute with the action of unless acts as zero. Only the constants survive, and the constants of are .
Does the theorem require to be finitely generated?
No, and it must not. The interesting targets are not finitely generated: is not, nor is the module of germs of holomorphic functions. Only the module of the system is required to be finitely generated, which it is automatically.
Can the solution space be infinite-dimensional?
Yes. The operator in two variables annihilates every polynomial in , so its polynomial solution space is infinite-dimensional. Finiteness is a consequence of holonomicity, not of the correspondence itself.
What does mean concretely?
For a single operator it is the cokernel of the action of on the target: the space of inhomogeneous right-hand sides for which has no solution, modulo those for which it does. For and target , that space is one-dimensional and is detected by the single condition .
If the module is non-zero, must there be a solution somewhere?
There is always a tautological one: the canonical generator is a solution in itself, corresponding to the identity homomorphism. Whether there is a solution in a target of independent interest is a different question, and shows the answer can be no for every classical target.
How does this relate to the classical count of solutions of an ODE?
For an ordinary equation of order with non-vanishing leading coefficient near a point, the analytic solution space near that point has dimension exactly , and the module-theoretic invariant reproducing is the holonomic rank. Polynomial solutions are a subspace of that and can be much smaller.
Why insist on a functor rather than just the isomorphism?
Because the operations of the theory - restricting to a subvariety, integrating along a fibre, changing coordinates - are functors on modules, and functoriality is what transports them to solution spaces. Without it, each such operation would have to be re-derived for each function space.
Is there a version for right modules?
Yes, symmetrically, and the transposition anti-automorphism converts between them. Right modules are the natural home for densities, so integration-type statements are usually phrased there; see side-changing functors.
References
- S. C. Coutinho, A Primer of Algebraic D-modules, London Mathematical Society Student Texts 33, Cambridge University Press, 1995 - Ch. 6 §1, Theorem (6.1.2), and Exercises 4.1-4.4 of that chapter.
- M. Kashiwara, Algebraic Study of Systems of Partial Differential Equations, master's thesis, University of Tokyo 1970; Mémoires de la Société Mathématique de France 63, 1995 - solution complexes and finiteness.
- J.-E. Björk, Rings of Differential Operators, North-Holland, 1979 - Ch. 1 and Ch. 5, for finiteness of Hom and Ext between holonomic modules.
- R. Hotta, K. Takeuchi and T. Tanisaki, D-modules, Perverse Sheaves, and Representation Theory, Progress in Mathematics 236, Birkhäuser, 2008 - Ch. 4 and Ch. 7, for the solution functor and Riemann-Hilbert.
- M. Saito, B. Sturmfels and N. Takayama, Gröbner Deformations of Hypergeometric Differential Equations, Springer, 2000 - algorithms for polynomial, rational and series solutions.
- L. Ehrenpreis, Fourier Analysis in Several Complex Variables, Wiley-Interscience, 1970 - solutions as homomorphisms in the constant-coefficient case.
- J. C. McConnell and J. C. Robson, Noncommutative Noetherian Rings, revised edition, American Mathematical Society, 2001 - Ch. 7, for Hom and Ext over Noetherian noncommutative rings.
- Macaulay2
Dmodulespackage documentation -holonomicRank,DrestrictionComplexand Ext computations over the Weyl algebra.
AI Suggested Questions
- Compute for , and .
- Show that and interpret the statement about antiderivatives.
- Find all polynomial solutions of and describe the corresponding module.
- Prove that an inclusion of target modules induces an injection of solution spaces, and give an example where it is not a bijection.
- Work out the solution space of in and in .
- Explain why is a right module over and compute that ring for .
- Give a system whose polynomial solution space is zero but whose formal power series solution space is infinite-dimensional.
