zbMATH — the first resource for mathematics

Generalized equivalence of matrices over normal domains. (English) Zbl 0806.16030
The homotopy classes of homomorphisms of \(R\) (a commutative ring) form a commutative monoid \(M(R)\) with 0 with product. Let \(M(R)^*\) denote the non-zero elements of \(M(R)\). Let \(R\) denote a noetherian integrally closed domain, let \(X_ 1(R)\) be the set of height 1 primes of \(R\). For each \(P \in X_ 1(R)\) the localization \(R_ P\) is a discrete valuation ring.
In this article the authors examine the natural map \(\phi: M(R)^* \to \bigoplus_{P \in X_ 1(R)} M(R_ P)^*\). They show \(\phi\) is an epimorphism. They determine the congruence on \(M(R)^*\) induced by \(\phi\). As a result the authors show \(\phi\) is an isomorphism if and only if \(R\) is a Dedekind domain. They provide a unique representing matrix for each homotopy class over a Dedekind domain. These last two results improve and simplify those in Section 2 of F. R. DeMeyer and T. J. Ford [J. Algebra 113, 379-398 (1988; Zbl 0654.13016)].
Reviewer: Y.Kuo (Knoxville)
16S50 Endomorphism rings; matrix rings
13F05 Dedekind, Prüfer, Krull and Mori rings and their generalizations
20M20 Semigroups of transformations, relations, partitions, etc.
13B10 Morphisms of commutative rings
20M14 Commutative semigroups
15A69 Multilinear algebra, tensor calculus
Full Text: DOI
[1] Bourbaki N., Commutative Algebra (1972)
[2] DOI: 10.1016/0021-8693(88)90167-6 · Zbl 0654.13016 · doi:10.1016/0021-8693(88)90167-6
[3] DOI: 10.1155/S0161171291000881 · Zbl 0749.13011 · doi:10.1155/S0161171291000881
[4] DOI: 10.1080/00927878808823582 · Zbl 0638.13008 · doi:10.1080/00927878808823582
[5] DOI: 10.1007/BF01279308 · Zbl 0211.36903 · doi:10.1007/BF01279308
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.