Weak Essential Submodules
نویسندگان
چکیده
منابع مشابه
The Sum Graph of Non-essential Submodules
Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...
متن کاملEssential Normality of Polynomial-generated Submodules: Hardy Space and Beyond
Recently, Douglas and Wang proved that for each polynomial q, the submodule [q] of the Bergman module generated by q is essentially normal [9]. Using improved techniques, we show that the Hardy-space analogue of this result holds, and more.
متن کاملEssential Weak Factorization Systems
We discuss a new type of weak factorization system. Although these systems provide (up to isomorphism) uniquely determined decompositions of morphisms, in general they do not constitute orthogonal factorizations and are not even functorial. Nevertheless, they arise naturally, as injective hulls or projective covers in comma categories. Surprisingly, often injective hulls and projective covers c...
متن کاملFinite unions of submodules ON FINITE UNIONS OF SUBMODULES
This paper is concerned with finite unions of ideals and modules. The first main result is that if N ⊆ N1 ∪N2 ∪ · · · ∪Ns is a covering of a module N by submodules Ni, such that all but two of the Ni are intersections of strongly irreducible modules, then N ⊆ Nk for some k. The special case when N is a multiplication module is considered. The second main result generalizes earlier results on co...
متن کاملWeak Theories and Essential Incompleteness
This paper is motivated by the following question: what is the weakest theory that is essentially incomplete or essentially undecidable? An axiomatic theory T is complete if it is consistent and for every sentence φ in its language it is the case that either T ` φ (the sentence φ is provable in T ) or T ` ¬φ (φ is refutable in T ). So if T is consistent and incomplete then there exist sentences...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Baghdad Science Journal
سال: 2009
ISSN: 2411-7986,2078-8665
DOI: 10.21123/bsj.6.1.214-221