On some properties of p-ideals based on intuitionistic fuzzy sets

Transcription

1 PURE MATHEMATICS RESEARCH ARTICLE On some properties of p-ideals based on intuitionistic fuzzy sets Muhammad Touqeer 1 * and Naim Çağman 2 Received: 13 June 2016 Accepted: 23 June 2016 First Published: 18 July 2016 *Corresponding author: Muhammad Touqeer, Basic Sciences Department, University of Engineering and Technology, Taxila, Pakistan touqeer-fareed@yahoo.com. Reviewing editor: Hari M. Srivastava, University of Victoria, Canada Additional information is available at the end of the article Abstract: In this paper, we consider the intuitionistic fuzzification of the concept of p-ideals in BCI-algebras and investigate some of their properties. Intuitionistic fuzzy p-ideals are connected with intuitionistic fuzzy ideals and intuitionistic fuzzy subalgebras. Moreover, intuitionistic fuzzy p-ideals are characterized using level subsets, homomorphic pre-images, and intuitionistic fuzzy ideal extensions. Subjects: Mathematics & Statistics; Physical Sciences; Science Keywords: intuitionistic fuzzy set; intuitionistic fuzzy ideal; intuitionistic fuzzy p-ideal; homomorphic pre-image; intuitionistic fuzzy ideal extensions 1. Introduction The operations of union, intersection, and the set difference are the most elementary operations of set theory. The study of these operations leads to the creation of a number of branches of algebra, for instance the notion of Boolean algebra is a result of generalization of these three operations and their properties. Also, the algebraic structures of distributive lattices, semi-rings, upper and lower semi-lattices are introduced on the basis of properties of intersection and union. Till 1966, different algebraic structures were discussed using the properties of intersection and union but the operation of set difference and its properties remained unexplored. Imai and Iséki (1966) considered the properties of set difference and presented the idea of a BCK-algebra. Iséki, in the same year, generalized BCK-algebras and presented the notion of BCI-algebras. BCK-algebras are inspired by BCK logic, i.e. an implicational logic based on modus ponens and the following axioms scheme: AxiomB..( A) ( B) AxiomC ( C).. ( ) AxiomK ( A) Similarly, BCI-algebras are inspired by BCI logic. In the present era, uncertainty is one of the definitive changes in science. The traditional view is that uncertainty is objectionable in science and science should endeavor for certainty through all conceivable means. At present, it is believed that uncertainty is vigorous for science that is not only an inevitable epidemic but also has great effectiveness. The statistical method, particularly the probability theory, was the first type of this approach to study the physical process at the molecular level as the ABOUT THE AUTHORS This article is an application of intuitionistic fuzzy sets to p-ideals in BCI-algebras. We have also worked out applications of intuitionistic fuzzy sets to BCI-commutative, BCI-implicative, and BCI-positive implicative ideals in BCI-algebras and discussed their relationship. Moreover, the study has been extended by applying hyperstructures and soft sets to these ideals. PUBLIC INTEREST STATEMENT This paper considers the intuitionistic fuzzification of the concept of p-ideals in BCI-algebras. Intuitionistic fuzzy p-ideals are related with simple intuitionistic fuzzy ideals with the help of examples and their characterizations are discussed using the ideas of level subsets, homomorphic pre-images, and intuitionistic fuzzy ideal extensions. This article can be helpful in solving many decision-making problems The Author(s). This open access article is distributed under a Creative Commons Attribution (CC-BY) 4.0 license. Page 1 of 12

2 existing computational approaches were not able to meet the enormous number of units involved in Newtonian mechanics. Till mid-twentieth century, probability theory was the only tool for handling certain type of uncertainty called randomness. But there are several other kinds of uncertainties, one such type is called vagueness" or imprecision" which is inherent in our natural languages. During the world war II, the development of computer technology assisted quite effectively in overcoming many complicated problems. But later, it was realized that complexity can be handled up to a certain limit, that is, there are complications which cannot be overcome by human skills or any computer technology. Then, the problem was to deal with such type of complications where no computational power is effective. Zadeh (1965) put forward his idea of fuzzy set theory which is considered to be the most suitable tool in overcoming the uncertainties. The concept of fuzzy set was suggested to achieve a simplified modeling of complex systems. The application of basic operations as direct generalization of complement, intersection, and union for characteristic function was also proposed as a result of this idea. This theory is considered as a substitute of probability theory and is widely used in solving decision-making problems. Later, this fuzziness" concept led to the highly acclaimed theory of fuzzy logic. This theory has been applied with a good deal of success to many areas of engineering, economics, medical science, etc., to name a few, with great efficiency. After the invention of fuzzy sets, many other hybrid concepts begun to develop. Atanassov (1986) generalized the fuzzy sets by presenting the idea of intuitionistic fuzzy sets, a set with each member having a degree of belongingness as well as a degree of non-belongingness. Davvaz, Abdulmula, and Salleh (2013), Senapati, Bhowmik, Pal, and Davvaz (2015), Cristea, Davvaz, and Sadrabadi (2015) discussed Atanassov s intuitionistic fuzzy hyperrings (rings) based on intuitionistic fuzzy universal sets, Atanassov s intuitionistic fuzzy translations of intuitionistic fuzzy subalgebras and ideals in BCK/BCI-algebras and special intuitionistic fuzzy subhypergroups of complete hypergroups. Mursaleen, Srivastava, and Sharma (2016) defined certain new spaces of statistically convergent and strongly summable sequences of fuzzy numbers. Jun and Meng (1994) discussed the idea of fuzzy p-ideals in BCI-algebras and proved the basic properties. In this paper, we introduce the concept of intuitionistic fuzzy p-ideals in BCI-algebras and investigate some of its properties. 2. Preliminaries An algebra (Ω,,0) of type (2, 0) is called a BCI-algebra if it satiates the following axioms (Imai & Iséki, 1966): ((ı ȷ) (ı l)) (l ȷ) = (ı (ı ȷ)) ȷ = ı ı = ı ȷ = 0 and ȷ ı = 0 imply ı = ȷ ı 0 = 0 ı = 0 for any ı, ȷ, l Ω. In a BCI-algebra, a partial ordering " is demarcated as, ı ȷ ı ȷ = 0. In a BCI-algebra Ω, the set M ={ı Ω 0 ı = 0} is a subalgebra and is called the BCK-part of Ω. Ω is called proper if Ω M Φ. Otherwise it is improper. Moreover, in a BCI-algebra, the succeeding axioms hold: (ı ȷ) l=(ı l) ȷ ı 0 = ı ı ȷ implies ı l ȷ l and l ȷ l ı (ı ȷ) =(0 ı) (0 ȷ) (0 (ı ȷ)) = 0 (ȷ ı) (ı l) (ȷ l) ı ȷ for any ı, ȷ, l Ω. Page 2 of 12

3 A mapping θ:x Y of BCI-algebras is called a homomorphism if θ(ı ȷ) =θ(ı) θ(ȷ), for any ı, ȷ X. Definition 2.1 An intuitionistic fuzzy set" (IFS) in a non-empty set Ξ is an object having the form ={(ı, π (ı) (ı)) ı Ξ}, where the mappings π :Ξ [0, 1] and ξ :Ξ [0, 1] signify the degree of membership and the degree of non-membership and 0 π (ı)+ξ (ı) 1 for all ı Ξ (Jun & Kim, 2000). An IFS ={(ı, π (ı) (ı)) ı Ξ} in Ξ can be identified to an ordered pair (π ) in I Ξ I Ξ. In the sequel, =(π ) will be used instead of the notation ={(ı, π (ı) (ı)) ı Ξ} and Ω will be a BCI-algebra." Definition 2.2 An IFS =(π ) in Ω is called an intuitionistic fuzzy subalgebra of Ω if it satisfies (Jun & Kim, 2000): π (ı ȷ) min{π (ı), π and ξ (ı ȷ) max{ξ (ı) for all ı, ȷ Ω. Proposition 2.3 & Kim, 2000): Any intuitionistic fuzzy subalgebra =(π ) of Ω satisfies the inequalities (Jun π (0) π (ı) and ξ (0) ξ (ı) for all ı Ω. Definition 2.4 An IFS =(π ) in Ω is called an intuitionistic fuzzy ideal (IFI) of Ω if it satisfies the following inequalities (Jun & Kim, 2000): (IFI 1)π (0) π (ı) and ξ (0) ξ (ı) (IFI 2)π (ı) min{π (ı ȷ), π (IFI 3)ξ (ı) max{ξ (ı ȷ) for all ı, ȷ Ω. An IFS =(π ) in Ω is called an intuitionistic fuzzy closed ideal of Ω if it satisfies (IFI 2), (IFI 3) and (IFI 4) π (0 ı) π (ı) and ξ (0 ı) ξ (ı) for all ı Ω. Proposition 2.5 Any IFI of a BCK-algebra Ξ is an intuitionistic fuzzy subalgebra of Ξ (Jun & Kim, 2000). Lemma 2.6 Let IFS =(π ) be an IF If the inequality ı ȷ l holds in Ω, then, π (ı) min{π (ȷ), π (l)} and ξ (ı) max{ξ (ȷ) (l)} (Jun & Kim, 2000). Lemma 2.7 Let IFS =(π ) be an IF If the inequality ı ȷ holds in Ω, then π (ı) π (ȷ) and ξ (ı) ξ (ȷ), that is π is order reversing, while ξ is order preserving (Jun & Kim, 2000). Theorem 2.8 Let IFS =(π ) be an IF If π (ı ȷ) π (ı) and ξ (ı ȷ) ξ (ı) for all ı, ȷ Ω, then =(π ) is an IF h I of Ω (Satyanarayana, Madhavi, & Prasad, 2010). Definition 2.9 Let (π ) be an IFS in a BCK-algebra Ξ and a, b Ξ. Then, the IFS < (π ), (a, b) > defined by < (π ), (a, b) >= (<π, a >, <ξ, b >) is called the extension of (π ) by (a, b). If a = b, then it is denoted by < (π ), a >. 3. Intuitionistic fuzzy p-ideal An IFS =(π ) in Ω is called an intuitionistic fuzzy p-ideal (IF p I) of Ω if it satisfies: Page 3 of 12

4 (IF PI 1)π (0) π (ı) and ξ (0) ξ (ı), for all ı Ω (IF PI 2)π (ı) min{π ((ı l) (ȷ l)), π (IF PI 3)ξ (ı) max{ξ ((ı l) (ȷ l)) for all ı, ȷ, l Ω. Example 3.1 Let Ω ={0, ı, ȷ, l} be a BCI-algebra defined by the following Cayley table: Define an IFS =(π ) in Ω as: π (0) =π (l) =1, π (ı) =π (ȷ) =t and ξ (0) =ξ (l) =0 (ı) =ξ (ȷ) =s where s, t (0, 1) and s + t 1. By routine calculations, it is easy to verify that IFS =(π An IFS =(π ) in Ω is called an intuitionistic fuzzy closed p-ideal (or IFC p I) of Ω if it satisfies (IF PI 2), (IF PI 3) and (IF PI 4) π (0 ı) π (ı) and ξ (0 ı) ξ (ı), for all ı Ω. Theorem 3.2 Any IF p I of Ω is an IF Proof Assume that IFS =(π ) is an intuitionistic fuzzy p-ideal of X. Then by definition, we have: π (x) min{π ((x z) (y z)), π (y)} ξ (x) max{ξ ((x z) (y z)) (y)} for all x, y X. putting z = 0, we get π (x) min{π ((x 0) (y 0)), π (y)} ξ (x) max{ξ ((x 0) (y 0)) (y)} imply: π (x) min{π (x y), π (y)} ξ (x) max{ξ (x y) (y)} Hence, IFS =(π ) is an IF Whereas, the converse of this theorem may not be true. For this, consider the following example. Example 3.3 Consider the BCI-algebra Ω ={0, ı, ȷ, l, } with the following Cayley table: Define an IFS =(π ) in Ω by: Page 4 of 12

5 π (0) =π (ȷ) =1, π (ı) =π (l) =π ( ) =t ξ (0) =ξ (ȷ) =0 (ı) =ξ (l) =ξ ( ) =s where s, t (0, 1) and s + t 1. By routine calculations, it is easy to verify that IFS =(π ) is an IFI of Ω, but it is not an IF p I of Ω because: π (l) =t < 1 = π (0) =min{α((l ) (0 )), π (0)}. Theorem 3.4 Any IF p I of Ω is an intuitionistic fuzzy subalgebra of Ω. Proof Since any IF p I of Ω is an IFI of Ω and every IFI of Ω is an intuitionistic fuzzy subalgebra of Ω, every IF p I of Ω is an intuitionistic fuzzy subalgebra of Ω. Whereas, the converse is not true and can be examined by considering the Example 3.3. Theorem 3.5 Let IFS =(π ) be an IF Then, the following conditions are equivalent: (1) IFS =(π (2) π (ı) π (0 (0 ı)) and ξ (ı) ξ (0 (0 ı)). (3) π (ı) =π (0 (0 ı)) and ξ (ı) =ξ (0 (0 ı)). Proof (1 2) Let IFS =(π ) be an IF p Then, π (ı) min{π ((ı l) (ȷ l)), π and ξ (ı) max{ξ ((ı l) (ȷ l)), for any ı, ȷ, l Ω. Now putting l = ı and ȷ = 0, we get π (ı) min{π ((ı ı) (0 ı)), π (0)} and ξ (ı) max{ξ ((ı ı) (0 ı)) (0)} π (ı) π (0 (0 ı)) and ξ (ı) ξ (0 (0 ı)). (2 3) Let π (ı) π (0 (0 ı)) and ξ (ı) ξ (0 (0 ı)). Since by 1.2.2, 0 (0 ı) ı. Therefore by Lemma 2.7, π (0 (0 ı)) π (ı) and ξ (0 (0 ı)) ξ (ı). Therefore, we have π (ı) =π (0 (0 ı)) and ξ (ı) =ξ (0 (0 ı)). which is the required condition. Page 5 of 12

6 (3 1) Let π (ı) =π (0 (0 ı)) and ξ (ı) =ξ (0 (0 ı)). Now (0 (0 ı)) ((ı l) (ȷ l))=(0 ((ı l) (ȷ l))) (0 ı) = ((0 (ı l)) (0 (ȷ l))) (0 ı) =((0 (ı l)) (0 ı)) (0 (ȷ l)) = (((0 ı) (0 l)) (0 ı)) ((0 ȷ) (0 l)) = (((0 ı) (0 ı)) (0 l)) ((0 ȷ) (0 l)) =(0 (0 l)) ((0 ȷ) (0 l)) 0 (0 ȷ) (By ) (0 (0 ı)) ((ı l) (ȷ l)) 0 (0 ȷ) Therefore by using Lemma 2.6, we get π (0 (0 ı)) min{π ((ı l) (ȷ l)), π (0 (0 ȷ))} and ξ (0 (0 ı)) max{ξ ((ı l) (ȷ l)) (0 (0 ȷ))} Since π (0 (0 ȷ)) π (ȷ) and ξ (0 (0 ȷ)) ξ (ȷ) Thus, we get π (0 (0 ı)) min{π ((ı l) (ȷ l)), π and ξ (0 (0 ı)) max{ξ ((ı l) (ȷ l)) that is π (ı) min{π ((ı l) (ȷ l)), π and ξ (ı) max{ξ ((ı l) (ȷ l)) Hence, IFS =(π Lemma 3.6 An IFS =(π I of Ω if and only if π and ξ are fuzzy p-ideals of Ω. Proof Suppose that IFS =(π Then, π (0) π (ı) and ξ (0) ξ (ı) Also π (ı) min{π ((ı l) (ȷ l)), π and ξ (ı) max{ξ ((ı l) (ȷ l)) for all ı, ȷ Ω. Then, clearly π is a fuzzy p-ideal of Ω. ξ (0) ξ (ı) 1 ξ (0) 1 ξ (ı) ξ (0) ξ (ı) Moreover, ξ (ı) max{ξ ((ı l) (ȷ l)) 1 ξ (ı) max{1 ξ ((ı l) (ȷ l)),1 ξ ξ (ı) 1 max{1 ξ ((ı l) (ȷ l)),1 ξ ξ (ı) min{ ξ ((ı l) (ȷ l)), ξ Page 6 of 12

7 Hence, ξ is also a fuzzy p-ideal of Ω. Conversely, suppose that π and ξ are fuzzy p-ideals of Ω. Then π (0) π (ı) and ξ (0) ξ (ı). Also π (ı) min{π ((ı l) (ȷ l)), π and ξ (ı) min{ ξ ((ı l) (ȷ l))), ξ. Then, ξ (0) ξ (ı) 1 ξ (0) 1 ξ (ı) ξ (0) ξ (ı). Also ξ (ı) min{ ξ ((ı l) (ȷ l)), ξ 1 ξ (ı) min{1 ξ ((ı l) (ȷ l)),1 ξ ξ (ı) 1 min{1 ξ ((ı l) (ȷ l)),1 ξ ξ (ı) max{ξ ((ı l) (ȷ l)). Hence, IFS =(π ) an IF p Lemma 3.7 An IFS =(π I of a BCI-algebra Ω if and only if π and ξ are fuzzy closed p-ideals of Ω. Proof Suppose that IFS =(π Then, it satisfies (IF PI 2), (IF PI 3), and (IF PI 4); that is π (0 ı) π (ı) and ξ (0 ı) ξ (ı) for all ı Ω. Then, it is clear that π is fuzzy closed p-ideal of Ω. For ξ it can be easily verified as done earlier in Lemma 3.6 that ξ (ı) min{ ξ ((ı l) (ȷ l)), ξ for all ı, ȷ, l Ω. It is therefore required to show only β(0 ı) β(ı). Since β(0 ı) β(ı) 1 ξ (0 ı) 1 ξ (ı) ξ (0 ı) ξ (ı) ξ is also a fuzzy closed p-ideal of Ω. Conversely, let π and ξ be fuzzy closed p-ideals of Ω. Then, π (0 ı) π (ı) and ξ (0 ı) ξ (ı) for all ı Ω. ξ (0 ı) ξ (ı) 1 ξ (0) 1 ξ (ı) ξ (0) ξ (ı). Moreover, π (ı) min{π ((ı l) (ȷ l)), π and ξ (ı) min{ ξ ((ı l) (ȷ l)), ξ ξ (ı) min{ ξ ((ı l) (ȷ l)), ξ 1 ξ (ı) min{1 ξ ((ı l) (ȷ l)),1 ξ ξ (ı) 1 min{1 ξ ((ı l) (ȷ l)),1 ξ ξ (ı) max{ξ ((ı l) (ȷ l)). Hence, IFS =(π Theorem 3.8 An IFS =(π I of Ω if and only if =(π, π ) and =( ξ ) are IF p Is of Ω. Proof Suppose that IFS =(π I of a Ω. Then by Lemma 3.6, π and ξ are fuzzy p-ideals of Ω, i.e. α = π and ξ are fuzzy p-ideals of Ω. Therefore by Lemma 3.6, =(π, π ) and =( ξ ) are IF p Is of Ω. Conversely, suppose that =(π, π ) and =( ξ ) are IF p Is of Ω. Then by Lemma 3.6, π and ξ are fuzzy p-ideals of Ω. Therefore by Lemma 3.6, IFS =(π Page 7 of 12

8 Theorem 3.9 An IFS =(π I of Ω if and only if =(π, π ) and =( ξ ) are IFC p Is of Ω. Proof Suppose that IFS =(π Then by Lemma 3.7, π and ξ are fuzzy closed p-ideals of Ω, i.e. α = π and ξ are fuzzy closed p-ideals of Ω. Therefore by Lemma 3.7, =(π, π ) and =( ξ ) are IFC p Is of Ω. Conversely, suppose that =(π, π ) and =( ξ ) are IFC p Is of Ω. Then by Lemma 3.7, π and ξ are fuzzy closed p-ideals of Ω. Therefore by Lemma 3.7, IFS =(π The transfer principle for fuzzy sets described in Kondo and Dudek (2005) suggests the following theorem. Theorem 3.10 An IFS =(π I of Ω if and only if the non-empty upper t-level cut U(π ;t) and the non-empty lower s-level cut L(ξ ;s) are p-ideals of Ω for any s, t [0, 1]. Proof Suppose that an IFS =(π I of a Ω. Since U(π ;t), L(ξ ;s). So for any ı U(π ;t) we have π (ı) t π (0) π (ı) t 0 U(π ;t). Now let ((ı l) (ȷ l)) U(π ;t) and ȷ U(π ;t). Then, π ((ı l) (ȷ l)) t and π (ȷ) t. Since π (ı) min{π ((ı l) (ȷ l)), π t ı U(π ;t) U(π ;t) is p-ideal of Ω. Similarly, we can prove that L(ξ ;s) is a p-ideal of Ω. Conversely, suppose that the non-empty upper t-level cut U(π ;t) and the non-empty lower s-level cut L(ξ ;s) are p-ideals of Ω for any s, t [0, 1]. If possible, assume that there exists some ı 0 Ω such that π (0) <π ) and ξ (0) >ξ ). Put t 0 = 1 2{π (0)+π )}, then π (0) < t 0 <π ) ı 0 U(π ) and 0 does not belong to U(π ) which is a contradiction to the fact that U(π ) is a p-ideal of Ω. Therefore, we must have π (0) π (ı) for all ı Ω. Similarly, by putting s 0 = 1 2{ξ (0)+ξ )}, we can prove that ξ (0) ξ (ı) for all ı Ω. If possible, assume that there exists some ı 0, ȷ 0, l 0 Ω such that p = π ) < min{π ( l 0 ) (ȷ 0 l 0 )), π (ȷ 0 )} = q. Put t 0 = 1 2{p + q }, then p < t 0 < q l 0 ) (ȷ 0 l 0 ) U(π ) and ȷ 0 U(π ), whereas ı 0 does not belong to U(π ) which is a contradiction to the fact that U(π ) is a p-ideal of Ω. Therefore, π (ı) min{π ((ı l) (ȷ l)), π for all ı, ȷ, l Ω. Similarly, we can prove that ξ (ı) max{ξ ((ı l) (ȷ l)) for all ı, ȷ, l Ω. Hence, IFS =(π Theorem 3.11 An IFS =(π I of Ω if and only if the non-empty upper t-level cut U(π ;t) and the non-empty lower s-level cut L(ξ ;s) are closed p-ideals of Ω for any s, t [0, 1]. Proof Suppose that an IFS =(π Then, π (0 ı) π (ı) and ξ (0 ı) ξ (ı) for all ı Ω. Since U(π ;t),l(ξ ;s). So for any ı U(π ;t) we have π (ı) t π (0 ı) π (ı) t 0 ı U(π ;t). Similarly for any ı L(ξ ;s), we have ξ (ı) s ξ (0 ı) ξ (ı) s 0 ı L(ξ ;s). Hence, U(π ;t) and L(ξ ;s) are closed p-ideals of Ω. Conversely, suppose that the non-empty upper t-level cut U(π ;t) and the non-empty lower s-level cut L(ξ ;s) are closed p-ideals of Ω for any s, t [0, 1]. We want to show that IFS =(π ) is an IFC p It is enough to show that π (0 ı) π (ı) and ξ (0 ı) ξ (ı) for all ı Ω. If possible, Page 8 of 12

9 assume that there exists some ı 0 Ω such that π (0 ı 0 ) <π ). Take t 0 = 1 2{π (0 ı 0 )+π )}, then π (0 ı 0 ) < t 0 <π ) ı 0 U(π ), whereas 0 ı 0 does not belong to U(π ) which is a contradiction to the fact that U(π ) is a closed p-ideal of Ω. Therefore, we must have π (0 ı) π (ı) for all ı Ω. Similarly, we can prove that ξ (0 ı) ξ (ı) for all ı Ω. Hence, IFS =(π I of Ω. Theorem 3.12 Let {I δ δ Λ} be a collection of p-ideals of Ω such that (1) Ω = δ Λ I δ. (2) η >δ if and only if I η I δ for all η, δ Λ.Then, an IFS =(π ) defined by π (ı) =sup{δ Λ ı I δ } and ξ (ı) =inf{η Λ ı I η } for all ı Ω is an IF p Proof By Theorem 3.11, it is sufficient to prove that U(π ;δ) and L(ξ ;η) are p-ideals of Ω. To prove that U(π ;δ) is a p-ideal of Ω, we divide the proof into the following two cases: (1) δ = sup{ρ Λ ρ<δ} (2) δ ρ sup{ρ Λ ρ<δ} The case (1) implies that ı U(π ;δ) ı I ρ, for all ρ <δ ı ρ<δ I ρ so that U(π ;δ) = ρ<δ I ρ which is a p-ideal of Ω. For the case (2), we claim that U(π ;δ) = I. If ı I, then ı I ρ δ ρ ρ δ ρ ρ for some ρ δ. It follows that π (ı) ρ δ, so that ı U(π ;δ). This shows that I U(π ;δ). Now assume that ı I,then ρ δ ρ ρ δ ρ ı I ρ for all ρ δ. Since t sup{ρ Λ ρ<δ}, there exists some ε >0 such that (δ ε, δ) Λ=. Hence, ı I ρ for all ρ >δ ε which means that ı I ρ if ρ δ ε<δ. Thus, π (ı) δ ε<δ and so ı U(π ;δ). Therefore, U(π ;δ) I and that U(π ;δ) = I ρ δ ρ ρ δ ρ which is a p-ideal of Ω. Next, we prove that L(ξ ;η) is a p-ideal of Ω. For this, we divide the proof into the following two cases: (1) η = inf{ς Λ η<ς} (2) η inf{ς Λ η<ς} The case (1) implies that ı L(ξ ;η) ı I ς, for all η <ς ı η<ς I ς so that L(ξ ;η) = η<ς I ς which is a p-ideal of Ω. For the case (2), we state that L(ξ ;η) = I. If ı I, then ı I ς η ς ς η ς ς for some ς η. Thus, ξ (ı) ς η, so that ı L(ξ ;η). This shows that I L(ξ ;η). Now assume that ı I, then ς η ς ς η ς ı I ς for all ς η. Since η inf{ς Λ η<ς}, ε>0 such that (η, η + ε) Λ=. Hence, ı I ς for all ς<η+ ε which means that ı I ς if ς η + ε>η. Thus (ı) η + ε>η and so ı L(ξ ;η). Therefore, L(ξ ;η) I and that L(ξ ;η) = I ς η ς ς η ς which is a p-ideal of Ω. This completes the proof. Theorem 3.13 If IFS =(π I of Ω, then the sets J ={ı Ω π (ı) =π (0)} and K ={ı X ξ (ı) =ξ (0)} are p-ideals of Ω. Proof Since 0 Ω, π (0) =π (0) and ξ (0) =ξ (0) implies 0 J and 0 K, J Φ and K Φ. Now, let (ı l) (ȷ l) J and ȷ J. Then, π ((ı l) (ȷ l)) = π (0) and π (ȷ) =π (0).Since π (ı) min{π ((ı l) (ȷ l)), π = π (0). But π (0) π (ı). Therefore, π (ı) =π (0). It follows that ı J for all ı, ȷ, l Ω. Hence, J is a p-ideal of Ω. Similarly, we can prove that K is a p-ideal of Ω. Definition 3.14 Let f be a mapping on a set X and =(π ) be an IFS in X. Then, the fuzzy sets u and v on f(x) defined by u(ȷ) =sup ı f 1 (ȷ) π (ı) and v(ȷ) =inf ı f 1 (ȷ) ξ (ı), for all ȷ f (X), are called the images of A under f. If u, v are fuzzy sets in f(x), then the fuzzy sets π = uof and ξ = vof are called the pre-images of u and v under f. Page 9 of 12

10 Theorem 3.15 Let f :X X be an onto homomorphism of BCI-algebras. If =(u, v I of BCIalgebra X, then the pre-image of =(u, v) under f is an IF p I of X. Proof Let an IFS =(π ) where π = uof and ξ = vof be the pre-image of =(u, v) under f. Since =(u, v I of X, we have u(0 ) u(f (ı)) = π (ı) and v(0 ) v(f (ı)) = ξ (ı). On the other hand, u(0 )=u(f(0)) = π (0) and v(0 )=v(f(0)) = ξ (0). Therefore, π (0) π (ı) and ξ (0) ξ (ı), for all ı X. Now we show that π (ı) min{π ((ı l) (ȷ l)), π and ξ (ı) max{ξ ((ı l) (ȷ l)) for all ı, ȷ, l X. Now π (ı) =u(f (ı)) = u(f (ı)) min{u((f (ı) l )(ȷ l )), u(ȷ )} for all ȷ, l X. Since f is an onto homomorphism, there exists some ȷ, l X such that f (ȷ) =ȷ and f (l) =l, respectively. Thus, π (ı) min{u((f (ı) f (l)) (f (ȷ) f (l))), u(f min{u(f ((ı l) (ȷ l))), u(f (ȷ))} = min{π ((ı l) (ȷ l)), π. Therefore, the result π (ı) min{π ((ı l) (ȷ l)), π is true for all ı, ȷ, l X because ȷ, l are arbitrary elements of X and f is an onto mapping. Similarly, we can prove that ξ (ı) max{ξ (((ı l) (ȷ l)) for all ı, ȷ, l X. Hence, the pre-image IFS =(π ) of =(u, v) under f is an IF p I of X. Definition 3.16 Let θ:ω Υ be a homomorphism of BCI-algebras. For any IFS =(π ) in Υ, we define a new IFS θ =(π θ, ξθ ) in Ω by πθ (ı) =π (θ(ı)), ξθ (ı) =ξ (θ(ı)) for all ı Ω. If θ:ω Υ is a homomorphism of BCI-algebras, then θ(0) =0. Theorem 3.17 Let θ:ω Υ be a homomorphism of BCI-algebras. If an IFS =(π ) in Υ is an IF p I of Υ, then the IFS θ =(π θ, ξθ ) in Ω is an IF p Proof We first have that π θ (ı) =π (θ(ı)) π (0) =π (θ(0)) = πθ (0) π θ (ı) πθ (0)ξθ (ı) =ξ (θ(ı)) ξ (0) =ξ (θ(0)) = ξθ (0) ξ θ (ı) ξθ (0). Let ı, ȷ, l Ω. Then min{π θ ((ı l) (ȷ l)), πθ = min{π (θ((ı l) (ȷ l))), π (θ(ȷ))} = min{π ((θ(ı) θ(l)) (θ(ȷ) θ(l))), π (θ(l))} π (θ(ı)) = π θ (ı). Similarly, max{ξ θ ((ı l) (ȷ l)), ξθ = max{ξ (θ((ı ȷ) (ȷ l))) (θ(ȷ))} = max{ξ ((θ(ı) θ(l)) (θ(ȷ) θ(l))) (θ(ȷ))} ξ (θ(ı)) = ξ θ (ı). Hence, IFS θ =(π θ, ξθ ) in Ω is an IF p Theorem 3.18 Let θ:ω Υ be an epimorphism of BCI-algebras and IFS =(π ) be in Υ. If IFS θ =(π θ, ξθ ) is an IF I of Ω, then IFS =(π, ξ ) is an IF p pi of Υ. Proof For any ı, ȷ, l Υ,, I, θ Ω, s.t, θ( ) =ı, θ(i) =ȷ, θ(θ) =l. Then for any ı Υ, Page 10 of 12

11 π (ı) =π (θ( )) = π θ ( ) πθ (0) =π (θ(0)) = π (0) π (ı) π (0) ξ (ı) =ξ (θ( )) = ξ θ ( ) ξθ (0) =ξ (θ(0)) = ξ (0) ξ (ı) ξ (0) Now π (ı) =π (θ( )) = π θ ( ) min{πθ (( θ) (I θ)), πθ (I)} = min{π (θ(( θ) (I θ))), π (θ(i))} = min{π ((θ( ) θ(θ)) ((θ(i) θ(θ)))), π (θ(i))} = min{π ((ı l) (ȷ l)), π. Similarly, ξ (ı) =ξ (θ( )) = ξ θ ( ) max{ξθ (( θ) (I θ)), ξθ (I)} = max{ξ (θ(( θ) (I θ))) (θ(i))} = max{ξ ((θ( ) θ(θ)) ((θ(i) θ(θ)))) (θ(i))} = max{ξ ((ı l) (ȷ l)) for all ı, ȷ, l Υ. Hence, IFS =(π I of Υ. A BCK-algebra Ω is said to be positive implicative if it satisfies for all ı, ȷ, l Ω: (ı l) (ȷ l) =(ı ȷ) l. Theorem 3.19 Let an IFS =(π ) be IF p I of a positive implicative BCK-algebra" Ξ and u, v Ξ. Then, the extension < (π ), (u, v) > of (π ) by (u, v) is also an IF p I of Ξ. Proof Let IFS =(π ) be IF p I of a positive implicative BCK-algebra" Ξ and, I Ξ. Let ı, ȷ Ξ. Then, we have <π, > (0) =π (0 )=π (0) π (ı )=<π, > (ı) and <ξ, I > (0) =ξ (0 I) =ξ (0) ξ (ı I) =<ξ, I > (ı). Moreover, <π, < (ı) =π (ı ) min{π ((((ı ) (l )) (ȷ ) (l ))), π (ȷ )} = min{π (((ı l) (ȷ l)) ), π (ȷ }) = min{< π, < ((ı l) (ȷ l)), <π, < Similarly, <ξ, I < (ı) =ξ (ı ) max{ξ ((((ı ) (l )) (ȷ ) (l ))) (ȷ I)} = max{ξ (((ı l) (ȷ l)) ) (ȷ I)} = max{< ξ, I < ((ı l) (ȷ l)), <ξ, I < Hence, the extension < (π ), (, I) > of (π ) by (, I I of Ξ. Corollary 3.20 Let an IFS =(π ) be IF p I of a positive implicative BCK-algebra" Ξ and Ξ. Then, the extension < (π ), > of (π ) by is also an IF p I of Ξ. Page 11 of 12

12 Funding The authors received no direct funding for this research. Author details Muhammad Touqeer 1 touqeer-fareed@yahoo.com Naim Çağman 2 naim.cagman@gop.edu.tr 1 Basic Sciences Department, University of Engineering and Technology, Taxila, Pakistan. 2 Faculty of Arts and Sciences, Department of Mathematics, University of Gaziosmanpasa, Tokat, Turkey. Citation information Cite this article as: On some properties of p-ideals based on intuitionistic fuzzy sets, Muhammad Touqeer & Naim Çağman, Cogent Mathematics (2016), 3: References Atanassov, K. T. (1986). Intuitionistic fuzzy sets. Fuzzy Sets and Systems, 20, Cristea, I., Davvaz, B., & Sadrabadi, E. H. (2015). Special intuitionistic fuzzy subhypergroups of complete hypergroups. Journal of Intelligent and Fuzzy Systems, 28, Davvaz, B., Abdulmula, K. S., & Salleh, A. R. (2013). Atanassov s intuitionistic fuzzy hyperrings (rings) based on intuitionistic fuzzy universal sets. Journal of Multiple- Valued Logic and Soft Computing, 21, Imai, Y., & Iséki, K. (1966). On axioms of propositional calculi. XIV Proceedings of the Japan Academy, 42, Jun, Y. B., & Kim, K. H. (2000). Intuitionistic fuzzy ideals of BCK-algebras. International Journal of Mathematics and Mathematical Sciences, 24, Jun, Y. B., & Meng, J. (1994). Fuzzy p-ideals in BCI-algebras. Math. Japonica, 40, Kondo, M., & Dudek, W. A. (2005). On the transfer principle in fuzzy theory. Mathware & Soft Computing, 12, Mursaleen, M., Srivastava, H. M., & Sharma, S. K. (2016). Generalized statistically convergent sequences of fuzzy numbers. Journal of Intelligent and Fuzzy Systems, 30, Satyanarayana, B., Madhavi, U. B., & Prasad, R. D. (2010). On intuitionistic fuzzy H-ideals in BCK-algebras. International Journal of Algebra, 4, Senapati, T., Bhowmik, M., Pal, M., & Davvaz, B. (2015). Atanassovs intuitionistic fuzzy translations of intuitionistic fuzzy subalgebras and ideals in BCK/BCI-algebras. Eurasian Mathematical Journal, 6, Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8, The Author(s). This open access article is distributed under a Creative Commons Attribution (CC-BY) 4.0 license. You are free to: Share copy and redistribute the material in any medium or format Adapt remix, transform, and build upon the material for any purpose, even commercially. The licensor cannot revoke these freedoms as long as you follow the license terms. Under the following terms: Attribution You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. No additional restrictions You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits. Cogent Mathematics (ISSN: ) is published by Cogent OA, part of Taylor & Francis Group. Publishing with Cogent OA ensures: Immediate, universal access to your article on publication High visibility and discoverability via the Cogent OA website as well as Taylor & Francis Online Download and citation statistics for your article Rapid online publication Input from, and dialog with, expert editors and editorial boards Retention of full copyright of your article Guaranteed legacy preservation of your article Discounts and waivers for authors in developing regions Submit your manuscript to a Cogent OA journal at Page 12 of 12