1. Introduction
Semigroups play a vital role in algebraic structures [
1,
2,
3,
4,
5] and they are applied in several fields and it is a generalization of groups, as all groups are semigroups and not vice versa. Neutrosophic sets proposed by Smarandache in [
6] has become an interesting area of major research in recent days both in the area of algebraic structures [
7,
8,
9,
10,
11] as well as in applications ranging from medical diagnosis to sentiment analysis [
12,
13]. The study of neutrosophic triplets happens to be a special form of neutrosophic sets. Extensive study in this direction have been carried out by several researchers in [
8,
14,
15,
16,
17]. Here we are interested in the study of neutrosophic components (NC) over the intervals (0, 1), (0, 1], [0, 1) and [0, 1]. So far researchers have studied and applied NC only on the interval [0, 1] though they were basically defined by Smarandache [
18] on all intervals. Further they have not studied them under the usual operation + and ×. Here we venture to study NC on all the four intervals and obtain several interesting algebraic properties about them.
Smarandache multiset semigroup studied in [
19] is different from these semigroups. Further these multiset NC semigroups are also different from multi semigroups in [
20] which deals with multi structures on semigroups.
Any algebraic structure becomes more efficient for application only when it enjoys some strong properties. In fact a set endowed with closed associative binary operation happens to be a semigroup. This semigroup structure does not yield many applications like algebraic codes or commutative rings or commutative semirings. Basically to have a vector space one needs at least the basic algebraic structure to be a group under addition. The same is true in case of algebraic codes. However none of the intervals [0, 1] or (0, 1) or (0, 1] can afford to have a group structure under +. One can not imagine of a group structure under product for no inverse element can be got for any element in these intervals. But when we consider the interval [0, 1) we see it is a group under addition modulo 1.
In fact for any collection of NC which are triplets to have a stronger structure than a semigroup we need to have a strong structure on the interval over which it is built. That is why this paper studies the NC on the interval [0, 1). These commutative rings in [0, 1) can be used to built both algebraic codes on the NC for which we basically need these NC to be at least a commutative ring. With this motivation, we have developed this paper.
This paper further proves that multiset NC built on the interval [0, 1) happens to be a commutative semiring paving way to build multiset NC algebraic codes and multiset neutrosophic algebraic codes which can be applied to cryptography with indeterminacy.
The paper is organized as follows. Section one is introductory in nature.
Section 2 recalls the basic concepts of partial order, torsion free semigroup and neutrosophic set.
Section 3 introduces NC on the four intervals [0, 1], (0,1), [0, 1) and (0, 1] and mainly prove they are infinite NC semigroups which are torsion free. The new notion of weakly torsion free elements in a semigroup is introduced in this paper and it is proved that NC semigroups built on intervals [0, 1] and [0, 1) are weakly torsion free under usual product ×. We further prove the NC built using the interval [0, 1) happens to be an infinite order commutative ring with infinite number of zero divisors and it has no unit. In
Section 4 we prove multiset NC built using these four intervals are multiset neutrosophic semigroups under usual product ×. We prove only in case of [0, 1) the multiset NC is a ring with infinite number of zero divisors and in all the other interval,
is a torsion free or weakly torsion free semigroup under ×. Only in case of the interval [0, 1),
is semigroup under modulo addition 1. In
Section 5 we define n-multiplicity multiset NC on all the intervals and obtain several interesting properties. Discussions about this study are given in
Section 6 and the final section gives conclusions and future research based on their structures.
3. Neutrosophic Components (NC) Semigroups under Usual Product and Sum
Throughout this section will denote the truth value, indeterminate value, false value where belongs to , the neutrosophic set. However we define special NC on the intervals (0, 1), (0, 1] and [0, 1). We first prove is a semigroup under product and obtain several interesting properties about NC semigroups using the four intervals (0, 1), (0, 1], [0, 1) and [0, 1].
Example 2. Let and be any two NC in . We define product = (0.3, 0.8, 0.5) × (0.9, 0.2, 0.7) = (0.3 × 0.9, 0.8 × 0.2, 0.5 × 0.7) = (0.27, 0.16, 0.35). It is again a neutrosophic set in .
Definition 6. The four NC , , and are all only partially ordered sets for if a = (x, y, z) and b = (s, r, t) are in then if and only if , , ; but not all elements are ordered in , that is why we say are only partially ordered sets, and denote it by ; where ≤ denotes the classical order relation over reals; .
For instance if and are in then a and b cannot be compared. If and , then or .
In view of this we have the following theorem.
Theorem 1. Let be the collection of all NC which are such that the elements x, y and z do not take any extreme values.
- 1.
is an infinite order commutative semigroup which is not a monoid and has no zero divisors.
- 2.
Every in will generate an infinite cyclic subsemigroup under product of denoted by .
- 3.
The elements of P forms a totally ordered set, (for if we see ).
- 4.
has no idempotents and is a torsion free semigroup.
Proof. Proof of 1: Clearly if and are in , then is in ; as and . Hence, is a semigroup under product. Further as number of elements in (0, 1) is infinite so is . Finally as the product in (0, 1) is commutative so is the product in . Hence the claim. (1, 1, 1) is not in as we have used only the open interval (0, 1), we see is not a monoid. has no zero divisors as the elements are from the open interval which does not include 0, hence the claim.
Proof of 2: Let be in S, we see , and so on and n can take values from . Thus a in S generates a cyclic subsemigroup of infinite order, hence the claim.
Proof of 3: Let , a generates the semigroup under product, it is of infinite order and from the property of elements in (0, 1); and so on . Hence the claim.
Proof of 4: If any as , and x, y and z are torsion free so is a. We see for any . Further if for no ; . Hence the claim.
□
Definition 7. The four NC and mentioned in definition 6 under the usual product × forms a commutative semigroup of infinite order defined as the NC semigroups.
Theorem 2. Let be the collection of NC. is only a semigroup and not a monoid and has infinite number of zero divisors. Further all other results mentioned in Theorem 1 are true with an additional property if ; we haveas (0, 0, 0) . Proof as in case of Theorem 1.
In view of this we define an infinite torsion free semigroup to be weakly torsion free if
; but
Thus is only a weakly torsion free semigroup.
It is interesting to note is contained in and in fact is a subsemigroup of .The differences between and is that has infinite number of zero divisors and the exists in and is torsion free but is weakly torsion free.
Theorem 3. Let be the collection of NC. is a monoid and has no zero divisors.
Results 2 to 4 of Theorem 1 are true. Finally is a subset of , in fact is a subsemigroup of . The main difference between and is that is a monoid and is not a monoid. The difference between and is that has no zero divisors but has zero divisors and is a monoid.
Next we prove a theorem for .
Theorem 4. Let . is a semigroup and is a monoid and has zero divisors. Other three conditions of Theorem 1 is true, but like is only a weakly torsion free semigroup.
Proof as in case of Theorem 1. We have contained in and is contained in and contained in and is contained in .
However, it is interesting to note and are not related in spite of the above relations.
Now we analyse all these four neutrosophic semigroups to find out, on which of them we can define addition modulo 1. does not include the element (0, 0, 0) as 0 is not in (0, 1), so is not even closed under addition modulo 1. So in not a semigroup or a group under plus modulo 1. Since and contains (1, 1, 1) we cannot define addition modulo 1; hence, they can not have any algebraic structure under addition modulo 1. Now consider , clearly is a group under addition modulo 1.
In view of all these we have the following theorem.
Definition 8. The NC under usual addition modulo 1 is a group defined as the NC group denoted by .
Theorem 5. is a group under addition modulo 1.
Proof. For any , x + y (mod 1) . (0, 0, 0) acts as additive identity. Further for every x there is a unique with (0, 0, 0). Hence the theorem. □
Definition 9. The NC under the operations of the usual addition + modulo 1 and usual product × forms a commutative ring of infinite order defined as the NC commutative ring denoted by .
Theorem 6. is a commutative ring with infinite number of zero divisors and has no multiplicative identity (1, 1, 1).
Proof. Follows from the Theorem 1 and the fact is closed under + modulo 1 by Theorem 5. The distributive property is inherited from the number theoretic properties of modulo integers. As 1 is not in ; (1, 1, 1) is not in , hence the result. □
Next we proceed on to define multiset NC semigroups in the following section.
4. Multiset NC Semigroups
In this section we proceed on to define multiset NC semigroups using and . We see Collection of all multiset NC using elements of . On similar lines we define and using and respectively. We prove is a multiset neutrosophic semiring of infinite order.
Recall [
18],
A is a multi neutrosophic set, then
,
; that is in the multiset neutrosophic set
A; (0.3, 0.7, 0.9) has occurred 5 times; (0.6, 0.2, 0.7) has occurred 12 times or its multiplicity is 12 in
A and so on.
Let = {Collection of all multisets using the elements from , is an infinite collection. We just show how the classical product is defined on .
Let
and
in
be any two multisets. We define the classical product × of
A and
B as follows;
is in , thus is a commutative semigroup of infinite order defined as the multiset NC semigroup.
Definition 10. Let be the multi NC using elements of , on the usual product × is defined as the multiset neutrosophic semigroup for and 4.
Definition 11. Let be the multiset NC semigroup under ×, elements of the form and so on which are infinite in number with contribute to zero divisors. Hence multisets using these types of elements contribute to zeros of the form ; . As the zeros are of varying multiplicity we call these zero divisors as special type of zero divisors.
We will provide examples of them.
Example 3. Let be the multiset NC semigroup under product. Let A = (0.6, 0, 0) and B = (0, 0.4, 0.5) be in R, = (0, 0, 0). Take and E = 9(0, 0, 0.4) in R; we get . Take and be two multisets in R; is a special type of zero divisor of R.
Thus is closed under the binary operation ×.
Theorem 7. The neutrosophic multiset semigroups for i = 1, 2, 3, 4 are commutative and of infinite order satisfying, the following properties for each = 1, 2, 3, 4.
- 1.
has no trivial or non-trivial special type of zero divisors and no trivial or non-trivial idempotents.
- 2.
has infinite number of special type of zero divisors and no non-trivial idempotents.
- 3.
has no trivial or non-trivial special zero divisors but has (1, 1, 1) as identity and has no non trivial idempotents.
- 4.
has non-trivial special type of zero divisors and has (1, 1, 1) as its identity and has idempotents of the form and so on }.
Proof. Follows from the fact that has no zero divisors and idempotents as it is built on the interval (0, 1).
Evident from the fact is built on [0, 1) so has special type of zero divisors by definition but no idempotent.
True from the fact is built on (0, 1], so (1, 1, 1) .
which is built on [0, 1] has infinite special type of zero divisors as (0, 0, 0) by Definition 11 and (1, 1, 1) and has idempotents of the form and so on }.
Hence the claims of the theorem. □
Now we proceed onto define usual addition on
in not even closed under addition. For there are such that is 1 or greater than 1, so these elements are not in (0, 1), hence our claim.
Recall . We can define addition modulo 1 and product under that addition both and are closed.
Let and be in , we find mod 1.
is in . (0, 0, 0) in acts as the additive identity.
For every there is a unique such that . Thus is a NC group of infinite under addition modulo 1. Further () is a semigroup under product of infinite order which is commutative and not a monoid as (1, 1, 1) is not in .
Now we illustrate how addition is performed on any two neutrosophic multisets in .
Let and be any two multisets of . To find the sum of A with B under addition modulo 1.
= {35[(0.3, 0.8, 0.45) + (0.1, 0, 0.9)]mod 1, 45[(0.02, 0.41, 0.9) + (0.1, 0, 0.9)]mod 1, 5[(0.6, 0.3, 0.2) + (0.1,0, 0.9)]mod 1, 14[(0.3, 0.8, 0.45) + (0.6, 0.5,0)]mod 1, 18[(0.02, 0.41, 0.9) + (0.6, 0.5, 0)]mod 1, 2[(0.6, 0.3, 0.2) + (0.6, 0.5, 0)]mod 135(0.4, 0.8, 0.35), 45(0.12, 0.41, 0.8), 5(0.7, 0.3, 0.1), 14(0.9, 0.3, 0.45), 18(0.62, 0.91, 0.9), 2(0.2, 0.8, 0.2)} is in . This is the way addition modulo 1 operation is performed. For and we can not define usual addition modulo 1 as (1, 1, 1) and .
Next we proceed on to describe the product of any two elements in . We take the above A and B and find . = {35[(0.3,0.8,0.45) × (0.1, 0, 0.9)], 45[(0.02, 0.41, 0.9) × (0.1, 0, 0.9)], 5[(0.6, 0.3, 02)× (0.1, 0, 0.9)], 14[(0.3, 0.8, 0.45)×(0.6, 0.5 0)], 18[(0.02, 0.41. 0.9)× (0.0.6, 0.5, 0)], 2[(0.6, 0.3, 0.2) × ( 0.6, 0.5, 0)]} = {35(0.03, 0, 0.405), 45(0.002,0, 0.81), 5(0.06, 0, 0.18), 14(0.18, 0.4, 0), 18(0.012, 0.205, 0), 2(0.36, 0.15, 0)}, is in .
Theorem 8. is a multiset NC semigroup under addition modulo 1.
Proof. is closed under the binary operation addition modulo 1. Thus is the neutrosophic multiset semigroup under + modulo 1. □
Now we proceed on to define a special type of zero divisors. In view of this we have the following theorem.
Theorem 9. is an infinite commutative multiset NC semigroup, which is not a monoid and has special type of zero divisors.
Proof. We see under the binary operation product is closed and is associative as the base set is associative and commutative and is closed under the binary operation product. Thus is commutative semigroup of infinite order. Further does not contain (1, 1, 1) so is not a monoid.
From the above definition and description of special zero divisors R has infinite number of them. □
We have the following theorem.
Theorem 10. is a NC multiset commutative semiring of infinite order which has infinite numbers of special type of zero divisors.
Proof. Follows from Theorem 8 and Theorem 9. □
Next we proceed on to define n- multiplicity neutrosophic multisets and derive some properties related with them. and are just multiset NC semigroups under product and in fact they are monoids. Further has infinite number of special zero divisors.
5. n-Multiplicity Neutrosophic Set Semigroups Using and
In this section we define the new notion of n-multiplicity NC using and . We prove these n-multiplicity NC are of infinite order but what is restricted is the multiplicity n, that is any element cannot exceed multiplicity n; it can maximum be n, where n is a positive finite integer. Finally we prove where is a NC n-multiset commutative semiring of infinite order.
We will first illustrate this situation by some examples before we make an abstract definition of them.
Example 4. Let 4- = {collection all multisets with entries from , such that any element in can maximum repeat itself only four times}. Here be a 4-multiplicity multiset from 4-. We see the NC and (0.8, 0.8,0.8) have multiplicity four which is the highest multiplicity an element of 4- can have. The NC (0.1, 0.9, 0.7) and (0.7,0.9,0.6) have multiplicity 3. The multiplicity of (0.9, 0.9, 0.9) is two and that of (0.6, 0.1, 0.1) is one. Clearly does not contain the extreme values 0 and 1 as is built using the open interval (0, 1). However on we can not define addition.
Thus 4-
can not have the operation of addition defined on it. Now we show how the operation × is defined on 4-
for the some
4-
. Now
we now use the fact we can have maximum only 4 multiplicity of an element so we replace 6(0.15, 0.49, 0.08) by 4(0.15, 0.49, 0.08) and 8(0.1, 0.21, 0.04) by 4(0.1, 0.21, 0.04). Now the thresholded product is
3(0.03, 0.21, 0.56), 2(0.05, 0.27, 0.42), 4(0.02, 0.09, 0.28), 4(0.15, 0.49, 0.08), 4(0.25, 0.63, 0.06), 4(0.1, 0.21, 0.04))
4-
{4- is a commutative neutrosophic multiset semigroup of infinite order and the multiplicity of any element cannot exceed 4.
This semigroup is not a monoid and it has no special zero divisors or zero divisors or units.
Definition 12. 12 Let n- ={collection of all multisets with entries from of at-most multiplicity n- under usual product, × is defined as the n-multiplicity NC semigroup, .
In view of this we have the following theorem.
Theorem 11. Let n- be the n-multiplicity neutrosophic multisets ().
- 1.
n- is not closed under the binary operation ‘+’ under usual addition, for 1, 3 and 4.
- 2.
n- is a (n-multiplicity neutrosophic multiset) semigroup under the usual product for i = 1, 2, 3 and 4.
- 3.
{n- is a monoid for i = 3 and 4.
- 4.
{n- has no special zero divisors if and but they have no non trivial idempotents. and special zero divisors and no non trivial idempotents, but has both non trivial special zero divisors and non trivial idempotents.
Proof. Proof of 1: If and n- 0.7, 1.1, 1.0) n- as when built using and and by example 4 n-. Only is closed under addition.
Proof of 2: Since is closed under product so is n- with replacing the numbers greater than n by n in the resultant product; and 4 are semigroups, hence the claim.
Proof of 3: As and so is in n- and n- respectively so they are monoids.
Proof of 4: n- has no special zero divisors in case of and . Finally , has zero divisors and special zero divisors in case of and for and 4, and non trivial idempotents contributed by 0’s and 1’s only in case of . Hence the theorem. □
Example 5. Let 5-Collection of all neutrosophic multisets which can occur at most 5-times that is the multiplicity is 5 with elements from Let 5- We see the multiplicity of (0.3, 0.1, 0.2) is 5 others are less than 5.
Let 3(0.3, 0.2, 0), 4(0.5, 0.6, 0.9), 5(0.1, 0.2, 0.7)} and 4(0.8, 0.1, 0.9), 2(0.6, 0.6, 0.6) 5-. Now we first find 5(0.24, 0.02, 0), 5(0.4, 0.06, 0.81), 5(0.08, 0.02, 0.63), 5(0.06, 0.12, 0.42).
5(0.1, 0.3, 0.9), 5(0.9, 0.8, 0.6), 5(0.3, 0.7, 0.8), 5(0.9, 0.3, 0.6), 5(0.1, 0.2, 0.5), 5(0.7, 0.8, 0.3) 5- Addition is done modulo 1. However we have closure axiom to be true under + for elements in and in case of ; = (0, 1)). This closure axiom is flouted.
If addition modulo 1 is done we have to see that 1 is not included in the interval and 0 is included in that interval so we need to have only closed open interval [0, 1). Under these two constraints only we can make as well as and n- as semigroups under addition modulo 1.
We can built strong structure only using the [0, 1).
Theorem 12. Let n- = Collection of all multisets of S built using with multiplicity less than or equal to n;
{ n- is a commutative neutrosophic multiset semigroup of infinite order and is not a monoid, n- has infinite number of zero divisors.
Proof. If A and n- we find and update the multiplicities in to be less than or equal to n so that n- by Theorem 11(2).
Clearly n- so is not a monoid. □
Theorem 13. B = {n- the n-multiplicity multiset NC is a commutative semiring of infinite order and has no unit, where .
Proof. Follows from the fact { n-, +} is a commutative semigroup under addition modulo 1, Theorem 11(1) and Theorem 12 and {n-, is a commutative semigroup under ×. Hence the claim. □