Overview
Twisting takes a left -module and an automorphism of and returns a new module : the same abelian group, with now acting the way used to act. The construction is cheap, it preserves simplicity, and has a very large automorphism group. So it is a factory for producing modules. The question this page settles is whether the factory produces anything genuinely new, and how one tells two of its products apart.
The answer, for the family that matters most, is completely clean. Fix polynomials satisfying the integrability condition , and let be the automorphism with and . Then is simple, and
Different data give non-isomorphic modules, with no exceptions and no coincidences. Coutinho proves the special case , , which already gives an infinite family of pairwise non-isomorphic simple -modules; (5.1) upgrades that to a family indexed by all integrable , which over is uncountable.
Two mechanisms drive the proof, and both are worth carrying away. First, a homomorphism out of a cyclic module is determined by the image of the generator, so an isomorphism question becomes a differential equation for a single polynomial. Second, a nonzero map between simple modules is automatically an isomorphism, so a non-surjective candidate map is a contradiction rather than a partial result. Beyond this family the isomorphism problem is hard: classifying all simple -modules is a genuinely difficult piece of ring theory, and twisting sees only a corner of it.
Definition
Throughout, is a field of characteristic zero, , and acts on in the standard way: multiplies, differentiates. See the polynomial module for that action and its simplicity.
Twist by an automorphismCoutinho, Ch. 5 §2
Let be a ring, a left -module and an automorphism of . The twisted module has the same underlying abelian group as , with the action
Associativity holds because is multiplicative: .
The exponential twists of the polynomial module
Let with and for all . The assignments , preserve all the defining relations of — the integrability condition is exactly — and therefore define an endomorphism , which is an automorphism with inverse . Write .
If each depends only on , integrability is automatic; that is the case Coutinho uses.
Twisting a quotientCoutinho (5.2.1)(4)
For a left ideal of and an automorphism , . Indeed the map sending is a surjective homomorphism of left -modules with kernel .
The inverse is not decoration
It is , not . The two choices produce genuinely different modules: for one gets , whereas the wrong version returns , and by (5.1) those two are not isomorphic unless .
Core Concepts
Twisting is an action of the automorphism group on isomorphism classes
A direct computation gives and , and an isomorphism is still an isomorphism . So twisting is a right action of on the set of isomorphism classes of -modules. Consequently
and the whole isomorphism problem for twists of a fixed collapses to the computation of one subgroup: the stabiliser .
Inner automorphisms never help
If for a unit , then is an isomorphism , so inner automorphisms lie in every stabiliser. For the Weyl algebra this observation is empty: because Bernstein degree is additive, the units of are the nonzero scalars, so the only inner automorphism is the identity. Every automorphism of is outer, and none of them is automatically trivial on isomorphism classes. Which of them act trivially has to be decided case by case.
The twist of is a differential equation
The module is the D-module of the system . Its formal solution is the exponential , which is a genuine function but not a polynomial. Twisting by is therefore the algebraic shadow of the gauge transformation : it multiplies solutions by an exponential factor without changing the underlying vector space. The isomorphism question becomes: when do two exponential factors differ by a polynomial factor? The answer, over a polynomial ring, is never — unless they are equal.
Construction and Proof
Isomorphism criterion for exponential twists
Let be integrable vectors of polynomials. Then every -homomorphism has the form for a unique satisfying (5.4), and conversely. Consequently if and only if , and .
Proof
Step 1: a homomorphism is multiplication by a polynomial. In both modules acts by ordinary multiplication, because . The element generates , and for we have . So is determined by , and .
Step 2: equivariance for is equation (5.4). On the one hand in , so . On the other hand in . Equating gives . The computation reverses: if satisfies these equations then is -linear, since .
Step 3: a nonzero forces to be a constant. Both and are simple, being twists of the simple module . A nonzero homomorphism between simple modules is an isomorphism, so multiplication by must be surjective onto . Multiplication by has image , which is all of only if is a unit of , that is a nonzero scalar.
Step 4: conclude. If then , so (5.4) gives and hence for every , because is a domain. Conversely gives the identity map. Taking in Steps 1–4 shows every endomorphism is multiplication by a scalar.
A proof by degree, without simplicity
Step 3 can be replaced by a bare degree count, which is how Coutinho argues (5.2.3). Suppose satisfies (5.4) and for some . If then , so and the domain property gives . If then , while . The two sides of (5.4) cannot agree. The degree version is what makes the argument survive when one only knows a nonzero map exists.
An infinite family of simple modulesCoutinho (5.2.3)
The modules , , where and , are simple and pairwise non-isomorphic. Over the larger family is uncountable, so has uncountably many pairwise non-isomorphic simple modules even though it is a simple Noetherian domain.
Key Equations
The presentation of an exponential twist, obtained by applying the twisting-a-quotient proposition to and :
The equation that any homomorphism must satisfy, where is the image of the generator:
Coutinho's family is ; for and , equation (5.4) reads
which has no nonzero polynomial solution, because the left side has strictly smaller degree in than the right.
For the twists are separated by a numerical invariant as well. With the filtration induced by the generator,
Variable Definitions
- the ground field, of characteristic zero
- the -th Weyl algebra over , with generators
- the polynomial ring , viewed as a left -module
- the polynomial ring in the , viewed as
- automorphisms of
- the twist of by , with action
- a vector of polynomials with
- the automorphism ,
- the twisted module
- the Fourier transform automorphism, ,
Properties and Behaviour
What twisting preservesCoutinho (5.2.1)
For any ring , automorphism and left -module : is simple if and only if is; is a torsion module if and only if is; and for every submodule . In fact is an equivalence of the category of left -modules with itself, so every purely categorical property — length, indecomposability, projectivity, the lattice of submodules, groups — is preserved.
Dimension is a twist invariant; multiplicity is not
Let be an automorphism of and let be the largest Bernstein degree of , so that . If is finitely generated with generators , the filtration on satisfies , where is the corresponding filtration on and is the span of the generators. Hence , a polynomial in of degree , giving ; applying the same argument to gives equality. The multiplicity only obeys the weaker bound , and (5.6) shows it is genuinely not invariant: while , with , so the bound is sharp.
In particular twisting preserves holonomicity, which is why all the modules are holonomic — a family of holonomic modules as large as the family of integrable .
The Fourier transform moves Coutinho (5.2.2)
Let be the automorphism , (an automorphism because ). Then , so . Moreover : in the element is nonzero and killed by every , whereas in the operator acts by multiplication in a domain and so kills nothing nonzero.
Since sends and , we get and hence . The orbit of under the cyclic group generated by has exactly two elements, and .
| Automorphism | Action on generators | Class moved? | |
|---|---|---|---|
| Translation | , | no | |
| Scaling | , | no | |
| Shear in | , | no | |
| Exponential twist | , | yes, unless | |
| Fourier | , | yes | |
| , | no |
Examples and Special Cases
The first twist,
For and the module is , whose analytic solution is . It is simple, holonomic, and has , exactly like — yet it is not isomorphic to , because has no nonzero polynomial solution. This is the smallest case where the numerical invariants fail and equation (5.4) is needed.
Twists that change nothing
Take but a translation , . Then fixes each , so and . Concretely, translation of the variable permutes polynomials without disturbing the flat vector . A nontrivial automorphism can therefore lie in the stabiliser: outer does not mean class-moving.
Two twists in two variables
In take , which is integrable since ; the corresponding module is , with solution . Take , giving . By (5.1) they are not isomorphic; equation (5.4) here reads and , which no nonzero polynomial satisfies.
The vector is not integrable (), so it defines no automorphism; the corresponding system , is inconsistent, and the module is not a twist of .
The Dirac module under Fourier transform
The delta module is . Since , its Fourier twist is . Twisting therefore exchanges the two standard simple modules, matching the analytic statement that the Fourier transform of the delta distribution is a constant.
Worked Example
Separating the twists numerically:
- Step 1 - fix the module and its action
Take and with , and . The underlying space is ; the action is
By (5.3), . Filter by , where is the Bernstein filtration; this is a good filtration because it is generated by the single generator .
- Step 2 - compute the first pieces for
. For : the spanning set of is , acting on to give , , and . So and .
For : adds . We get and , so enters. Collecting, and . The pattern matches .
- Step 3 - prove is the space of polynomials of degree at most
Upper bound: multiplying by raises degree by , and raises it by at most , so lies in the polynomials of degree .
Lower bound, by induction. Suppose contains every polynomial of degree . Then contains everything of degree , and for we have , whence for all such . Those exponents cover , so contains everything of degree .
- Step 4 - read off dimension and multiplicity
The Hilbert polynomial is , of degree . So : every is holonomic. The leading coefficient is , so .
Cross-check against the presentation: for of Bernstein degree one has , and has Bernstein degree . The two computations agree.
- Step 5 - conclude
Multiplicity is an isomorphism invariant, so would force . This reproves the corollary for without touching equation (5.5), and it does more: it exhibits an explicit invariant that separates the members of the family.
is holonomic with and . In particular gives , the same multiplicity as itself, so multiplicity alone does not separate from — for that pair one still needs equation (5.4), which gives and hence no nonzero polynomial solution.
Applications and Industry Use
In a mathematics topic, this section covers downstream use inside mathematics, computing and engineering rather than a manufactured product.
- Exponential factors and irregular singularities. Twisting by is the algebraic form of multiplying solutions by . In the analytic theory of irregular connections, exactly these exponential factors are the discrete data attached to a singular point, and (5.1) is the algebraic reason they cannot be absorbed by a polynomial change of variable.
- Supply of test objects. Every construction in the theory — dimension, characteristic variety, inverse and direct images — needs a stock of modules on which to be tested. The family is cheap, explicit, holonomic, and has adjustable multiplicity, which makes it the natural stress test.
- Fourier methods. Realising the Fourier transform as a twist converts constant-coefficient operators into polynomials and back. This is what makes the module-theoretic proof of results about constant-coefficient equations short, and it is used in the same way in the theory of the Fourier–Laplace transform of D-modules.
- Counterexample construction. Because the family is uncountable while is countable when is, the twists show that the set of isomorphism classes of simple -modules is strictly larger than any list of finitely presented normal forms one might hope for. See the catalogue of counterexamples.
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.
Deciding is an isomorphism test between two cyclic presentations, and it reduces to a computation:
- Compute Gröbner bases of and in the Weyl algebra with respect to a term order refining the Bernstein filtration.
- For increasing degree bounds , solve the linear system over describing modulo .
- For holonomic modules the answer stabilises at a computable bound, so the procedure terminates; a nonzero solution gives a candidate map, and one checks surjectivity and injectivity by comparing multiplicities.
- Cheap pre-filter: compute and for both modules first. Different multiplicities settle the question immediately and cost far less than the Hom computation.
The Dmodules package in Macaulay2 implements homomorphism and Ext computations between holonomic modules following Tsai and Walther; dmod.lib in Singular and the ore_algebra package in SageMath provide the underlying Gröbner engines. Note that a negative answer from a degree-bounded search is only conclusive once the bound is justified — an unbounded search that finds nothing proves nothing.
Limits of Validity
The clean criterion (5.1) is a statement about one family, not a general solution to the isomorphism problem.
- It applies to twists of by automorphisms fixing all the . For a general pair the reduction (5.2) still holds, but computing the stabiliser of inside is not settled by anything on this page.
- Characteristic zero is required. In characteristic the module is not simple — the subspace spanned by the -th powers is a submodule — so Step 3 of the proof collapses, and itself is no longer simple. See the positive characteristic page.
- Integrability cannot be dropped. If then is not an endomorphism of at all, and the module is something else entirely — it can even be zero.
- The family does not exhaust the simple modules. Classifying simple -modules is a hard open-ended problem; Block's 1981 work reduces it to conjugacy classes of certain irreducible elements, and the exponential twists are only one visible slice of it.
What the criterion does not say
It says nothing about isomorphisms of with modules constructed some other way. For instance the localisation is holonomic of multiplicity but is not simple, so it is not an ; ruling out such coincidences in general requires invariants beyond , such as the characteristic variety or the lattice of submodules.
Failure Modes and Common Mistakes
Assuming a cyclic presentation is unique
A cyclic module is for many different left ideals : the ideal depends on the generator chosen. Take over . With the generator we get . With the generator — which also generates, since is simple — we get , and this ideal is not principal: if it were , then would have to equal , forcing , and no such operator annihilates . So tells you nothing; only similarity of the ideals does.
Sign errors in the twist, and their cost
The two conventions and both define modules, and both appear in the literature. Under the first, ; under the second, the sign of flips. By (5.1) the two answers are non-isomorphic modules whenever , so this is not a cosmetic ambiguity. State the convention before computing, and check it against the case .
