![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
It is important to handle real-life problems algebraically, but as most of the real-life problems as well as the applications are imprecise(i.e. vague, inexact, or uncertain), it makes harder to analyze algebraically, while Rough Set Theory (RST) has the capability to deal imprecise problems. To solve imprecise problems algebraically, we investigated injective module based on RST.
Public Interest Statement
Algebra & Logics are most important to solve problems, but they are based on crisp set theory. Some authors investigated fuzziness in algebra. In view of uncertain data, we investigated injective module based on rough set theory. This work is in direction to handle imprecise situations algebraically. We hope these results will further enrich algebra to cover uncertain situations.
1. Introduction
The terminology injective module was originated by Carten and Eilenberg (Citation1956) to deal real-life situations algebraically; and then the dual concept projective module and injective module have been covered in many texts (Goldhaber & Enrich, Citation1970; Rebenboim, Citation1969; Rowen, Citation1991). These terms are based on crisp set theory and can handle only exact situations. In recent years, most data-sets are imprecise or the surrounding information is imprecise and our way of thinking or concluding depends on the information at our disposal. This means that to draw conclusions, we should able to process uncertain and/or incomplete information. To analyze any type of information, mathematical logics are most appropriate, so we should have to generalize the algebraic structures and the logic in sense of imprecise or vague. Rough set theory (RST) is a powerful mathematical tool to handle imprecise situations and rough algebraic structures can play a vital role to deal such situations.
In Pawlak’s RST, the key concept is an equivalence relation and the building blocks for the construction of the lower and upper approximations are the equivalence classes. The lower approximation of the given set is the union of all the equivalence classes which are the subsets of the set, and the upper approximation is the union of all the equivalence classes which have a non-empty intersection with the set. The object of the given universe can be divided into three classes with respect to any subset :
(1) | the objects which are definitely in A; | ||||
(2) | the objects which are definitely not in A; and | ||||
(3) | the objects which are possibly in A. |
The aim of this paper is to investigate the rough injective module. The rest of the paper is organized as follows: In Section 2, preliminaries are given. In Section 3, we introduce the concept of rough injective module. Finally, our conclusions are presented. We have used standard mathematical notation throughout this paper and we assume that the reader is familiar with the basic notions of algebra and RST.
2. Preliminaries
In this section, we give some basic definitions of rough algebraic structures and results which will be used later on.
Definition 2.1
(Pawlak, Citation1991) A pair , where
and
is an equivalence relation on U and is called an approximation space.
Definition 2.2
(Davvaz, Citation2004) For an approximation space , by a rough approximation operator in
we mean a mapping
defined by
where ,
.
is called the lower rough approximation of X in
and
is called upper rough approximation of X in
.
Definition 2.3
(Davvaz, Citation2004) Given an approximation space , a pair
is called a rough set in
iff
for some
.
Example 2.1
Let be an approximation space, where
,
and an equivalence relation
with the following equivalence classes:
Let the target set be then
and
and so
is a rough set.
Definition 2.4
(Miao, Han, Li, & Sun, Citation2005) Let be an approximation space and
be a binary operation defined on U. A subset
of universe U is called a rough group if
satisfies the following property:
(1) |
| ||||
(2) | Association property holds in | ||||
(3) |
| ||||
(4) |
|
Definition 2.5
(Han, Citation2001) Let and
be two approximation spaces,
and
be two operations over
and
, respectively. Let
and
.
and
are called homomorphic rough sets if there exists a mapping
of
into
such that
If is 1–1 mapping,
and
are called isomorphic rough sets.
Definition 2.6
(Wang, Citation2004) An algebraic system is called rough ring if it satisfies:
(1) |
| ||||
(2) |
| ||||
(3) |
|
Definition 2.7
(Zhang et al., Citation2006) Let be a rough ring with a unity,
a rough commutative group.
is called a rough left module over the ring
if there is mapping
such that
(1) | |||||
(2) | |||||
(3) | |||||
(4) |
|
Definition 2.8
(Zhang et al., Citation2006) A rough subset of a rough module
is called rough submodule of
, if
satisfies the following:
(1) |
| ||||
(2) |
|
Definition 2.9
(Zhang et al., Citation2006) Let and
be two rough R-modules. If there exists a mapping
of M into
such that
(1) |
| ||||
(2) |
3. Rough injective module
Definition 3.1
A sequence of two homomorphism of a module over the rough ring
is said to be rough exact if
. This happens if and only if
, and
the relation
(i.e.
and
), implies that
for some
. Indeed condition (i) and (ii) mean, respectively, that
and
.
Definition 3.2
A -module
is injective if and only if every diagram
with exact row (i.e. with
injective) can be completed to a commutative diagram
by means of a homomorphism .
Since it is obviously enough to check the above condition for inclusion maps ,
is injective if and only if every homomorphism into
form any submodule
of any
can be extended to a homomorphism of
into
.
Example 3.1
The -module
is injective.
Let be a submodule of a
-module
, and
a homomorphism of
-modules. We have to show that
can be extended to a homomorphism of
into
. For this, it will be sufficient to show any homomorphism v from a submodule
of
into
.
Preposition 3.1
Let us be given two cointial maps and form the diagram
a pushout of or of the above diagram is a pair of coterminal maps
such that the square is commutative.
Theorem 3.1
An -module
is injective if and only if every exact sequence of the form
(1)
(1)
splits.
Proof
If is injective and (1) an exact sequence, then
there exists a homomorphism
such that
; therefore the sequence (1) splits.
Conversely, suppose that every exact sequence of the form (1) splits, and let us be given the diagram with exact row form the push-out
of the above diagram; since
is injective, so is v; therefore, denoting by
the co-kernel of v we have the exact sequence
(2)
(2)
Since this sequence splits, there exists such that
. Then,
is a homomorphism of
into
, and we have
. Hence
is injective.
Preposition 3.2
If is an integral domain, then every injective
-module is divisible.
Proof
Let is an integral domain, and let
be an injective
-module. Let
be any non-zero element of
. Since
is an integral domain,
is a free
-module with basis
. Therefore, there exists a homomorphism from
to
which maps a to y. Since
is injective, the above homomorphism extends to a homomorphism
; let
, then
, implies
is divisible.
Lemma 3.1
Every -module can be embedded in an injective
module.
Proof
Let be a Apr(Z)-module, suppose
with
a free
-module. Since
is a direct sum of copies of
, and since
is a submodule of the divisible module
, therefore
is a submodule of a direct sum
of divisible
-modules. Then,
is a submodule of
. Since
is divisible, so is
; therefore, by the above preposition,
is injective and the proof is complete.
Theorem 3.2
If the -module
is injective, then the
-module
is injective.
Proof
Let is a submodule of module
over a rough ring
. Here, we prove that
is a direct summand of
. Mapping
from
to
is additive. Since the
-module
is injective, there exists a homomorphism
of
-modules such that
(3)
(3)
Define by
(4)
(4)
the mapping is linear and so in
, the mapping
is additive. If
, then or every
,
and hence . Thus,
is linear. If now
, then
, for all
, and hence
. Thus,
is an linear projection from
to
. Hence
is a direct summand of
, and this completes the proof.
4. Conclusion
Recently, RST has received wide attention in the real-life applications and the algebraic studies. There are so many models arising in the solution of specific problems and turn out to be modules. For this reason, injective module based on RST introduced here is applicable in many diverse contexts. Injective module based on RST is important to all in linear algebra, vector space & physics applications. The combination of RST and abstract algebra has many interesting research topics. In this paper, we focused on algebraic results by combining RST and abstract algebra, and we hope the results given in this paper will further enrich rough set theories.
Additional information
Funding
Notes on contributors
Arvind Kumar Sinha
Arvind Kumar Sinha is an assistant professor in the Department of Mathematics at National Institute of Technology Raipur, Chhattisgarh, India. He received his MSc and PhD degrees in mathematics from Guru Ghasidas University, Bilaspur (A Central University), India, in 1995 and 2003, respectively. He has 15 years of teaching experience at graduate and post graduate levels and he has several national and international publications. His research area is algebra.
References
- Anderson, F. W., & Fuller, K. R. (1992). Rings and categories of modules (2nd ed.).New York, NY: Springer-Verlag.
- Biswas, R., & Nanda, S. (1994). Rough groups and rough subgroups. Bulletin of the Polish Academy of Sciences Mathematics, 42, 251–254.
- Bonikowaski, Z. (1995). Algebraic structures of rough sets. In W. P. Ziarko (Ed.), Rough sets, fuzzy sets and Knowledge discovery (pp. 242–247). Berlin: Springer-Verlag.
- Cartan, H., & Eilenberg, S. (1956). Homological algebra. Princeton, NJ: Princeton University Press.
- Chakraborty, M. K., & Banergee, M. (1994). Logic and algebra of the rough sets. In W. P. Ziarko (Ed.), Rough sets, fuzzy sets and knowledge discovery (pp. 196–207). London: Springer-Verlag.
- Davvaz, B. (2004). Roughness in rings. Information Sciences, 164, 147–163. Retrieved from http://www.sciencedirect.com/science/article/pii/S0020025503003438. doi:10.1016/j.ins.2003.10.001
- Davvaz, B., & Mahdavipour, M. (2006). Roughness in modules. Information Sciences, 176, 3658–3674. Retrieved from http://www.sciencedirect.com/science/article/pii/S0020025506000466. doi:10.1016/j.ins.2006.02.014
- Goldhaber, J. K., & Enrich, G. (1970). Algebra. London: Macmillan.
- Han, S. (2001). The homomorphism and isomorphism of rough groups. Academy of Shanxi University, 24, 303–305.
- Irfan Ali, M., Davvaz, B., & Shabir, M. (2013). Some properties of generalized rough sets. Information Sciences, 224, 170–179. Retrieved from http://www.sciencedirect.com/science/article/pii/S0020025512006913. doi:10.1016/j.ins.2012.10.026
- Iwinski, T. (1987). Algebraic approach to rough sets. Bulletin of the Polish Academy of Sciences Mathematics, 35, 673–683.
- Jacobson, N. (1951). Lecture in abstract algebra, 1, Basic concepts. New York, NY: Springer-Verag.
- Kryszkiewicz, M. (1998). Rough set approach to incomplete information systems. Information Sciences, 112, 39–49. Retrieved from http://www.sciencedirect.com/science/article/pii/S0020025598100191. doi:10.1016/S0020-0255(98)10019-1
- Kuroki, N. (1997). Rough ideals in semigroups. Information Sciences, 100, 139–163. Retrieved from http://www.sciencedirect.com/science/article/pii/S0020025596002745. doi:10.1016/S0020-0255(96)00274-5
- Kuroki, N., & Mordeson, J. N. (1997). Structure of rough sets and rough groups. Journal of Fuzzy Mathematics, 5, 183–191.
- Li, F., & Zhang, Z. (2014). The homomorphisms and operations of rough groups. The Scientific World Journal, 2014, Article ID: 635783, 6 p. doi:10.1155/2014/507972
- Miao, D., Han, S., Li, D., & Sun, L. (2005). Rough group, Rough subgroup and their properties. Lecture Notes in Artificial Intelligence, 3641, 104–113.
- Pattaraintakorn, P., & Cercone, N. (2008). Integrating rough set theory and its medical applications. Applied Mathematics Letters, 21, 400–403. Retrieved from http://www.sciencedirect.com/science/article/pii/S0893965907001632. doi:10.1016/j.aml.2007.05.010
- Pawlak, Z. (1982). Rough sets. International Journal of Information and Computer Sciences, 11, 341–356. Retreived from http://link.springer.com/article/10.1007
- Pawlak, Z. (1984). Rough classification. International Journal of Man-Machine Studies, 20, 469–483.
- Pawlak, Z. (1987). Rough logic. Bulletin of the Polish Academy of Sciences Technical Sciences, 35, 253–258.
- Pawlak, Z. (1991). Rough sets-theoretical aspects of reasoning about data. Dordrecht: Kluwer.
- Pawlak, Z. (1992). Rough sets: A new approach to vagueness. In L. A. Zadeh & J. Kacprzyk (Eds.), Fuzzy logic for the management of uncertainty (pp. 105–118). New York, NY: Wiley.
- Pawlak, Z. (1998). Granularity of knowledge, indiscernibility and rough sets,. In Proceedings of 1998 IEEE International Conference on Fuzzy Systems (pp. 106–110). Anchorage, AK. doi:10.1109/FUZZY.1998.687467
- Prakash, A., & Sinha, A. K. (2014). Rough projective module. International Conference on Advances in Applied Science and Environmental Engineering---ASEE 2014 (pp. 35–38). Retrieved from http://www.seekdl.org/search.php?page=825&&jayshri&&&&&&&&&&. doi:10.15224/978-1-63248-033-0-09
- Rasouli, S., & Davvaz, B. (2014). An investigation on algebraic structure of soft sets and soft filters over residuated lattices. ISRN Algebra, 2014, Article ID: 635783, 8 p. doi:10.1155/2014/635783
- Rebenboim, P. (1969). Rings and modules (No. 24). New York, NY: Interscience.
- Rowen, L. H. (1991). Ring theory (student ed.). New York, NY: Academic Press.
- Sinha, A. K., & Prakash, A. (2014, November 10--12). Roughness in free module. In The First International Conference on Rough Sets & Knowledge Technologies India (pp. 19–22). Hyderabad.
- Walczak, B., & Massart, D. L. (1997). Rough set theory. Chemometrics and Information Laboratory Systems, 47, 1–16. doi:10.1016/S0169-7439(98)00200-7.
- Wang, C., & Chen, D. (2010). A short note on some properties of rough groups. Computer and Mathematics with Applications, 59, 431–436. Retrieved from http://www.sciencedirect.com/science/article/pii/S0898122109004003. doi:10.1016/j.camwa.2009.06.024
- Wang, D.-s. (2004). Application of the theory of rough set on the groups and rings ( Dissertation for master degree).
- Xin, X. L., Hua,, X. J., & Zhu, X. (2014). Roughness in lattice ordered effect algebras. The Scientific World Journal, 2014, Article ID: 542846, 9 p. doi:10.1155/2014/542846
- Yao, Y. Y. (1996). Two views of the theory of rough sets in finite universes. International Journal of Approximation Reasoning, 15, 291–317. doi:10.1016/S0888-613X(96)00071-0.
- Yao, Y. Y. (1998). constructive and algebraic methods of the theory of rough sets. Information Sciences, 109, 21–44. doi:10.1016/S0020-0255(98)00012-7
- Zhang, Q.-F., Fu, A.-M., & Zhao, S.-x. (2006, August 13--16). Rough modules and their some properties. In Proceeding of the fifth International Conference on Machine Learning and Cybernatics. Dalin. Retrieved from http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4028446&tag=1. doi:10.1109/ICMLC.2006.258675