Maximal (semi-)lattices of fractions and injective hulls

1995 ◽  
Vol 51 (1) ◽  
pp. 105-115
Author(s):  
W. Thurnherr ◽  
J. Schmid
Keyword(s):  
2010 ◽  
Vol 52 (A) ◽  
pp. 53-59 ◽  
Author(s):  
PAULA A. A. B. CARVALHO ◽  
CHRISTIAN LOMP ◽  
DILEK PUSAT-YILMAZ

AbstractThe purpose of this paper is to study finiteness conditions on injective hulls of simple modules over Noetherian down-up algebras. We will show that the Noetherian down-up algebras A(α, β, γ) which are fully bounded are precisely those which are module-finite over a central subalgebra. We show that injective hulls of simple A(α, β, γ)-modules are locally Artinian provided the roots of X2 − αX − β are distinct roots of unity or both equal to 1.


1980 ◽  
Vol 45 (3) ◽  
pp. 544-548 ◽  
Author(s):  
Wilfrid Hodges

Let A be an abelian group and B a pure injective pure extension of A. Then there is a homomorphic image C of B over A which is a pure injective hull of A; C can be constructed by using Zorn's lemma to find a suitable congruence on B. In a paper [4] which greatly generalises this and related facts about pure injectives, Walter Taylor asks (Problem 1.5) whether one can find a “construction” of C which is more concrete than the one mentioned above; he asks also whether the points of C can be explicitly described. In this note I return the answer No.


2015 ◽  
Vol 43 (10) ◽  
pp. 4221-4230 ◽  
Author(s):  
Paula A. A. B. Carvalho ◽  
Can Hatipoğlu ◽  
Christian Lomp

2014 ◽  
Vol 91 (1) ◽  
pp. 62-70 ◽  
Author(s):  
Xia Zhang ◽  
Valdis Laan
Keyword(s):  

2013 ◽  
Vol 378 ◽  
pp. 207-216
Author(s):  
Boris M. Schein

1970 ◽  
Vol 13 (1) ◽  
pp. 115-118 ◽  
Author(s):  
G. Bruns ◽  
H. Lakser

A (meet-) semilattice is an algebra with one binary operation ∧, which is associative, commutative and idempotent. Throughout this paper we are working in the category of semilattices. All categorical or general algebraic notions are to be understood in this category. In every semilattice S the relationdefines a partial ordering of S. The symbol "∨" denotes least upper bounds under this partial ordering. If it is not clear from the context in which partially ordered set a least upper bound is taken, we add this set as an index to the symbol; for example, ∨AX denotes the least upper bound of X in the partially ordered set A.


Sign in / Sign up

Export Citation Format

Share Document