• No results found

Properties of Operations for Fuzzy Soft Sets over Fully Up-Semigroups

N/A
N/A
Protected

Academic year: 2020

Share "Properties of Operations for Fuzzy Soft Sets over Fully Up-Semigroups"

Copied!
17
0
0

Loading.... (view fulltext now)

Full text

(1)

Volume 17, Number 5 (2019), 821-837 URL:https://doi.org/10.28924/2291-8639

DOI:10.28924/2291-8639-17-2019-821

PROPERTIES OF OPERATIONS FOR FUZZY SOFT SETS OVER FULLY UP-SEMIGROUPS

AKARACHAI SATIRAD AND AIYARED IAMPAN∗

Department of Mathematics, School of Science, University of Phayao, Phayao 56000, Thailand

Corresponding author: [email protected]

Abstract. The aim of this manuscript is to apply distributivity laws of several fuzzy sets for any fuzzy sets and study distributivity laws with any fuzzy soft sets. We investigate properties of some operations for fuzzy soft sets over fully UP-semigroups and their interrelation with respect to different operations such as “(restricted) union”, “(extended) intersection”, “AND”, and “OR”.

1. Introduction and Preliminaries

Several researches introduced a new class of algebras related to logical algebras and semigroups such as:

In 1993, Jun et al. [7] introduced the notion of BCI-semigroups. In 2018, Iampan [6] introduced the notion

of fully UP-semigroups.

In 1999, to solve complicated problems in economics, engineering, and environment, we cannot successfully

use classical methods because of various uncertainties typical for those problems. Uncertainties cannot be

handled using traditional mathematical tools but may be dealt with using a wide range of existing theories

such as the probability theory, the theory of (intuitionistic) fuzzy sets, the theory of vague sets, the theory of

interval mathematics, and the theory of rough sets. However, all of these theories have their own difficulties

which are pointed out in [11]. In 2001, Maji et al. [10] 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

Received 2019-06-02; accepted 2019-07-11; published 2019-09-02. 2010Mathematics Subject Classification. 03G25; 08A72.

Key words and phrases. fully UP-semigroup; fuzzy soft set; (restricted) union; (extended) intersection; AND; OR. This work was supported by the Unit of Excellence, University of Phayao.

c

2019 Authors retain the copyrights of their papers, and all open access articles are distributed under the terms of the Creative Commons Attribution License.

(2)

problem. In 2010, Jun et al. [8] applied fuzzy soft set for dealing with several kinds of theories in

BCK/BCI-algebras. The notions of fuzzy soft BCK/BCI-algebras, (closed) fuzzy soft ideals and fuzzy soft p-ideals are

introduced, and related properties are investigated. In 2013, Rehman et al. [13] studied some operations

of fuzzy soft sets and give fundamental properties of fuzzy soft sets. They discuss properties of fuzzy soft

sets and their interrelation with respect to different operations such as union, intersection, restricted union

and extended intersection. Then, they illustrate properties of AND and OR operations by giving counter

examples. Also we prove that certain De Morgan’s laws hold in fuzzy soft set theory with respect to different

operations on fuzzy soft sets. In 2019, Satirad and Iampan [16] introduced ten types of fuzzy soft sets

over fully UP-semigroups, and investigate the algebraic properties of fuzzy soft sets under the operations of

(extended) intersection and (restricted) union.

Before we begin our study, we will give the definition of a UP-algebra.

Definition 1.1. [5] An algebra A = (A,·,0) of type (2,0) is called a UP-algebra where A is a nonempty

set,· is a binary operation on A, and0 is a fixed element ofA (i.e., a nullary operation) if it satisfies the

following axioms:

(UP-1): (∀x, y, z∈A)((y·z)·((x·y)·(x·z)) = 0),

(UP-2): (∀x∈A)(0·x=x),

(UP-3): (∀x∈A)(x·0 = 0), and

(UP-4): (∀x, y∈A)(x·y = 0, y·x= 0⇒x=y).

From [5], we know that the notion of UP-algebras is a generalization of KU-algebras (see [12]).

On a UP-algebraA= (A,·,0), we define a binary relation≤onA[5] as follows:

(∀x, y∈A)(x≤y⇔x·y= 0).

Example 1.1. [18] LetX be a universal set and letΩ∈ P(X)whereP(X)means the power set ofX. Let

PΩ(X) ={A∈ P(X)|Ω⊆A}. Define a binary operation·onPΩ(X)by puttingA·B=B∩(AC∪Ω)for all

A, B∈ PΩ(X)whereAC means the complement of a subset A. Then(PΩ(X),·,Ω)is a UP-algebra and we

shall call it the generalized power UP-algebra of type 1 with respect toΩ. LetPΩ(X) ={A∈ P(X)|A}.

Define a binary operation ∗ on PΩ(X) by putting AB = B (ACΩ) for all A, B ∈ P(X). Then

(PΩ(X),,Ω)is a UP-algebra and we shall call it the generalized power UP-algebra of type 2 with respect

to Ω. In particular, (P(X),·,∅) is a UP-algebra and we shall call it the power UP-algebra of type 1, and

(3)

Example 1.2. [3] LetN be the set of all natural numbers with two binary operations ◦ and•defined by

(∀x, y∈N)

 x◦y=

  

y if x < y,

0 otherwise

 

and

(∀x, y∈N)

 x•y=

  

y if x > y orx= 0,

0 otherwise

 .

Then(N,◦,0) and(N,•,0)are UP-algebras.

For more examples of UP-algebras, see [2,6,17,18].

In a UP-algebraA= (A,·,0), the following assertions are valid (see [5,6]).

(∀x∈A)(x·x= 0), (1.1)

(∀x, y, z∈A)(x·y= 0, y·z= 0⇒x·z= 0), (1.2)

(∀x, y, z∈A)(x·y= 0⇒(z·x)·(z·y) = 0), (1.3)

(∀x, y, z∈A)(x·y= 0⇒(y·z)·(x·z) = 0), (1.4)

(∀x, y∈A)(x·(y·x) = 0), (1.5)

(∀x, y∈A)((y·x)·x= 0⇔x=y·x), (1.6)

(∀x, y∈A)(x·(y·y) = 0), (1.7)

(∀a, x, y, z∈A)((x·(y·z))·(x·((a·y)·(a·z))) = 0), (1.8)

(∀a, x, y, z∈A)((((a·x)·(a·y))·z)·((x·y)·z) = 0), (1.9)

(∀x, y, z∈A)(((x·y)·z)·(y·z) = 0), (1.10)

(∀x, y, z∈A)(x·y= 0⇒x·(z·y) = 0), (1.11)

(∀x, y, z∈A)(((x·y)·z)·(x·(y·z)) = 0), and (1.12)

(∀a, x, y, z∈A)(((x·y)·z)·(y·(a·z)) = 0). (1.13)

Definition 1.2. [6] LetA be a nonempty set,·and∗ are binary operations onA, and0 is a fixed element

of A(i.e., a nullary operation). An algebra A= (A,·,∗,0)of type(2,2,0) in which(A,·,0)is a UP-algebra

and(A,∗)is a semigroup is called a fully UP-semigroup (in short, anf-UP-semigroup) if the operation “∗”

(4)

Definition 1.3. [20] A fuzzy set F in a nonempty set U (or a fuzzy subset of U) is described by its

membership functionfF. To every point x∈U, this function associates a real numberfF(x) in the interval

[0,1]. The numberfF(x)is interpreted for the point as a degree of belonging xto the fuzzy set F, that is,

F :={(x,fF(x))|x∈U}.

We say that a fuzzy set FinU is constant if its membership functionfF is constant.

Rosenfeld [14] introduced the notion of fuzzy subsemigroups (resp., fuzzy ideals) of semigroups as follows:

Definition 1.4. A fuzzy set Fin a semigroupA= (A,∗)is called

(1) a fuzzy subsemigroup of Aif (∀x, y∈A)(fF(x∗y)≥min{fF(x),fF(y)}).

(2) a fuzzy ideal ofA if(∀x, y∈A)(fF(x∗y)≥max{fF(x),fF(y)}).

Clearly, a fuzzy ideal is a fuzzy subsemigroup.

Definition 1.5. [9] Let {Fi}i∈I be a nonempty family of fuzzy sets in a nonempty set U where I is an

arbitrary index set. The intersection of Fi, denoted by Ti∈IFi, is described by its membership function fT

i∈IFi which defined as follows:

(∀x∈U)(fT

i∈IFi(x) = inf{fFi(x)}i∈I).

The union ofFi, denoted bySi∈IFi, is described by its membership functionfS

i∈IFi which defined as follows:

(∀x∈U)(fS

i∈IFi(x) = sup{fFi(x)}i∈I).

Theorem 1.1. Let Fi and F be fuzzy sets in a nonempty set X where I is a nonempty set. Then the

following properties hold:

(1) F∩(S

i∈IFi) =

S

i∈I(F∩Fi),

(2) (S

i∈IFi)∩F =Si∈I(Fi∩F), (3) F∪(T

i∈IFi) =Ti∈I(F∪Fi), and (4) (T

i∈IFi)∪F =

T

i∈I(Fi∪F).

Proof. Letx∈X. (1) First, we investigate left hand side of the equality. Assume thatS

i∈IFi= F

. Then

F∩(S

i∈IFi) = F∩F∪. Also,

fF∩F∪(x) = min{fF(x),fF∪(x)}

= min{fF(x),fS

i∈IFi(x)}

(5)

Consider the right hand side of the equality. Assume that F∩Fi= F∩i for alli∈I. Then

fS

i∈IF∩i(x) = sup{fF∩i(x)}i∈I

= sup{fF∩Fi(x)}i∈I

= sup{min{fF(x),fFi(x)}}i∈I.

It is clear that min{fF(x),sup{fFi(x)}i∈I}= sup{min{fF(x),fFi(x)}}i∈I. Therefore, F∩(Si∈IFi) =Si∈I(F∩ Fi).

(2) By using techniques as in (1), then (2) can be derived.

(3) First, we investigate left hand side of the equality. Assume thatT

i∈IFi= F∩. Then F∪(Ti∈IFi) = F∪F∩. Also,

fF∪F∩(x) = max{fF(x),fF∩(x)}

= max{fF(x),fT

i∈IFi(x)}

= max{fF(x),inf{fFi(x)}i∈I}.

Consider the right hand side of the equality. Assume that F∪Fi= F∪i for alli∈I. Then

fT

i∈IF

i(x) = inf{fF

i(x)}i∈I

= inf{fF∪Fi(x)}i∈I

= inf{max{fF(x),fFi(x)}}i∈I.

It is clear that max{fF(x),inf{fFi(x)}i∈I}= inf{max{fF(x),fFi(x)}}i∈I. Therefore, F∪(

T

i∈IFi) =Ti∈I(F∪ Fi).

(4) By using techniques as in (3), then (4) can be derived.

Somjanta et al. [19], Guntasow et al. [4], and Satirad and Iampan [16] introduced the notion of fuzzy

UP-subalgebras (resp., fuzzy near UP-filters, fuzzy UP-filters, fuzzy UP-ideals, fuzzy strongly UP-ideals) of

UP-algebras as follows:

Definition 1.6. A fuzzy set Fin a UP-algebraA= (A,·,0)is called

(1) a fuzzy UP-subalgebra ofA if(∀x, y∈A)(fF(x·y)≥min{fF(x),fF(y)}).

(2) a fuzzy near UP-filter ofA if

(i) (∀x∈A)(fF(0)≥fF(x)), and

(ii) (∀x, y∈A)(fF(x·y)≥fF(y)).

(3) a fuzzy UP-filter ofA if

(6)

(ii) (∀x, y∈A)(fF(y)≥min{fF(x·y),fF(x)}).

(4) a fuzzy UP-ideal of Aif

(i) (∀x∈A)(fF(0)≥fF(x)), and

(ii) (∀x, y, z∈A)(fF(x·z)≥min{fF(x·(y·z)),fF(y)}).

(5) a fuzzy strongly UP-ideal of Aif

(i) (∀x∈A)fF(0)≥fF(x), and

(ii) (∀x, y, z∈A)(fF(x)≥min{fF((z·y)·(z·x)),fF(y)}).

We know that the notion of fuzzy UP-subalgebras is a generalization of fuzzy near UP-filters, the notion of

fuzzy near UP-filters is a generalization of fuzzy UP-filters, the notion of fuzzy UP-filters is a generalization of

fuzzy UP-ideals, and the notion of fuzzy UP-ideals is a generalization of fuzzy strongly UP-ideals. Moreover,

fuzzy strongly UP-ideals and constant fuzzy sets coincide in UP-algebras.

Satirad and Iampan [15,16] introduced the notion of fuzzy UPs-subalgebras (resp., fuzzy UPi-subalgebras,

fuzzy near UPs-filters, fuzzy near UPi-filters, fuzzy UPs-filters, fuzzy UPi-filters, fuzzy UPs-ideals, fuzzy UPi

-ideals, fuzzy strongly UPs-ideals, fuzzy strongly UPi-ideals) off-UP-semigroups as follows:

Definition 1.7. A fuzzy set Fin anf-UP-semigroup A= (A,·,∗,0)is called

(1) a fuzzy UPs-subalgebra of A if F is a fuzzy UP-subalgebra of (A,·,0) and a fuzzy subsemigroup of

(A,∗).

(2) a fuzzy UPi-subalgebra of Aif Fis a fuzzy UP-subalgebra of(A,·,0)and a fuzzy ideal of(A,∗).

(3) a fuzzy near UPs-filter of A if F is a fuzzy near UP-filter of (A,·,0) and a fuzzy subsemigroup of

(A,∗).

(4) a fuzzy near UPi-filter ofA ifFis a fuzzy near UP-filter of(A,·,0) and a fuzzy ideal of(A,∗).

(5) a fuzzy UPs-filter of Aif Fis a fuzzy UP-filter of(A,·,0)and a fuzzy subsemigroup of(A,∗).

(6) a fuzzy UPi-filter ofA ifF is a fuzzy UP-filter of(A,·,0) and a fuzzy ideal of(A,∗).

(7) a fuzzy UPs-ideal ofA ifFis a fuzzy UP-ideal of (A,·,0)and a fuzzy subsemigroup of(A,∗).

(8) a fuzzy UPi-ideal ofAif Fis a fuzzy UP-ideal of (A,·,0) and a fuzzy ideal of(A,∗).

(9) a fuzzy strongly UPs-ideal ofAifFis a fuzzy strongly UP-ideal of(A,·,0)and a fuzzy subsemigroup

of (A,∗).

(10) a fuzzy strongly UPi-ideal ofAifFis a fuzzy strongly UP-ideal of(A,·,0)and a fuzzy ideal of(A,∗).

Theorem 1.2. [15,16] The intersection of any nonempty family of fuzzy UPs-subalgebras (resp., fuzzy

UPi-subalgebras, fuzzy near UPs-filters, fuzzy near UPi-filters, fuzzy UPs-filters, fuzzy UPi-filters, fuzzy UPs

(7)

a fuzzy UPs-subalgebra (resp., fuzzy UPi-subalgebra, fuzzy near UPs-filter, fuzzy near UPi-filter, fuzzy UPs

-filter, fuzzy UPi-filter, fuzzy UPs-ideal, fuzzy UPi-ideal, fuzzy strongly UPs-ideal, fuzzy strongly UPi-ideal).

Theorem 1.3. [15,16] The union of any nonempty family of fuzzy near UPi-filters (resp., fuzzy strongly

UPs-ideals, fuzzy strongly UPi-ideals) of an f-UP-semigroup is also a fuzzy near UPi-filter (resp., fuzzy

strongly UPs-ideal, fuzzy strongly UPi-ideal).

2. Fuzzy Soft Sets over Fully UP-Semigroups

From now on, we shall let A be an f-UP-semigroupA = (A,·,∗,0) and P be a set of parameters. Let

F(A) denotes the set of all fuzzy sets in A. A subsetEof P is called aset of statistics.

Definition 2.1. Let E ⊆ P. A pair (Fe, E) is called a fuzzy soft set over A if Fe is a mapping given by

e

F :E→ F(A), that is, a fuzzy soft set is a statistic family of fuzzy sets in A. In general, for every e∈E,

e

F[e] :={(x,f e

F[e](x))|x∈A} is a fuzzy set inA and it is called a fuzzy value set of statistice.

Definition 2.2. Let(Fe, E1) and(Ge, E2)be two fuzzy soft sets over a common universeU. The union [10]

of (Fe, E1)and (Ge, E2)is defined to be the fuzzy soft set (Fe, E1)∪(Ge, E2) = (He, E) satisfying the following

conditions:

(i) E=E1∪E2 and

(ii) for alle∈E,

e

H[e] =

        

e

F[e] ife∈E1\E2

e

G[e] ife∈E2\E1

e

F[e]∪G[e e] ife∈E1∩E2.

The restricted union [13] of(Fe, E1)and(Ge, E2)is defined to be the fuzzy soft set(eF, E1)d(Ge, E2) = (He, E)

satisfying the following conditions:

(i) E=E1∩E26=∅ and

(ii) H[e e] =F[ee]∪G[e e]for all e∈E.

Definition 2.3. [10] Let (eF, E1)and (Ge, E2)be two fuzzy soft sets over a common universe U. The OR

of (Fe, E1)and (Ge, E2)is defined to be the fuzzy soft set (Fe, E1)∨(Ge, E2) = (He, E) satisfying the following

conditions:

(i) E=E1×E2 and

(ii) H[e e1, e2] =F[ee1]∪G[e e2] for all(e1, e2)∈E.

Definition 2.4. Let (Fe, E1) and (Ge, E2)be two fuzzy soft sets over a common universe U. The extended

intersection [13] of(Fe, E1)and(Ge, E2)is defined to be the fuzzy soft set(Fe, E1)∩(Ge, E2) = (He, E)satisfying

(8)

(i) E=E1∪E2 and

(ii) for alle∈E,

e

H[e] =

        

e

F[e] ife∈E1\E2

e

G[e] ife∈E2\E1

e

F[e]∩G[e e] ife∈E1∩E2.

The intersection [1] of (Fe, E1) and (Ge, E2) is defined to be the fuzzy soft set (Fe, E1)e(Ge, E2) = (He, E)

satisfying the following conditions:

(i) E=E1∩E26=∅ and

(ii) H[e e] =F[ee]∩G[e e]for all e∈E.

Definition 2.5. [10] Let(Fe, E1)and(Ge, E2)be two fuzzy soft sets over a common universeU. TheAND

of (Fe, E1)and (Ge, E2)is defined to be the fuzzy soft set (Fe, E1)∧(Ge, E2) = (He, E) satisfying the following

conditions:

(i) E=E1×E2 and

(ii) H[e e1, e2] =F[ee1]∩G[e e2] for all(e1, e2)∈E.

Definition 2.6. A fuzzy soft set (Fe, E) over A is called a fuzzy soft UPs-subalgebra based on e ∈ E (we

shortly call an e-fuzzy soft UPs-subalgebra) of A if a fuzzy setF[ee] in A is a fuzzy UPs-subalgebra of A. If

(Fe, E)is ane-fuzzy soft UPs-subalgebra of Afor alle∈E, we say that(Fe, E)is a fuzzy soft UPs-subalgebra

of A.

We can call fuzzy soft sets that fuzzy soft UPi-subalgebras (fuzzy soft near UPs-filters, fuzzy soft near

UPi-filters,fuzzy soft UPs-filters,fuzzy soft UPi-filters,fuzzy soft UPs-ideals,fuzzy soft UPi-ideals,fuzzy soft

strongly UPs-ideals, and fuzzy soft strongly UPi-ideals) based on a statistic or fuzzy soft UPi-subalgebras

(fuzzy soft near UPs-filters,fuzzy soft near UPi-filters,fuzzy soft UPs-filters,fuzzy soft UPi-filters,fuzzy soft

UPs-ideals, fuzzy soft UPi-ideals, fuzzy soft strongly UPs-ideals, and fuzzy soft strongly UPi-ideals) ofA if

fuzzy soft sets satisfy statement in Definition2.6.

We will introduce the notions of the restricted union, the union, the intersection, the extended intersection,

the AND, and the OR of any fuzzy soft sets and apply tof-UP-semigroups.

Definition 2.7. Let {(eFi, Ei) | i ∈ I} be a nonempty family of fuzzy soft sets over a common universe U where I is an arbitrary index set. The restricted union of (Fei, Ei) is defined to be the fuzzy soft set

d

i∈I(Fei, Ei) = (Fe, E)satisfying the following conditions:

(i) E=T

i∈IEi6=∅ and

(ii) F[ee] = S

(9)

Theorem 2.1. The restricted union of family of fuzzy soft near UPi-filters of A is also a fuzzy soft near

UPi-filter.

Proof. Let (Fei, Ei) be a fuzzy soft near UPi-filters of Afor all i ∈I. Assume that

d

i∈I(eFi, Ei) = (Fe, E)

be the restricted union of (eFi, Ei) for all i∈I. Then E = T

i∈IEi 6=∅. Lete ∈E. By Theorem 1.3, we have eF[e] =SiIFei[e] is a fuzzy near UPi-filter ofA. Therefore, (Fe, E) is ane-fuzzy soft near UPi-filter of

A. But sinceeis an arbitrary statistic ofE, we have (eF, E) is a fuzzy soft near UPi-filter ofA.

In the same way as Theorem 2.1, we can use Theorem 1.3 to prove that the restricted union of family

of fuzzy soft strongly UPs-ideals (resp., fuzzy soft strongly UPi-ideals) of A is also a fuzzy soft strongly

UPs-ideal (resp., fuzzy soft strongly UPi-ideal).

Definition 2.8. Let {(Fei, Ei)|i∈ I} be a nonempty family of fuzzy soft sets over a common universeU

whereIis an arbitrary index set. The union of(Fei, Ei)is defined to be the fuzzy soft set S

i∈I(Fei, Ei) = (Fe, E)

satisfying the following conditions:

(i) E=S

i∈IEi and

(ii) F[ee] =SjJFej[e]for all e∈E with e∈Tj∈JEj−Sk∈I−JEk where ∅ 6=J ⊆I.

Theorem 2.2. The union of family of fuzzy soft near UPi-filters of Ais also a fuzzy soft near UPi-filter.

Proof. Let (Fei, Ei) be a fuzzy soft near UPi-filters ofAfor alli∈I. Assume thatTiI(Fei, Ei) = (eF, E) be

the union of (Fei, Ei) for all i∈I. ThenE= S

i∈IEi. Lete∈E.

Case 1: |J|=|I|. By Theorem2.1, we haveF[ee] = T

i∈IFei[e] is a fuzzy near UPi-filter ofA.

Case 2: |J|= 1, that is,J is a singleton set. Then eF[e] = Tj∈{j}eFj[e] =Fej[e] is a fuzzy near UPi-filter

ofA.

Case 3: 1<|J|<|I|. Then eF[e] = T

j∈JFej[e]. Sincee∈Ej for allj∈J ande /∈Ek for somek∈I−J and by same Case 1, we haveF[ee] is a fuzzy near UPi-filter ofA.

Therefore, (Fe, E) is ane-fuzzy soft near UPi-filter ofA. But sinceeis an arbitrary statistic ofE, we have

(Fe, E) is a fuzzy soft near UPi-filter ofA.

In the same way as Theorem2.2, we can prove that the union of family of fuzzy soft strongly UPs-ideals

(resp., fuzzy soft strongly UPi-ideals) ofA is also a fuzzy soft strongly UPs-ideal (resp., fuzzy soft strongly

UPi-ideal).

In [16], we show that the union of two fuzzy soft UPs-subalgebras (resp., fuzzy soft UPi-subalgebras, fuzzy

soft near UPs-filters, fuzzy soft UPs-filters, fuzzy soft UPi-filters, fuzzy soft UPs-ideals, fuzzy soft UPi-ideals)

ofAis not fuzzy soft UPs-subalgebra (resp., fuzzy soft UPi-subalgebra, fuzzy soft near UPs-filter, fuzzy soft

(10)

Definition 2.9. Let {(Fei, Ei)|i∈ I} be a nonempty family of fuzzy soft sets over a common universeU

whereIis an arbitrary index set. The intersection of(Fei, Ei)is defined to be the fuzzy soft set

e

i∈I(Fei, Ei) =

(Fe, E)satisfying the following conditions:

(i) E=T

i∈IEi6=∅ and

(ii) F[ee] = T

i∈IFei[e]for all e∈E.

Theorem 2.3. The intersection of family of fuzzy soft UPs-subalgebras of A is also a fuzzy soft UPs

-subalgebra.

Proof. Let (Fei, Ei) be a fuzzy soft UPs-subalgebras of Afor all i∈I. Assume that

e

i∈I(eFi, Ei) = (Fe, E)

is the intersection of (eFi, Ei) for alli ∈I. ThenE = T

i∈IEi 6=∅. Let e∈E. By Theorem 1.2, we have

e

F[e] =T

i∈IeFi[e] is a fuzzy UPs-subalgebra ofA. Therefore, (Fe, E) is ane-fuzzy soft UPs-subalgebra of A.

But sinceeis an arbitrary statistic ofE, we have (eF, E) is a fuzzy soft UPs-subalgebra ofA.

In the same way as Theorem2.3, we can use Theorem1.2to prove that the intersection of family of fuzzy

soft UPi-subalgebras (resp., fuzzy soft near UPs-filters, fuzzy soft near UPi-filters, fuzzy soft UPs-filters,

fuzzy soft UPi-filters, fuzzy soft UPs-ideals, fuzzy soft UPi-ideals, fuzzy soft strongly UPs-ideals, fuzzy soft

strongly UPi-ideals) ofAis also a fuzzy soft UPi-subalgebra (resp., fuzzy soft near UPs-filter, fuzzy soft near

UPi-filter, fuzzy soft UPs-filter, fuzzy soft UPi-filter, fuzzy soft UPs-ideal, fuzzy soft UPi-ideal, fuzzy soft

strongly UPs-ideal, fuzzy soft strongly UPi-ideal).

Definition 2.10. Let {(Fei, Ei) | i ∈ I} be a nonempty family of fuzzy soft sets over a common universe U where I is an arbitrary index set. The extended intersection of(Fei, Ei)is defined to be the fuzzy soft set T

i∈I(Fei, Ei) = (Fe, E)satisfying the following conditions:

(i) E=S

i∈IEi and

(ii) F[ee] = T

j∈JFej[e]for all e∈E with e∈Tj∈JEj−

S

k∈I−JEk where ∅ 6=J ⊆I.

Theorem 2.4. The extended intersection of family of fuzzy soft UPs-subalgebras of A is also a fuzzy soft

UPs-subalgebra.

Proof. Let (Fei, Ei) be a fuzzy soft UPs-subalgebras ofAfor alli∈I. Assume that TiI(Fei, Ei) = (Fe, E) is

the extended intersection of (Fei, Ei) for alli∈I. ThenE= S

i∈IEi. Lete∈E.

Case 1: |J|=|I|. By Theorem2.3, we haveF[ee] =TiIFei[e] is a fuzzy UPs-subalgebra ofA.

Case 2: |J|= 1, that is,J is a singleton set. ThenF[ee] =Tj∈{j}eFj[e] =Fej[e] is a fuzzy UPs-subalgebra

ofA.

(11)

Therefore, (eF, E) is an e-fuzzy soft UPs-subalgebra of A. But since e is an arbitrary statistic of E, we

have (Fe, E) is a fuzzy soft UPs-subalgebra ofA.

In the same way as Theorem2.4, we can prove that the extended intersection of family of fuzzy soft UPi

-subalgebras (resp., fuzzy soft near UPs-filters, fuzzy soft near UPi-filters, fuzzy soft UPs-filters, fuzzy soft

UPi-filters, fuzzy soft UPs-ideals, fuzzy soft UPi-ideals, fuzzy soft strongly UPs-ideals, fuzzy soft strongly

UPi-ideals) ofA is also a fuzzy soft UPi-subalgebra (resp., fuzzy soft near UPs-filter, fuzzy soft near UPi

-filter, fuzzy soft UPs-filter, fuzzy soft UPi-filter, fuzzy soft UPs-ideal, fuzzy soft UPi-ideal, fuzzy soft strongly

UPs-ideal, fuzzy soft strongly UPi-ideal).

Definition 2.11. Let {(eFi, Ei)|i∈I} be a nonempty family of fuzzy soft sets over a common universeU

whereIis an arbitrary index set. TheANDof(eFi, Ei)is defined to be the fuzzy soft set V

i∈I(Fei, Ei) = (Fe, E)

satisfying the following conditions:

(i) E=Q

i∈IEi and

(ii) F[(e ei)i∈I] =TiIFei[ei]for all(ei)i∈I ∈E.

Theorem 2.5. The ANDof family of fuzzy soft UPs-subalgebras ofA is also a fuzzy soft UPs-subalgebra.

Proof. Let (Fei, Ei) be a fuzzy soft UPs-subalgebras of A for all i ∈ I. By means of Definition 2.11, we

assume thatV

i∈I(eFi, Ei) = (Fe, E) such thatE = Q

i∈IEi and F[(e ei)i∈I] =Ti∈IeFi[ei] for all (ei)i∈I ∈E. Assume thate= (ei)i∈I ∈Eand letx, y∈A. Then

f e

F[e](x·y) = fT

i∈IFei[ei](x·y)

= inf{f e

Fi[ei](x·y)}i∈I

≥inf{min{f e

Fi[ei](x),fFei[ei](y)}}i∈I

= min{inf{f e

Fi[ei](x)}i∈I,inf{fFei[ei](y)}i∈I}

= min{fT

i∈IeFi[ei](x),fTiIFi[e ei](y)}

= min{f e

F[e](x),fF[ee](y)}, and

f e

F[e](x∗y) = fT

i∈IFi[e ei](x∗y)

= inf{f e

Fi[ei](x∗y)}i∈I

≥inf{min{f e

Fi[ei](x),fFei[ei](y)}}i∈I

= min{inf{f e

Fi[ei](x)}i∈I,inf{fFei[ei](y)}i∈I}

= min{fT

i∈IeFi[ei](x),fTi∈IFei[ei](y)}

= min{f e

(12)

Therefore,F[ee] is a fuzzy UPs-subalgebra of A, that is, (eF, E) is ane-fuzzy soft UPs-subalgebra ofA. But

sinceeis an arbitrary statistic ofE, we have (Fe, E) is a fuzzy soft UPs-subalgebra ofA.

In the same way as Theorem 2.5, we can use Theorem 1.2 to prove that the AND of family of fuzzy

soft UPi-subalgebras (resp., fuzzy soft near UPs-filters, fuzzy soft near UPi-filters, fuzzy soft UPs-filters,

fuzzy soft UPi-filters, fuzzy soft UPs-ideals, fuzzy soft UPi-ideals, fuzzy soft strongly UPs-ideals, fuzzy soft

strongly UPi-ideals) ofAis also a fuzzy soft UPi-subalgebra (resp., fuzzy soft near UPs-filter, fuzzy soft near

UPi-filter, fuzzy soft UPs-filter, fuzzy soft UPi-filter, fuzzy soft UPs-ideal, fuzzy soft UPi-ideal, fuzzy soft

strongly UPs-ideal, fuzzy soft strongly UPi-ideal).

Definition 2.12. Let {(eFi, Ei)|i∈I} be a nonempty family of fuzzy soft sets over a common universeU

whereIis an arbitrary index set. TheORof(Fei, Ei)is defined to be the fuzzy soft setWiI(Fei, Ei) = (Fe, E)

satisfying the following conditions:

(i) E=Q

i∈IEi and

(ii) F[(e ei)i∈I] =Si∈IeFi[ei]for all(ei)i∈I ∈E.

Theorem 2.6. The ORof family of fuzzy soft near UPi-filters ofA is also a fuzzy soft near UPi-filter.

Proof. Let (Fei, Ei) be a fuzzy soft near UPi-filters ofAfor alli∈I. By means of Definition2.12, we assume

that W

i∈I(Fei, Ei) = (Fe, E) such thatE =QiIEi and eF[(ei)i∈I] =Si∈IFei[ei] for all (ei)i∈I ∈E. Assume thate= (ei)i∈I ∈E and letx, y∈A. Then

f e

F[e](0) = fS

i∈IeFi[ei](0)

= sup{f e

Fi[ei](0)}i∈I

≥sup{f e

Fi[ei](x)}i∈I

= fS

i∈IeFi[ei](x)

= f e

F[e](x),

f e

F[e](x·y) = fS

i∈IeFi[ei](x·y)

= sup{f e

Fi[ei](x·y)}i∈I

≥sup{f e

Fi[ei](y)}i∈I

= fS

i∈IeFi[ei](y)

= f e

(13)

f e

F[e](x∗y) = fS

i∈IFei[ei](x∗y)

= sup{f e

Fi[ei](x∗y)}i∈I

≥sup{max{f e

Fi[ei](x),fFi[e ei](y)}}i∈I

= max{sup{f e

Fi[ei](x)}i∈I,sup{feFi[ei](y)}i∈I}

= max{fT

i∈IeFi[ei](x),f T

i∈IFi[e ei](y)}

= max{f e

F[e](x),feF[e](y)}.

Therefore, F[ee] is a fuzzy near UPi-filter of A, that is, (Fe, E) is an e-fuzzy soft near UPi-filter ofA. But

sinceeis an arbitrary statistic ofE, we have (Fe, E) is a fuzzy soft near UPi-filter ofA.

In the same way as Theorem2.6, we can use Theorem 1.3 to prove that the OR of family of fuzzy soft

strongly UPs-ideals (resp., fuzzy soft strongly UPi-ideals) ofAis also a fuzzy soft strongly UPs-ideal (resp.,

fuzzy soft strongly UPi-ideal).

The following example shows that the OR of two fuzzy soft UPs-subalgebras ofAis not fuzzy soft UPs

-subalgebra.

Example 2.1. Let A be the set of four series of the iPhone, that is,

A={5,6,7,X}.

Define two binary operations· and∗on Aas the following Cayley tables:

· X 7 6 5

X X 7 6 5

7 X X 6 5

6 X 7 X 5

5 X 7 6 X

∗ X 7 6 5

X X X X X

7 X X X X

6 X X X 7

5 X X 7 X

ThenA= (A,·,∗,X)is anf-UP-semigroup. Let (Fe1, E1)and(eF2, E2) be two fuzzy soft sets overA where

E1:={price, beauty,specifications}andE2:={price,stability}

withFe1[price],Fe1[beauty],eF1[specifications],Fe2[price], andFe2[stability]are fuzzy sets inAdefined as follows:

e

F1 X 7 6 5

price 0.9 0.7 0.9 0.2

beauty 1 0.8 0.3 0.2

specifications 0.6 0.5 0.3 0.4

e

F2 X 7 6 5

price 0.9 0.3 0.2 0.8

(14)

Then(eF1, E1)and(Fe2, E2)are two fuzzy soft UPs-subalgebras ofA. Since(price,price)∈E1×E2, we have

(f e

F1[price]∪Fe2[price])(5∗6) = (fFe1[price]∪eF2[price])(7)

= 0.7

0.8

= min{0.8,0.9}

= min{(f e

F1[price]∪Fe2[price])(5),(fFe1[price]∪eF2[price])(6)}.

ThuseF1[price]∪Fe2[price]is not a fuzzy UPs-subalgebra ofA, that is,(Fe1, E1)∪(Fe2, E2)is not a(price,price)

-fuzzy soft UPs-subalgebra ofA. Hence,(eF1, E1)∪(eF2, E2)is not a fuzzy soft UPs-subalgebra ofA. Moreover,

(Fe1, E1)∨(Fe2, E2)is not a fuzzy soft UPs-subalgebra of A.

We can apply those examples in [16] to check that the OR of two fuzzy soft UPi-subalgebras (resp.,

fuzzy soft near UPs-filters, fuzzy soft UPs-filters, fuzzy soft UPi-filters, fuzzy soft UPs-ideals, fuzzy soft

UPi-ideals) of A is not fuzzy soft UPi-subalgebra (resp., fuzzy soft near UPs-filter, fuzzy soft UPs-filter,

fuzzy soft UPi-filter, fuzzy soft UPs-ideal, fuzzy soft UPi-ideal).

We prove that certain distributive laws hold in fuzzy soft set theory with respect to the restricted union,

the union, the intersection, and the extended intersection on any fuzzy soft sets.

Theorem 2.7. Let(Fei, Ei)and(Fe, E)be fuzzy soft sets over a common universeU whereI is a nonempty

set. Then the following properties hold:

(1) (Fe, E)e(SiI(eFi, Ei)) =SiI((Fe, E)e(Fei, Ei)),

(2) (S

i∈I(Fei, Ei))e(eF, E) = S

i∈I((Fei, Ei)e(Fe, E)),

(3) (Fe, E)d(TiI(eFi, Ei)) =Ti∈I((Fe, E)d(Fei, Ei)), (4) (T

i∈I(Fei, Ei))d(eF, E) = (Fei, Ei))dTi∈I((Fe, E),

(5) (Fe, E)∩(

d

i∈I(Fei, Ei)) =

d

i∈I((Fe, E)∩(eFi, Ei)),

(6) (

d

i∈I(Fei, Ei))∩(Fe, E) =

d

i∈I((Fei, Ei)∩(eF, E)),

(7) (Fe, E)∪(

e

i∈I(Fei, Ei)) =

e

i∈I((Fe, E)∪(eFi, Ei)), (8) (

e

i∈I(Fei, Ei))∪(Fe, E) =

e

i∈I((Fei, Ei)∪(eF, E)),

(9) (Fe, E)e(

d

i∈I(Fei, Ei)) =

d

i∈I((Fe, E)e(eFi, Ei)),

(10) (

d

i∈I(Fei, Ei))e(Fe, E) =

d

i∈I((Fei, Ei)e(eF, E)),

(11) (Fe, E)d(

e

i∈I(Fei, Ei)) =

e

i∈I((Fe, E)d(eFi, Ei)), and

(12) (

e

i∈I(Fei, Ei))d(Fe, E) =

e

i∈I((Fei, Ei)d(eF, E)).

Proof. (1) First, we investigate left hand side of the equality. Suppose that S

i∈I(Fei, Ei) = (Ge, EU) is

the union of (Fei, Ei) for all i ∈ I. Then EU = S

i∈IEi and for any e ∈ E U,

e

G[e] = S

(15)

e∈T

j∈JEj−

S

k∈I−JEkwhere∅ 6=J ⊆I. Thus (Fe, E)e(SiI(Fei, Ei)) = (Fe, E)e(Ge, EU) = (He, EU I). For

anye∈EU I =E∩EU 6=∅,H[e e] =F[ee]∩G[e e] whereE∩EU =E∩( S

i∈IEi) =

S

i∈I(E∩Ei). By considering

e

G as piecewise defined function, we haveH[e e] =F[ee]∩(SjJFej[e]) withe∈Tj∈J(E∩Ej)−Sk∈I−J(E∩Ek) where∅ 6=J⊆I.

Consider the right hand side of the equality. Suppose that (eF, E)e(Fei, Ei) = (eIi, EiI) is the intersection

of (eF, E) and (Fei, Ei) for all i ∈ I. Then EIi = E ∩Ei 6= ∅ and for any e ∈ EiI, eIi[e] = F[ee]∩Fei[e]. Now, S

i∈I((eF, E)e(Fei, Ei)) =Si∈I(eIi, EIi) = (eJ, EIU), where EIU =SiIEiI = SiI(E∩Ei). For any e∈ EIU,

e

J[e] =S

j∈JeIj[e] with e∈ Tj∈JEjI−

S

k∈I−JEkI where ∅ 6=J ⊆I. ConsideringeIi as piecewise functions for all i ∈ I, we have eJ[e] =

S

j∈J(F[ee]∩eFj[e]) with e ∈ Tj∈J(E ∩Ej)−

S

k∈I−J(E ∩Ek)

where ∅ 6= J ⊆ I. By Theorem 1.1 (1), it is clear that H ande eJ are same set-valued mapping. Hence,

(Fe, E)e(SiI(eFi, Ei)) =SiI((Fe, E)e(Fei, Ei)).

(2) By using techniques as in (1) and by Theorem1.1 (2), then (2) can be derived.

(3) By using techniques as in (1) and by Theorem1.1 (3), then (3) can be derived.

(4) By using techniques as in (1) and by Theorem1.1 (4), then (4) can be derived.

(5) First, we investigate left hand side of the equality. Suppose that

d

i∈I(Fei, Ei) = (Ge, ERU) is the

restricted union of (Fei, Ei) for alli∈I. Then ERU =Ti∈IEi=6 ∅ and for anye∈ERU,G[e e] =SiIFei[e]. Thus (eF, E)∩(

d

i∈I(Fei, Ei)) = (eF, E)∩(Ge, ERU) = (He, ERU EI). For anye∈ERU EI=E∪ERU, we have

e

H[e] =

         e

F[e] ife∈E\ERU

e

G[e] ife∈ERU \E

e

F[e]∩G[e e] ife∈E∩ERU.

By taking into account the definition ofG along withe H, we can writee

e

H[e] =

         e

F[e] ife∈E\(T

i∈IEi)

S

i∈IFei[e] ife∈(TiIEi)\E

e

F[e]∩(S

i∈IeFi[e]) ife∈E∩(Ti∈IEi).

Consider the right hand side of the equality. Suppose that (Fe, E)∩(Fei, Ei) = (eIi, EiEI) is the extended intersection of (Fe, E) and (Fei, Ei) for all i∈I. Then for anye∈EiEI=E∪Ei, we have

eIi[e] =

         e

F[e] ife∈E\Ei

e

Fi[e] ife∈Ei\E

e

F[e]∩Fei[e] ife∈E∩Ei.

Now,

d

i∈I((eF, E)∩(Fei, Ei)) =

d

i∈I(eIi, EiEI) = (eJ, EEIRU) whereEEIRU =TiIEiI =TiI(E∪Ei) = E∪(T

i∈IEi)6=∅. For anye∈E EIRU,

(16)

in set theory and consideringeIi as piecewise defined functions for alli∈I, we have

e

J[e] =

        

S

i∈IeF[e] ife∈E\( T

i∈IEi)

S

i∈IeFi[e] ife∈(Ti∈IEi)\E

S

i∈I(F[ee]∩eFi[e]) ife∈E∩(TiIEi). And so

e

J[e] =

        

e

F[e] ife∈E\(T

i∈IEi)

S

i∈IeFi[e] ife∈(TiIEi)\E

S

i∈I(F[ee]∩eFi[e]) ife∈E∩(Ti∈IEi).

By Theorem1.1 (1), it is clear thatH ande eJ are same set-valued mapping. Hence, (Fe, E)∩(

d

i∈I(Fei, Ei)) =

d

i∈I((Fe, E)∩(Fei, Ei)).

(6) By using techniques as in (5) and by Theorem1.1 (2), then (6) can be derived.

(7) By using techniques as in (5) and by Theorem1.1 (3), then (7) can be derived.

(8) By using techniques as in (5) and by Theorem1.1 (4), then (8) can be derived.

(9) First, we investigate left hand side of the equality. Suppose that

d

i∈I(Fei, Ei) = (Ge, ERU) is the

restricted union of (Fei, Ei) for alli∈I. Then ERU =TiIEi6=∅ and for anye∈ERU,G[e e] =SiIFei[e]. Thus (Fe, E)e(

d

i∈I(Fei, Ei)) = (Fe, E)e(Ge, ERU) = (He, ERU I). For any e ∈ ERU I = E∩ERU = E∩

(T

i∈IEi)6=∅, we haveH[e e] =F[ee]∩G[e e] =eF[e]∩(SiIFei[e]).

Consider the right hand side of the equality. Suppose that (eF, E)e(Fei, Ei) = (eIi, EiI) is the intersection

of (eF, E) and (Fei, Ei) for all i ∈ I. Then EIi = E ∩Ei 6= ∅ and for any e ∈ EiI, eIi[e] = F[ee]∩Fei[e]. Now,

d

i∈I((Fe, E)e(Fei, Ei)) =

d

i∈I(eIi, EiI) = (eJ, EIRU), where EIRU = TiIEiI = TiI(E∩Ei)6=∅. For any e ∈ EIRU,

e

J[e] = S

j∈JeIj[e] = Sj∈J(F[ee]∩Fei[e]). Since Ti∈I(E ∩Ei) = E ∩(Ti∈IEi), we have EIRU = ERU I. By Theorem 1.1 (1), it is clear that

e

H and eJ are same set-valued mapping. Hence,

(Fe, E)e(

d

i∈I(Fei, Ei)) =

d

i∈I((Fe, E)e(Fei, Ei)).

(10) By using techniques as in (9) and by Theorem1.1 (2), then (10) can be derived.

(11) By using techniques as in (9) and by Theorem1.1 (3), then (11) can be derived.

(12) By using techniques as in (9) and by Theorem1.1 (4), then (12) can be derived.

Acknowledgment

The authors would also like to thank the anonymous referee for giving many helpful suggestion on the

revision of present paper.

References

[1] B. Ahmad and A. Kharal, On fuzzy soft sets, Adv. Fuzzy Syst. 2009 (2009), Article ID 586507.

(17)

[3] N. Dokkhamdang, A. Kesorn, and A. Iampan, Generalized fuzzy sets in UP-algebras, Ann. Fuzzy Math. Inform. 16 (2018), no. 2, 171–190.

[4] T. Guntasow, S. Sajak, A. Jomkham, and A. Iampan, Fuzzy translations of a fuzzy set in UP-algebras, J. Indones. Math. Soc. 23 (2017), no. 2, 1–19.

[5] A. Iampan, A new branch of the logical algebra: UP-algebras, J. Algebra Relat. Top. 5 (2017), no. 1, 35–54. [6] A. Iampan, Introducing fully UP-semigroups, Discuss. Math., Gen. Algebra Appl. 38 (2018), no. 2, 297–306. [7] Y. B. Jun, S. M. Hong, and E. H. Roh, BCI-semigroups, Honam Math. J. 15 (1993), no. 1, 59–64.

[8] Y. B. Jun, K. J. Lee, and C. H. Park, Fuzzy soft set theory applied to BCK/BCI-algebras, Comput. Math. Appl. 59 (2010), 3180–3192.

[9] K. H. Lee, First course on fuzzy theory and applications, Springer-Verlag Berlin Heidelberg, Republic of South Korea, 2005.

[10] P.K. Maji, R. Biswas, and A.R. Roy, Fuzzy soft sets, J. Fuzzy Math. 9 (2001), no. 3, 589–602. [11] D. Molodtsov, Soft set theory-first results, Comput. Math. Appl. 37 (1999), 19–31.

[12] C. Prabpayak and U. Leerawat, On ideals and congruences in KU-algebras, Sci. Magna 5 (2009), no. 1, 54–57.

[13] A. Rehman, S. Abdullah, M. Aslam, and M. S. Kamran, A study on fuzzy soft set and its operations, Ann. Fuzzy Math. Inform. 6 (2013), no. 2, 339–362.

[14] A. Rosenfeld, Fuuzy groups, J. Math, Anal. Appl. 35 (1971), 512–517.

[15] A. Satirad and A. Iampan, Fuzzy sets in fully UP-semigroups, Manuscript accepted for publication in Ital. J. Pure Appl. Math., July 2018.

[16] A. Satirad and A. Iampan, Fuzzy soft sets over fully UP-semigroups, Eur. J. Pure Appl. Math. 12 (2019), no. 2, 294–331. [17] A. Satirad, P. Mosrijai, and A. Iampan, Formulas for finding UP-algebras, Int. J. Math. Comput. Sci. 14 (2019), no. 2,

403–409.

[18] A. Satirad and A. Iampan, Generalized power UP-algebras, Int. J. Math. Comput. Sci. 14 (2019), no. 1, 17–25.

[19] J. Somjanta, N. Thuekaew, P. Kumpeangkeaw, and A. Iampan, Fuzzy sets in UP-algebras, Ann. Fuzzy Math. Inform. 12 (2016), no. 6, 739–756.

References

Related documents

Thus, this study suggested a theoretical model by which both transformational and transactional leadership styles influence employees’ knowledge sharing practices, and

model consists of a pair of 2-d equations of Kirchho type for the static equi- librium or dynamic motion, as appropriate, of the transverse displacements of the references surfaces

abbreviations: RIC – Radiation-induced coagulopathy; AC - activated carbon; ARS – acute radiation syndrome; ES – enterosorbent; APTT – activated partial thromboplastin time; PC

This study has demonstrated that: a) the MXR defence system in earthworm E. fetida is at least partly mediated by the P-gp efflux transporter; b) the identified sequence

In order to assess the performance of our novel approach based on “The Code Quantity Principle” and show that it is suitable for Text Summarization, we evaluated the sum-

Simplified Arabic and Traditional Ara- bic fonts show high size, slant, and overall error rates, high rejection rate, and low recognition success rate compared to Tahoma fonts..

Results: Experimental studies on complexing interaction between a special form of biomaterial - microcrystalline chitosan as ligand, L = MCCh, of two exemplary degrees of

Since the s allele is associated not only with neuroticism and tendency to develop affective disorders in the face of adverse life events, but also with less favourable response