<i>h</i>-Divisible Modules (Q4803369)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1891865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | <i>h</i>-Divisible Modules |
scientific article; zbMATH DE number 1891865 |
Statements
<i>h</i>-Divisible Modules (English)
0 references
2 April 2003
0 references
\(h\)-divisible modules
0 references
pure-injective modules
0 references
cotorsion modules
0 references
projective dimension
0 references
envelope
0 references
Matlis domain
0 references
semi-Dedekind domain
0 references
0.8431941270828247
0 references
0.8251711130142212
0 references
0.8214548230171204
0 references
0.8019498586654663
0 references
The author characterizes domains over which every \(h\)-divisible module (i.e.\ factor of an injective module) has some additional property. Moreover, several properties of semi-Dedekind domains (i.e.\ domains over which \(h\)-divisible modules are pure-injective) are proven. -- Sample results: Every \(h\)-divisible module \(C\) is Matlis cotorsion (i.e.\ \(\text{ Ext}^1(Q,C) = 0\) where \(Q\) is the quotient field) if and only if the domain is a Matlis domain (theorem 3.1). Every \(h\)-divisible module \(C\) is Enochs cotorsion (i.e.\ \(\text{ Ext}^1(F,C) = 0\) for all flat module \(F\)) if and only if all flat modules have projective dimension at most \(1\) if and only if pure submodules of projective modules are projective (theorem 3.2). Semi-Dedekind domains have all the above properties (theorem 4.3) and hence they are Matlis domains (corollary 4.5). A Matlis domain is semi-Dedekind if and only if every torsion-free complete module is pure-injective (theorem 4.15). Every module over a semi-Dedekind domains has a \(\mathcal{P}_1\)-cover and a divisible envelope (theorem 4.10). Here \(\mathcal{P}_1\) is the class of modules of projective dimension at most \(1\).
0 references