<h3>A <span class="Heading">The Mathematical Idea behind <strong class="pkg">Modules</strong></span></h3>
<p>As finite dimensional constructions in linear algebra over a field <span class="SimpleMath">\(k\)</span> boil down to solving (in)homogeneous linear systems over <span class="SimpleMath">\(k\)</span>, the Gaussian algorithm makes the whole theory perfectly computable.</p>
<p>Hence, for homological algebra (viewed as linear algebra over general rings) to be computable one needs to find appropriate substitutes for the Gaussian algorithm, where finite dimensionality has to be replaced by finite generatedness.</p>
<p>Luckily such substitutes exist for many rings of interest. Beside the well-known Hermite normal form algorithm for principal ideal rings it turns out that appropriate generalizations of the classical Gröbner basis algorithm for polynomial rings provide the desired substitute for a wide class of commutative <em>and</em> noncommutative rings. Note that for noncommutative rings the above discussion has to be restricted to homological constructions leading to one-sided linear systems <span class="SimpleMath">\(XA=B\)</span> resp. <span class="SimpleMath">\(AX=B\)</span> (--> <a href="chap1_mj.html#X7C31B1FE786E596E"><span class="RefLink">Principal limitation</span></a>).</p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
