
The aim of this paper is to apply the concept of Pythagorean fuzzy sets to UP-algebras, and then we introduce five types of Pythagorean fuzzy sets in UP-algebras. In addition, we will also discuss the relationship between some assertions of Pythagorean fuzzy sets and Pythagorean fuzzy UP-subalgebras (resp., Pythagorean fuzzy near UP-filters, Pythagorean fuzzy UP-filters, Pythagorean fuzzy UP-ideals, Pythagorean fuzzy strong UP-ideals) in UP-algebras and study upper and lower approximations of Pythagorean fuzzy sets.
Citation: Akarachai Satirad, Ronnason Chinram, Aiyared Iampan. Pythagorean fuzzy sets in UP-algebras and approximations[J]. AIMS Mathematics, 2021, 6(6): 6002-6032. doi: 10.3934/math.2021354
[1] | Abdul Razaq, Ghaliah Alhamzi . On Pythagorean fuzzy ideals of a classical ring. AIMS Mathematics, 2023, 8(2): 4280-4303. doi: 10.3934/math.2023213 |
[2] | Supriya Bhunia, Ganesh Ghorai, Qin Xin . On the fuzzification of Lagrange's theorem in (α,β)-Pythagorean fuzzy environment. AIMS Mathematics, 2021, 6(9): 9290-9308. doi: 10.3934/math.2021540 |
[3] | Ayesha Shareef, Uzma Ahmad, Saba Siddique, Mohammed M. Ali Al-Shamiri . Pythagorean fuzzy incidence graphs with application in illegal wildlife trade. AIMS Mathematics, 2023, 8(9): 21793-21827. doi: 10.3934/math.20231112 |
[4] | Misbah Rasheed, ElSayed Tag-Eldin, Nivin A. Ghamry, Muntazim Abbas Hashmi, Muhammad Kamran, Umber Rana . Decision-making algorithm based on Pythagorean fuzzy environment with probabilistic hesitant fuzzy set and Choquet integral. AIMS Mathematics, 2023, 8(5): 12422-12455. doi: 10.3934/math.2023624 |
[5] | Supriya Bhunia, Ganesh Ghorai, Qin Xin . On the characterization of Pythagorean fuzzy subgroups. AIMS Mathematics, 2021, 6(1): 962-978. doi: 10.3934/math.2021058 |
[6] | Hifza, Muhammad Gulistan, Zahid Khan, Mohammed M. Al-Shamiri, Muhammad Azhar, Asad Ali, Joseph David Madasi . A new fuzzy decision support system approach; analysis and applications. AIMS Mathematics, 2022, 7(8): 14785-14825. doi: 10.3934/math.2022812 |
[7] | Li Li, Mengjing Hao . Interval-valued Pythagorean fuzzy entropy and its application to multi-criterion group decision-making. AIMS Mathematics, 2024, 9(5): 12511-12528. doi: 10.3934/math.2024612 |
[8] | D. Ajay, P. Chellamani, G. Rajchakit, N. Boonsatit, P. Hammachukiattikul . Regularity of Pythagorean neutrosophic graphs with an illustration in MCDM. AIMS Mathematics, 2022, 7(5): 9424-9442. doi: 10.3934/math.2022523 |
[9] | Saleem Abdullah, Muhammad Qiyas, Muhammad Naeem, Mamona, Yi Liu . Pythagorean Cubic fuzzy Hamacher aggregation operators and their application in green supply selection problem. AIMS Mathematics, 2022, 7(3): 4735-4766. doi: 10.3934/math.2022263 |
[10] | Esmail Hassan Abdullatif Al-Sabri, Muhammad Rahim, Fazli Amin, Rashad Ismail, Salma Khan, Agaeb Mahal Alanzi, Hamiden Abd El-Wahed Khalifa . Multi-criteria decision-making based on Pythagorean cubic fuzzy Einstein aggregation operators for investment management. AIMS Mathematics, 2023, 8(7): 16961-16988. doi: 10.3934/math.2023866 |
The aim of this paper is to apply the concept of Pythagorean fuzzy sets to UP-algebras, and then we introduce five types of Pythagorean fuzzy sets in UP-algebras. In addition, we will also discuss the relationship between some assertions of Pythagorean fuzzy sets and Pythagorean fuzzy UP-subalgebras (resp., Pythagorean fuzzy near UP-filters, Pythagorean fuzzy UP-filters, Pythagorean fuzzy UP-ideals, Pythagorean fuzzy strong UP-ideals) in UP-algebras and study upper and lower approximations of Pythagorean fuzzy sets.
For the study of many algebraic structures, algebras of logic form important class of algebras. Examples of these are BCK-algebras [15], BCI-algebras [16], BE-algebras [19], UP-algebras [11], fully UP-semigroups [12], topological UP-algebras [27], UP-hyperalgebras [13], extension of KU/UP-algebras [24] and others.
The concept of rough sets was first introduced by Pawlak [22] in 1982. After the concept was introduced, several researchers were conducted on the generalizations of the concept of rough sets and application to many algebraic structures such as: in 2002, Jun [18] and Dudek et al. [7] applied rough set theory to BCK/BCI-algebras. In 2019-2020, Ansari et al. [2] and Klinseesook et al. [20] applied rough set theory to UP-algebras.
The concept of fuzzy sets was first introduced by Zadeh [35] in 1965. The fuzzy set theories developed by Zadeh and others have found many applications in the domain of mathematics and elsewhere. After the introduction of the concept of fuzzy sets by Zadeh [35], Atanassov [3] defined new concept called intuitionistic fuzzy set which is a generalization of fuzzy set, Yager [33] introduce a new class of non-standard fuzzy subsets called Pythagorean fuzzy subsets and the related idea of Pythagorean membership grades, and Satirad and Iampan [25] introduced several types of subsets and of fuzzy sets of fully UP-semigroups, and investigated the algebraic properties of fuzzy sets under the operations of intersection and union.
The concept of Pythagorean fuzzy sets was applied to semigroups, ternary semigroups, and many logical algebras such as: In 2019, Hussain et al. [9] present the concept of rough Pythagorean fuzzy ideals in semigroups. Then, this idea is extended to the lower and upper approximations of Pythagorean fuzzy left (resp., right) ideals, bi-ideals, interior ideals, (1, 2)-ideals in semigroups and some important properties related to these concepts are given. Jansi and Mohana [17] introduced the concepts of bipolar Pythagorean fuzzy A-ideals of BCI-algebras and investigated their properties. Also, relationship between bipolar Pythagorean fuzzy subalgebras, bipolar Pythagorean fuzzy ideals, and bipolar Pythagorean fuzzy A-ideals are analyzed. In 2020, Chinram and Panityakul [5] studied rough Pythagorean fuzzy ideals in ternary semigroups. This idea is extended to the lower and upper approximations of Pythagorean fuzzy ideals.
In this paper, we apply the concept of Pythagorean fuzzy sets to UP-algebras and investigate their properties. Also, we discuss the relationship between the Pythagorean UP-subalgebras, Pythagorean fuzzy near UP-filters, Pythagorean fuzzy UP-filters, Pythagorean fuzzy UP-ideals, and Pythagorean fuzzy strong UP-ideals. This idea is extended to the lower and upper approximations of Pythagorean fuzzy sets in UP-algebras.
Before we begin our study, let's review the definition of UP-algebras.
Definition 1.1. [11] An algebra U=(U,∗,0) of type (2,0) is said to be a UP-algebra, where U is a nonempty set, ∗ is a binary operation on U, and 0 is a fixed element of U if it fulfills the following axioms:
(UP-1) (for all x,y,z∈U)((y∗z)∗((x∗y)∗(x∗z))=0),
(UP-2) (for all x∈U)(0∗x=x),
(UP-3) (for all x∈U)(x∗0=0), and
(UP-4) (for all x,y∈U)(x∗y=0,y∗x=0⇒x=y),
and is said to be a KU-algebra if it fulfills axioms (UP-2), (UP-3), (UP-4), and the following axiom:
(KU) (for all x,y,z∈U)((x∗y)∗((y∗z)∗(x∗z))=0).
From [11], we know that the concept of UP-algebras is a generalization of KU-algebras (see [23]).
Example 1.2. [29] Let U be a nonempty set and let X∈P(U), where P(U) means the power set of U. Let PX(U)={A∈P(U)∣X⊆A}. Define a binary operation △ on PX(U) by putting A△B=B∩(AC∪X) for all A,B∈PX(U), where AC means the complement of a subset A. Then (PX(U),△,X) is a UP-algebra. Let PX(U)={A∈P(U)∣A⊆X}. Define a binary operation ▴ on PX(U) by putting A▴B=B∪(AC∩X) for all A,B∈PX(U). Then (PX(U),▴,X) is a UP-algebra.
Example 1.3. [6] Let N0 be the set of all natural numbers with zero. Define two binary operations ∘ and ⋆ on N0 by
(for all m,n∈N0)(m∘n={nifm<n,0otherwise) |
and
(for all m,n∈N0)(m⋆n={nifm>norm=0,0otherwise). |
Then (N0,∘,0) and (N0,⋆,0) are UP-algebras.
For more examples of UP-algebras, see [1,2,4,12,14,28,29,30,31].
In a UP-algebra U=(U,∗,0), the following axioms are valid (see [11,12]).
(for all x∈U)(x∗x=0), | (1) |
(for all x,y,z∈U)(x∗y=0,y∗z=0⇒x∗z=0),(for all x,y,z∈U)(x∗y=0⇒(z∗x)∗(z∗y)=0), | (2) |
(for all x,y,z∈U)(x∗y=0⇒(y∗z)∗(x∗z)=0), | (3) |
(for all x,y∈U)(x∗(y∗x)=0), | (4) |
(for all x,y∈U)((y∗x)∗x=0⇔x=y∗x),(for all x,y∈U)(x∗(y∗y)=0),(for all a,x,y,z∈U)((x∗(y∗z))∗(x∗((a∗y)∗(a∗z)))=0),(for all a,x,y,z∈U)((((a∗x)∗(a∗y))∗z)∗((x∗y)∗z)=0),(for all x,y,z∈U)(((x∗y)∗z)∗(y∗z)=0),(for all x,y,z∈U)(x∗y=0⇒x∗(z∗y)=0),(for all x,y,z∈U)(((x∗y)∗z)∗(x∗(y∗z))=0),and(for all a,x,y,z∈U)(((x∗y)∗z)∗(y∗(a∗z))=0). | (5) |
From [11], the binary relation ≤ on a UP-algebra U=(U,∗,0) is defined as follows:
(for all x,y∈U)(x≤y⇔x∗y=0). |
In a KU-algebra U=(U,∗,0), the following axioms are valid (see [21]).
(for all x,y,z∈U)(x∗(y∗z)=y∗(x∗z)),and(for all x,y∈U)(y∗((y∗x)∗x)=0). | (6) |
Theorem 1.4. [11] In a UP-algebra U=(U,∗,0), the following statements are equivalent:
(1) U is a KU-algebra,
(2) (for allx,y,z∈U)(x∗(y∗z)=y∗(x∗z)), and
(3) (for allx,y,z∈U)(x∗(y∗z)=0⇒y∗(x∗z)=0).
For a nonempty subset S of a UP-algebra U=(U,∗,0) which fulfills the following assertion:
(for all x,y∈U)(y∈S⇒x∗y∈S). | (7) |
Then the constant 0 of U is in S. Indeed, let x∈S. By (1) and (7), we have 0=x∗x∈S.
Definition 1.5. [8,10,11,32] A nonempty subset S of a UP-algebra U=(U,∗,0) is said to be
(1) a UP-subalgebra of U if it fulfills the following assertion:
(for all x,y∈S)(x∗y∈S), |
(2) a near UP-filter of U if it fulfills the assertion (7),
(3) a UP-filter of U if it fulfills the following assertions:
the constant0ofUis inS,(for all x,y∈U)(x∗y∈S,x∈S⇒y∈S), | (8) |
(4) a UP-ideal of U if it fulfills the assertion (8) and the following assertion:
(for all x,y,z∈U)(x∗(y∗z)∈S,y∈S⇒x∗z∈S), |
(5) a strong UP-ideal of U if it fulfills the assertion (8) and the following assertion:
(for all x,y,z∈U)((z∗y)∗(z∗x)∈S,y∈S⇒x∈S). |
Guntasow et al. [8] and Iampan [10] proved that the concept of UP-subalgebras is a generalization of near UP-filters, near UP-filters is a generalization of UP-filters, UP-filters is a generalization of UP-ideals, and UP-ideals is a generalization of strong UP-ideals. Furthermore, they proved that the only strong UP-ideal of a UP-algebra U is U.
Definition 1.6. [35] A fuzzy set F in a nonempty set U (or a fuzzy subset of U) is described by its membership function fF. To every point x∈U, this function associates a real number fF(x) in the closed interval [0,1]. The real number fF(x) is interpreted for the point as a degree of membership of an object x∈U to the fuzzy set F, that is, F:={(x,fF(x))∣x∈U}. We say that a fuzzy set F in U is constant if its membership function fF is constant.
Definition 1.7. [35] Let F be a fuzzy set in a nonempty set U. The complement of F, denoted by ˜F, is described by its membership function f˜F which defined as follows:
(for all x∈U)(f˜F(x)=1−fF(x)). |
The following two propositions are easy to verify.
Proposition 1.8. Let F be a fuzzy set in a nonempty set U. Then following assertions are valid:
(1) (for allx,y∈U)(fF(x)≤fF(y)⇔f˜F(x)≥f˜F(y)),
(2) (for allx,y∈U)(fF(x)=fF(y)⇔f˜F(x)=f˜F(y)),
(3) ˜˜F=F, and
(4) (for allx,y∈U)(1−min{fF(x),fF(y)}=max{f˜F(x),f˜F(y)}).
Proposition 1.9. Let {Fi}i∈I be a nonempty family of fuzzy sets in a nonempty set U, where I is an arbitrary index set. Then following assertions are valid:
(1) (for allx,y∈U)(infi∈I{min{fFi(x),fFi(y)}}=min{infi∈I{fFi(x)},infi∈I{fFi(y)}}),
(2) (for allx,y∈U)(supi∈I{max{fFi(x),fFi(y)}}=max{supi∈I{fFi(x)},supi∈I{fFi(y)}}),
(3) (for allx,y∈U)(infi∈I{max{fFi(x),fFi(y)}}≥max{infi∈I{fFi(x)},infi∈I{fFi(y)}}),
(4) (for allx,y∈U)(supi∈I{min{fFi(x),fFi(y)}}≤min{supi∈I{fFi(x)},supi∈I{fFi(y)}}),
(5) (for allx∈U)((supi∈I{fFi(x)})2=supi∈I{fFi(x)2}),
(6) (for allx∈U)((infi∈I{fFi(x)})2=infi∈I{fFi(x)2}),
(7) (for allx∈U)(1−supi∈I{fFi(x)}=infi∈I{1−fFi(x)}), and
(8) (for allx∈U)(1−infi∈I{fFi(x)}=supi∈I{1−fFi(x)}).
For a fuzzy set F in a UP-algebra U=(U,∗,0) which fulfills the following assertion:
(for all x,y∈U)(fF(x∗y)≥fF(y)). | (9) |
Then
(for all x∈U)(fF(0)≥fF(x)). |
Indeed, let x∈U. By (1) and (9), we have fF(0)=fF(x∗x)≥fF(x).
Definition 1.10. [8,26,32] A fuzzy set F in a UP-algebra U=(U,∗,0) is said to be
(1) a fuzzy UP-subalgebra of U if it fulfills the following assertion:
(for all x,y∈U)(fF(x∗y)≥min{fF(x),fF(y)}), | (10) |
(2) a fuzzy near UP-filter of U if it fulfills the assertion (9),
(3) a fuzzy UP-filter of U if it fulfills the following assertions:
(for all x∈U)(fF(0)≥fF(x)), | (11) |
(for all x,y∈U)(fF(y)≥min{fF(x∗y),fF(x)}), | (12) |
(4) a fuzzy UP-ideal of U if it fulfills the assertion (11) and the following assertion:
(for all x,y,z∈U)(fF(x∗z)≥min{fF(x∗(y∗z)),fF(y)}), | (13) |
(5) a fuzzy strong UP-ideal of U if it fulfills the assertion (11) and the following assertion:
(for all x,y,z∈U)(fF(x)≥min{fF((z∗y)∗(z∗x)),fF(y)}). | (14) |
Guntasow et al. [8], and Satirad and Iampan [26] proved that the concept of fuzzy UP-subalgebras is a generalization of fuzzy near UP-filters, fuzzy near UP-filters is a generalization of fuzzy UP-filters, fuzzy UP-filters is a generalization of fuzzy UP-ideals, and fuzzy UP-ideals is a generalization of fuzzy strong UP-ideals. Furthermore, they proved that fuzzy strong UP-ideals and constant fuzzy sets coincide in a UP-algebras U.
In 2013, Yager [33] and Yager and Abbasov [34] introduced the concept of Pythagorean fuzzy sets for the first time.
Definition 2.1. [33,34] A Pythagorean fuzzy set P in a nonempty set U is described by their membership function μP and non-membership function νP. To every point x∈U, these functions associate real numbers μP(x) and νP(x) in the closed interval [0,1], with the following assertion:
(for all x∈U)(0≤μP(x)2+νP(x)2≤1). |
The real numbers μP(x) and νP(x) are interpreted for the point as a degree of membership and non-membership of an object x∈U, respectively, to the Pythagorean fuzzy set P, that is, P:={(x,μP(x),νP(x))∣x∈U}. For the sake of simplicity, a Pythagorean fuzzy set P is denoted by P=(μP,νP). We say that a Pythagorean fuzzy set P in U is constant if their membership function μP and non-membership function νP are constant.
We apply the concept of Pythagorean fuzzy sets to UP-algebras and introduce the five types of Pythagorean fuzzy sets in UP-algebras.
Definition 2.2. A Pythagorean fuzzy set P=(μP,νP) in a UP-algebra U=(U,∗,0) is said to be
(1) a Pythagorean fuzzy UP-subalgebra of U if it fulfills the following assertions:
(for all x,y∈U)(μP(x∗y)≥min{μP(x),μP(y)}), | (15) |
(for all x,y∈U)(νP(x∗y)≤max{νP(x),νP(y)}), | (16) |
(2) a Pythagorean fuzzy near UP-filter of U if it fulfills the following assertions:
(for all x,y∈U)(μP(x∗y)≥μP(y)), | (17) |
(for all x,y∈U)(νP(x∗y)≤νP(y)), | (18) |
(3) a Pythagorean fuzzy UP-filter of U if it fulfills the following assertions:
(for all x∈U)(μP(0)≥μP(x)), | (19) |
(for all x∈U)(νP(0)≤νP(x)), | (20) |
(for all x,y∈U)(μP(y)≥min{μP(x∗y),μP(x)}), | (21) |
(for all x,y∈U)(νP(y)≤max{νP(x∗y),νP(x)}), | (22) |
(4) a Pythagorean fuzzy UP-ideal of U if it fulfills the assertions (19) and (20) and the following assertions:
(for all x,y,z∈U)(μP(x∗z)≥min{μP(x∗(y∗z)),μP(y)}), | (23) |
(for all x,y,z∈U)(νP(x∗z)≤max{νP(x∗(y∗z)),νP(y)}), | (24) |
(5) a Pythagorean strong fuzzy UP-ideal of U if it fulfills the assertions (19) and (20) and the following assertions:
(for all x,y,z∈U)(μP(x)≥min{μP((z∗y)∗(z∗x)),μP(y)}), | (25) |
(for all x,y,z∈U)(νP(x)≤max{νP((z∗y)∗(z∗x)),νP(y)}). | (26) |
From now on, we shall let U be a UP-algebra U=(U,∗,0).
Theorem 2.3. A Pythagorean fuzzy set in U is a Pythagorean fuzzy strong UP ideal if and only if it is constant.
Proof. Assume that P=(μP,νP) is a Pythagorean fuzzy strong UP ideal of U. Then it fulfills (19) and (20). Thus for all x∈U,
μP(x)≥min{μP((x∗0)∗(x∗x)),μP(0)}by (25)=min{μP(0∗(x∗x)),μP(0)}by (UP-3)=min{μP(x∗x),μP(0)}by (UP-2)=min{μP(0),μP(0)}by (1)=μP(0) |
and
νP(x)≤max{νP((x∗0)∗(x∗x)),νP(0)}by (26)=max{νP(0∗(x∗x)),νP(0)}by (UP-3)=max{νP(x∗x),νP(0)}by (UP-2)=max{νP(0),νP(0)}by (1)=νP(0). |
Since μP(0)≥μP(x) and νP(0)≤νP(x), we have μP(x)=μP(0) and νP(x)=νP(0) for all x∈U. Hence, μP and νP are constant, that is, P is constant.
The converse is evident because P is constant.
Theorem 2.4. Every Pythagorean fuzzy near UP-filter of U is a Pythagorean fuzzy UP-subalgebra.
Proof. Let P=(μP,νP) be a Pythagorean fuzzy near UP-filter of U. Then for all x,y∈U,
μP(x∗y)≥μP(y)by (17)≥min{μP(x),μP(y)} |
and
νP(x∗y)≤νP(y)by (18)≤max{νP(x),νP(y)}. |
Therefore, P is a Pythagorean fuzzy UP-subalgebra of U.
The converse of Theorem 2.4 does not hold in general. This is shown by the following example.
Example 2.5. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100132000330110 |
We define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.90.70.80.5νP00.40.10.6 |
Then P is a Pythagorean fuzzy UP-subalgebra of U. Since μP(3∗2)=μP(1)=0.7≱0.8=μP(2), we have P is not a Pythagorean fuzzy near UP-filter of U.
Theorem 2.6. Every Pythagorean fuzzy UP-filter of U is a Pythagorean fuzzy near UP-filter.
Proof. Let P=(μP,νP) be a Pythagorean fuzzy UP-filter of U. Then for all x,y∈U,
μP(x∗y)≥min{μP(y∗(x∗y)),μP(y)}=min{μP(0),μP(y)}by (21), (4)=μP(y) |
and
νP(x∗y)≤max{νPν(y∗(x∗y)),νP(y)}=max{νP(0),νP(y)}by (22), (4)=νP(y). |
Therefore, P is a Pythagorean fuzzy near UP-filter of U.
The converse of Theorem 2.6 does not hold in general. This is shown by the following example.
Example 2.7. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100232000330000 |
We define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP10.70.80.75νP00.60.30.4 |
Then P is a Pythagorean fuzzy near UP-filter of U. Since μP(1)=0.7≱0.75=min{1,0.75}=min{μP(0),μP(3)}=min{μP(3∗1),μP(3)}, we have P is not a Pythagorean fuzzy UP-filter of U.
Theorem 2.8. Every Pythagorean fuzzy UP-ideal of U is a Pythagorean fuzzy UP-filter.
Proof. Let P=(μP,νP) be a Pythagorean fuzzy UP-ideal of U. It is sufficient to prove the assertions (21) and (22). Then for all x,y∈U,
μP(y)=μP(0∗y)≥min{μP(0∗(x∗y)),μP(x)}=min{μP(x∗y),μP(x)}by (UP-2), (23) |
and
νP(y)=νP(0∗y)≤max{νP(0∗(x∗y)),νP(x)}=max{νP(x∗y),νP(x)}.by (UP-2), (24) |
Therefore, P is a Pythagorean fuzzy UP-filter of U.
The converse of Theorem 2.8 does not hold in general. This is shown by the following example.
Example 2.9. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100222010230100 |
We define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.90.50.20.2νP0.10.40.50.5 |
Then P is a Pythagorean fuzzy UP-filter of U. Since μP(2∗3)=μP(2)=0.2≱0.5=min{0.9,0.5}=min{μP(0),μP(1)}=min{μP(2∗(1∗3)),μP(1)}, we have P is not a Pythagorean fuzzy UP-ideal of U.
Theorem 2.10. Every Pythagorean fuzzy strong UP-ideal of U is a Pythagorean fuzzy UP-ideal.
Proof. Let P=(μP,νP) be a Pythagorean fuzzy strong UP-ideal of U. By Theorem 2.3, we have P is constant. Therefore, it is evident that P is a Pythagorean fuzzy UP-ideal of U.
The converse of Theorem 2.10 does not hold in general. This is shown by the following example.
Example 2.11. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100232010330120 |
We define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP10.50.20.7νP00.60.80.4 |
Then P is a Pythagorean fuzzy UP-ideal of U. But P is not constant and by Theorem 2.3, we have P is not a Pythagorean fuzzy strong UP-ideal of U.
Theorem 2.12. Let F be a fuzzy set in U. Then the following statements hold:
(1) (fF,f˜F) is a Pythagorean fuzzy set in U,
(2) F is a fuzzy UP-subalgebra of U if and only if (fF,f˜F) is a Pythagorean fuzzy UP-subalgebra of U,
(3) F is a fuzzy near UP-filter of U if and only if (fF,f˜F) is a Pythagorean fuzzy near UP-filter of U,
(4) F is a fuzzy UP-filter of U if and only if (fF,f˜F) is a Pythagorean fuzzy UP-filter of U,
(5) F is a fuzzy UP-ideal of U if and only if (fF,f˜F) is a Pythagorean fuzzy UP-ideal of U, and
(6) F is a fuzzy strong UP-ideal of U if and only if (fF,f˜F) is a Pythagorean fuzzy strong UP-ideal of U.
Proof. (1) Let x∈U. Then 0≤fF(x)2+f˜F(x)2=fF(x)2+(1−fF(x))2≤fF(x)+(1−fF(x))=1. Hence, (fF,f˜F) is a Pythagorean fuzzy set in U.
(2) Assume that F is a fuzzy UP-subalgebra of U. Then for all x,y∈U,
fF(x∗y)≥min{fF(x),fF(y)}by (10) |
and
f˜F(x∗y)=1−fF(x∗y)≤1−min{fF(x),fF(y)}=max{f˜F(x),f˜F(y)}.by Proposition 1.8 (4), (10) |
This implies that (fF,f˜F) is a Pythagorean fuzzy UP-subalgebra of U.
Conversely, assume that (fF,f˜F) is a Pythagorean fuzzy UP-subalgebra of U. Then F fulfills the assertion (15). Hence, F is a fuzzy UP-subalgebra of U.
(3) Assume that F is a fuzzy near UP-filter of U. Then for all x,y∈U,
fF(x∗y)≥fF(y)by (9) |
and
f˜F(x∗y)≤f˜F(y).by Proposition 1.8 (1) |
This implies that (fF,f˜F) is a Pythagorean fuzzy near UP-filter of U.
Conversely, assume that (fF,f˜F) is a Pythagorean fuzzy near UP-filter of U. Then F fulfills the assertion (17). Hence, F is a fuzzy near UP-filter of U.
(4) Assume that F is a fuzzy UP-filter of U. Then for all x,y∈U,
fF(0)≥fF(x),by (11)f˜F(0)≤f˜F(x),by Proposition 1.8 (1)fF(y)≥min{fF(x∗y),fF(x)},by (12) |
and
f˜F(y)=1−fF(y)≤1−min{fF(x∗y),fF(x)}=max{f˜F(x∗y),f˜F(x)}.by (12), Proposition 1.8 (4) |
This implies that (fF,f˜F) is a Pythagorean fuzzy UP-filter of U.
Conversely, assume that (fF,f˜F) is a Pythagorean fuzzy UP-filter of U. Then F fulfills the assertions (19) and (21). Hence, F is a fuzzy UP-filter of U.
(5) Assume that F is a fuzzy UP-ideal of U. Then for all x,y∈U,
fF(0)≥fF(x),by (11)f˜F(0)≤f˜F(x),by Proposition 1.8 (1)fF(x∗z)≥min{fF(x∗(y∗z)),fF(y)},by (13) |
and
f˜F(x∗z)=1−fF(x∗z)≤1−min{fF(x∗(y∗z)),fF(y)}=max{f˜F(x∗(y∗z)),f˜F(y)}.by (13), Proposition 1.8 (4) |
This implies that (fF,f˜F) is a Pythagorean fuzzy UP-ideal of U.
Conversely, assume that (fF,f˜F) is a Pythagorean fuzzy UP-ideal of U. Then F fulfills the assertions (19) and (23). Hence, F is a fuzzy UP-ideal of U.
(6) Assume that F is a fuzzy strong UP-ideal of U. Then fF is constant and so f˜F is constant. By Theorem 2.3, we have (fF,f˜F) is a Pythagorean fuzzy strong UP-ideal of U.
Conversely, assume that (fF,f˜F) is a Pythagorean fuzzy strong UP-ideal of U. By Theorem 2.3, we have fF is constant. Hence, F is a fuzzy strong UP-ideal of U.
In this section, we shall find some properties and examples for study the generalizations of Pythagorean fuzzy sets in UP-algebras.
Proposition 3.1. If P=(μP,νP) is a Pythagorean fuzzy UP-subalgebra of U, then it fulfills the assertions (19) and (20).
Proof. Let P=(μP,νP) be a Pythagorean fuzzy UP-subalgebra of U. Then for all x∈U,
μP(0)=μP(x∗x)≥min{μP(x),μP(x)}=μP(x)by (1) and (15) |
and
νP(0)=νP(x∗x)≤max{νP(x),νP(x)}=νP(x).by (1) and (16) |
Hence, P fulfills the assertions (19) and (20).
Proposition 3.2. If P=(μP,νP) is a Pythagorean fuzzy UP-filter of U, then
(for allx,y∈U)(x≤y⇒μP(x)≤μP(y)), | (27) |
(for allx,y∈U)(x≤y⇒νP(x)≥νP(y)). | (28) |
Proof. Let P=(μP,νP) be a Pythagorean fuzzy UP-filter of U and let x,y∈U be such that x≤y. Then x∗y=0, so
μP(y)≥min{μP(x∗y),μP(x)}=min{μP(0),μP(x)}=μP(x)by (21) |
and
νP(y)≤max{νP(x∗y),νP(x)}=max{νP(0),νP(x)}=νP(x).by (22) |
Hence, P fulfills the assertions (27) and (28).
Corollary 3.3. If P=(μP,νP) is a Pythagorean fuzzy UP-filter of U, then
(for allx,y∈U)(μP(y)≤μP(x∗y)),(for allx,y∈U)(νP(y)≥νP(x∗y)). |
Proof. By (4), we have y∗(x∗y)=0, that is, y≤x∗y. By (27) and (28), we have μP(y)≤μP(x∗y) and νP(y)≥νP(x∗y). Hence, P fulfills the assertions (3.3) and (3.3).
Proposition 3.4. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the following assertions:
(for allx,y,z∈U)(z≤x⇒μP(x∗y)≥min{μP(z),μP(y)}), | (29) |
(for allx,y,z∈U)(z≤x⇒νP(x∗y)≤max{νP(z),νP(y)}), | (30) |
then it is a Pythagorean fuzzy UP-subalgebra of U.
Proof. Let x,y∈U. By (1), we have x≤x. It follows from (29) and (30) that μP(x∗y)≥min{μP(x),μP(y)} and νP(x∗y)≤max{νP(x),νP(y)}. Hence, P is a Pythagorean fuzzy UP-subalgebra of U.
Theorem 3.5. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (29) and (30), then it fulfills the assertions (19) and (20).
Proof. It is straightforward by Proposition 3.4.
In general, the converse of Theorem 3.5 may be not true by the following example.
Example 3.6. From Example 2.9, we define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP10.50.10.7νP00.50.60.4 |
Then P fulfills the assertions (19) and (20) but it does not satisfy the assertions (29) and (30). Indeed, 1≤1 but μP(1∗3)=μP(2)=0.1≱0.5=min{0.5,0.7}=min{μP(1),μP(3)} and νP(1∗3)=νP(2)=0.6≰0.5=max{0.5,0.4}=max{νP(1),νP(3)}.
Proposition 3.7. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the following assertions:
(for allx,y,z∈U)(μP(x∗y)≥min{μP(z),μP(y)}), | (31) |
(for allx,y,z∈U)(νP(x∗y)≤max{νP(z),νP(y)}), | (32) |
then it fulfills the assertions (29) and (30).
In general, the converse of Proposition 3.7 may be not true by the following example.
Example 3.8. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100332010030120 |
We define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.80.10.30.2νP0.40.90.60.8 |
Then P fulfills the assertions (29) and (30) but it does not satisfy the assertions (31) and (32). Indeed, μP(1∗2)=μP(3)=0.2≱0.3=min{0.8,0.3}=min{μP(0),μP(2)} and νP(1∗2)=νP(3)=0.8≰0.6=max{0.4,0.6}=max{νP(0),νP(2)}.
Proposition 3.9. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (27) and (28), then it is a Pythagorean fuzzy near UP-filter of U.
Proof. Let x,y∈U. By (4), we have y≤x∗y. It follows from (27) and (28) that μP(x∗y)≥μP(y) and νP(x∗y)≤νP(y). Hence, P is a Pythagorean fuzzy near UP-filter of U.
Theorem 3.10. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (27) and (28), then it fulfills the assertions (31) and (32).
Proof. Let x,y,z∈U. By (4), we have y≤x∗y. It follows from (27) and (28) that μP(x∗y)≥μP(y)≥min{μP(z),μP(y)} and νP(x∗y)≤νP(y)≤max{νP(z),νP(y)}. Hence, P fulfills the assertions (31) and (32).
In general, the converse of Theorem 3.10 may be not true by the following example.
Example 3.11. From Example 2.7, we define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.80.30.40.7νP0.20.70.50.4 |
Then P fulfills the assertions (31) and (32) but it does not satisfy the assertions (27) and (28). Indeed, 3≤1 but μP(3)=0.7≰0.3=μP(1) and νP(3)=0.4≱0.7=νP(1).
Theorem 3.12. If P=(μP,νP) is a Pythagorean fuzzy UP-subalgebra of U fulfilling the following assertions:
(for allx,y∈U)(x∗y≠0⇒μP(x)≥μP(y)), | (33) |
(for allx,y∈U)(x∗y≠0⇒νP(x)≤νP(y)), | (34) |
then it is a Pythagorean fuzzy near UP-filter of U.
Proof. Let x,y∈U.
Case 1: x∗y=0. By Proposition 3.1, we have μP(x∗y)=μP(0)≥μP(y) and νP(x∗y)=νP(0)≤νP(y).
Case 2: x∗y≠0. By (33) and (34), we have μP(x∗y)≥min{μP(x),μP(y)}=μP(y) and νP(x∗y)≤max{νP(x),νP(y)}=νP(y). Hence, P is a Pythagorean fuzzy near UP-filter of U.
Proposition 3.13. A Pythagorean fuzzy set P=(μP,νP) in U fulfills the following assertions:
(for allx,y,z∈U)(z≤x∗y⇒μP(y)≥min{μP(z),μP(x)}), | (35) |
(for allx,y,z∈U)(z≤x∗y⇒νP(y)≤max{νP(z),νP(x)}) | (36) |
if and only if it is a Pythagorean fuzzy UP-filter of U.
Proof. Let x∈U. By (UP-3), we have x≤x∗0. It follows from (35) and (36) that μP(0)≥min{μP(x),μP(x)}=μP(x) and νP(0)≤max{νP(x),νP(x)}=νP(x). Next, let x,y∈U. By (1), we have x∗y≤x∗y. It follows from (35) and (36) that μP(y)≥min{μP(x∗y),μP(x)} and νP(y)≤max{νP(x∗y),νP(x)}. Hence, P is a Pythagorean fuzzy UP-filter of U.
Conversely, let x,y,z∈U be such that z≤x∗y. Then z∗(x∗y)=0, so
μP(x∗y)≥min{μP(z∗(x∗y)),μP(z)}=min{μP(0),μP(z)}=μP(z)by (21) |
and
νP(x∗y)≤max{νP(z∗(x∗y)),νP(z)}=max{νP(0),νP(z)}=νP(z).by (22) |
Thus
μP(y)≥min{μP(x∗y),μP(x)}≥min{μP(z),μP(x)} |
and
νP(y)≤max{νP(x∗y),νP(x)}≤max{νP(z),νP(x)}. |
Hence, P fulfills the assertions (35) and (36).
Theorem 3.14. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (35) and (36), then it fulfills the assertions (27) and (28).
Proof. Let x,y∈U be such that x≤y. By (5), we have x≤x∗y. It follows from (35) and (36) that μP(y)≥min{μP(x),μP(x)}=μP(x) and νP(y)≤max{νP(x),νP(x)}=νP(x). Hence, P fulfills the assertions (27) and (28).
In general, the converse of Theorem 3.14 may be not true by the following example.
Example 3.15. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100222010130000 |
We define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.70.30.50.1νP0.30.70.50.8 |
Then P fulfills the assertions (27) and (28) but it does not satisfy the assertions (35) and (36). Indeed, 2≤1∗3 but μP(3)=0.1≱0.3=min{0.5,0.3}=min{μP(2),μP(1)} and νP(3)=0.8≰0.7=max{0.5,0.7}=max{νP(2),νP(1)}.
Theorem 3.16. If P=(μP,νP) is a Pythagorean fuzzy near UP-filter of U fulfilling the following assertions:
(for allx,y∈U)(μP(x∗y)=μP(y)), | (37) |
(for allx,y∈U)(νP(x∗y)=νP(y)), | (38) |
then it is a Pythagorean fuzzy UP-filter of U.
Proof. Let x,y∈U. By Theorem 2.4 and Proposition 3.1, we have P is a Pythagorean fuzzy UP-subalgebra of U which fulfills the assertions (19) and (20). By (37) and (38), we have μP(y)≥min{μP(y),μP(x)}=min{μP(x∗y),μP(x)} and νP(y)≤max{νP(y),νP(x)}=max{νP(x∗y),νP(x)}. Hence, P is a Pythagorean fuzzy UP-filter of U.
Proposition 3.17. A Pythagorean fuzzy set P=(μP,νP) in U fulfills the following assertions:
(for alla,x,y,z∈U)(a≤x∗(y∗z)⇒μP(x∗z)≥min{μP(a),μP(y)}), | (39) |
(for alla,x,y,z∈U)(a≤x∗(y∗z)⇒νP(x∗z)≤max{νP(a),νP(y)}) | (40) |
if and only if it is a Pythagorean fuzzy UP-ideal of U.
Proof. Let x∈U. By (UP-3), we have x≤x∗(x∗0). Then
μP(0)=μP(x∗0)≥min{μP(x),μP(x)}=μP(x)by (UP-3) and (39) |
and
νP(0)=νP(x∗0)≤max{νP(x),νP(x)}=νP(x).by (UP-3) and (40) |
Let x,y,z∈U. By (1), we have x∗(y∗z)≤x∗(y∗z). Then
μP(x∗z)≥min{μP(x∗(y∗z)),μP(y)}by (39) |
and
νP(x∗z)≤max{νP(x∗(y∗z)),νP(y)}.by (40) |
Hence, P is a Pythagorean fuzzy UP-ideal of U.
Conversely, let a,x,y,z∈U be such that a≤x∗(y∗z). By (27) and (28), we have μP(a)≤μP(x∗(y∗z)) and νP(a)≥νP(x∗(y∗z)). Thus
μP(x∗z)≥min{μP(x∗(y∗z)),μP(y)}≥min{μP(a),μP(y)}by (23) |
and
νP(x∗z)≤max{νP(x∗(y∗z)),νP(y)}≤max{νP(a),νP(y)}.by (24) |
Hence, P fulfills the assertions (39) and (40).
Proposition 3.18. If P=(μP,νP) is a Pythagorean fuzzy UP-ideal of U, then
(for alla,x,y,z∈U)(a≤x∗(y∗z)⇒μP(a∗z)≥min{μP(x),μP(y)}), | (41) |
(for alla,x,y,z∈U)(a≤x∗(y∗z)⇒νP(a∗z)≤max{νP(x),νP(y)}). | (42) |
Proof. Let a,x,y,z∈U such that a≤x∗(y∗z). Then a∗(x∗(y∗z))=0, so
μP(a∗(y∗z))≥min{μP(a∗(x∗(y∗z))),μP(x)}=min{μP(0),μP(x)}=μP(x)by (23) |
and
νP(a∗(y∗z))≤max{νP(a∗(x∗(y∗z))),νP(x)}=max{νP(0),νP(x)}=νP(x).by (24) |
Thus
μP(a∗z)≥min{μP(a∗(y∗z)),μP(y)}≥min{μP(x),μP(y)}by (23) |
and
νP(a∗z)≤max{νP(a∗(y∗z)),νP(y)}≤max{νP(x),νP(y)}.by (24) |
Hence, P fulfills the assertions (41) and (42).
Corollary 3.19. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (39) and (40), then it fulfills the assertions (41) and (42).
Proof. It is straightforward by Propositions 3.17 and 3.18.
Theorem 3.20. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (6), (41), and (42), then it fulfills the assertions (39) and (40).
Proof. Let a,x,y,z∈U be such that a≤x∗(y∗z). By (6), we have 0=a∗(x∗(y∗z))=x∗(a∗(y∗z)), that is, x≤a∗(y∗z). It follows from (41) and (42) that μP(x∗z)≥min{μP(a),μP(y)} and νP(x∗z)≤max{νP(a),νP(y)}. Hence, P fulfills the assertions (39) and (40).
Theorem 3.21. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (41) and (42), then it fulfills the assertions (35) and (36).
Proof. Let x,y,z∈U be such that z≤x∗y. By (1) and (2), we have 0=z∗z≤z∗(x∗y). By (UP-2), (41), and (42), we have μP(y)=μP(0∗y)≥min{μP(z),μP(x)} and νP(y)=νP(0∗y)≤max{νP(z),νP(x)}. Hence, P fulfills the assertions (35) and (36).
Corollary 3.22. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the assertions (39) and (40), then it fulfills the assertions (35) and (36).
Proof. It is straightforward by Corollary 3.19 and Theorem 3.21.
In general, the converse of Theorem 3.21 may be not true by the following example.
Example 3.23. From Example 3.8, we define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.70.30.20.2νP0.30.70.750.75 |
Then P fulfills the assertions (35) and (36) but it does not satisfy the assertions (41) and (42). Indeed, 3≤1∗(0∗2) but μP(3∗2)=μP(2)=0.2≱0.3=min{0.3,0.7}=min{μP(1),μP(0)} and νP(3∗2)=νP(2)=0.75≰0.7=max{0.7,0.3}=max{νP(1),νP(0)}.
The following example shows that Pythagorean fuzzy set in a UP-algebra which fulfills the assertions (39) and (40) is not constant.
Example 3.24. From Example 2.11, we define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP10.80.50.5νP00.30.60.6 |
Then P fulfills the assertions (39) and (40) but it is not constant.
Theorem 3.25. If P=(μP,νP) is a Pythagorean fuzzy UP-filter of U fulfilling the assertion (6), then it is a Pythagorean fuzzy UP-ideal of U.
Proof. Let P be a Pythagorean fuzzy UP-filter of U. Then for all x,y,z∈U,
μP(x∗z)≥min{μP(y∗(x∗z)),μP(y)}=min{μP(x∗(y∗z)),μP(y)}by (21) and (6) |
and
νP(x∗z)≤max{νP(y∗(x∗z)),νP(y)}=max{νP(x∗(y∗z)),νP(y)}.by (22) and (6) |
Hence, P is a Pythagorean fuzzy UP-ideal of U.
Proposition 3.26. A Pythagorean fuzzy set P=(μP,νP) in U fulfills the following assertions:
(for alla,x,y,z∈U)(a≤(z∗y)∗(z∗x)⇒μP(x)≥min{μP(a),μP(y)}), | (43) |
(for alla,x,y,z∈U)(a≤(z∗y)∗(z∗x)⇒νP(x)≤max{νP(a),νP(y)}) | (44) |
if and only if it is a Pythagorean fuzzy strong UP-ideal of U.
Proof. Let x∈U. By (UP-3), we have x≤0=x∗0=(0∗x)∗(0∗0). By (43) and (44), we have μP(0)≥min{μP(x),μP(x)}=μP(x) and νP(0)≤max{νP(x),νP(x)}=νP(x). Next, let x,y,z∈U. By (1), we have (z∗y)∗(z∗x)≤(z∗y)∗(z∗x). By (43) and (44), we have μP(x)≥min{μP((z∗y)∗(z∗x)),μP(y)} and νP(x)≤max{νP((z∗y)∗(z∗x)),νP(y)}. Hence, P is a Pythagorean fuzzy strong UP-ideal of U.
The converse is evident because P is constant by Theorem 2.3.
Theorem 3.27. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the following assertions:
(for allx,y,z∈U)(z≤x∗y⇒μP(z)≥min{μP(x),μP(y)}), | (45) |
(for allx,y,z∈U)(z≤x∗y⇒νP(z)≤max{νP(x),νP(y)}), | (46) |
then it fulfills the assertions (29) and (30).
Proof. Let x,y,z∈U be such that z≤x. By (3), we have x∗y≤z∗y. By (45) and (46), we have μP(x∗y)≥min{μP(z),μP(y)} and νP(x∗y)≤max{νP(z),νP(y)}. Hence, P fulfills the assertions (29) and (30).
Proposition 3.28. A Pythagorean fuzzy set P=(μP,νP) in U fulfills the assertions (45) and (46) if and only if it is a Pythagorean fuzzy strong UP-ideal of U.
Proof. Let x∈U. By (UP-3), we have x≤0=0∗0. By (45) and (46), we have μP(x)≥min{μP(0),μP(0)}=μP(0) and νP(x)≤max{νP(0),νP(0)}=νP(0). By Theorem 3.27, we have P fulfills (29) and (30). Thus P is a Pythagorean fuzzy UP-subalgebra of U by Proposition 3.4. It follows from Proposition 3.1 that μP(0)≥μP(x) and νP(0)≤νP(x), so μP(x)=μP(0) and νP(x)=νP(0) for all x∈U, that is, P is constant. By Theorem 2.3, we have P is a Pythagorean fuzzy strong UP-ideal of U.
The converse is evident because P is constant by Theorem 2.3.
Theorem 3.29. If P=(μP,νP) is a Pythagorean fuzzy set in U fulfilling the following assertions:
(for allx,y,z∈U)(z≤x∗y⇒μP(z)≥μP(y)), | (47) |
(for allx,y,z∈U)(z≤x∗y⇒νP(z)≤νP(y)), | (48) |
then it fulfills the assertions (29) and (30).
Proof. Let x,y,z∈U be such that z≤x. By (3), we have x∗y≤z∗y. It follows from (47) and (48) that μP(x∗y)≥μP(y)≥min{μP(z),μP(y)} and νP(x∗y)≤νP(y)≤max{νP(z),νP(y)}. Hence, P fulfills the assertions (29) and (30).
Proposition 3.30. A Pythagorean fuzzy set P=(μP,νP) in U fulfills the assertions (47) and (48) if and only if it is a Pythagorean fuzzy strong UP-ideal of U.
Proof. Let x∈U. By (UP-3), we have x≤0=0∗0. By (47) and (48), we have μP(x)≥μP(0) and νP(x)≤νP(0). By Theorem 3.27, we have P fulfills (29) and (30). Thus P is a Pythagorean fuzzy UP-subalgebra of U by Proposition 3.4. It follows from Proposition 3.1 that μP(0)≥μP(x) and νP(0)≤νP(x), so μP(x)=μP(0) and νP(x)=νP(0) for all x∈U, that is, P is constant. By Theorem 2.3, we have P is a Pythagorean fuzzy strong UP-ideal of U.
The converse is evident because P is constant by Theorem 2.3.
We get the diagram of the properties of Pythagorean fuzzy sets in UP-algebras, which is shown with Figure 1.
Let U be a set and ρ an equivalence relation on U. If x∈U, then the ρ-class of U is the set (x)ρ defined as follows:
(x)ρ={y∈U∣(x,y)∈ρ}. |
An equivalence relation ρ on a UP-algebra U=(U,∗,0) is said to be a congruence relation if
(for all x,y,z∈U)((x,y)∈ρ⇒(x∗z,y∗z)∈ρ,(z∗x,z∗y)∈ρ). |
Definition 4.1. For nonempty subsets A and B of a UP-algebra U=(U,∗,0), we denote
AB=A∗B={a∗b∣a∈Aandb∈B}. |
If ρ is a congruence on a UP-algebra U=(U,∗,0), then
(for all x,y∈U)((x)ρ(y)ρ⊆(x∗y)ρ).see [20] |
A congruence relation ρ on a UP-algebra U=(U,∗,0) is said to be complete if
(for all x,y∈U)((x)ρ(y)ρ=(x∗y)ρ). |
Example 4.2. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100232000130000 |
Let
ρ={(0,0),(1,1),(2,2),(3,3),(0,1),(1,0),(2,3),(3,2)}. |
Then ρ is a congruence relation on U. Thus
(0)ρ=(1)ρ={0,1},(2)ρ=(3)ρ={2,3}. |
We consider
{0,1}={0,1}{0,1}=(0)ρ(0)ρ=(0∗0)ρ=(0)ρ={0,1}, |
{0,1}={0,1}{0,1}=(0)ρ(1)ρ=(0∗1)ρ=(1)ρ={0,1}, |
{2.3}={0,1}{2,3}=(0)ρ(2)ρ=(0∗2)ρ=(2)ρ={2,3}, |
{2,3}={0,1}{2,3}=(0)ρ(3)ρ=(0∗3)ρ=(3)ρ={2,3}, |
{0,1}={0,1}{0,1}=(1)ρ(0)ρ=(1∗0)ρ=(0)ρ={0,1}, |
{0,1}={0,1}{0,1}=(1)ρ(1)ρ=(1∗1)ρ=(0)ρ={0,1}, |
{2.3}={0,1}{2,3}=(1)ρ(2)ρ=(1∗2)ρ=(2)ρ={2,3}, |
{2,3}={0,1}{2,3}=(1)ρ(3)ρ=(1∗3)ρ=(3)ρ={2,3}, |
{0,1}={2,3}{0,1}=(2)ρ(0)ρ=(2∗0)ρ=(0)ρ={0,1}, |
{0,1}={2,3}{0,1}=(2)ρ(1)ρ=(2∗1)ρ=(0)ρ={0,1}, |
{0,1}={2,3}{2,3}=(2)ρ(2)ρ=(2∗2)ρ=(0)ρ={0,1}, |
{0,1}={2,3}{2,3}=(2)ρ(3)ρ=(2∗3)ρ=(1)ρ={0,1}, |
{0,1}={2,3}{0,1}=(3)ρ(0)ρ=(3∗0)ρ=(0)ρ={0,1}, |
{0,1}={2,3}{0,1}=(3)ρ(1)ρ=(3∗1)ρ=(0)ρ={0,1}, |
{0,1}={2,3}{2,3}=(3)ρ(2)ρ=(3∗2)ρ=(0)ρ={0,1}, |
{0,1}={2,3}{2,3}=(3)ρ(3)ρ=(3∗3)ρ=(0)ρ={0,1}. |
Hence, ρ is a complete congruence relation on U.
Definition 4.3. Let ρ be an equivalence relation on a nonempty set U and P=(μP,νP) a Pythagorean fuzzy set in U. The upper approximation is defined by
ρ+(P)={(x,¯μP(x),¯νP(x))∣x∈U}, |
where ¯μP(x)=supa∈(x)ρ{μP(a)} and ¯νP(x)=infa∈(x)ρ{νP(a)}. The lower approximation is defined by
ρ−(P)={(x,μ_P(x),ν_P(x))∣x∈U}, |
where μ_P(x)=infa∈(x)ρ{μP(a)} and ν_P(x)=supa∈(x)ρ{νP(a)}.
Theorem 4.4. Let ρ be an equivalence relation on a nonempty set U and P=(μP,νP) a Pythagorean fuzzy set in U. Then the following statements hold:
(1) ρ+(P) is a Pythagorean fuzzy set in U, and
(2) ρ−(P) is a Pythagorean fuzzy set in U.
Proof. Let x∈U.
(1) We consider
0≤¯μP(x)2+¯νP(x)2=(supa∈(x)ρ{μP(a)})2+(infa∈(x)ρ{νP(a)})2=supa∈(x)ρ{μP(a)2}+infa∈(x)ρ{νP(a)2}by Proposition 1.9 (6)≤supa∈(x)ρ{μP(a)2}+infa∈(x)ρ{1−μP(a)2}=supa∈(x)ρ{μP(a)2}+1−supa∈(x)ρ{μP(a)2}by Proposition 1.9 (7)=1. |
This implies that 0≤¯μP(x)2+¯νP(x)2≤1. Therefore, ρ+(P) is a Pythagorean fuzzy set in U.
(2) The proof is similar to the proof of (1).
Lemma 4.5. If ρ is an equivalence relation on a nonempty set U and P=(μP,νP) a Pythagorean fuzzy set in U, then
(for allx,y∈U)(xρy⇒¯μP(x)=¯μP(y)), | (49) |
(for allx,y∈U)(xρy⇒¯νP(x)=¯νP(y)), | (50) |
(for allx,y∈U)(xρy⇒μ_P(x)=μ_P(y)),(for allx,y∈U)(xρy⇒ν_P(x)=ν_P(y)). | (51) |
Proof. Let x,y∈U be such that xρy. Then
¯μP(x)=supa∈(x)ρ{μP(a)}=supb∈(y)ρ{μP(b)}=¯μP(y),¯νP(x)=infa∈(x)ρ{νP(a)}=infb∈(y)ρ{νP(b)}=¯νP(y),μ_P(x)=infa∈(x)ρ{μP(a)}=infb∈(y)ρ{μP(b)}=μ_P(y),ν_P(x)=supa∈(x)ρ{νP(a)}=supb∈(y)ρ{νP(b)}=ν_P(y). |
We complete the proof.
Theorem 4.6. Let ρ be an congruence relation on a UP-algebra U=(U,∗,0) and P=(μP,νP) a Pythagorean fuzzy set in U. Then the following statements hold:
(1) if P is a Pythagorean fuzzy UP-subalgebra of U and ρ is complete, then ρ−(P) is a Pythagorean fuzzy UP-subalgebra of U,
(2) if P is a Pythagorean fuzzy near UP-filter of U and ρ is complete, then ρ−(P) is a Pythagorean fuzzy near UP-filter of U,
(3) if P is a Pythagorean fuzzy UP-filter of U and (0)ρ={0}, then ρ−(P) is a Pythagorean fuzzy UP-filter of U,
(4) if P is a Pythagorean fuzzy UP-ideal of U, (0)ρ={0}, and ρ is complete, then ρ−(P) is a Pythagorean fuzzy UP-ideal of U, and
(5) if P is a Pythagorean fuzzy strong UP-ideal of U, then ρ−(P) is a Pythagorean fuzzy strong UP-ideal of U.
Proof. (1) Assume that P is a Pythagorean fuzzy UP-subalgebra of U and ρ is complete. Then for all x,y∈U,
μ_P(x∗y)=infc∈(x∗y)ρ{μP(c)}=infc∈(x)ρ(y)ρ{μP(c)}=infa∗b∈(x)ρ(y)ρ{μP(a∗b)}≥infa∈(x)ρ,b∈(y)ρ{min{μP(a),μP(b)}}by (15)=min{infa∈(x)ρ{μP(a)},infb∈(y)ρ{μP(b)}}by Proposition 1.9 (1)=min{μ_P(x),μ_P(y)} |
and
ν_P(x∗y)=supc∈(x∗y)ρ{νP(c)}=supc∈(x)ρ(y)ρ{νP(c)}=supa∗b∈(x)ρ(y)ρ{νP(a∗b)}≤supa∈(x)ρ,b∈(y)ρ{max{νP(a),νP(b)}}by (16)=max{supa∈(x)ρ{νP(a)},supb∈(y)ρ{νP(b)}}by Proposition 1.9 (2)=max{ν_P(x),ν_P(y)}. |
Hence, ρ−(P) is a Pythagorean fuzzy UP-subalgebra of U.
(2) Assume that P is a Pythagorean fuzzy near UP-filter of U and ρ is complete. Then for all x,y∈U,
μ_P(x∗y)=infc∈(x∗y)ρ{μP(c)}=infc∈(x)ρ(y)ρ{μP(c)}=infa∗b∈(x)ρ(y)ρ{μP(a∗b)}≥infb∈(y)ρ{μP(b)}by (17)=μ_P(y) |
and
ν_P(x∗y)=supc∈(x∗y)ρ{νP(c)}=supc∈(x)ρ(y)ρ{νP(c)}=supa∗b∈(x)ρ(y)ρ{νP(a∗b)}≤supb∈(y)ρ{νP(b)}by (18)=ν_P(y). |
Hence, ρ−(P) is a Pythagorean fuzzy near UP-filter of U.
(3) Assume that P is a Pythagorean fuzzy UP-filter of U and (0)ρ={0}. Then for all x,y∈U,
μ_P(0)=infa∈(0)ρ{μP(a)}=μP(0)≥μP(b)≥infb∈(x)ρ{μP(b)}=μ_P(x), |
ν_P(0)=supa∈(0)ρ{νP(a)}=νP(0)≤νP(b)≤supb∈(x)ρ{νP(b)}=ν_P(x), |
μ_P(y)=infb∈(y)ρ{μP(b)}≥infa∗b∈(x)ρ(y)ρ,a∈(x)ρ{min{μP(a∗b),μP(a)}}by (21)≥infa∗b∈(x∗y)ρ,a∈(x)ρ{min{μP(a∗b),μP(a)}}=min{infa∗b∈(x∗y)ρ{μP(a∗b)},infa∈(x)ρ{μP(a)}}by Proposition 1.9 (1)=min{μ_P(x∗y),μ_P(x)}, |
and
ν_P(y)=supb∈(y)ρ{νP(b)}≤supa∗b∈(x)ρ(y)ρ,a∈(x)ρ{max{νP(a∗b),νP(a)}}by (22)≤supa∗b∈(x∗y)ρ,a∈(x)ρ{max{νP(a∗b),νP(a)}}=max{supa∗b∈(x∗y)ρ{νP(a∗b)},supa∈(x)ρ{νP(a)}}by Proposition 1.9 (2)=max{ν_P(x∗y),ν_P(x)}. |
Hence, ρ−(P) is a Pythagorean fuzzy UP-filter of U.
(4) Assume that P is a Pythagorean fuzzy UP-ideal of U, ρ is complete, and (0)ρ={0}. Then for all x,y,z∈U,
μ_P(0)=infa∈(0)ρ{μP(a)}=μP(0)≥μP(b)≥infb∈(x)ρ{μP(b)}=μ_P(x), |
ν_P(0)=supa∈(0)ρ{νP(a)}=νP(0)≤νP(b)≤supb∈(x)ρ{νP(b)}=ν_P(x), |
μ_P(x∗z)=infd∈(x∗z)ρ{μP(d)}=infd∈(x)ρ(z)ρ{μP(d)}=infa∗c∈(x)ρ(z)ρ{μP(a∗c)}≥infa∗(b∗c)∈(x)ρ((y)ρ(z)ρ),b∈(y)ρ{min{μP(a∗(b∗c)),μP(b)}}by (23)=infa∗(b∗c)∈(x∗(y∗z))ρ,b∈(y)ρ{min{μP(a∗(b∗c)),μP(b)}}=min{infa∗(b∗c)∈(x∗(y∗z))ρ{μP(a∗(b∗c))},infb∈(y)ρ{μP(b)}}by Proposition 1.9 (1)=min{μ_P(x∗(y∗z)),μ_P(y)}, |
and
ν_P(x∗z)=supd∈(x∗z)ρ{νP(d)}=supd∈(x)ρ(z)ρ{νP(d)}=supa∗c∈(x)ρ(z)ρ{νP(a∗c)}≤supa∗(b∗c)∈(x)ρ((y)ρ(z)ρ),b∈(y)ρ{max{νP(a∗(b∗c)),νP(b)}}by (24)=supa∗(b∗c)∈(x∗(y∗z))ρ,b∈(y)ρ{max{νP(a∗(b∗c)),νP(b)}}=max{supa∗(b∗c)∈(x∗(y∗z))ρ{νP(a∗(b∗c))},supb∈(y)ρ{νP(b)}}by Proposition 1.9 (2)=max{ν_P(x∗(y∗z)),ν_P(y)}. |
Hence, ρ−(P) is a Pythagorean fuzzy UP-ideal of U.
(5) Assume that P is a Pythagorean fuzzy strong UP-ideal of U. By Theorem 2.3, we have P is constant. Then for all x,y,z∈U,
μ_P(0)=infa∈(0)ρ{μP(a)}=infb∈(x)ρ{μP(b)}=μ_P(x), |
ν_P(0)=supa∈(0)ρ{νP(a)}=supb∈(x)ρ{νP(b)}=ν_P(x), |
μ_P(x)=infa∈(x)ρ{μP(a)}≥inf(c∗b)∗(c∗a)∈((z)ρ(y)ρ)((z)ρ(x)ρ),b∈(y)ρ{min{μP((c∗b)∗(c∗a)),μP(b)}}by (25)≥inf(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ,b∈(y)ρ{min{μP((c∗b)∗(c∗a)),μP(b)}}=min{inf(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ{μP((c∗b)∗(c∗a))},infb∈(y)ρ{μP(b)}}by Proposition 1.9 (1)=min{μ_P((z∗y)∗(z∗x)),μ_P(y)}, |
and
ν_P(x)=supa∈(x)ρ{νP(a)}≤sup(c∗b)∗(c∗a)∈((z)ρ(y)ρ)((z)ρ(x)ρ),b∈(y)ρ{max{νP((c∗b)∗(c∗a)),νP(b)}}by (26)≤sup(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ,b∈(y)ρ{max{νP((c∗b)∗(c∗a)),νP(b)}}=max{sup(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ{νP((c∗b)∗(c∗a))},supb∈(y)ρ{νP(b)}}by Proposition 1.9 (2)=max{ν_P((z∗y)∗(z∗x)),ν_P(y)}. |
Hence, ρ−(P) is a Pythagorean fuzzy strong UP-ideal of U.
The following example shows that Theorem 4.6 (3) may be not true if (0)ρ≠{0}.
Example 4.7. Let U={0,1,2,3} be a UP-algebra with a fixed element 0 and a binary operation ∗ defined by the following Cayley table:
∗012300123100202010330120 |
We define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.70.40.60.6νP0.20.60.30.3 |
Then P=(μP,νP) is a Pythagorean fuzzy UP-filter of U. Let
ρ={(0,0),(1,1),(2,2),(3,3),(0,1),(1,0),(0,3),(3,0)}. |
Then ρ is a congruence relation on U. Thus
(0)ρ=(1)ρ=(3)ρ={0,1,3},(2)ρ={2}. |
Since μ_P(0)=min{μP(0),μP(1),μP(3)}=min{0.7,0.4,0.6}=0.4≱0.6=μP(2)=μ_P(2) and ν_P(0)=max{νP(0),νP(1),νP(3)}=max{0.2,0.6,0.3}=0.6≰0.3=νP(2)=ν_P(2), we have ρ−(P) is not a Pythagorean fuzzy UP-filter of U.
The following example shows that Theorem 4.6 (4) may be not true if (0)ρ≠{0} and ρ is not complete.
Example 4.8. From Example 2.11, we define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP10.20.10.5νP00.60.90.4 |
Then P=(μP,νP) is a Pythagorean fuzzy UP-ideal of U. Let
ρ={(0,0),(1,1),(2,2),(3,3),(0,2),(2,0)}. |
Then ρ is a congruence relation on U. Thus
(0)ρ=(2)ρ={0,2},(1)ρ={1},(3)ρ={3}. |
Since μ_P(0)=min{μP(0),μP(2)}=min{1,0.1}=0.1≱0.2=μP(1)=μ_P(1) and ν_P(0)=max{νP(0),νP(2)}=max{0,0.9}=0.9≰0.6=νP(1)=ν_P(1), we have ρ−(P) is not a Pythagorean fuzzy UP-ideal of U.
Problem 4.9. Is the lower approximation ρ−(P) a Pythagorean fuzzy UP-ideal of U if P is a Pythagorean fuzzy UP-ideal, (0)ρ≠{0}, and ρ is complete?
Lemma 4.10. If ρ is an congruence relation on a UP-algebra U=(U,∗,0) and P=(μP,νP) a Pythagorean fuzzy UP-subalgebra of U, then the upper approximation ρ+(P) fulfills the following assertions:
(for allx∈U)(¯μP(0)≥¯μP(x)), | (52) |
(for allx∈U)(¯νP(0)≤¯νP(x)). | (53) |
Proof. Let x∈U. Then
¯μP(0)=supa∈(0)ρ{μP(a)}≥μP(0)≥supb∈(x)ρ{μP(b)}by (19)=¯μP(x) |
and
¯νP(0)=infa∈(0)ρ{νP(a)}≤νP(0)≤infb∈(x)ρ{νP(b)}by (20)=¯νP(x). |
Hence, ρ+(P) fulfills the assertions (52) and (53).
Theorem 4.11. Let ρ be an congruence relation on a UP-algebra U=(U,∗,0) and P=(μP,νP) a Pythagorean fuzzy set in U. Then the following statements hold:
(1) If P is a Pythagorean fuzzy UP-subalgebra of U, then ρ+(P) is a Pythagorean fuzzy UP-subalgebra of U,
(2) If P is a Pythagorean fuzzy near UP-filter of U, then ρ+(P) is a Pythagorean fuzzy near UP-filter of U, and
(3) If P is a Pythagorean fuzzy strong UP-ideal of U, then ρ+(P) is a Pythagorean fuzzy strong UP-ideal of U.
Proof. (1) Assume that P is a Pythagorean fuzzy UP-subalgebra of U. Then for all x,y∈U,
Case 1: x=y. Then
¯μP(x∗y)=¯μP(0)≥¯μP(x)by (1), (52)≥min{¯μP(x),¯μP(y)} |
and
¯νP(x∗y)=¯νP(0)≤¯νP(x)by (1), (53)≤max{¯νP(x),¯νP(y)}. |
Case 2: x≠y.
Case 2.1: x∗y=x or y. It is sufficient to assume that x∗y=x. Then
¯μP(x∗y)=¯μP(x)≥min{¯μP(x),¯μP(y)} |
and
¯νP(x∗y)=¯νP(x)≤max{¯νP(x),¯νP(y)}. |
Case 2.2: x∗y≠x and x∗y≠y. Assume that there exists z∈U be such that x∗y=z. If zρ0, then
¯μP(x∗y)=¯μP(z)=¯μP(0)≥min{¯μP(x),¯μP(y)}by (49) |
and
¯νP(x∗y)=¯νP(z)=¯νP(0)≤max{¯νP(x),¯νP(y)}by (50). |
If xρ0 or yρ0, it is sufficient to assume that xρ0. Since ρ is a congruence relation on U, we have xyρ0y, that is, zρy. Therefore,
¯μP(x∗y)=¯μP(z)=¯μP(y)by (49), (52)=min{¯μP(0),¯μP(y)}=min{¯μP(x),¯μP(y)} |
and
¯νP(x∗y)=¯νP(z)=¯νP(y)by (50), (53)=min{¯νP(0),¯νP(y)}=max{¯νP(x),¯νP(y)}. |
Hence, ρ+(P) is a Pythagorean fuzzy UP-subalgebra of U.
(2) Assume that P is a Pythagorean fuzzy near UP-filter of U. Then for all x,y∈U,
¯μP(x∗y)=supc∈(x∗y)ρ{μP(c)}≥supc∈(x)ρ(y)ρ{μP(c)}=supa∗b∈(x)ρ(y)ρ{μP(a∗b)}≥supb∈(y)ρ{μP(b)}by (17)=¯μP(y) |
and
¯νP(x∗y)=infc∈(x∗y)ρ{νP(c)}≤infc∈(x)ρ(y)ρ{νP(c)}=infa∗b∈(x)ρ(y)ρ{νP(a∗b)}≤infb∈(y)ρ{νP(b)}by (18)=¯νP(y). |
Hence, ρ+(P) is a Pythagorean fuzzy near UP-filter of U.
(3) Assume that P is a Pythagorean fuzzy strong UP-ideal of U. By Theorem 2.3, we have P is constant. Then for all x,y,z∈U,
¯μP(0)=supa∈(0)ρ{μP(a)}=supb∈(x)ρ{μP(b)}=¯μP(x), |
¯νP(0)=infa∈(0)ρ{νP(a)}=infb∈(x)ρ{νP(b)}=¯νP(x), |
¯μP(x)=supa∈(x)ρ{μP(a)}≥sup(c∗b)∗(c∗a)∈((z)ρ(y)ρ)((z)ρ(x)ρ),b∈(y)ρ{min{μP((c∗b)∗(c∗a)),μP(b)}}by (25)=sup(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ,b∈(y)ρ{min{μP((c∗b)∗(c∗a)),μP(b)}}=min{sup(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ{μP((c∗b)∗(c∗a))},supb∈(y)ρ{μP(b)}}by P is constant=min{¯μP((z∗y)∗(z∗x)),¯μP(y)}, |
and
¯νP(x)=infa∈(x)ρ{νP(a)}≤inf(c∗b)∗(c∗a)∈((z)ρ(y)ρ)((z)ρ(x)ρ),b∈(y)ρ{max{νP((c∗b)∗(c∗a)),νP(b)}}by (26)=inf(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ,b∈(y)ρ{max{νP((c∗b)∗(c∗a)),νP(b)}}=max{inf(c∗b)∗(c∗a)∈((z∗y)∗(z∗x))ρ{νP((c∗b)∗(c∗a))},infb∈(y)ρ{νP(b)}}by P is constant=max{¯νP((z∗y)∗(z∗x)),¯νP(y)}. |
Hence, ρ+(P) is a Pythagorean fuzzy strong UP-ideal of U.
The following example shows that if P is a Pythagorean fuzzy UP-filter of U, then the upper approximation ρ+(P) is not a Pythagorean fuzzy UP-filter in general.
Example 4.12. From Example 3.8, we define a Pythagorean fuzzy set P=(μP,νP) with μP and νP as follows:
U0123μP0.60.50.30.3νP0.30.40.70.7 |
Then P=(μP,νP) is a Pythagorean fuzzy UP-filter of U. Let
ρ={(0,0),(1,1),(2,2),(3,3),(3,0),(0,3)}. |
Then ρ is a congruence relation on U. Thus
(0)ρ=(3)ρ={0,3},(1)ρ={1},(2)ρ={2}. |
Since ¯μP(2)=μP(2)=0.3≱0.5=min{max{μP(0),μP(3)},μP(1)}}=min{¯μP(3),¯μP(1)}=min{¯μP(1∗2),¯μP(1)}. we have ρ+(P) is not a Pythagorean fuzzy UP-filter of U.
Problem 4.13. Is the upper approximation ρ+(P) a Pythagorean fuzzy UP-filter of U if P is a Pythagorean fuzzy UP-filter of U?
In this paper, we have introduced the concept of Pythagorean fuzzy sets in UP-algebras, and then we have introduced five types of Pythagorean fuzzy sets in UP-algebras, namely Pythagorean fuzzy UP-subalgebras, Pythagorean fuzzy near UP-filters, Pythagorean fuzzy UP-filters, Pythagorean fuzzy UP-ideals, and Pythagorean fuzzy strong UP-ideals. Further, we have discussed the relationship between some assertions of Pythagorean fuzzy sets and Pythagorean fuzzy UP-subalgebras (resp., Pythagorean fuzzy near UP-filters, Pythagorean fuzzy UP-filters, Pythagorean fuzzy UP-ideals, Pythagorean fuzzy strong UP-ideals) in UP-algebras and have studied upper and lower approximations of Pythagorean fuzzy sets. Hence, we get the diagram of generalization of Pythagorean fuzzy sets in UP-algebras, which is shown with Figure 2.
Some important topics for our future study of UP-algebras are as follows:
(1) to get more results in Pythagorean fuzzy sets,
(2) to define new types of Pythagorean fuzzy sets,
(3) to get more results and examples in upper approximation and lower approximation,
(4) to study the roughness of Pythagorean fuzzy sets, and
(5) to study the soft set theory of Pythagorean fuzzy sets.
This work was supported by the Unit of Excellence in Mathematics, University of Phayao.
The authors declare no conflict of interest.
[1] | M. A. Ansari, A. Haidar, A. N. A. Koam, On a graph associated to UP-algebras, Math. Comput. Appl., 23 (2018), 1–12. |
[2] | M. A. Ansari, A. N. A. Koam, A. Haider, Rough set theory applied to UP-algebras, Ital. J. Pure Appl. Math., 42 (2019), 388–402. |
[3] |
K. T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Set. Syst., 20 (1986), 87–96. doi: 10.1016/S0165-0114(86)80034-3
![]() |
[4] |
R. Chinram, A. Iampan, Codewords generated by UP-valued functions, AIMS Mathematics, 6 (2021), 4771–4785. doi: 10.3934/math.2021280
![]() |
[5] | R. Chinram, T. Panityakul, Rough Pythagorean fuzzy ideals in ternary semigroups, J. Math. Comput. Sci., 20 (2020), 303–312. |
[6] |
N. Dokkhamdang, A. Kesorn, A. Iampan, Generalized fuzzy sets in UP-algebras, Ann. Fuzzy Math. Inform., 16 (2018), 171–190. doi: 10.30948/afmi.2018.16.2.171
![]() |
[7] | W. A. Dudek, Y. B. Jun, H. S. Kim, Rough set theory applied to BCI-algebras, Quasigroups Relat. Syst., 9 (2002), 45–54. |
[8] |
T. Guntasow, S. Sajak, A. Jomkham, A. Iampan, Fuzzy translations of a fuzzy set in UP-algebras, J. Indones. Math. Soc., 23 (2017), 1–19. doi: 10.22342/jims.23.2.371.1-19
![]() |
[9] |
A. Hussain, T. Mahmood, M. I. Ali, Rough Pythagorean fuzzy ideals in semigroups, Comput. Appl. Math., 38 (2019), 1–15. doi: 10.1007/s40314-019-0767-y
![]() |
[10] | A. Iampan, Multipliers and near UP-filters of UP-algebras, Journal of Discrete Mathematical Sciences and Cryptography, 2019, 1–14. |
[11] | A. Iampan, A new branch of the logical algebra: UP-algebras, J. Algebra Relat. Top., 5 (2017), 35–54. |
[12] |
A. Iampan, Introducing fully UP-semigroups, Discuss. Math. Gen. Algebra Appl., 38 (2018), 297–306. doi: 10.7151/dmgaa.1290
![]() |
[13] |
A. Iampan, A. Satirad, M. Songsaeng, A note on UP-hyperalgebras, J. Algebr. Hyperstruct. Log. Algebr., 1 (2020), 77–95. doi: 10.29252/hatef.jahla.1.2.7
![]() |
[14] |
A. Iampan, M. Songsaeng, G. Muhiuddin, Fuzzy duplex UP-algebras, Eur. J. Pure Appl. Math., 13 (2020), 459–471. doi: 10.29020/nybg.ejpam.v13i3.3752
![]() |
[15] | Y. Imai, K. Iséki, On axiom systems of propositional calculi. XIV, Proc. Japan Acad., 42 (1966), 19–22. |
[16] | K. Iséki, An algebra related with a propositional calculus, Proc. Japan Acad., 42 (1966), 26–29. |
[17] | R. Jansi, K. Mohana, Bipolar Pythagorean fuzzy A-ideals of BCI-algebra, International Journal of Innovative Science, Engineering & Technology, 6 (2019), 2348–7968. |
[18] | Y. B. Jun, Roughness of ideals in BCK-algebras, Sci. Math. Japonica. Online, 7 (2002), 115–119. |
[19] | H. S. Kim, Y. H. Kim, On BE-algebras, Sci. Math. Japonica. Online, 2006 (2006), 1299–1302. |
[20] |
T. Klinseesook, S. Bukok, A. Iampan, Rough set theory applied to UP-algebras, Journal of Information and Optimization Sciences, 41 (2020), 705–722. doi: 10.1080/02522667.2018.1552511
![]() |
[21] | S. M. Mostafa, M. A. A. Naby, M. M. M. Yousef, Fuzzy ideals of KU-algebras, Int. Math. Forum, 63 (2011), 3139–3149. |
[22] |
Z. Pawlak, Rough sets, Internat. J. Comput. Inform. Sci., 11 (1982), 341–356. doi: 10.1007/BF01001956
![]() |
[23] | C. Prabpayak, U. Leerawat, On ideals and congruences in KU-algebras, Sci. Magna, 5 (2009), 54–57. |
[24] | A. Satirad, R. Chinram, A. Iampan, Four new cnocepts of extension of KU/UP-algebras, Missouri J. Math. Sci., 32 (2020), 138–157. |
[25] | A. Satirad, A. Iampan, Fuzzy sets in fully UP-semigroups, Ital. J. Pure Appl. Math., 42 (2019), 539–558. |
[26] |
A. Satirad, A. Iampan, Fuzzy soft sets over fully UP-semigroups, Eur. J. Pure Appl. Math., 12 (2019), 294–331. doi: 10.29020/nybg.ejpam.v12i2.3412
![]() |
[27] |
A. Satirad, A. Iampan, Topological UP-algebras, Discuss. Math. Gen. Algebra Appl., 39 (2019), 231–250. doi: 10.7151/dmgaa.1317
![]() |
[28] | A. Satirad, P. Mosrijai, A. Iampan, Formulas for finding UP-algebras, Int. J. Math. Comput. Sci., 14 (2019), 403–409. |
[29] | A. Satirad, P. Mosrijai, A. Iampan, Generalized power UP-algebras, Int. J. Math. Comput. Sci., 14 (2019), 17–25. |
[30] |
T. Senapati, Y. B. Jun, K. P. Shum, Cubic set structure applied in UP-algebras, Discrete Math. Algorithms Appl., 10 (2018), 1850049. doi: 10.1142/S1793830918500490
![]() |
[31] | T. Senapati, G. Muhiuddin, K. P. Shum, Representation of UP-algebras in interval-valued intuitionistic fuzzy environment, Ital. J. Pure Appl. Math., 38 (2017), 497-517. |
[32] | J. Somjanta, N. Thuekaew, P. Kumpeangkeaw, A. Iampan, Fuzzy sets in UP-algebras, Ann. Fuzzy Math. Inform., 12 (2016), 739–756. |
[33] | R. R. Yager, Pythagorean fuzzy subsets, 2013 Joint IFSA World Congress NAFIPS Annual Meeting (IFSA/NAFIPS), 2013, 57–61. |
[34] |
R. R. Yager, A. M. Abbasov, Pythagorean member grades, complex numbers, and decision making, Int. J. Intell. Syst., 28 (2013), 436–452. doi: 10.1002/int.21584
![]() |
[35] |
L. A. Zadeh, Fuzzy sets, Inform. Contr., 8 (1965), 338–353. doi: 10.1016/S0019-9958(65)90241-X
![]() |
1. | Rukchart Prasertpong, Roughness of soft sets and fuzzy sets in semigroups based on set-valued picture hesitant fuzzy relations, 2022, 7, 2473-6988, 2891, 10.3934/math.2022160 | |
2. | Harish Garg, Gia Sirbiladze, Zeeshan Ali, Tahir Mahmood, Hamy Mean Operators Based on Complex q-Rung Orthopair Fuzzy Setting and Their Application in Multi-Attribute Decision Making, 2021, 9, 2227-7390, 2312, 10.3390/math9182312 | |
3. | Muhammad Kamran, Rashad Ismail, Shahzaib Ashraf, Nadeem Salamat, Seyma Ozon Yildirim, Ismail Naci Cangul, Decision support algorithm under SV-neutrosophic hesitant fuzzy rough information with confidence level aggregation operators, 2023, 8, 2473-6988, 11973, 10.3934/math.2023605 | |
4. | Yixiong Feng, Kaiyue Cui, Zhaoxi Hong, Zhiwu Li, Weiyu Yan, Jianrong Tan, Disassembly Sequence Planning of Product Structure With an Improved QICA Considering Expert Consensus for Remanufacturing, 2023, 19, 1551-3203, 7201, 10.1109/TII.2022.3231922 |