HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Constructive Computation of Bases of Free Modules over the Weyl Algebras

Abstract : A well-known result due to J. T. Stafford asserts that a stably free left module $M$ over the Weyl algebras $D=A_n(k)$ or $B_n(k)$ $-$ where $k$ is a field of characteristic $0$ $-$ with $rank_D(M) \geq2$ is free. The purpose of this paper is to present a new constructive proof of this result as well as an effective algorithm for the computation of bases of $M$. This algorithm, based on the new constructive proofs of J. T. Stafford's result on the number of generators of left ideals of $D$, performs Gaussian elimination on the formal adjoint of the presentation matrix of $M$. We show that J. T. Stafford's result is a particular case of a more general one asserting that a stably free left $D$-module $M$ with $rank_D(M) \geqsr(D)$ is free, where $sr(D)$ denotes the stable range of a ring $D$. This result is constructive if the stability of unimodular vectors with entries in $D$ can be tested. Finally, an algorithm which computes the left projective dimension of a general left $D$-module $M$ defined by means of a finite free resolution is presented. It allows us to check whether or not the left $D$-module $M$ is stably free.
Document type :
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 7:37:08 PM
Last modification on : Friday, February 4, 2022 - 3:18:56 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:41:56 PM


  • HAL Id : inria-00070235, version 1



Alban Quadrat, Daniel Robertz. Constructive Computation of Bases of Free Modules over the Weyl Algebras. [Research Report] RR-5786, INRIA. 2005, pp.33. ⟨inria-00070235⟩



Record views


Files downloads