Abstract
Fuzzy soft set theory is applied to hyper BCK-algebras. The notion of fuzzy soft positive implicative hyper BCK-ideals is introduced, and several properties are investigated. The relation between fuzzy soft positive implicative hyper BCK-ideal and fuzzy soft hyper BCK-ideal is considered. Characterizations of fuzzy soft positive implicative hyper BCK-ideal are provided. Using the notion of positive implicative hyper BCK-ideal, a fuzzy soft weak (strong) hyper BCK-ideal is established.
Introduction
Hyperstructure theory was born in 1934 when Marty defined hypergroups, began to analyze their properties, and applied them to groups and relational algebraic functions (see [22]). Since then, many papers and several books have been written on this topic. Nowadays, hyperstructures have a lot of applications in several branches of mathematics and computer sciences (see [1–3, 24–28]). In a classical algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. In [18], Jun et al. applied the hyperstructures to BCK-algebras, and introduced the concept of a hyper BCK-algebra which is a generalization of a BCK-algebra. Sine then, Jun et al. studied more notions and results in [12, 17]. Borzooei et al. [6] introduced the concept of the hyper K-algebra which is a generalization of the hyper BCK-algebra, and Zahedi et al. [29] defined the notions of (weak, strong) implicative hyper K-algebras. Borumand Saeidet al. [5] studied (weak) implicative hyper K-ideals in hyper K-algebras. Also, several fuzzy versions of hyper BCK-algebras have been considered in [13, 15]. Molodtsov [23] proposed a new approach, which was called soft set theory, for modeling uncertainty. In [10], Jun applied the notion of soft sets to the theory of BCK/BCI-algebras, and Jun et al. [12] studied ideal theory of BCK/BCI-algebras based on soft set theory. Maji et al. [21] extended the study of soft sets to fuzzy soft sets. They introduced the concept of fuzzy soft sets as a generalization of the standard soft sets, and presented an application of fuzzy soft sets in a decision making problem. Jun et al. [11] applied fuzzy soft set to BCK/BCI-algebras.
In this paper we apply the notion of fuzzy soft sets by Maji et al. to the theory of hyper BCK-algebras. We introduce the notion of fuzzy soft positive implicative hyper BCK-ideal, and investigate several properties. We discuss the relation between fuzzy soft positive implicative hyper BCK-ideal and fuzzy soft hyper BCK-ideal, and provide characterizations of fuzzy soft positive implicative hyper BCK-ideal. Using the notion of positive implicative hyper BCK-ideal, we establish a fuzzy soft weak (strong) hyper BCK-ideal.
Preliminaries
Let H be a nonempty set endowed with a hyper operation “cc”, that is, cc is a function from H × H to
By a BCK -algebra (see [18]) we mean a nonempty set H endowed with a hyper operation “cc” and a constant 0 satisfying the following axioms: (xccz) cc (yccz) ⪡ xccy, (xccy) ccz = (xccz) ccy, xccH ⪡ {x}, x ⪡ y and y ⪡ x imply x = y,
for all x, y, z ∈ H, where x ⪡ y is defined by 0 ∈ xccy and for every A, B ⊆ H, A ⪡ B is defined by ∀a ∈ A, ∃b ∈ B such that a ⪡ b.
In a BCK -algebra H, the condition (H3) is equivalent to the condition: xccy ⪡ {x} for all x, y ∈ H.
In any BCK-algebra H, the following hold (see [18]):
A non-empty subset I of a BCK-algebra H is said to be S-reflexive (see [7])
A subset I of a BCK-algebra H is called a BCK-ideal of H (see [18]) if it satisfies
A subset I of a BCK-algebra H is called a strong BCK-ideal of H (see [17]) if it satisfies (2.10) and
Recall that every strong BCK-ideal is a BCK-ideal (see [17]).
A subset I of a BCK-algebra H is called a weak BCK-ideal of H (see [18]) if it satisfies (2.10) and
A subset I of a BCK-algebra H is called a BCK-ideal of Lom (see [16]) if it satisfies (2.10) and
Molodtsov [23] defined the soft set in the following way: Let U be an initial universe set and E be a set of parameters. Let P (U) denote the power set of U and A ⊆ E .
In other words, a soft set over U is a parameterized family of subsets of the universe U . For ɛ ∈ A, λ (ɛ) may be considered as the set of ɛ-approximate elements of the soft set (λ, A) . Clearly, a soft set is not a set. For illustration, Molodtsov considered several examples in [23].
In general, for every parameter u in A, kapu is a fuzzy set in U and it is called fuzzy value set of parameter u. If for every u ∈ A, kapu is a crisp subset of U, then (kap, A) is degenerated to be the standard soft set. Thus, from the above definition, it is clear that fuzzy soft set is a generalization of standard soft set.
Given a fuzzy set μ in a BCK-algebra Lom and a subset T of Lom, by μ* and μ* we mean
Given a fuzzy set μ in a BCK-algebra Lom, we consider the following conditions:
A satisfies the condition
If A satisfies the following condition:
In what follows, let Lom and E be a BCK-algebra and a set of parameters, respectively, and A be a subset of E unless otherwise specified.
We first consider the following condition
Tabular representation of the binary operation cc
Given a set A = {x, y} of parameters, we define a fuzzy soft set A by Table 2.
Tabular representation of A
It is clear that kap [y] (0) ≥ kap [y] (z) for all z ∈ Lom. But a ⪡ b and kap [y] (a) =0.4 < 0.6 = kap [y] (b).
Cayley table for the binary operation “cc”
Given a set A = {x, y, z} of parameters, we define a fuzzy soft set A by Table 4.
Tabular representation of A
Then kap [x] and kap [z] satisfies conditions (3.1) and (3.2). Hence A is a fuzzy soft positive implicative hyper BCK-ideal of Lom based on x and z. But kap [y] does not satisfy the condition (3.1) since a ⪡ b and kap [y] (a) < kap [y] (b), and does not satisfy the condition (3.2) because of
Cayley table for the binary operation “cc”
Given a set A = {x, y, z} of parameters, we define a fuzzy soft set A by Table 6.
Tabular representation of A
Then A is a fuzzy soft positive implicative hyper BCK-ideal of Lom.
The converse of Theorem 3.5 is not true as seen in the following example.
Cayley table for the binary operation “cc”
Given a set A = {x, y} of parameters, we define a fuzzy soft set A by Table 8.
Tabular representation of A
Then A is a fuzzy soft BCK-ideal based on y over Lom. But it is not a fuzzy soft positive implicative hyper BCK-ideal based on y over Lom since
Therefore any fuzzy soft BCK-ideal may not be a fuzzy soft positive implicative hyper BCK-ideal.
Given a fuzzy soft set A over Lom and t ∈ [0, 1], we consider the following set.
Thus c ∈ U (kapu ; t), and so xccz ⊆ U (kapu ; t). Therefore U (kapu ; t) is a positive implicative hyper BCK-ideal of Lom for all t ∈ [0, 1] and any parameter u in A with U (kapu ; t)≠ ∅.
Conversely, assume that U (kapu ; t)≠ ∅ for t ∈ [0, 1] and any parameter u in A. Suppose that U (kapu ; t) is a positive implicative hyper BCK-ideal of Lom. Then U (kapu ; t) is a BCK-ideal of Lom by Lemma 3.7. It follows from Lemma 3.8 that kapu is a BCK-ideal of Lom. Thus the condition (3.1) is valid. Let t = min{ kapu * ((xccy) ccz) , kapu * (yccz) }. Then
I is a positive implicative hyper BCK-ideal of Lom.
I is a BCK-ideal of Lom such that
The answer to the question above is negative. For example, note that A is a fuzzy soft positive implicative hyper BCK-ideal of Lom based on x and z in Example 3.3. Also U (kap [x] ; t) and U (kap [z] ; t) are reflexive for all t ∈ Im (kapu). But
for all x, y, z ∈ Lom. Moreover if the non-empty level set U (kapu ; t) of A is reflexive for all t ∈ [0, 1], then
Using the notion of positive implicative hyper BCK-ideal of Lom, we establish a fuzzy soft weak BCK-ideal.
where t > s in [0, 1] and I z : = {y ∈ Lom ∣ yccz ⊆ I}, then A is a u-fuzzy soft weak BCK-ideal of Lom.
for all x, y ∈ Lom.
is a BCK-ideal of Lom for all z ∈ Lom.
The following example shows that any positive implicative hyper BCK-ideal is neither S-reflexive nor a strong BCK-ideal.
Using the notion of positive implicative hyper BCK-ideal of Lom, we establish a fuzzy soft strong BCK-ideal.
The following example shows that the converse of Lemma 3.21 is not true in general.
Cayley table for the binary operation “cc”
Then I : = {0, c} is a strong BCK-ideal and S-reflexive. But it is not a positive implicative hyper BCK-ideal since (bcca) cca ⪡ I and acca ⊆ I but bcca ⊈ I.
where u is any parameter in A. If the set U (kapu ; t) in (3.3) is a strong BCK-ideal of Lom for all t ∈ [0, 1] with U (kapu ; t)≠ ∅, then A is a fuzzy soft strong BCK-ideal of Lom.
Using Lemmas 3.21 and 3.23, we have the following theorem.
The following example shows that the converse of Theorem 3.24 is not true in general.
Cayley table for the binary operation “cc”
Given a set A = {x, y} of parameters, we define a fuzzy soft set A by Table 11.
Tabular representation of A
It is routine to verify that A is a fuzzy soft strong BCK-ideal of Lom. If t > 0.6, then the set U (kap [x] ; t) = {0} is not a positive implicative hyper BCK-ideal of Lom since (0ccb) ccb = {0} ⪡ U (kap [x] ; t), bccb = {0, b} ⊈ U (kap [x] ; t) and
Conclusions
We have applied the notion of fuzzy soft sets by Maji et al. to the theory of hyper BCK-algebras. We have introduced the notion of fuzzy soft positive implicative hyper BCK-ideal, and have investigated several properties. We have discussed the relation between fuzzy soft positive implicative hyper BCK-ideal and fuzzy soft hyper BCK-ideal, and have provided characterizations of fuzzy soft positive implicative hyper BCK-ideal. We have established a fuzzy soft weak (strong) hyper BCK-ideal by using the notion of positive implicative hyper BCK-ideal. We hope in the forthcoming researches and papers we continue this idea and define some new notions.
Footnotes
Acknowledgments
The authors wish to thank the anonymous reviewers for their valuable suggestions.
