3. NeutroHyperstructures
In this section, we define NeutroSemihypergroups and NeutroH-Semigroups, present some illustrative examples, and study several properties of some important subsets of NeutroSemihypergroups and NeutroH-Semigroups.
Definition 4. Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called a NeutroHyperoperation on A if some (or all) of the following conditions hold in a way that .
- 1.
There exist with . (This condition is called degree of truth, “T”).
- 2.
There exist with . (This condition is called degree of falsity, “F”).
- 3.
There exist with is indeterminate in A. (This condition is called degree of indeterminacy, “I”).
Definition 5. Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called an AntiHyperoperation on A if for all .
Definition 6. Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called NeutroAssociative on A if there exist satisfying some (or all) of the following conditions in a way that .
- 1.
; (This condition is called degree of truth, “T”).
- 2.
; (This condition is called degree of falsity, “F”).
- 3.
is indeterminate or is indeterminate or we cannot find if and are equal. (This condition is called degree of indeterminacy, “I”).
Definition 7. Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called AntiAssociative on A if for all .
Definition 8. Let A be any non-empty set and “·” be a hyperoperation on A. Then “·” is called a NeutroWeakAssociative on A if there exist satisfying some (or all) of the following conditions in a way that .
- 1.
; (This condition is called degree of truth, “T”).
- 2.
; (This condition is called degree of falsity, “F”).
- 3.
is indeterminate or is indeterminate or we cannot find if and have common elements. (This condition is called degree of indeterminacy, “I”).
Definition 9. Let A be a non-empty set and “·” be a hyperoperation on A. Then is called a
- 1.
NeutroHypergroupoid if “·” is a NeutroHyperoperation.
- 2.
NeutroSemihypergroup if “·” is NeutroAssociative but not an AntiHyperoperation.
- 3.
NeutroH-Semigroup if “·” is NeutroWeakAssociative but not an AntiHyperoperation.
Example 4. Let and be defined by the following table.Then is a NeutroSemihypergroup and NeutroH-Semigroup. This is clear as Example 5. Let be the set of real numbers and define “★” on as follows.Then is a NeutroSemihypergroup. This is clear as and . Example 6. Let and be defined by the following table.Then is a NeutroSemihypergroup. This is clear as and . Remark 3. It is well known in classical algebraic hyperstructures that every semihypergroup is a hypergroupoid. This may fail to occur in NeutroHyperstructures. In Example 6, is a NeutroSemihypergroup that is not a NeutroHypergroupoid.
Proposition 1. Every -semigroup that is not a semihypergroup and has an idempotent element is a NeutroSemihypergroup.
Proof. Let be an -semigroup with for some . Then . Since is not a semihypergroup, it follows that there exist with . Therefore, is a NeutroSemihypergroup. □
Example 7. Let and be defined by the following table. ⋄ | m | a | d |
m | m | {a,d} | d |
a | {a,d} | d | m |
d | d | m | a |
Then is an -semigroup having m as an idempotent element and hence, it is a NeutroSemihypergroup. Remark 4. It is well known in algebraic hyperstructures that every semihypergroup is an -semigroup. This may not hold in NeutroHyperstructures. i.e., A NeutroSemihypergroup may not be a NeutroH-Semigroup.
The -semigroup in Example 7 is a NeutroSemihypergroup that is not NeutroH-Semigroup.
Example 8. Let be the set of integers and define “⊕” on as follows. For all ,and if Then is a NeutroSemihypergroup. This is clear asand Example 9. Let be the set of integers and define “⊙” on as follows. For all ,Then is a NeutroSemihypergroup. This is clear asand Example 10. Let be the set of integers under addition modulo 6 and define “⊞” on as follows.Then is a NeutroSemihypergroup. This is clear as and . Example 11. Let and be defined by the following table.Then is a NeutroH-Semigroup. This is clear asandMoreover, is a NeutroSemihypergroup as . Remark 5. Every NeutroSemigroup is both: a NeutroSemihypergroup and a NeutroH-Semigroup. So, the results related to NeutroSemihypergroups (NeutroH-Semigroups) are more general than that related to NeutroSemigroups and as a result, we can deal with NeutroSemigroups as a special case of NeutroSemihypergroups (NeutroH-Semigroups).
Example 12. Let and be defined by the following table.In [6], Al-Tahan et al. proved that is a NeutroSemigroup. Thus, is a NeutroSemihypergroup. Theorem 1. Let be a NeutroSemihypergroup (NeutroH-Semigroup) and “★” be defined on H as for all . Then is a NeutroSemihypergroup (NeutroH-Semigroup).
Proof. The proof is straightforward. □
Example 13. Let and be the NeutroSemihypergroup defined in Example 11. By applying Theorem 1, we get that defined in the following table is a NeutroSemihypergroup and a NeutroH-Semigroup. Definition 10. Let be a NeutroSemihypergroup (NeutroH-Semigroup) and . Then S is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H if is a NeutroSemihypergroup (NeutroH-Semigroup).
Remark 6. Let be a NeutroSemihypergroup (NeutroH-Semigroup) and . Unlike the case in algebraic hyperstructures (Remark 2), proving that for all does not imply that S is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H.
As an illustration of Remark 6, in Example 5 but is not a NeutroSubsemihypergroup of .
Definition 11. Let be a NeutroSemihypergroup (NeutroH-Semigroup) and be a NeutroSubsemihypergroup (NeutroH-Subsemigroup). Then
- (1)
S is a NeutroLeftHyperideal of H if there exists such that for all .
- (2)
S is a NeutroRightHyperideal of S if there exists such that for all .
- (3)
S is a NeutroHyperideal of H if there exists such that and for all .
A NeutroSemihypergroup (NeutroH-Semigroup) is called simple if it has no proper NeutroSubsemihypergroups (NeutroH-Subsemigroups).
Example 14. Let be the NeutroSemihypergroup defined in Example 4. Then A is simple. This is clear as and are the only options for any possible proper NeutroSubsemihypergroup and and are AntiHypergroupoids.
Example 15. Let be the NeutroSemihypergroup defined in Example 11. Then is a NeutroSubsemihypergroup of M.
Example 16. Let be the NeutroSemihypergroup defined in Example 8, , and . Then are NeutroSubsemihypergroups of .
Remark 7. The intersection of NeutroSubsemihypergroups may fail to be a NeutroSubsemihypergroup. This is clear from Example 16 as is not a NeutroSubsemihypergroup of .
Lemma 1. Let be a NeutroSemihypergroup (NeutroH-Semigroup) and be hypergroupoids. If are NeutroSubsemihypergroups (NeutroH-Subsemigroups) of H then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H.
Proof. Let be NeutroSubsemihypergroups. Since A and B are hypergroupoids, it follows that “∘” is NeutroAssociative on both of A and B. The latter implies that there exist satisfying some (or all) of the following conditions in a way that .
T: ;
F: ;
I: is indeterminate or is indeterminate or we cannot find if and are equal.
Therefore, is a NeutroSubsemihypergroup of H. The proof of (NeutroH-Subsemigroup is done similarly. □
Example 17. Let be the NeutroSemihypergroup defined in Example 9, , and . Then are NeutroHyperideals of . We show that is a NeutroHyperideal of and may be done similarly. Sinceandit follows that is a NeutroSubsemihypergroup of . Having and for all ,implies that is a NeutroHyperideal of . Remark 8. The intersection of NeutroHyperideals may fail to be a NeutroHyperideal. This is clear from Example 17 as is not a NeutroHyperideal of .
Lemma 2. Let be a NeutroSemihypergroup (NeutroH-Semigroup) and be hypergroupoids. If are NeutroLeftHyperideals (NeutroRightHyperideals or NeutroHyperideals) of H. Then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H.
Proof. Let be NeutroLeftHyperideals of H. Lemma 1 asserts that is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H. Since A is a NeutroLeftHyperideal of H, it follows that there exists such that for all . The latter implies that there exists such that for all . Thus, is a NeutroLeftHyperideal of H. □
Definition 12. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a function. Then
- (1)
ϕ is called NeutroHomomorphism if for some .
- (2)
ϕ is called NeutroIsomomorphism if ϕ is a bijective NeutroHomomorphism.
- (3)
ϕ is called NeutroStrongHomomorphism if for all , when , when , and is indeterminate when is indeterminate.
- (4)
ϕ is called NeutroStrongIsomomorphism if ϕ is a bijective NeutroOrderedStrongHomomorphism. In this case we say that .
Example 18. Let and be the NeutroSemihypergroups defined in Examples 11 and 13, respectively. Then as is a NeutroStongIsomorphism. Here, Theorem 2. The relation “” is an equivalence relation on the set of NeutroSemihypergroups (NeutroH-Semigroups).
Proof. By taking the identity map, we can easily prove that “
” is a reflexive relation. Let
. Then there exists a NeutroStrongIsomorphism
. We prove that the inverse function
of
is a NeutroStrongIsomorphism. For all
, there exist
with
and
. We have
We consider the following cases for
.
Case
. Having
a NeutroStrongIsomorphism and
imply that
and hence,
Case . Suppose, to get contradiction, that or indeterminate. Then by using our hypothesis that is NeutroStrongIsomorphism, we get that or indeterminate.
Case is indeterminate. Suppose, to get contradiction, that or . Then by using our hypothesis that is NeutroStrongIsomorphism, we get that or .
Thus, and hence, “” is a symmetric relation. Let and . Then there exist NeutroStrongIsomorphisms and . One can easily see that the composition function of and is a NeutroStrongIsomorphism. Thus, and hence, “” is a transitive relation. □
Lemma 3. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be an injective NeutroStrongHomomorphism. If is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of .
Proof. Let M be a NeutroSubsemihypergroup of H. If “∘” is NeutroHyperoperation on M then it is clear that “★” is NeutroHyperoperation on . If “∘” is NeutroAssociative then there exist satisfying some (or all) of the following conditions in a way that .
T: ;
F: ;
I: is indeterminate or is indeterminate or we cannot find if and are equal.
The latter and having an injective NeutroStrongHomomorphism imply that some (or all) of the following conditions are satisfied in a way that .
T: ;
F: ;
I: is indeterminate or is indeterminate or we cannot find if and are equal.
Thus, is a NeutroSubsemihypergroup. The proof that is a NeutroH- Subsemigroup of is done similarly. □
Example 19. Let and be the NeutroSemihypergroups defined in Examples 11 and 13, respectively. Example 15 asserts that is a NeutroSubsemihypergroup of . Using Example 18 and Lemma 3, we get that is a NeutroSubsemihypergroup of .
Lemma 4. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomomorphism. If is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H.
Proof. Let be a NeutroSubsemihypergroup of . If “★” is NeutroHyperoperation on N then it is clear that “∘” is NeutroHyperoperation on . Let “★” be NeutroAssociative. Having is an onto NeutroStrongHomomorphism implies that there exist satisfying some (or all) of the following conditions in a way that .
T: ;
F: ;
I: is indeterminate or is indeterminate or we cannot find if and are equal.
Having be an injective NeutroStrongHomomorphism implies that there exist satisfying some (or all) of the following conditions in a way that .
T: ;
F: ;
I: is indeterminate or is indeterminate or we cannot find if and are equal.
Thus, is a NeutroSubsemihypergroup of H. The proof that is a NeutroH-Subsemigroup of H may be done similarly. □
Theorem 3. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. Then is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H if and only if is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of .
Proof. The proof follows from Theorem 2 and Lemmas 3 and 4. □
Corollary 1. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. Then H is simple if and only if is simple.
Proof. The proof follows from Theorem 3. □
Lemma 5. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. If is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of .
Proof. Let be a NeutroLeftHyperideal of H. Lemma 3 asserts that is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of . Having M a NeutroLeftHyperideal of H implies that there exists such that for all . Having an onto NeutroStrongHomomorphism implies that for all . Thus, is a NeutroLeftHyperideal of . The proofs of NeutroRightHyperideal and NeutroHyperideal are done similarly. □
Lemma 6. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. If is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H.
Proof. Let be a NeutroLeftHyperideal of H. Lemma 3 asserts that is a NeutroSubsemihypergroup (NeutroH-Subsemigroup) of H. Having N a NeutroLeftHyperideal of implies that there exists such that for all . Since is an NeutroStrongHomomorphism, it follows that for all where . The latter implies that there exists with for all . Thus, is a NeutroLeftHyperideal of H. The proofs of NeutroRightHyperideal and NeutroHyperideal are done similarly. □
Theorem 4. Let , be NeutroSemihypergroups (NeutroH-Semigroups) and be a NeutroStrongIsomorphism. Then is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of H if and only if is a NeutroLeftHyperideal (NeutroRightHyperideal or NeutroHyperideal) of .
Proof. The proof follows from Theorem 2, Lemmas 5 and 6. □
Let be any non-empty set for all and “” be a hyperoperation on . We define “∘” on as follows: For all , .
Theorem 5. Let and be hypergroupoids. Then is a NeutroSemihypergroup (NeutroH-Semigroup) if and only if either is a NeutroSemihypergroup (NeutroH-Semigroup) or is a NeutroSemihypergroup (NeutroH-Semigroup) or both are NeutroSemihypergroups (NeutroH-Semigroups).
Proof. The proof is straightforward. □
Example 20. Let be the semihypergroup defined as: for all and be the NeutroSemihypergroup defined in Example 6. Then the following are true.
- 1.
is a NeutroSemihypergroup,
- 2.
is a NeutroSemihypergroup, and
- 3.
is a NeutroSemihypergroup.
In what follows, we present a way to construct a new NeutroSemihypergroup (NeutroH-Semigroup) from an existing one. This tool is of great importance to prove that for any positive integer , there exists at least one NeutroSemihypergroup (NeutroH-Semigroup) of order n.
Let
be a NeutroSemihypergroup (NeutroH
-Semigroup) and
J be any non-empty set such that
and
. The extension
of
H by
J is given as
. We define the hyperoperation “⊚” on
as follows.
Theorem 6. Let be a NeutroSemihypergroup (NeutroH-Semigroup) and J be any non-empty set such that and . Then is a NeutroSemihypergroup (NeutroH-Semigroup).
Proof. Let be a NeutroSemihypergroup. If “∘” is a NeutroHyperoperation then there exist with representing “T”, representing “F”, is indeterminate representing “I”. Where . Since , it follows that there exist with representing “T”, representing “F” (as and ), is indeterminate representing “I”. Where . Thus, “⊚” is NeutroHyperoperation on . If “∘” is NeutroAssociative on H then it is clear that “⊚” is NeutroAssociative on . Therefore, is a NeutroSemihypergroup. The case is a NeutroH-Semigroup is done similarly. □
Example 21. Let be the NeutroSemihypergroup defined in Example 6 and . Then and is the NeutroSemihypergroup defined by the following table. ⊚ | m | a | d | n |
m | m | m | m | {m,a,d,n} |
a | m | {m,a} | d | {m,a,d,n} |
d | m | d | d | {m,a,d,n} |
n | {m,a,d,n} | {m,a,d,n} | {m,a,d,n} | {m,a,d,n} |
Theorem 7. Let be an integer. Then there is at least one NeutroSemihypergroup of order n.
Proof. The proof follows from Example 4 and Theorem 6. □
Corollary 2. There are infinitely many NeutroSemihypergroups up to NeutroStrongIsomorphism.
Proof. The proof follows from Theorem 7. □
Theorem 8. Let be any integer. Then there is at least one NeutroH-Semigroup of order n.
Proof. The proof follows from Example 4 and Theorem 6. □
Corollary 3. There are infinitely many NeutroH-Semigroups up to NeutroStrongIsomorphism.
Proof. The proof follows from Theorem 8. □