In this article, after describing some examples to explain the concept of fuzzy multiplicative (m, n)-hyperrings (F(m,n)-hyperrings), we will offer some related properties. Also, by defining F-hyperideals and regular relations, we will study the quotient of multiplicative F(m,n)-hyperrings. Finally, we will generalize the classical isomorphism theorems of groups to multiplicative F(m,n)-hyperrings.
1. Introduction and preliminaries
In this section, at first, we review some works related to the content of the paper and then we express some necessary arrangements. As we know, Marty is the first person who introduced the notion of hypergroups. One of the most natural ways that helps in understanding fundamental properties of algebraic structures is n-ary generalizations of them. In [8], Davvaz and Vougiouklis introduced the concept of n-hypergroups as a generalization of hypergroups in the sense of Marty. An interested reader can refer to [5, 18] for more information about n-ary generalizations of hyperstructures. Hyperring theory is another important branch of hyperstructure theory. Krasner, Multiplicative and Feeble hyperrings are some famous hyperrings that have studied by a variety of authors. Multiplicative hyperring is a triple (R, + , ·), where (R, +) is an abelian group and (R, ·) is a semihypergroup, such that · is distributive with respect to + (see [6]). In [3, 16] there are some review of hyperring theory. Three isomorphism theorems that describe the relationship between quotients, homomorphisms and subobjects of algebraic structures can be stated in (m, n)-ary generalizations of hyperrings. Some versions of isomorphism theoremsfor Krasner (m, n)-hyperrings can be found in [7]. In [20], Zadeh was introduced the notion of fuzzy set which have penetrated in various branches of science including mathematics. In [1, 24] there are some relationships between the fuzzy sets and algebraic hyperstructures. In [9], the notion of fuzzy Krasner (m, n)-hyperrings (F(m,n)-hyperrings) by using the notion of Fm-hyperoperations and Fn-operations is introduced and some related properties are investigated. Now, in this paper, we have dealt with inspiration from the concept of F-polygroups defined by Zahedi and Hasankhani (see [21, 22]) in the multiplicative F(m,n)-hyperrings defining. Throughout this paper we shall use the notation to denote the sequence xi, …, xj. Let X be a non-empty set and let be the set of all non-empty subsets of X and Xn be the n-times cartesian product of X. In general, an n-hyperoperation on X is a mapping . The couple (X, f) where f is an n-hyperoperation is called an n-hypergroupoid. An n-hypergroupoid (H, f) is called an n-semihypergroup if f is associative, i.e., the following equality holds: for all i, j ∈ {1, …, n} and . If for all (x1, …, xn) ∈ Xn, the set is singleton, then f is called n-operation and in the case that f is associative, (X, f) is called an n-semigroup. An element e of an n-hypergroupoid (X, f) is called an identity element, if , for all x ∈ X and all i ∈ {1, …, n}. We recall the following background from [18]. Let P be a non-empty set. Let f be an n-hyperoperation on P and - 1 : P ⟶ P be a unitary operation. Then, (P, f) is called an n-polygroup if the following axioms hold:
f is associative,
there exists an identity element o ∈ P such that o-1 = o,
implies , for all .
We shall use the notation (P, f, o) to say that o is an identity element. An n-polygroup (P, f) is said to be canonical if , for all and for every A canonical n-polygroup (P, f) is said to be monadic if , for all . In what follows, we have a generalization of the notion of multiplicative hyperring which introduced by R. Rota [17] in 1982. Let R be a non-empty set. A multiplicative (m, n)-hyperring is an algebraic hyperstructure (R, f, g) which satisfies the following axioms:
(R, f, o) is a monadic m-polygroup,
(R, g) is an n-semihypergroup with an identity element e,
we have for all i ∈ {1, …, n} and all ,
for all x, y ∈ R we have g (x, y-1, e .) = g (x-1, y, e .) = (g (x, y, e .)) -1,
for every we have where o is the identity element of (R, f).
If in (3) we have equality instead of inclusion, then we say that the multiplicative (m, n)-hyperring is strongly distributive. An (m, n)-hyperring (R, f, g) is called an (m, n)-ring if (R, g) is an n-semigroup.
A fuzzy subset of X is a mapping μ : X → [0, 1]. An empty fuzzy subset of X denoted by ∅ is the zero function from X to [0, 1]. We denote the set of all fuzzy subsets of X by I (X), that is I (X) = {μ | μ : X → [0, 1] isafunction}. Also, we denote the set of all non-empty fuzzy subsets of X by I* (X). Let {μα} α∈Λ be a family of fuzzy subsets of X. We define fuzzy subsets (⋃ α∈Λμα) and (⋂ α∈Λμα) as follows:(⋃ α∈Λμα) (x) = ⋁ α∈Λ {μα (x)} and ⋂α∈Λμα) (x) = ⋀ α∈Λ {μα (x)}, where ∨ and ∧ denote supremum and infimum, respectively. If μ ∈ I (X), then the support of μ, is defined by supp (μ) = {x ∈ H | μ (x) >0} . If A ⊆ X and t ∈ [0, 1], then by At we mean a fuzzy subset of X which is defined as follows: At (x) = t if x ∈ A and At (x) =0 if x ∉ A. In particular, if A is a singleton set, say {a}, then {a} t is said to be a fuzzy point and is denoted by at. An Fn-hyperoperation on X is a function f : Xn → I* (X). If for all (x1, …, xn) ∈ Xn, the set is singleton, then f is called Fn-operation. If a ∈ X and , then we define Furthermore, for and and for i ∈ {1, …, n} we define
,
,
,
,
where χA is the characteristic function. whenever f is an Fn-hyperoperation on X, the couple (X, f) is called an Fn-hypergroupoid. An Fn-hypergroupoid (X, f) is called an Fn-semihypergroup if f is associative, i.e., the following equality holds:
for all i, j ∈ {1, …, n} and . An element e of an Fn-hypergroupoid (X, f) is called an F-identity element, if for all x ∈ X and all i ∈ {1, …, n}.
Lemma 1.1.Let (X, f) be anFn-semihypergroup containing anF-identity elemente. Then, we havefor allx, y ∈ Xandi ∈ {1, …, n - 1}, j ∈ {i, …, n - 1}.
Proof. Let x, y be arbitrary elements of X and i ∈ {1, …, n - 1}, j ∈ {i, …, n - 1}. Then, we have . □
2. Multiplicative F(m,n)-hyperrings
We recall the following background from [10]. Let P be a non-empty set. Let f be an Fm-hyperoperation on P and - 1 : P → P be a unitary operation. Then, (P, f) is called an Fm-polygroup if the following axioms hold:
f is associative,
there exists an F-identity element o ∈ P such that o-1 = o,
, for all .
We shall use the notation (P, f, o) to say that o is an F-identity element. An Fm-polygroup (P, f) is said to be canonical if , for all and for every . A canonical Fm-polygroup (P, f) is said to be monadic if , for all . Sometimes, in a monadic Fm-polygroup, we will denote the singleton set by its element. It is easy to see that in a monadic Fm-polygroup (P, f) we have supp (f (x, x-1, o .)) = {o}, for all x ∈ P. In general case, since f is associative, we have , for all .
Example 1. Let (G, *) be an abelian group and t ∈ (0, 1]. Let ∘ be an F2-operation on G which is defined as follows: x ∘ y = (x * y) t, for all x, y ∈ G. If the inverse of each element of G is attributed to that element by the unitary operation - 1 : G → G, then (G, ∘) is a monadic F2-polygroup.
Lemma 2.1.If (P, f) is anFm-polygroup,andare arbitrary elements ofP, Then
Definition 2.2.Let R be a non-empty set. A multiplicative F(m,n)-hyperring is a fuzzy algebraic hyperstructure (R, f, g) which satisfies the following axioms:
(R, f, o) is a monadic Fm-polygroup,
(R, g) is an Fn-semihypergroup with an F-identity element e,
we have
for all i ∈ {1, …, n} and all ,
for all x, y ∈ R we have
for every we have
where o is the F-identity element of (R, f).
An F(m,n)-hyperring (R, f, g) is called an F(m,n)-ring if (R, g) is an Fn-semigroup. If in (3) we have equality instead of inclusion, then we say that the multiplicative F(m,n)-hyperring is strongly distributive.
Example 2.Consider the F2-operations ∘ and ∗ on R = {0, 1} as follows:
where 0 < t1 ≤ t2 ≤ 1. If we define the unitary operation - 1 on R by x-1 = x, then (R, ∘ , 0) is a monadic F2-polygroup. Also, (R, ∗) is an F2-semigroup and 1 is its F-identity element. It is easy to check that (R, ∘ , ∗) is a multiplicative F(2,2)-ring. Obviously, (R, ∘ , ∗) is not strongly distributive whenever t1 < t2.
Example 3. Let G = {e, a, b, c} be the Klein 4-group and t ∈ (0, 1]. We define the Fm-operation f on G as follows:
Let ∗ be an F2-hyperoperation defined on G with the following table:
Then, (G, f, ∗) is a multiplicative F(m,2)-hyperring.
Proposition 2.3.If (R, f, g) is a multiplicativeF(m,n) -hyperring, then for allx, y, z ∈ R,
If (R, f, g) is strongly distributive, then for allx, y, z ∈ R,
Proof. The statement follows from conditions (3), (4) and (5) of Definition 2.2. □
Theorem 2.4.Let (R, f, g) be a strongly distributive multiplicativeF(m,n)-hyperring. Then, the following assertions hold:
|supp (g (x, y, e .)) |=1, for allx, y ∈ R,
(R, f, g) is anF(m,n)-ring.
Proof. (1) Let x, y ∈ R be arbitrary elements. Since (R, f) is a monadic Fm-polygroup, it follows that supp (f (y, y-1, o .)) = {o} and therefore by using Proposition 2.3 we have
So, for each u, v ∈ supp (g (x, y, e .)) we have o ∈ supp (f (u, v-1, o .)). This implies u ∈ supp (f (v, o .)) = {v}. Whence, u = v and supp (g (x, y, e .)) contains only one element.
(2) By (1), (R, g) is an Fn-semigroup and so (R, f, g) is an F(m,n)-ring. □
Notice that in Example 2, in the case that t1 < t2, we have a multiplicative F(2,2)-ring which is not strongly distributive and therefore the converse of Theorem 2.4 is not true in general.
Definition 2.5.Let (R, f, g) be a multiplicative F(m,n)-hyperring and I be a non-empty subset of R. We say that I is an F-subhyperring of (R, f, g) if
supp (f (I, I-1, o .)) ⊆ I,
supp (g (x, y, e .)) ⊆ I, for all x, y ∈ I.
An F-subhyperring I of (R, f, g) is called an F-hyperideal if supp (g (x, r, e .)) ∪ supp (g (r, x, e .)) ⊆ I, for all x ∈ I and all r ∈ R.
Lemma 2.6.LetIbe anF-hyperideal of a multiplicativeF(m,n)-hyperring (R, f, g). Then, the following assertions hold:
supp (f (I, x, o .)) = I, for allx ∈ I.
, for allx ∈ Iand.
, for all.
implies that, where.
Proof. (1) Let x ∈ I be an arbitrary element. Since I is an F-hyperideal, we have supp (f (I, x, o .)) ⊆ I. Also, we have
(2) Let x ∈ I and be arbitrary elements. Then, we have
(3) With frequent use of (2) it can be achieved.
(4) Let be arbitrary elements of R and . Then, we have
Now, we prove the reverse inclusion. By assumption, (R, f) is an Fm-polygroup and therefore from it follows that
Thus, by using (2) and that f is associative we have
This completes the proof. □
Lemma 2.7.LetbeF-hyperideals of a multiplicativeF(m,n)-hyperring (R, f, g). Then, the following assertions hold:
is anF-hyperideal of (R, f, g).
is anF-hyperideal of, for allj ∈ {1, …, m}.
Ijis anF-hyperideal of, for allj ∈ {1, …, m}.
Proof. (1) Let and r ∈ R be arbitrary elements. Then, there exist wj, zj ∈ Ij, 1 ≤ j ≤ m, such that and . Now, we have
Also, we have
Similarly, we can show
Therefore, is an F-hyperideal of (R, f, g).
The proofs of (2) and (3) are easy. □
Any intersection of F-subhyperrings of a multiplicative F(m,n)-hyperring (R, f, g) is an F-subhyperring of R. Also, any intersection of F-hyperideals of a multiplicative F(m,n)-hyperring (R, f, g) is an F-hyperideal of R. In this manner, we can consider the F-hyperideal generated by any subset S of R which is the intersection of all F-hyperideals of R containing S as a subset. We denote by I ⊕ J the F-hyperideal generated by I ∪ J, where I and J are F-hyperideals of (R, f, g).
Theorem 2.8.LetIandJbe twoF-hyperideals of a multiplicativeF(m,n)-hyperring (R, f, g). Then,I ⊕ J = supp (f (I, J, o .)).
Proof. First, we show that o ∈ I ∩ J. Since I≠ ∅ we can assume that a ∈ I, for some a ∈ R. By condition (1) of Definition 2.5, we have supp (f (a, a-1, o .)) ⊆ I.On the other hand, since (R, f) is an Fm-polygroup, from a ∈ supp (f (a, o .)) it implies that o ∈ supp (f (a, a-1, o .)) and therefore we have o ∈ I.In a similar manner we can show that o ∈ J.Set S = supp (f (I, J, o .)). Since we have x ∈ supp (f (x, o .)) ⊆ S, for all x ∈ I, we have I ⊆ S. Similarly, we have J ⊆ S. Thus, I ∪ J ⊆ S. Now, we show that S is an F-hyperideal of R. Let u and v be arbitrary elements of S. Then, there exist x, y ∈ I and z, t ∈ J such that supp (f (x, z, o .)) = {u} and supp (f (y, t, o .)) = {v}. Since I and J are F-hyperideals, we have supp (f (x, y-1, o .)) ⊆ I and supp (f (z, t-1, o .)) ⊆ J. So, by using Lemma 2.1, we have
Therefore, the condition (1) of Definition 2.5 holds. Now, let r ∈ R be an arbitrary element. Since I and J are F-hyperideals, we have supp (g (x, r, e .)) ⊆ I and supp (g (z, r, e .)) ⊆ J. Hence,
In a similar manner we can show that supp (g (r, u, e .)) = S. Finally, suppose that K is an F-hyperideal of R such that I ∪ J ⊆ K. We have to show that S ⊆ K. Let s ∈ S be an arbitrary element. Then, there exist x ∈ I and y ∈ J such that supp (f (x, y, o .)) = {s}. Since I ∪ J ⊆ K we have x, y ∈ K and since K is an F-hyperideal we conclude that s ∈ K. This completes the proof. □
3. Quotient multiplicative F(m,n)-hyperrings
The goal of this section is to introduce an equivalence relation on a multiplicative F(m,n)-hyperring and to construct a quotient multiplicative F(m,n)-hyperring.
Let ρ be a binary relation on a non-empty set H. If A and B are non-empty subsets of H, then
we write if for every a ∈ A, there exists b ∈ B such that aρb and for every b ∈ B there exists a ∈ A such that bρa,
means that for every a ∈ A and for every b ∈ B, one has aρb.
An equivalence relation ρ defined on a multiplicative F(m,n)-hyperring (R, f, g) is called regular if the following implications hold:
and ρ is called strongly regular if the following implications hold:
In the sequel, ρ [x] is the equivalence class of x. Also, ρ [A] means {ρ [x] | x ∈ A}, where A is a set.
Theorem 3.1.Let (R, f, g) be a multiplicativeF(m,n)-hyperring and letρbe an equivalence relation onR. Then, the following assertions are equivalent:
ρis regular.
Them-operationf|ρandn-hyperoperation g|ρdefined onR/ρ = {ρ [x] | x ∈ R} as follows are well-defined.for all.
Proof. (1⇒2) Let ρ be a regular relation and ρ [xi] = ρ [yi], for all i ∈ {1, …, m}. Then,
Therefore, f|ρ is well-defined. Now, suppose that ρ [xi] = ρ [yi], for all i ∈ {1, …, n}. Set and . We show that A = B. Let ρ [z] ∈ A be an arbitrary element. Then ρ [z] = ρ [z′] for some . Since ρ is regular, there exists such that ρ [z′] = ρ [w]. Thus, ρ [z] ∈ B and so A ⊆ B. Similarly, we can show that B ⊆ A. Hence, A = B and g|ρ is well-defined.
(2⇒1) Let ρ [xi] = ρ [yi], for all i ∈ {1, …, m}. Since f|ρ is well-defined, we have and therefore
Now, suppose that ρ [xi] = ρ [yi], for all i ∈ {1, …, n}. Since g|ρ is well-defined, we have A = B, where A and B are the sets defined in previous part. We show that . Let be an arbitrary element. Since ρ [z] ∈ A and A = B, there exists such that ρ [z] = ρ [w]. Similarly, for each there exists such that ρ [z] = ρ [w]. Thus . □
Remark 1. Whenever ρ is a strongly regular relation, reflexivity of ρ implies that for every we have ρ [z] = ρ [z′] and so is a singleton set. Thus, g|ρ defined in Theorem 3.1 is an n-operation. Conversely, if g|ρ is an n-operation, then is a singleton set and ρ is a strongly regular relation.
Corollary 3.2.Let (R, f, g) be a multiplicativeF(m,n)-hyperring and letρbe an equivalence relation onR. Then,
ρis regular if and only if (R/ρ, f|ρ, g|ρ) is a multiplicative (m, n)-hyperring,
ρis strongly regular if and only if (R/ρ, f|ρ, g|ρ) is a multiplicative (m, n)-ring.
Now, let I be an F-hyperideal of a multiplicative F(m,n)-hyperring (R, f, g). We define the relation ρI on R as follows: xρIy ⇔ supp (f (x, y-1, o .)) ⊆ I .It is not difficult to see that the relation ρI is an equivalence relation.
Lemma 3.3.Let (R, f, g) be a multiplicativeF(m,n)-hyperring andx, y ∈ R. Then, the following assertions hold:
xρIyif and only ifx ∈ supp (f (I, y, o .)).
ρI [x] = supp (f (I, x, o .)).
For everywe have, where.
Proof. (1) Let xρIy, for some x, y ∈ R. By definition of ρI, there exists z ∈ I such that supp (f (x, y-1, o .)) = {z}. Since (R, f) is an Fm-polygroup, we havex ∈ supp (f (z, y, o .)) ⊆ supp (f (I, y, o .)).Conversely, assume that x ∈ supp (f (I, y, o .)), for some x, y ∈ R. Then, there exists z ∈ I such that x ∈ supp (f (z, y, o .)). Again, since (R, f) is an Fm-polygroup, we have supp (f (x, y-1, o .)) = {z}. Therefore, supp (f (x, y-1, o .)) ⊆ I.
(2) By using (1) we have
(3) It is a direct consequence of part (2) and Lemma 2.6 (4). □
Corollary 3.4.IfIis anF-hyperideal of a multiplicativeF(m,n)-hyperring (R, f, g), then
implies,
xρIyif and only if there existsuch that.
Proposition 3.5.LetIbe anF -hyperideal of a multiplicativeF(m,n) -hyperring (R, f, g). Then, for allwe have
Lemma 3.6.LetIbe anF-hyperideal of a multiplicativeF(m,n)-hyperring (R, f, g) andx, y ∈ R. Then, the following assertions are equivalent:
xρIy,
supp (f (x, y-1, o .)) ⊆ I,
supp (f (x, y-1, o .))∩ I ≠ ∅.
Proof. (1⇒2) By Lemma 3.3 (1) we have x ∈ supp (f (I, y, o .)). So,
(2⇒3) It is obvious.
(3⇒1) Let z ∈ supp (f (x, y-1, o .)) ∩ I. Since(R, f) is an Fm-polygroup we have x ∈ supp (f (z, y, o .)) ⊆ supp (f (I, y, o .)). That is, xρIy. □
Corollary 3.7.For eachF-hyperideals IandJof a multiplicativeF(m,n)-hyperring we haveI ⊆ Jif and only ifρI ⊆ ρJ.
Theorem 3.8.The relationρIis a regular relation on (R, f, g).
Proof. Let x1ρIy1, …, xmρIym. Let and . Then,
Therefore, by using Lemma 3.3 (1) we have xρIy. Now, consider x1ρIy1, …, xnρIyn. We show that . By Lemma 3.6, for each i ∈ {1, …, n} there exists zi ∈ I such that . Since (R, f) is an Fm-polygroup we have supp (f (zi, yi, o .)) = {xi}, for all i ∈ {1, …, n}. Hence, we have
Consequently, for any there exists such that w ∈ supp (f (I, w′, o .)) which means that wρIw′. Similarly, by writing , where i ∈ {1, …, n}, it follows that for any there exists such that w′ ρIw. This completes the proof. □
Corollary 3.9.There exists a one to one correspondence between the set of regular relations, for which the equivalence class ofois anF-hyperideal and the set ofF-hyperideals of a multiplicativeF(m,n)-hyperring.
Proof. Suppose that A is the set of F-hyperideals of a multiplicative F(m,n)-hyperring (R, f, g) and B is the set of regular relations for which the equivalence class of o is an F-hyperideal. We define ψ : A → B by ψ (I) = ρI. Clearly, ψ is well-defined. Also, by using Lemma 3.3 (1), we have ρI [o] = I, for all I ∈ A. Let I, J ∈ A and ψ (I) = ψ (J). Then, ρI = ρJ and so we have I = ρI [o] = ρJ [o] = J. Therefore, ψ is one to one. It suffices to show that ψ is onto. Assume that ρ is a regular relation for which ρ [o] is an F-hyperideal. Set I = ρ [o]. We show that ρI = ρ. Let xρIy. By Lemma 3.3 (1), there exists z ∈ I such that supp (f (x, y-1, o .)) = {z}. From zρo it follows that supp (f (x, y-1, o .)) ρo. Since yρy and ρ is regular we have supp (f (f (x, y-1, o .) , y, o .)) ρy. But we have
which implies that xρy. Conversely, assume that xρy. From regularity of ρ and that x-1ρx-1 we conclude that supp (f (x, x-1, o .)) ρ supp (f (y, x-1, o .)) which means that supp (f (y, x-1, o .)) ρo. Hence, supp (f (y, x-1, o .)) ⊆ I and by Lemma 3.6 we have yρIx. □
Theorem 3.10. (1) Let (R, f′, g′) be a multiplicative (m, n)-hyperring. Then, (R, f, g) is a multiplicativeF(m,n)-hyperring, where
(R, f, g) is called the multiplicativeF(m,n)-hyperring induced from (R, f′, g′).
(2) Let (R, f, g) be a multiplicativeF(m,n)-hyperring. Then, (R, f′, g′) is a multiplicative (m, n)-hyperring, where
(R, f′, g′) is called the multiplicative (m, n)-hyperring extracted from (R, f, g).
Proof. (1) Since and (R, f′) is a monadic m-polygroup, it follows that (R, f) is a monadic Fm-polygroup. Similarly, from and that (R, g′) is an n-semi-group with identity element e we conclude that (R, g) is an Fn-semigroup with F-identity element e. Let i ∈ {1, …, n} and be arbitrary elements. Then, from
and that (R, f′, g′) is distributive, we obtain that (R, f, g) is distributive. For each x, y ∈ R we have
In a similar manner we can show that
Finally, for each we have . Similarly, we have
(2) An argument similar to that in (1) establishes (2).□
Let I be an F-hyperideal of a multiplicative F(m,n)-hyperring (R, f, g). Since ρI is a regular relation, by Corollary 3.2, (R/ρI, f|ρI, g|ρI) is a multiplicative (m, n)-hyperring. The multiplicative F(m,n)-hyperring induced from (R/ρI, f|ρI, g|ρI) denoted by R/I is called the quotient multiplicative F(m,n)-hyperring.
Definition 3.11. Let (R1, f1, g1) and (R2, f2, g2) be two multiplicative F(m,n) -hyperrings. A homomorphism from R1 to R2 is a mapping φ : R1 → R2 such that
φ (o) = o,
= supp (f2 (φ (x1) , …, φ (xm))),
⊆supp (g2 (φ (y1) , …, φ (yn))),
for all , where denotes the sequence φ (ai) , …, φ (aj). If in (3) we have equality instead of inclusion, then we say that φ is a good homomorphism.
An injective homomorphism is called a monomorphism and an onto homomorphism is called an epimorphism. An injective and onto homomorphism is called an isomorphism. We say that R1 is isomorphic to R2, denoted by R1 ≅ R2, if there exists an isomorphism from R1 to R2.
Lemma 3.12.Supposeandare two multiplicativeF(m,n)-hyperrings andφ : R1 → R2is a homomorphism. Then, the following assertions hold:
φ (x-1) = (φ (x)) -1, for allx ∈ R1.
φis injective if and only if ker φ = {o}, where ker φ = {x ∈ R1 | φ (x) = o}.
ker φis anF-hyperideal of.
Ifφis a good homomorphism andφ (e) = e, then Im φis anF(m,n)-subhyperring of.
Proof. (1) Let x ∈ R1 be an arbitrary element. Since φ is a homomorphism, we have
Now, since (R1, f1) is an Fm-polygroup and o ∈ supp (f2 (φ (x-1) , φ (x) , o .)) we have
.
(2) Let φ is injective and x ∈ ker φ. Then, we have φ (x) = o = φ (o) which implies that x = o. Conversely, assume that ker φ = {o} and x, y are arbitrary elements of R1 such that φ (x) = φ (y). Then, we have
Therefore, we have supp (f1 (x, y-1, o .)) ⊆ ker φ = {o}. Since (R1, f) is a monadic Fm-polygroup we have x ∈ supp (f1 (y, o .)) = {y}. Thus, x = y. Consequently, φ is injective.
(3) Let x, y ∈ ker φ and r ∈ R1 be arbitrary elements. Since
we have supp (f1 (x, y-1, o .)) ⊆ ker φ. Also, we have
Thus, supp (g1 (x, y, e .)) ⊆ ker φ. Finally, we have
which implies that supp (g (x, r, e .)) ⊆ ker φ. In a similar way we can show that supp (g (r, x, e .)) ⊆ ker φ.
(4) Let φ (x) and φ (y) be arbitrary elements of Im φ. Then, we have
(5) Assume that (x, y) ∈ ρI is an arbitrary element. By Lemma 3.6 we have supp (f1 (x, y-1, o .)) ⊆ I.This implies that φ (supp (f1 (x, y-1, o .)) ⊆ φ (I) = {o}. Since φ is a homomorphism, we have
and since (R2, f2) is an Fm-polygroup we haveφ (x) ∈ supp (f2 (φ (y) , o .)) = {φ (y)}. Thus, φ (x) = φ (y). Conversely, suppose that φ (x) = φ (y), for somex, y ∈ R1. So, we have supp (f2 (φ (x) , (φ (y)) -1, o .)) = supp (f2 (φ (x) , (φ (x)) -1, o .)) = {o} which implies that φ (supp (f1 (x, y-1, o .)) = {o}. Thus,
and by Lemma 3.6 we have (x, y) ∈ ρI. This completes the proof. □
Let I be an F-hyperideal of a multiplicative F(m,n)-hyperring (R, f, g). As is well known, the natural map π : R → R/I by π (x) = ρI [x] is an epimorphism. π is called canonical homomorphism.
Lemma 3.13.Let (R1, f1, g1) and (R2, f2, g2) be two multiplicativeF(m,n)-hyperrings and letφ : R1 → R2be a homomorphism. Then, there exists a monomorphismψ : R1/I → R2such thatψ ∘ π = φ, where I = ker φ.
Proof. We define ψ (ρI [x]) = φ (x). By Lemma 3.12 (5), ψ is well-defined and one to one. We show that ψ is a homomorphism. We have ψ (ρI [o]) = φ (o) = {o}, where ρI [o] is an F-identity element of . Let ρI [x1] , …, ρI [xm] be arbitrary elements of R/I. Then,
For each ρI [y1] , …, ρI [yn] ∈ R/I we have
Finally, for each x ∈ R1 we have ψ ∘ π (x) = ψ (ρI [x]) = φ (x). □
Notice that in the above lemma, ψ is a good monomorphism if φ is a good homomorphism.
Theorem 3.14.LetIandJbeF-hyperideals of a multiplicativeF(m,n)-hyperring (R, f, g) such thatI ⊆ J. Then, there exists anF-hyperidealLofR/Isuch that (R/I)/Lis good isomorphic toR/J.
Proof. We define the map φ : R/I → R/J by φ (ρI [x]) = ρJ [x]. By Corollary 3.7, φ is well-defined. For ρI [x1] , …, ρI [xm] ∈ R/I we have
Also, for ρI [y1] , …, ρI [yn] ∈ R/I we have
Therefore, φ is a good homomorphism. Now, if L = ker φ, then by Lemma 3.13, there exists a good monomorphism ψ : (R/I)/J → R/J such that ψ ∘ π = φ, and so ψ is a good isomorphism. □
Lemma 3.15Let (R, f, g), (R1, f1, g1) and (R2, f2, g2) be three multiplicativeF(m,n)-hyperrings and letφ1 : R → R1 and φ2 : R → R2be epimorphisms such that. Then, there exists a unique epimorphismψ : R1 → R2such thatψ ∘ φ1 = φ2.
Proof. We define ψ : R1 → R2 by ψ (z) = φ2 (x), where . For each y ∈ φ-1 (z) we have , and so φ2 (x) = φ2 (y). This proves that ψ is well-defined. We prove that ψ is an epimorphism. Clearly, we have ψ (o) = o. Let be arbitrary elements. Since φ1 is onto, there exist such that φ1 (yi) = xi, (1 ≤ i ≤ m). Set . Since φ1 is a homomorphism,
which implies that . Thus,
Also, for every , there exist such that φ1 (yi) = xi, (1 ≤ i ≤ n) and we have
Clearly, ψ is onto and ψ ∘ φ1 = φ2. The uniqueness is evident. □
Theorem 3.16.IfIandJareF-hyperideals of a multiplicativeF(m,n)-hyperring (R, f, g) such thatI ⊆ J, then there exists an epimorphismR/I → R/J.
Proof. Let π1 : R → R/I and π2 : R → R/J be canonical homomorphisms. We show that . Let be an arbitrary element. Then, we have π1 (x) = π1 (y) which implies that ρI [x] = ρI [y]. Since I ⊆ J, by Corollary 3.7 we have ρJ [x] = ρJ [y] and therefore . Now, by Lemma 3.15 the proof is completed.□
We present now the first isomorphism theorem for multiplicative F(m,n)-hyperrings.
Theorem 3.17.(First Isomorphism Theorem). Let (R1, f1, g1) and (R2, f2, g2) be two multiplicativeF(m,n)-hyperrings andφ : R1 → R2be a good homomorphism such thatφ (e) = e. Then,R1/I ≅ Im φ, whereI = ker φ.
Proof. By Lemma 3.12 (4), Im φ is an F(m,n)-subhyper ring of (R2, f2, g2). We define the map ψ : R1/I → Im φ by ψ (ρI [x]) = φ (x). By the following argument ψ is well-defined.
Obviously, ψ (ρI [o]) = φ (o) = o and for every ρI [x1] , …, ρI [xm] ∈ R1/I, we have
Also, for every ρI [y1] , …, ρI [yn] ∈ R1/I, we have
Therefore, ψ is a good homomorphism. Evidently, ψ is onto. Finally, we have
Therefore, ψ is an isomorphism and the desired result follows. □
We are now in a position to state and prove the second and third isomorphism theorems in multiplicative F(m,n)-hyperrings.
Theorem 3.18.(Second Isomorphism Theorem). IfareF-hyperideals of a multiplicativeF(m,n)-hyperring (R, f, g), then for eachj ∈ {1, …, m} we have
Proof. Let j ∈ {1, …, m} be an arbitrary element. By Lemma 2.7, and are defined. We consider the map by ψ (x) = ρIj [x]. For each we have
Also, for each we have
Therefore, ψ is a good homomorphism. Let be an arbitrary element. Then, there exist ai ∈ Ii, 1 ≤ i ≤ m, such that . By using Lemmas 2.6 (1) and 3.3 (2), for we have
Therefore, ψ is onto. We have
Evidently, ρIj [e] is an F-identity element of and ψ (e) = ρIj [e]. So, by the first isomorphism theorem the desired result holds. □
Theorem 3.19.(Third Isomorphism Theorem). IfIandJareF-hyperideals of a multiplicativeF(m,n)-hyperring (R, f, g) such thatI ⊆ J, thenJ/Iis anF-hyperideal ofR/Iand (R/I)/(J/I) ≅ R/J.
Proof. First, we show that J/I is an F-hyperideal of R/I. Let x, y ∈ J and r ∈ R be arbitrary elements. Since J is an F-hyperideal of (R, f, g), we have supp (f (x, y-1, o .)) ⊆ J and supp (g (x, r, e .)) ∪ supp (g (r, x, e .)) ⊆ J and so we have
Also, we have
In a similar manner we can show that
So far we have proved that J/I is an F-hyperideal of R/I. It is not difficult to see that ψ : R/I → R/J defined by ψ (ρI [x]) = ρJ [x] is an onto good homomorphism and ker φ = J/I. Therefore, by the First Isomorphism Theorem the desired result follows easily. □
References
1.
CorsiniP., DavvazB. and Leoreanu-FoteaV., Atanassov’s intuitionistic (s, t)-fuzzy n-ary subhypergroups and their properties, Inform Sci179(5) (2009), 654–666.
2.
DavvazB., Fuzzy krasner (m, n)-hyperrings, Comput Math Appl59(12) (2010), 3879–3891.
3.
DavvazB., Isomorphism theorems on hyperrings, Indian J Pure Appl Math35(3) (2004), 321–331.