In algebra, linear equations and systems of linear equations over a field are widely studied. "Over a field" means that the coefficients of the equations and the solutions that one is looking for belong to a given field, commonly the real or the complex numbers. This article is devoted to the same problems where "field" is replaced by "commutative ring", or "typically Noetherian integral domain". In the case of a single equation, the problem splits in two parts. First, the ideal membership problem, which consists, given a non-homogeneous equation
a 1 x 1 + ⋯ + a k x k = b {\displaystyle a_{1}x_{1}+\cdots +a_{k}x_{k}=b}
with a 1 , … , a k {\displaystyle a_{1},\ldots ,a_{k}} and b in a given ring R, to decide if it has a solution with x 1 , … , x k {\displaystyle x_{1},\ldots ,x_{k}} in R, and, if any, to provide one. This amounts to decide if b belongs to the ideal generated by the ai. The simplest instance of this problem is, for k = 1 and b = 1, to decide if a is a unit in R. The syzygy problem consists, given k elements a 1 , … , a k {\displaystyle a_{1},\ldots ,a_{k}} in R, to provide a system of generators of the module of the syzygies of ( a 1 , … , a k ) , {\displaystyle (a_{1},\ldots ,a_{k}),} that is a system of generators of the submodule of those elements ( x 1 , … , x k ) {\displaystyle (x_{1},\ldots ,x_{k})} in Rk that are solutions of the homogeneous equation
a 1 x 1 + ⋯ + a k x k = 0. {\displaystyle a_{1}x_{1}+\cdots +a_{k}x_{k}=0.}
The simplest case, when k = 1 amounts to find a system of generators of the annihilator of a1. Given a solution of the ideal membership problem, one obtains all the solutions by adding to it the elements of the module of syzygies. In other words, all the solutions are provided by the solution of these two partial problems. In the case of several equations, the same decomposition into subproblems occurs. The first problem becomes the submodule membership problem. The second one is also called the syzygy problem. A ring such that there are algorithms for the arithmetic operations (addition, subtraction, multiplication) and for the above problems may be called a computable ring, or effective ring. One may also say that linear algebra on the ring is effective. The article considers the main rings for which linear algebra is effective.
Generalities To be able to solve the syzygy problem, it is necessary that the module of syzygies is finitely generated, because it is impossible to output an infinite list. Therefore, the problems considered here make sense only for a Noetherian ring, or at least a coherent ring. In fact, this article is restricted to Noetherian integral domains because of the following result.
Given a Noetherian integral domain, if there are algorithms to solve the ideal membership problem and the syzygies problem for a single equation, then one may deduce from them algorithms for the similar problems concerning systems of equations. This theorem is useful to prove the existence of algorithms. However, in practice, the algorithms for the systems are designed directly. A field is an effective ring as soon one has algorithms for addition, subtraction, multiplication, and computation of multiplicative inverses. In fact, solving the submodule membership problem is what is commonly called solving the system, and solving the syzygy problem is the computation of the null space of the matrix of a system of linear equations. The basic algorithm for both problems is Gaussian elimination.
Properties of effective rings Let R be an effective commutative ring.
… excerpt ends here. Continue reading the full article.
