Algorithmic proofs of two theorems of Stafford
Abstract
Two classical results of Stafford say that every (left) ideal of the n-th Weyl algebra An can be generated by two elements, and every holonomic An-module is cyclic, i.e. generated by one element. We modify Stafford's original proofs to make the algorithmic computation of these generators possible.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.