数学同调代数的公理化体系及局部化的另一种方法
An Axiomatic Setup for Algorithmic Homological Algebra and an Alternative Approach to Localization
摘要:
本文建立了阿贝尔范畴的算法同调代数的一个公理系统。这是通过展示所有进入阿贝尔范畴定义的存在量词来完成的,为了可计算性,需要将其转化为构造性量词。我们明确地对经常研究的所谓可计算环$R$上的可表示模的阿贝尔范畴的例子这样做,即,一个具有显式算法的环,用于求解$R$上的单侧(内)齐次线性系统。对于交换环$R$中的一个非线性生成的极大理想$\mathfrak{m}$,我们证明了如何求解$R_{\mathfrak{m}}$上的齐次线性系统可以归结为求解$R$上的相关系统。因此,$R$的可计算性意味着$R_{\mathfrak{m}}$的可计算性。作为推论,我们得到了不需要Mora-like算法的条件下,可表示的$R_{\mathfrak{m}}$ -模范畴作为一个阿贝尔范畴的可计算性.减少也产生,作为一个副产品,一个复杂性估计的理想成员问题的局部多项式环。最后,在本地化的多项式环的情况下,我们证明了我们的同调动机的替代方法相比,现有的实现莫拉算法的计算优势。
英文摘要:
In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of computability need to be turned into constructive ones. We do this explicitly for the often-studied example Abelian category of finitely presented modules over a so-called computable ring $R$, i.e., a ring with an explicit algorithm to solve one-sided (in)homogeneous linear systems over $R$. For a finitely generated maximal ideal $\mathfrak{m}$ in a commutative ring $R$ we show how solving (in)homogeneous linear systems over $R_{\mathfrak{m}}$ can be reduced to solving associated systems over $R$. Hence, the computability of $R$ implies that of $R_{\mathfrak{m}}$. As a corollary we obtain the computability of the category of finitely presented $R_{\mathfrak{m}}$-modules as an Abelian category, without the need of a Mora-like algorithm. The reduction also yields, as a by-product, a complexity estimation for the ideal membership problem over local polynomial rings. Finally, in the case of localized polynomial rings we demonstrate the computational advantage of our homologically motivated alternative approach in comparison to an existing implementation of Mora's algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。