See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/326979727

On Fuzzy Multigroups and Fuzzy Submultigroups

Article · August 2018

CITATIONS READS
0 13

1 author:

Ejegwa Paul Augustine

University of Agriculture, Makurdi-Nigeria
28 PUBLICATIONS   71 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Non-classical sets and their applications View project

Fuzzy Algebra View project

All content following this page was uploaded by Ejegwa Paul Augustine on 11 August 2018.

The user has requested enhancement of the downloaded file.

 On Fuzzy Multigroups and Fuzzy
Submultigroups
P.A. Ejegwa

Department of Mathematics/Statistics/Computer Science, University of

Agriculture, P.M.B. 2373, Makurdi, Nigeria
Email: ocholohi@gmail.com

Abstract. The concept of fuzzy multigroups is the algebraic structure of fuzzy

multisets and hence the extension of the notion of fuzzy groups. This paper
studies fuzzy multigroups and proposes the idea of fuzzy multigroupoids. It is
shown that the level set of a fuzzy multigroup is a subgroup of a group. The
notion of fuzzy submultigroups is introduced and some related results are es-
tablished.

2010 Mathematics Subject Classification: 03E72, 08A72, 20N25

Keywords. Fuzzy multisets, Fuzzy submultisets, Fuzzy multigroups, Fuzzy

submultigroups, Fuzzy multigroupoids.
1

1 Introduction
In an attempt to model uncertainty, the notion of fuzzy sets was proposed by
Zadeh [16] as a method for representing imprecision in real-life situations. One
can say, a fuzzy set (or a fuzzy subset of a set) is the fuzzification of crisp
set to capture uncertainty in a collection. The concept of fuzzy set has grown
stupendously over the years giving birth to fuzzy group which is the application
of fuzzy sets to the elementary theory of groups and groupoids as noted in [7].
Several works has been done on fuzzy groups since inception; some could be
found in [5, 8].
Motivated by Zadeh [16], the idea of fuzzy multisets was introduced in [15]
as the generalization of fuzzy sets or the fuzzification of multisets in [3]. Re-
cently, Shinoj et al. [9] followed the foot steps of Rosenfeld [7] and introduced
a non-classical group called fuzzy multigroup. In particular, the idea of fuzzy
multigroups generalized fuzzy groups. In this paper, we study fuzzy multi-
groups and obtain some related results. The notions of fuzzy multigroupoids,
fuzzy submultigroups and the level sets of fuzzy multigroups are introduced.

2 Preliminaries
In this section, we review some definitions and results for the sake of complete-
ness and reference.
1 This paper has been published by Journal of Fuzzy Mathematics: J. Fuzzy Math. 26(3)

(2018) 641–654

1
Definition 2.1. Let X be a set. A fuzzy set A of X is characterized by a
membership function
µA : X → [0, 1].
That is, 
 1, if x ∈ A
µA (x) = 0, if x ∈/A
(0, 1) if x is partly in A


The closer the membership value µA (x) to 1, the more x belongs to A, while the
grade 1 and 0 represent full membership and full non-membership, respectively.
See [16] for details.
Definition 2.2. Let X be a group. A fuzzy set A of X is called a fuzzy group
(or a fuzzy subgroup) of X if it satisfies
(i) µA (xy) ≥ µA (x) ∧ µA (y)∀x, y ∈ X,
(ii) µA (x−1 ) = µA (x)∀x ∈ X.
See [7, 5, 8] for details.
Definition 2.3. Let X be a set. A multiset M is characterized by a count
function
CM : X → N,
where N = N ∪ {0}.
The set of all multisets of X is denoted by M S(X). Details on multisets can be
found in [3, 11, 12, 14].
Definition 2.4. Let X be a group. A multiset M is called a multigroup of X
if it satisfies the following conditions:
(i) CM (xy) ≥ CM (x) ∧ CM (y)∀x, y ∈ X,
(ii) CM (x−1 ) ≥ CM (x)∀x ∈ X.
We denote the set of all multigroups of X by M G(X). See [6] for details.
Definition 2.5. Let X be a set. A fuzzy multiset A of X is characterized by a
count membership function

CMA : X → [0, 1]

of which the value is a multiset of the unit interval I = [0, 1]. That is,

CMA (x) = {µ1 , µ2 , ..., µn , ...} ∀x ∈ X,

where µ1 , µ2 , ..., µn , ... ∈ [0, 1] such that

(µ1 ≥ µ2 ≥ ... ≥ µn ≥ ...).

Whenever the fuzzy multiset is finite, we write

CMA (x) = {µ1 , µ2 , ..., µn },

2
where µ1 , µ2 , ..., µn ∈ [0, 1] such that

µ1 ≥ µ2 ≥ ... ≥ µn ,

or simply
CMA (x) = {µi }
for µi ∈ [0, 1] and i = 1, 2, ..., n.
Now, a fuzzy multiset A is given as

CMA (x)
A = {h i | x ∈ X} or A = {hx, CMA (x)i | x ∈ X}.
x
The set of all fuzzy multisets is depicted by F M S(X).
Example 2.6. Assume that X = {a, b, c} is a set. Then for CMA (a) =
{1, 0.5, 0.5}, CMA (b) = {0.9, 0.7}, CMA (c) = {0}, A is a fuzzy multiset of
X written as
1, 0.5, 0.5 0.9, 0.7
A = {h i, h i}.
a b
Definition 2.7. Let A, B ∈ F M S(X). Then A is called a fuzzy submultiset of
B written as A ⊆ B if CMA (x) ≤ CMB (x)∀x ∈ X. Also, if A ⊆ B and A 6= B,
then A is called a proper fuzzy submultiset of B and denoted as A ⊂ B.
Definition 2.8. Let A, B ∈ F M S(X). Then the intersection and union of A
and B, denoted by A ∩ B and A ∪ B, are defined by the rules that for any object
x ∈ X,
(i) CMA∩B (x) = CMA (x) ∧ CMB (x),
(ii) CMA∪B (x) = CMA (x) ∨ CMB (x),
where ∧ and ∨ denote minimum and maximum operations. Also, the sum of A
and B denoted as A + B, is defined by the addition operation in X × [0, 1] for
crisp multiset. That is,

CMA+B (x) = CMA (x) + CMB (x)∀x ∈ X.

The meaning of the addition operation here is not as in the case of crisp multiset.
For example, if
0.7, 0.5 1, 0.5 0.5, 0.4
A = {h i, h i, h i}
x y z
and
0.8, 0.6 0.9, 0.3 1, 0.7
B = {h i, h i, h i}
x y z
for X = {x, y, z}. Then
0.8, 0.7, 0.6, 0.5 1, 0.9, 0.5, 0.3 1, 0.7, 0.5, 0.4
A + B = {h i, h i, h i}.
x y z

Definition 2.9. Let A, B ∈ F M S(X). A and B are comparable to each other

if A ⊆ B or B ⊆ A, and A = B if CMA (x) = CMB (x)∀x ∈ X.
See [2, 4, 10, 13, 15] for more details on fuzzy multisets.

3
Definition 2.10. Let X be a group. A fuzzy multiset A of X is said to be a
fuzzy multigroup of X if it satisfies the following two conditions:
(i) CMA (xy) ≥ CMA (x) ∧ CMA (y)∀x, y ∈ X,
(ii) CMA (x−1 ) ≥ CMA (x)∀x ∈ X.
It follows immediately that,

CMA (x−1 ) = CMA (x), ∀x ∈ X

since
CMA (x) = CMA ((x−1 )−1 ) ≥ CMA (x−1 ).
Also,
CMA (e) ≥ CMA (x)∀x ∈ X
because

CMA (e) = CMA (xx−1 ) ≥ CMA (x) ∧ CMA (x) = CMA (x)

and
CMA (xn ) ≥ CMA (x)∀x ∈ X
since

CMA (xn ) = CMA (xn−1 x) ≥ CMA (xn−1 ) ∧ CMA (x)

≥ CMA (x) ∧ ... ∧ CMA (x)
= CMA (x).

The set of all fuzzy multigroups of X is denoted by F M G(X).

Definition 2.11. Let A ∈ F M G(X). Then the set A∗ is defined as

A∗ = {x ∈ X | CMA (x) = CMA (e)},

where e is the identity element of X.

Proposition 2.12. Let A ∈ F M G(X). Then A∗ is a subgroup of X.
Definition 2.13. Let A ∈ F M G(X). Then the inverse of A, that is A−1 , is
defined by
CMA−1 (x) = CMA (x−1 )∀x ∈ X.
Clearly, A ∈ F M G(X) if and only if A−1 ∈ F M G(X).
Remark 2.14. Let A, B ∈ F M G(X), then the following statements hold.
(i) A ⊆ B ⇔ A−1 ⊆ B −1 ,
(ii) A ⊆ A−1 ⇔ A−1 ⊆ A.
Definition 2.15. Let A, B ∈ F M G(X). Then the product A ◦ B of A and B
is defined to be a fuzzy multiset over X as follows:
 W
CMA◦B (x) = x=yz (CMA (y) ∧ CMB (z)), if ∃ y, z ∈ X such that x = yz
0, otherwise.

Thus, if A ∈ F M G(X), then A ◦ A = A.

4
Theorem 2.16. Let A ∈ F M S(X). Then A ∈ F M G(X) if and only if A
satisfies the following conditions.

(i) A ◦ A ⊆ A,
(ii) A−1 ⊆ A or A ⊆ A−1 or A−1 = A,
(iii) A ◦ A−1 ⊆ A.
Theorem 2.17. Let A, B ∈ F M G(X), then the following hold.

(i) A ◦ B = B ◦ A,
(ii) (A ◦ B)−1 = B −1 ◦ A−1 ,
(iii) (A ◦ B) ◦ C = A ◦ (B ◦ C).

See [1, 9] for details on fuzzy multigroups.

3 Some results on fuzzy multigroups

Definition 3.1. Let X be a groupoid. A fuzzy multiset A of X is called a fuzzy
multigroupoid of X if for all x, y ∈ X,

CMA (xy) ≥ CMA (x) ∧ CMA (y),

where CMA denotes count membership function of A from X into a unit interval
[0, 1].

Definition 3.2. Let X be a group. A fuzzy multigroupoid A of X is called a

fuzzy multigroup of X if

CMA (x−1 ) = CMA (x)∀x ∈ X.

Remark 3.3. Let X be a group and A be a fuzzy multiset of X. If

CMA (xy −1 ) ≥ CMA (x) ∧ CMA (y),

for all x, y ∈ X, then A is called a fuzzy multigroup of X.

Example 3.4. Let X = {0, 1, 2} be a Z3 group with respect to addition. Then
0.6, 0.5 0.52, 0.44 0.52, 0.44
A = {h i, h i, h i}
0 1 2
is a fuzzy multigroup of X.

Remark 3.5. Every fuzzy multigroup is a fuzzy multiset but the converse is
not necessarily true.
Proposition 3.6. Let A be a fuzzy multigroup of a finite group X. Then

CMA (x−1 ) = CMA (xn−1 )

∀x ∈ X, n ∈ N.

5
Proof. Let x ∈ X, x 6= e. Since X is finite, x has finite order, say n > 1. Thus
xn = e and so x−1 = xn−1 . Consequently, A is finite since A ∈ F M G(X), then
we have

CMA (x−1 ) = CMA (x−1 e) = CMA (xn−1 xn )

≥ CMA (xn−1 ) ∧ CMA (xn )
= CMA (xn−1 )

⇒ CMA (x−1 ) ≥ CMA (xn−1 ),

and

CMA (xn−1 ) = CMA (xn−1 xn ) = CMA ((xn−2 x)xn )

≥ CMA (xn−2 x) ∧ CMA (xn )
≥ CMA (xn−2 ) ∧ CMA (x)
≥ CMA (x) ∧ ... ∧ CMA (x)
= CMA (x) = CMA (x−1 ).

⇒ CMA (xn−1 ) ≥ CMA (x−1 ). Hence CMA (x−1 ) = CMA (xn−1 )∀x ∈ X.
Theorem 3.7. A fuzzy multigroupoid A of a finite group X is a fuzzy multigroup
if
CMA (x−1 ) = CMA (xn−1 )
∀x ∈ X and n ∈ N.
Proof. Since A is a fuzzy multigroupoid of X, then

CMA (xy) ≥ CMA (x) ∧ CMA (y)

for all x, y ∈ X. Suppose CMA (x−1 ) = CMA (xn−1 )∀x ∈ X and n ∈ N. Using
the notion of fuzzy multigroupoid repeatedly, we get

CMA (x−1 ) = CMA (xn−2 x) ≥ CMA (xn−2 ) ∧ CMA (x)

≥ CMA (x) ∧ CMA (x) ∧ ... ∧ CMA (x)
= CMA (x),

that is,
CMA (x−1 ) ≥ CMA (x)
and by Definition 2.10,

CMA (x) = CMA ((x−1 )−1 ) ≥ CMA (x−1 ),

implies
CMA (x) ≥ CMA (x−1 ).
Hence, CMA (x−1 ) = CMA (x). Therefore, A is a fuzzy multigroup of X by
Definition 3.2.

6
Definition 3.8. Let {Ai }i∈I , I = 1, ..., n be an arbitrary family of fuzzy multi-
groups of X. Then
^
CMTi∈I Ai (x) = CMAi (x) ∀x ∈ X
i∈I

and _
CMSi∈I Ai (x) = CMAi (x) ∀x ∈ X.
i∈I

The family of fuzzy multigroups {Ai }i∈I of X is said to have inf/sup assuming
chain if either A1 ⊆ A2 ⊆ ... ⊆ An or A1 ⊇ A2 ⊇ ... ⊇ An , respectively.
In [9], if A, B ∈ F M G(X) and
T {Ai }i∈I is a family of fuzzy multigroups
of X, then A ∩ B ∈ F M G(X),
S i∈I Ai ∈ F M G(X) and A ∪ B ∈ / F M G(X)
in general. We show that i∈I Ai ∈ F M G(X) if {Ai }i∈I have either sup/inf
assuming chain.

Theorem 3.9. Let {Ai }i∈I be a family S of fuzzy multigroups of X. If {Ai }i∈I
have sup/inf assuming chain, then i∈I Ai ∈ F M G(X).
S W
Proof. Let A = i∈I Ai , then CMA (x) = i∈I CMAi (x). We show that
CMA (xy −1 ) ≥ CMA (x) ∧ CMA (y)∀x, y ∈ X. If either CMA (x) = 0 or
CMA (y) = 0,Wthen the inequalityW holds. Let CMA (x) > 0, CMA (y) > 0,
then we have i∈I W CMAi (x) > 0, i∈I CMAi (y) > 0. Suppose ∃ i0 ∈ I such
that
W CM A i0
(x) = i∈I CMAi (x), and also ∃ jo ∈ I such that CMAj0 (x) =
i∈I CM A i
(x) because {Ai }i∈I is a sup/inf assuming chain. Since {Ai }i∈I is a
chain, implies that
(i) Ai0 ⊆ Aj0 or (ii) Aj0 ⊆ Ai0 .
(i) Suppose Ai0 ⊆ Aj0 implies CMAi0 (x) ≤ CMAj0 (x).
Then

CMA (xy −1 ) = CMAj0 (xy −1 )

≥ CMAj0 (x) ∧ CMAj0 (y)
≥ CMAi0 (x) ∧ CMAi0 (y)
_ _
= CMAi (x) ∧ CMAi (y)
i∈I i∈I
= CMA (x) ∧ CMA (y).

(ii) Suppose Aj0 ⊆ Ai0 implies CMAj0 (x) ≤ CMAi0 (x). Then

CMA (xy −1 ) = CMAi0 (xy −1 )

≥ CMAi0 (x) ∧ CMAi0 (y)
≥ CMAj0 (x) ∧ CMAj0 (y)
_ _
= CMAi (x) ∧ CMAi (y)
i∈I i∈I
= CMA (x) ∧ CMA (y).
S
Hence, A = i∈I Ai ∈ F M G(X).

7
Remark 3.10. Let A, B ∈ F M G(X) such that A and B are comparable, then
A ∪ B ∈ F M G(X).
Theorem 3.11. If A, B ∈ F M G(X), then A + B ∈ F M G(X).
Proof. Let x, y ∈ X. By Definition 2.8 and Remark 3.3, we have
CMA+B (xy −1 ) = CMA (xy −1 ) + CMB (xy −1 )
≥ (CMA (x) ∧ CMA (y)) + (CMB (x) ∧ CMB (y))
= CMA (x) + CMB (x) ∧ CMA (y) + CMB (y)
= CMA+B (x) ∧ CMA+B (y),
⇒ CMA+B (xy −1 ) ≥ CMA+B (x) ∧ CMA+B (y). Hence A + B ∈ F M G(X).
P
Remark 3.12. Let {Ai }i∈I ∈ F M G(X). Then i∈I Ai ∈ F M G(X).
Theorem 3.13. Let A ∈ F M G(X). Then CMA (xy) = CMA (y)∀x, y ∈ X if
and only if CMA (x) = CMA (e).
Proof. Suppose CMA (xy) = CMA (y)∀y ∈ X. Then by letting y = e, we have
CMA (x) = CMA (e)∀x ∈ X.
Conversely, suppose that CMA (x) = CMA (e). Then CMA (y) ≤ CMA (x)
and so
CMA (xy) ≥ CMA (x) ∧ CMA (y) = CMA (y).
Also,
CMA (y) = CMA (x−1 xy) ≥ CMA (x) ∧ CMA (xy)
= CMA (xy).
Hence CMA (xy) = CMA (y)∀y ∈ X.
Theorem 3.14. Let A ∈ F M G(X) with identity e ∈ X. Then CMA (x) =
CMA (y), ∀x, y ∈ X if CMA (xy −1 ) = CMA (e).
Proof. Let A ∈ F M G(X) and suppose CMA (xy −1 ) = CMA (e). Then ∀x, y ∈
X,
CMA (x) = CMA (xy −1 y)
= CMA ((xy −1 )y)
≥ CMA (xy −1 ) ∧ CMA (y)
= CMA (e) ∧ CMA (y)
= CMA (y).
⇒ CMA (x) ≥ CMA (y).
Again,
CMA (y) = CMA (y −1 ) = CMA ((x−1 x)y −1 )
= CMA (x−1 (xy −1 ))
≥ CMA (x−1 ) ∧ CMA (xy −1 )
= CMA (x) ∧ CMA (xy −1 )
= CMA (x) ∧ CMA (e)
= CMA (x).

8
⇒ CMA (y) ≥ CMA (x).
Hence, CMA (x) = CMA (y).
Theorem 3.15. Let X be a group. If A is a fuzzy multigroup of X, then
CMA (xy) = CMA (x) ∧ CMA (y) for each x, y ∈ X with CMA (x) 6= CMA (y).
Proof. Let x, y ∈ X. Assume that CMA (x) > CMA (y), then

CMA (xy) ≥ CMA (x) ∧ CMA (y) = CMA (y)∀x, y ∈ X

and

CMA (y) = CMA (x−1 xy) ≥ CMA (x−1 ) ∧ CMA (xy)

= CMA (x) ∧ CMA (xy)
= CMA (xy).

Thus CMA (xy) = CMA (y) = CMA (x) ∧ CMA (y).

Corollary 3.16. Let A ∈ F M G(X) and if x, y ∈ X with CMA (x) 6= CMA (y),
then CMA (xy) = CMA (yx) = CMA (x) ∧ CMA (y).
Proof. Let x, y ∈ X. Since CMA (x) 6= CMA (y), it implies that CMA (x) >
CMA (y) or CMA (y) > CMA (x). Suppose CMA (x) > CMA (y). Then

CMA (xy) ≥ CMA (y)

and

CMA (y) = CMA (x−1 xy) ≥ CMA (x−1 ) ∧ CMA (xy)

= CMA (x) ∧ CMA (xy)
= CMA (xy).

It follows that

CMA (y) ≥ CMA (xy) ≥ CMA (x) ∧ CMA (y)

= CMA (y).

From here, we see that

CMA (xy) ≥ CMA (x) ∧ CMA (y)

and
CMA (x) ∧ CMA (y) ≥ CMA (xy)
implying that CMA (xy) = CMA (x) ∧ CMA (y).
Similarly, suppose CMA (y) > CMA (x). We have

CMA (yx) ≥ CMA (x)

and

CMA (x) = CMA (y −1 yx) ≥ CMA (y −1 ) ∧ CMA (yx)

= CMA (y) ∧ CMA (yx)
= CMA (yx).

9
Thus, we get

CMA (x) ≥ CMA (yx) ≥ CMA (y) ∧ CMA (x)

= CMA (x).

Clearly, CMA (yx) = CMA (y) ∧ CMA (x). Hence, the result follows.
Theorem 3.17. Let A, B ∈ F M G(X). Then A ⊆ A ◦ B if and only if
CMA (e) ≤ CMB (e).
Proof. Let x ∈ X. If CMA (e) ≤ CMB (e) and by Definition 2.15, we get
_
CMA◦B (x) = (CMA (y) ∧ CMB (z)), ∀y, z ∈ X
x=yz
≥ CMA (x) ∧ CMB (e)
≥ CMA (x) ∧ CMA (e)
= CMA (x).

⇒ CMA◦B (x) ≥ CMA (x) that is, A ⊆ A ◦ B. Conversely,

_
CMA◦B (e) = (CMA (x) ∧ CMB (x−1 )), ∀x ∈ X
e=xx−1
≤ CMA (e) ∧ CMB (e).

Thus if CMA (e) > CMB (e), then CMA◦B (e) = CMB (e) < CMA (e) and so
A * A ◦ B.
Corollary 3.18. Let A, B ∈ F M G(X). Then A ⊆ A ◦ B and B ⊆ A ◦ B if
CMA (e) = CMB (e).
Proof. Let x ∈ X. Suppose CMA (e) = CMB (e). By Definition 2.15, we have
_
CMA◦B (x) = (CMA (y) ∧ CMB (z)), ∀y, z ∈ X
x=yz
≥ CMA (x) ∧ CMB (e)
= CMA (x) ∧ CMA (e)
= CMA (x).

⇒ CMA◦B (x) ≥ CMA (x) that is, A ⊆ A ◦ B.

Also,
_
CMA◦B (x) = (CMA (y) ∧ CMB (z)), ∀y, z ∈ X
x=yz
≥ CMA (e) ∧ CMB (x)
= CMB (e) ∧ CMB (x)
= CMB (x).

⇒ CMA◦B (x) ≥ CMB (x) that is, B ⊆ A ◦ B.

Theorem 3.19. Let A, B ∈ F M G(X) such that CMA (e) = CMB (e). If A◦B ∈
F M G(X), then A ◦ B is generated by A and B.

10
Proof. Suppose that A ◦ B ∈ F M G(X). Then we show that A ◦ B is the
smallest fuzzy multigroup of X containing A and B. By Corollary 3.18, we see
that A ⊆ A ◦ B and B ⊆ A ◦ B.
Let C be any fuzzy multigroup of X containing both A and B. Let x ∈ X, then
we get
_
CMA◦B (x) = (CMA (y) ∧ CMB (z)), ∀y, z ∈ X
x=yz
_
≤ (CMC (y) ∧ CMC (z)), ∀y, z ∈ X
x=yz
= CMC◦C (x),

since CMA (y) ≤ CMC (y) and CMB (z) ≤ CMC (z). Because C ∈ F M G(X)
and C ◦ C = C by Definition 2.15, we have A ◦ B ⊆ C. Consequently, A ◦ B is
a fuzzy multigroup generated by A and B.
Theorem 3.20. Let A, B ∈ F M G(X). Then A ◦ B ∈ F M G(X) if and only if
A ◦ B = B ◦ A.
Proof. Since A, B ∈ F M G(X), it follows from Definition 2.13 that A = A−1
and B = B −1 . Suppose (A ◦ B) ∈ F M G(X). Then we have

CMA◦B (x) = CM(A◦B)−1 (x) = CMB −1 ◦A−1 (x)

_
= (CMB −1 (y) ∧ CMA−1 (z)), ∀y, z ∈ X
x=yz
_
= (CMB (y −1 ) ∧ CMA (z −1 )), ∀y, z ∈ X
x=yz
_
= (CMB (y) ∧ CMA (z)), ∀y, z ∈ X
x=yz
= CMB◦A (x).

Thus, A ◦ B = B ◦ A.
Conversely, let A ◦ B = B ◦ A. Then

CM(A◦B)−1 (x) = CMA◦B (x−1 ) = CMA◦B (x)

and

CM(A◦B)◦(A◦B) (x) = CMA◦(B◦A)◦B (x)

= CMA◦(A◦B)◦B (x)
= CM(A◦A)◦(B◦B) (x)
= CMA◦B (x).

The result follows from Theorem 2.16.

Definition 3.21. Let A ∈ F M G(X). Then the level set, A∗ of A is defined as

A∗ = {x ∈ X | CMA (x) > 0}.

Theorem 3.22. Let A ∈ F M G(X). Then A∗ is a subgroup of X.

11
Proof. Let x, y ∈ A∗ . Then CMA (x) > 0 and CMA (y) > 0. Now

CMA (xy −1 ) ≥ (CMA (x) ∧ CMA (y)) > 0.

Hence, xy −1 ∈ A∗ . Therefore, A∗ is a subgroup of X.

Definition 3.23. Let A ∈ F M G(X). A fuzzy submultiset B of A is called a
fuzzy submultigroup of A denoted by B v A if B form a fuzzy multigroup. A
fuzzy submultigroup B of A is a proper fuzzy submultigroup denoted by B @ A,
if B v A and A 6= B.
Example 3.24. Let X = {e, a, b, c} be a Klein 4-group and
1, 0.8 0.52, 0.44 0.9, 0.6 0.52, 0.44
A = {h i, h i, h i, h i}
e a b c
be a fuzzy multigroup of X. Then
1, 0.8 0.52, 0.44 0.9, 0.6 0.52, 0.44
A = {h i, h i, h i, h i}
e a b c
and
0.7, 0.6 0.5, 0.44 0.6, 0.6 0.5, 0.44
B = {h i, h i, h i, h i}
e a b c
are fuzzy submultigroups of A.
But
0.7, 0.6 0.5, 0.44 0.6, 0.6 0.5, 0.44
B = {h i, h i, h i, h i}
e a b c
is a proper fuzzy submultigroups of A.
Remark 3.25. If A ∈ F M G(X) and B v A, then B ∈ F M G(X).
Remark 3.26. Let A, B ∈ F M G(X), C ∈ F M S(X), B v A and C ⊆ B,
respectively. Then C v A if and only if C v B.
Theorem 3.27. Let A, B ∈ F M G(X) such that CMA (x) ≤ CMB (x)∀x ∈ X.
Then
(i) A∗ is a subgroup of B∗ ,
(ii) A∗ is a subgroup of B ∗ .
Proof. (i) Let X be a group and x ∈ X because X 6= ∅. Since A, B ∈ F M G(X),
then A∗ is a subgroup of X, and consequently, B∗ is a subgroup of X by Theo-
rem 3.22. Since A is a fuzzy submultigroup of B, the result follows.

(ii) Follows from (i).

Theorem 3.28. If A, B, C ∈ F M G(X) such that A ⊆ B ⊆ C, then
(i) A ∩ B is a fuzzy submultigroup of C,
(ii) A ∪ B is a fuzzy submultigroup of C.
Proof. (i) Suppose A, B, C ∈ F M G(X), then CMA∩B (x) ≤ CMC (x)∀x ∈ X
since A ⊆ B ⊆ C. Thus, A ∩ B is a fuzzy submultigroup of C.

(ii) Straightforward from (i).

12
 4 Conclusion
The concepts of fuzzy multigroups and fuzzy submultigroups have been studied
with some results. The notion of fuzzy multigroupoids was proposed and some
related results were obtained.

References
[1] A. Baby, T.K. Shinoj, J.J. Sunil, On abelian fuzzy multigroups and order
of fuzzy multigroups, J. New Theory, 5(2) (2015):80–93.
[2] P.A. Ejegwa, Correspondence between fuzzy multisets and sequences,
Global J. Sci. Frontier Research: Math. Decision Sciences, 14(7) (2014):61–
66.
[3] D. Knuth, The art of computer programming, Semi Numerical Algorithms,
Second Edition, 2(1981), Addison-Wesley, Reading, Massachusetts.
[4] S. Miyamoto, Basic operations of fuzzy multisets, J. Japan Soci. Fuzzy
Theory Systems, 8(4) (1996):639–645.
[5] J.M. Mordeson, K.R. Bhutani, A. Rosenfeld, Fuzzy group theory, Springer-
Verlag Berlin Heidelberg, 2005.
[6] Sk. Nazmul, P. Majumdar and S.K. Samanta, On multisets and multi-
groups, Ann. Fuzzy Math. Inform., 6(3)(2013):643–656.
[7] A. Rosenfeld, Fuzzy subgroups, J. Mathl. Analy. Appl., 35(1971):512-517.
[8] B. Seselja, A. Tepavcevic, A note on fuzzy groups, Yugoslav J. Operation
Research, 7(1) (1997):49–54.
[9] T.K. Shinoj, A. Baby and J.J. Sunil, On some algebraic structures of fuzzy
multisets, Ann. Fuzzy Math. Inform., 9(1) (2015):77-90.
[10] D. Singh, J. Alkali, A.M. Ibrahim, An outline of the development of the con-
cept of fuzzy multisets, Int. J. Inno., Management Tech., 4(2) (2013):209–
212.
[11] D. Singh, A.M. Ibrahim, T. Yohanna, and J.N. Singh, An overview of the
applications of multisets, Novi Sad J. Math., 37(2)(2007):73–92.
[12] A. Syropoulos, Mathematics of multisets, Springer-Verlag Berlin Heidel-
berg, (2001):347–358.
[13] A. Syropoulos, On generalized fuzzy multisets and their use in computation,
Iranian J. Fuzzy Systems, 9(2) (2012):113–125.
[14] N.J. Wildberger, A new look at multisets, School of Mathematics, UNSW
Sydney 2052, Australia, 2003.
[15] R.R. Yager, On the theory of bags, Int. J. General Systems, 13 (1986):23–
37.
[16] L.A. Zadeh, Fuzzy sets, Inform. Control, 8 (1965):338–353.

13

View publication stats