Intuitionistic Q-Fuzzy Subalgebras
Intuitionistic Q-Fuzzy Subalgebras
1168
for every x, y, z X . A BCI-algebra X satisfying the condition (V) 0 x = 0 for all x X is called a BCK-algebra. In any BCK/BCI-algebra X one can dene a partial order by putting x y if and only if x y = 0. A BCK/BCI-algebra X has the following properties: (2.1) x 0 = x, (2.2) (x y ) z = (x z ) y, (2.3) x y implies that x z y z and z y z x, (2.4) (x z ) (y z ) x y for all x, y, z X . A non-empty subset S of a BCK/BCI-algebra X is called a subalgebra of X if x y S whenever x, y S . A mapping f : X Y of BCK/BCI-algebras is called a homomorphism if f (x y ) = f (x) f (y ) for all x, y X . Let X be a BCK/BCI-algebra. A fuzzy set f in X , i.e., a mapping f : X [0, 1], is called a fuzzy subalgebra of X if f (x y ) f (x) f (y ) for all x, y X . Note that if f is a fuzzy subalgebra of a BCK/BCI-algebra X , then f (0) f (x) for all x X . 3. Intuitionistic Q-fuzzy subalgebras In what follows, let Q and X denote a set and a BCK/BCI-algebra, respectively, unless otherwise specied. A mapping H : X Q [0, 1] is called a Q-fuzzy set in X . A Q-fuzzy set H : X Q [0, 1] is called a fuzzy subalgebra of X over Q (briey, Q-fuzzy subalgebra of X ) if H (x y, q ) H (x, q ) H (y, q ) for all x, y X and q Q. Denition 3.1. let Q and X denote a set and a BCK/BCI-algebra, respectively. An intuitionistic Q-fuzzy set (IQFS for short) A is an object having the form A = {(x, A (x, q ), A (x, q )) : x X, q Q} where the functions A : X Q [0, 1] and A : X Q [0, 1] denote the degree of membership (namely A (x, q )) and the degree of nonmembership (namely A (x, q )) of each element (x, q ) X Q to the set A, respectively, and 0 A (x, q ) + A (x, q ) 1 for all x X and q Q. For the sake of simplicity, we shall use the symbol A = (A , A ) for the IQFS A = {(x, A (x, q ), A (x, q )) : x X, q Q}. Denition 3.2. An IQFS A = (A , A ) in X is called an intuitionistic Q-fuzzy subalgebra of X if (IQF1) A (x y, q ) A (x, q ) A (y, q ) and A (x y, q ) A (x, q ) A (y, q ) for all x, y X and q Q.
1169
Example 3.3. Let X = {0, a, b, c} be a BCK-algebra with the following Cayley table: 0 a b c 0 a b c 0 a b c 0 0 a c 0 0 0 c 0 a b 0
Dene an IQF S = (A , A ) in X as follows: for every q Q, A (0, q ) = A (b, q ) = 0.6, A (a, q ) = A (c, q ) = 0.2 and A (0, q ) = A (b, q ) = 0.3, A (a, q ) = A (c, q ) = 0.7 It is easy to verify that A = (A , A ) is an intuitionistic Q-fuzzy subalgebra of X. Example 3.4. Consider a BCI-algebra X = {0, x} with Cayley table as follows (Is eki [2]): 0 x 0 x 0 x x 0
Let Q = {1, 2} and let A = (A , A ) be an intuitionistic Q-fuzzy set in X dened by A (0, 1) = A (0, 2) = 1, A (x, 1) = 0.8, A (x, 2) = 0.5 and A (0, 1) = A (0, 2) = 0, A (x, 1) = 0.1, A (x, 2) = 0.2. It is easy to verify that A = (A , A ) is an intuitionistic Q-fuzzy subalgebra of X. Proposition 3.5. If A = (A , A ) in X is an intuitionistic fuzzy Q-subalgebra of X , then A (0, q ) A (x, q ) and A (0, q ) A (x, q ) for all x X and q Q. Proof. Let x X and q Q. Then A (0, q ) = A (x x, q ) A (x, q ) A (x, q ) = A (x, q ) and A (0, q ) = A (x x, q ) A (x, q ) A (x, q ) = A (x, q ). Proposition 3.6. Let A = (A , A ) be an intuitionistic Q-fuzzy subalgebra of X . Dene an intuitionistic Q-fuzzy set B = (B , B ) in X by B (x, q ) = A (x, q ) A (x, q ) , B (x, q ) = A (0, q ) A (0, q )
1170
and
(xy,q ) 1 B (x y, q ) = A A (0 {A (x, q ) A (y, q )} A (0,q ) ,q ) A (x,q ) A (y,q ) = { A (0,q) A (0,q) } = B (x, q ) B (y, q ).
Hence B = (B , B ) is an intuitionistic Q-fuzzy subalgebra of X . Let A = (A , A ) be an IQFS in a set X and let , [0, 1] be such that + 1. Then we dene the set XA
(, )
Theorem 3.7. Let A = (A , A ) be an intuitionistic Q-fuzzy subalgebra of X. (, ) Then XA is a subalgebra of X for every (, ) Im(A ) Im(A ) with + 1. Proof. Let x, y XA and q Q. Then A (x, q ) , A (x, q ) , A (y, q ) , A (y, q ) which imply that A (xy, q ) A (x, q ) A (y, q ) A (xy, q ) A (x, q ) A (y, q ) . Thus xy XA
(, ) (, )
Therefore XA
(, )
is a subalgebra of X.
n i=1
yn (yn1 ( (y1 x) )) = x
i=1
yi .
Proposition 3.8. Let A = (A , A ) be an intuitionistic Q-fuzzy subalgebra of a BCK-algebra X and let x1 , x2 , , xn be arbitrary elements of X . If there exists k {1, 2, , n} such that xk = x1 , then A (x1 and A (x1
n i=2 n i=2
xi , q ) A (x, q )
Proof. Let k be a xed number in {1, 2, , n} such that xk = x1 . Using (III), (V) and (2.2), one can deduce
n n
A (x1
i=2
xi , q ) = A (0, q ).
1171
n i=2
xi , q ) A (x, q )
for all x X and q Q. Proposition 3.9. Let A = (A , A ) be an intuitionistic Q-fuzzy subalgebra of a BCK-algebra X. Then (i) A (x
2k 1 i=1 2k
2k 1 i=1 2k i=1
x, q ) A (x, q ) and A (x
n1 i=1
X, q Q and for n = 1, 2, .
Proof. It follows immediately from (III), (2.1) and Proposition 3.5. Theorem 3.10. If {Ai : i } is an arbitrary family of intuitionistic Q-fuzzy subalgebras of X , then Ai is an intuitionistic Q-fuzzy subalgebra of X where Ai = {((x, Ai (x, q ), Ai (x, q )) : x X, q Q}. Proof. Let x, y X, q Q. Then Ai (x y, q ) (Ai (x, q ) Ai (y, q )) = (Ai (x, q )) (Ai (y, q )) and Ai (x y, q ) (Ai (x, q ) Ai (y, q )) = (Ai (x, q )) (Ai (y, q )). Hence Ai = (Ai , Ai ) is an intuitionistic Q-fuzzy subalgebra of X . Theorem 3.11. If an IQFS A = (A , A ) in X is an intuitionistic Q-fuzzy subalgebra of X , then so is A, where A = {((x, q ), A (x, q ), 1A (x, q )) : x X, q Q}. Proof. It is sucient to show that A satises the second condition in (IQF1). Let x, y X and q Q. Then A (x y, q ) = 1 A (x y, q ) 1 (A (x, q ) A (y, q )) = (1 A (x, q )) (1 A (y, q )) = A (x, q ) A (y, q ). Hence A is an intuitionistic Q-fuzzy subalgebra of X . Theorem 3.12. If an IQFS A = (A , A ) in X is an intuitionistic Q-fuzzy subalgebra of X , then the sets X := {x X : A (x, q ) = A (0, q )}
1172
X := {x X : A (x, q ) = A (0, q )} are subalgebras of X for all q Q. Proof. Let x, y X and q Q. Then A (x, q ) = A (0, q ) = A (y, q ), and so A (x y, q ) A (x, q ) A (y ) = A (0, q ). By using Proposition 3.5, we know that A (x y, q ) = A (0, q ) or equivalently x y X . Now let x, y X . Then A (x y, q ) A (x, q ) A (y, q ) = A (0, q ), and by applying Proposition 3.5, we conclude that A (x y, q ) = A (0, q ) and hence x y X . Denition 3.13. Let A = (A , A ) be an IQFS in X and let [0, 1]. Then the set := {x X : A (x, q ) , q Q} is called a -level -cut and A, A, := {x X : A (x, q ) , q Q} is called a -level -cut of A. Theorem 3.14. If an IQFS A = (A , A ) in X is an intuitionistic Q-fuzzy subalgebra of X , then the -level -cut and -level -cut of A are subalgebras of X for every [0, 1] such that Im(A ) Im(A ), which are called a -level subalgebra and a -level subalgebra respectively. Proof. Let x, y and q A, It follows that A (x y, q ) Hence is a subalgebra of A, A (x, q ) A (y, q ) and so X. Q. Then A (x, q ) and A (y, q ) . A (x, q ) A (y, q ) so that x y . A, X . Now let x, y A, . Then A (x y, q ) x y A, . Therefore A, is a subalgebra of
and
Theorem 3.15. Let A = (A , A ) be an IQFS in X such that the sets A, and A, are subalgebras of X . Then A = (A , A ) is an intuitionistic Q-fuzzy subalgebra of X . Proof. We need to show that A = (A , A ) satises the condition (IQF1). If the rst condition of (IQF1) is not true, then there exist x0 , y0 X such that A (x0 y0 , q ) < A (x0 , q ) A (y0 , q ) for all q Q. Let 1 0 := (A (x0 y0 , q ) + (A (x0 , q ) A (y0, q ))) . 2 Then A (x0 y0 , q ) < 0 < A (x0 , q ) A (y0 , q ), and so x0 y0 / , but A,0 x0 , y0 A, . This leads to a contradiction. Now assume that the second 0 condition of (IQF1) does not hold. Then A (x0 y0 , q ) > A (x0 , q ) A (y0 , q ) for some x0 , y0 X and q Q. Taking 1 0 := (A (x0 y0 , q ) + (A (x0 , q ) A (y0 , q ))) , 2 and then A (x0 , q ) A (y0 , q ) < 0 < A (x0 y0 , q ). It follows that x0 , y0 A, 0 x0 y0 / A, . This leads to a contradiction. This completes the proof.
0
1173
Theorem 3.16. Any subalgebra of X can be realized as both a -level subalgebra and a -level subalgebra of some intuitionistic Q-fuzzy subalgebra of X. Proof. Let S be a subalgebra of X and let A and A be Q-fuzzy sets in X dened by A (x, q ) := , if x S , 0, otherwise, and A (x, q ) := , if x S , 1, otherwise,
for all x X and q Q where and are xed numbers in (0, 1) such that + < 1. Let x, y X for all q Q. If x, y S , then x y S . Hence A (x y, q ) = A (x, q ) A (y, q ) and A (x y, q ) = A (x, q ) A (y, q ). If at least one of x and y does not belong to S , then at least one of A (x, q ) and A (y, q ) is equal to 0, and at least one of A (x, q ) and A (y, q ) is equal to 1. It follows that A (x y, q ) 0 = A (x, q ) A (y, q ) and A (x y, q ) 1 = A (x, q ) A (y, q ). Hence A = (A , A ) is an intuitionistic Q-fuzzy subalgebra of X . Obviously, = S = A, . This completes the proof. A, Denition 3.17. Let f be a map from a set X to a set Y . If A = (A , A ) and B = (B , B ) are IQFSs in X and Y respectively, then the preimage of B under f , denoted by f 1 (B ), is an IQFS in X dened by f 1 (B ) = (f 1 (B ), f 1 (B )), and the image of A under f , denoted by f (A), is an IQFS of Y dened by f (A) = (fsup (A ), finf (A )), where fsup (A )(y, q ) = and finf (A )(y, q ) = for each y Y and q Q. Theorem 3.18. Let f : X Y be a homomorphism of BCK/BCI-algebras. If B = (B , B ) is an intuitionistic Q-fuzzy subalgebra of Y , then the preimage f 1 (B ) = (f 1 (B ), f 1 (B )) of B under f is an intuitionistic Q-fuzzy subalgebra of X . Proof. Assume that B = (B , B ) is an intuitionistic Q-fuzzy subalgebra of Y and let x1 , x2 X and q Q. Then f 1 (B )(x1 x2 , q ) = B (f (x1 x2 ), q ) = B (f (x1 ) f (x2 ), q ) B (f (x1 ), q ) B (f (x2 ), q ) = f 1 (B )(x1 , q ) f 1 (B )(x2 , q )
x f 1 ( y )
inf 1,
1174
and f 1 (B )(x1 x2 , q ) = B (f (x1 x2 ), q ) = B (f (x1 ) f (x2 ), q ) B (f (x1 ), q ) B (f (x2 ), q ) = f 1 (B )(x1 , q ) f 1 (B )(x2 , q ). Therefore f 1 (B ) = (f 1 (B ), f 1(B )) is an intuitionistic Q-fuzzy subalgebra of X . Theorem 3.19. Let f : X Y be a homomorphism from a BCK/BCIalgebra X onto a BCK/BCI-algebra Y . If A = (A , A ) is an intuitionistic Qfuzzy subalgebra of X , then the image f (A) = (fsup (A ), finf (A )) of A under f is an intuitionistic Q-fuzzy subalgebra of Y . Proof. Let A = (A , A ) be an intuitionistic Q-fuzzy subalgebra of X and let y1 , y2 Y and q Q. Noticing that {(x1 x2 , q ) | (x1 , q ) f 1 (y1 , q ) and (x2 , q ) f 1 (y2 , q )} {(x, q ) X Q | (x, q ) f 1 (y1 y2 , q )}, we have
fsup (A )(y1 y2 , q ) = sup{A (x, q ) | (x, q ) f 1 (y1 y2 , q )} sup{A (x1 x2 , q ) | (x1 , q ) f 1 (y1 , q ) and (x2 , q ) f 1 (y2 , q )} sup{A (x1 , q ) A (x2 , q ) | (x1 , q ) f 1 (y1 , q ) and (x2 , q ) f 1 (y2 , q )} = sup{A (x1 , q ) | (x1 , q ) f 1 (y1 , q )} sup{A (x2 , q ) | (x2 , q ) f 1 (y2 , q )} = fsup (A )(y1 , q ) fsup (A )(y2 , q ) and finf (A )(y1 y2 , q ) = inf {A (x, q ) | (x, q ) f 1 (y1 y2 , q )} inf {A (x1 x2 , q ) | (x1 , q ) f 1 (y1 , q ) and x2 f 1 (y2 , q )} inf {A (x1 , q ) A (x2 , q ) | (x1 , q ) f 1 (y1 , q ) and (x2 , q ) f 1 (y2 , q )} = inf {A (x1 , q ) | (x1 , q ) f 1 (y1 , q )} inf {A (x2 , q ) | (x2 , q ) f 1 (y2 , q )} = finf (A )(y1 , q ) finf (A )(y2 , q ).