*Article* **The n-Pythagorean Fuzzy Sets**

## **Anna Bryniarska**

Department of Computer Science, Opole University of Technology, Proszkowska 76, 45-758 Opole, Poland; a.bryniarska@po.edu.pl

Received: 16 September 2020; Accepted: 23 October 2020; Published: 26 October 2020

**Abstract:** The following paper presents deductive theories of n-Pythagorean fuzzy sets (n-PFS). N-PFS objects are a generalization of the intuitionistic fuzzy sets (IFSs) and the Yager Pythagorean fuzzy sets (PFSs). Until now, the values of membership and non-membership functions have been described on a one-to-one scale and a quadratic function scale. There is a symmetry between the values of this membership and non-membership functions. The scales of any power functions are used here in order to increase the scope of the decision-making problems. The theory of n-PFS introduces a conceptual apparatus analogous to the classic theory of Zadeh fuzzy sets, consistently striving to correctly define the n-PFS algebra.

**Keywords:** fuzzy set; n-Pythagorean; n-PFS algebra; triangular norms

## **1. Introduction**

Zadeh [1] introduced the fuzzy set idea, which generalizes the theory of classical sets. In fuzzy sets, there is a membership function *µ*, which assigns a number from the set [0, 1] to each element of the universe. This determines how much this element belongs to this universe, where 0 means no belonging and 1 means full belonging to the set that is under consideration. Other values between 0 and 1 mean the degree of belonging to this set. This membership function is defined to describe the degree of belonging of an element to some class. The membership function in the fuzzy sets replace the characteristic function that is used in crisp sets. Since the work of Zadeh, the fuzzy set theory has been used in different disciplines such as management sciences, engineering, mathematics, social sciences, statistics, signal processing, artificial intelligence, automata theory, and medical and life sciences.

Atanassov studied the intuitionistic fuzzy sets (IFSs) [2,3]. IFSs have values for two functions: the membership function *µ* and the non-membership function *v*. Additionally, there is a constraint 0 ≤ *µ* + *v* ≤ 1. This is a symmetric relationship between the values and the membership function. In order to create model for imprecise information, the model of Pythagorean fuzzy sets (PFSs) was proposed by Yager [4,5]. This model is different than the IFSs model because it uses the condition 0 ≤ *µ* <sup>2</sup> + *v* <sup>2</sup> <sup>≤</sup> 1. Moreover, there is also the Pythagorean fuzzy number (PFN) idea established by Zhang and Xu [6]. In decision-making problems, there are also applications of PFSs proposed by Garg [7,8].

The decision-making problems in the model of Pythagorean fuzzy sets will significantly increase the application range of solving these problems than in the model of intuitionistic fuzzy sets. It is because more pairs (*µ*, *v*) satisfy the condition 0 ≤ *µ* <sup>2</sup> + *v* <sup>2</sup> <sup>≤</sup> <sup>1</sup> than the condition <sup>0</sup> <sup>≤</sup> *<sup>µ</sup>* <sup>+</sup> *<sup>v</sup>* <sup>≤</sup> 1. Is there any other data scale in decision-making problems that will help to extend its applicability even further? Yes, with the condition 0 ≤ *µ <sup>n</sup>* + *v <sup>n</sup>* <sup>≤</sup> 1, for any natural number *<sup>n</sup>* <sup>&</sup>gt; 2.

In articles using local deduction regarding IFSs [3,9–12] and concerning PFSs [4,5,13–17], it was noted that there is a series of mathematical and logical inaccuracies. That is why the conceptual apparatus should be generalized and refined by formulating the deductive theory of n-Pythagorean fuzzy sets with the condition 0 ≤ *µ <sup>n</sup>* + *v <sup>n</sup>* <sup>≤</sup> 1, for any natural number *<sup>n</sup>*i0. The theory is presented below.

#### **2. Triangular Norms**

**Definition 1.** *The operation* •*<sup>t</sup>* : [0, 1] × [0, 1] → [0, 1] *is called a t-norm in the set* [0, 1]*, or a triangular norm, when it meets the following conditions (for any numbers x*, *y*, *z* ∈ [0, 1]*):*

*1. boundary conditions*

$$0 \bullet\_t y = 0,\\ y \bullet\_t 1 = y,\tag{1}$$

*2. monotonicity*

$$\text{If } \mathbf{x} \bullet\_t \mathbf{y} \le z \bullet\_t \mathbf{y}, \text{ when } \mathbf{x} \le z,\tag{2}$$

*3. commutativity*

$$\mathbf{x} \bullet\_{t} y = y \bullet\_{t} \mathbf{x},\tag{3}$$

*4. associativity*

$$\propto \bullet\_t \left( y \bullet\_t z \right) = \left( \mathbf{x} \bullet\_t y \right) \bullet\_t z,\tag{4}$$

Since there is sup{*t* ∈ [0, 1] : *x* •*<sup>t</sup> t* ≤ *y*}, there can be specified the operation →*<sup>t</sup>* : [0, 1] × [0, 1] → [0, 1], such that for any numbers *x*, *y* ∈ [0, 1]:

$$\mathbf{x} \to\_{l} y = \sup \{ t \in [0, 1] : \mathbf{x} \bullet\_{l} t \le y \}. \tag{5}$$

This operation is called *t-residuum* in the set [0, 1]. The operation •*<sup>s</sup>* : [0, 1] × [0, 1] → [0, 1], described by formula for any numbers *x*, *y* ∈ [0, 1]:

$$\propto \bullet\_s y = 1 - (1 - x) \bullet\_t (1 - y),\tag{6}$$

is called a *s-norm* or *triangular conorm*.

Using the definitions of t-norm and s-norm, after simple calculations we get (where the names of conditions are given analogously to the definition of t-norm):

**Theorem 1.** *For any numbers x*, *y*, *z* ∈ [0, 1]*:*

• *boundary conditions*

$$0 \bullet\_s y = y,\\ y \bullet\_s 1 = 1,\tag{7}$$

• *monotonicity*

$$\propto \bullet\_s y \le z \bullet\_s y,\text{ when } \ge z,\tag{8}$$

• *commutativity*

$$\mathfrak{x}\bullet\_{\mathfrak{s}}\mathfrak{y} = \mathfrak{y}\bullet\_{\mathfrak{s}}\mathfrak{x} \tag{9}$$

• *associativity*

$$\propto \bullet\_{\rm s} \left( y \bullet\_{\rm s} z \right) = \left( \propto \bullet\_{\rm s} y \right) \bullet\_{\rm s} z \tag{10}$$

Further, only continuous t-norms and s-norms are considered. The general discussion on the construction of triangular norms, using the results of functional equations, leads to the theorem from paper [18]:

#### **Theorem 2.**

*1. There is a continuous and strictly decreasing function for each continuous t-norm f<sup>t</sup>* : [0, 1] → [0, +∞) *such that ft*(1) = 0, *ft*(0) = 1 *and for any x*, *y* ∈ [0, 1]*:*

$$\mathbf{x} \bullet\_{\mathbf{t}} \mathbf{y} = \begin{cases} f\_{\mathbf{t}}^{-1} [f\_{\mathbf{t}}(\mathbf{x}) + f\_{\mathbf{t}}(\mathbf{y})]\_{\prime} & f\_{\mathbf{t}}(\mathbf{x}) + f\_{\mathbf{t}}(\mathbf{y}) \in [\mathbf{0}, \mathbf{1}] \\ \mathbf{0}, & \text{otherwise.} \end{cases} \tag{11}$$

*2. There is a continuous and strictly increasing function for each continuous s-norm f<sup>s</sup>* : [0, 1] → [0, +∞) *such that fs*(0) = 0, *fs*(1) = 1 *and for any x*, *y* ∈ [0, 1]*:*

$$\mathbf{x} \bullet\_{s} y = \begin{cases} f\_{s}^{-1} [f\_{s}(\mathbf{x}) + f\_{s}(y)], & f\_{s}(\mathbf{x}) + f\_{s}(y) \in [0, 1] \\ 1, & \text{otherwise.} \end{cases} \tag{12}$$

*3. For any x* ∈ [0, 1]

$$f\_{\mathbf{s}}(\mathbf{x}) = f\_{\mathbf{t}}(\mathbf{1} - \mathbf{x}). \tag{13}$$

Functions *f<sup>t</sup>* , *f<sup>s</sup>* are called *generators* of t-norm and s-norm, respectively.

**Example 1.** *For the t-norm x* •*<sup>t</sup> y* = min{*x*, *y*} *and any x*, *y* ∈ [0, 1]*, the generator is ft*(*x*) = 1 − *x. For the s-norm x* •*<sup>s</sup> y* = max{*x*, *y*} *and any x*, *y* ∈ [0, 1]*, the generator is fs*(*x*) = *x.*

**Example 2.** *For the t-norm x* •*<sup>t</sup> y* = 1 − min{1,((1 − *x*) *<sup>p</sup>* + (<sup>1</sup> <sup>−</sup> *<sup>y</sup>*) *p* ) 1/*p*}, *<sup>p</sup>* <sup>≥</sup> <sup>1</sup> *and any <sup>x</sup>*, *<sup>y</sup>* <sup>∈</sup> [0, 1]*, the generator is ft*(*x*) = 1 − *x p .*

*For the s-norm x* •*<sup>s</sup> y* = min{1,(*x <sup>p</sup>* + *y p* ) 1/*p*}, *<sup>p</sup>* <sup>≥</sup> <sup>1</sup> *and any <sup>x</sup>*, *<sup>y</sup>* <sup>∈</sup> [0, 1]*, the generator is <sup>f</sup>s*(*x*) = *<sup>x</sup> p .*

**Theorem 3.** *Let f<sup>t</sup>* , *f<sup>s</sup> be generators of the triangular norms* •*<sup>t</sup>* , •*s . Then there exist operations* •*<sup>p</sup>* : [0, 1] × [0, 1] → [0, 1], •*<sup>l</sup>* : [0, 1] × [0, 1] → [0, 1] *defined by formulas:*

$$
\lambda \bullet\_p \ge \begin{cases}
f\_t^{-1}[\lambda f\_t(\mathbf{x})], & \text{for } \lambda f\_t(\mathbf{x}) \in [0, 1] \\
0, & \text{otherwise}.
\end{cases}
\tag{14}
$$

$$\lambda \bullet\_l \mathbf{x} = \begin{cases} f\_s^{-1}[\lambda f\_s(\mathbf{x})], & \text{for } \lambda f\_s(\mathbf{x}) \in [0, 1] \\ 1, & \text{otherwise.} \end{cases} \tag{15}$$

**Proof of Theorem 3.** Because *f<sup>t</sup>* is a strictly decreasing function, there is only one value *f* −1 *t* [*λ ft*(*x*)] ∈ [0, 1], when *λ ft*(*x*) ∈ [0, *fs*(0)].

It is noted that *λ* •*<sup>p</sup> x* =*d f f* −1 *t* [*λ ft*(*x*)], for *λ ft*(*x*) ∈ [0, *ft*(0)], and *λ* •*<sup>p</sup> x* =*d f* 0 otherwise. Similarly, we define the operation •*<sup>l</sup>* .

**Definition 2.** *Operations* •*p*, •*<sup>l</sup> specified in Theorem 3 are called p-norm (with properties similar to the power functions) and the l-norm (with properties similar to the linear function), respectively, and the system* **SYager** = h[0, 1], •*<sup>t</sup>* , •*s* , •*p*, •*<sup>l</sup>* , 0, 1i *is called the Yager system of the triangular norms.*

The following notation agreement is accepted:

$$
\lambda \bullet\_p \mathfrak{x} =\_{df} \mathfrak{x}^{\lambda},
\tag{16}
$$

$$
\lambda \bullet\_l \mathfrak{x} =\_{df} \lambda \mathfrak{x}.\tag{17}
$$

**Fact 1.** *If x<sup>λ</sup>* = *f* −1 *t* [*λ ft*(*x*)]*, for λ ft*(*x*) ∈ [0, *ft*(0)]*, then ft*(*x λ* ) = *λ ft*(*x*)*. If λx* = *f* −1 *s* [*λ fs*(*x*)]*, for λ fs*(*x*) ∈ [0, *fs*(1)]*, then fs*(*λx*) = *λ fs*(*x*)*.*

**Theorem 4.** *In the system* **SYager** = h[0, 1], •*<sup>t</sup>* , •*s* , •*p*, •*<sup>l</sup>* , 0, 1i *operations* •*p*, •*<sup>l</sup> satisfy the following conditions (for any x*, *y*, *λ*, *λ*1, *λ*<sup>2</sup> ∈ [0, 1]*):*

$$
\lambda(\mathfrak{x}\bullet\_{\mathfrak{s}}\mathfrak{y}) = \lambda\mathfrak{x}\bullet\_{\mathfrak{s}}\lambda\mathfrak{y},\tag{18}
$$

$$(\mathfrak{x}\bullet\_{t}\mathfrak{y})^{\lambda}=\mathfrak{x}^{\lambda}\bullet\_{t}\mathfrak{y}^{\lambda},\tag{19}$$

$$(\lambda\_1 + \lambda\_2)\mathfrak{x} = \lambda\_1 \mathfrak{x} \bullet\_{\mathfrak{s}} \lambda\_2 \mathfrak{x},\tag{20}$$

$$
\mathfrak{x}^{\lambda\_1 + \lambda\_2} = \mathfrak{x}^{\lambda\_1} \bullet\_t \mathfrak{x}^{\lambda\_2}.\tag{21}
$$

#### **Proof of Theorem 4.**


#### **3. n-Pythagorean Fuzzy Set and Yager Aggregation Operators**

**Definition 3.** *Let F be a set of all fuzzy sets for the nonempty space X. Any function p* : *X* → [0, 1] × [0, 1] *defined for any µp*, *v<sup>p</sup>* ∈ *F is:*

$$p = \{ \langle \mathbf{x}, \langle \mu\_p(\mathbf{x}), v\_p(\mathbf{x}) \rangle \rangle : \mathbf{x} \in X \}. \tag{22}$$

*It is called the n-Pythagorean fuzzy set (n-PFS) if the following condition is satisfied (for any natural number n* > 0 *):*

$$0 \le (\mu\_p(\mathbf{x}))^n + (v\_p(\mathbf{x}))^n \le 1,\text{ for any } \mathbf{x} \in \mathbf{X}.\tag{23}$$

Let **n-PFS** mean set of all n-PFS.

The fuzzy sets *µp*, *v<sup>p</sup>* indicate the membership and non-membership functions. Zhang and Xu [6] considered *p*(*x*) = h*µp*(*x*), *vp*(*x*)i as n-Pythagorean fuzzy number (n-PFN) represented by *p* = h*µp*, *vp*i. The notation is used:

$$\mathbf{n}\text{-FFN} =\_{df} \{ \langle \mu, v \rangle \in [0, 1] \times [0, 1] : 0 \le \mu^n + v^n \le 1 \}.\tag{24}$$

**Fact 2.**

$$\mathfrak{n}\text{-PFS} = \{p(\mathfrak{x}) : \mathfrak{x} \in \mathcal{X}, p \in \mathfrak{n}\text{-PFS}\}.\tag{25}$$

When *n* = 1, then the 1-Pythagorean fuzzy sets are the intuitionistic fuzzy sets (IFS), which were studied by Atanassow [2]. Moreover, when *n* = 2, then the 2-Pythagorean fuzzy sets are the PFS of Yager [4].

Simple arithmetic properties of inequalities 0 ≤ *µ <sup>n</sup>*+<sup>1</sup> + *v <sup>n</sup>*+<sup>1</sup> <sup>≤</sup> *<sup>µ</sup> <sup>n</sup>* + *v <sup>n</sup>* <sup>≤</sup> 1 result from:

**Theorem 5.** *For any natural number n* > 1

$$n\text{-PFN} \subseteq (n\text{-1})\text{-PFN} \subseteq [0,1] \times [0,1]. \tag{26}$$

Thus, entering a power scale for a value of the membership and non-membership functions allows to replace h*µ*, *v*i ∈ [0, 1] × [0, 1] such that *µ* + *v* > 1, by h*µ n* , *v n* i ∈ **1-PFN**, for some *n*. As a result, the aggregation operations on the *IFS* can be extended to the aggregation operations on the *n-PFS*.

**Theorem 6.** *In any system* **SYager** = h[0, 1], •*<sup>t</sup>* , •*s* , •*p*, •*<sup>l</sup>* , 0, 1i*, for any* h*µ*1, *v*1i,h*µ*2, *v*2i ∈ **1***-PFN and a number λ* ∈ [0, 1]*, the following conditions are satisfied:*

$$
\langle \mu\_1 \bullet\_s \mu\_2, v\_1 \bullet\_t v\_2 \rangle \in \mathbf{1} \text{-PFN},\tag{27}
$$

$$<\langle \mu\_1 \bullet\_t \mu\_2, v\_1 \bullet\_s v\_2 \rangle \in \mathbf{1} \text{-PFN},\tag{28}$$

*Furthermore, in some systems* **SYager** *(not in all - see Proof of Theorem 3,4 and Remark 1) there are additional conditions:*

$$
\langle \lambda \bullet\_{\mathsf{I}} \mu\_{1}, \lambda \bullet\_{\mathsf{p}} v\_{1} \rangle \in \mathbf{1} \text{-PFN}\_{\mathsf{I}} \tag{29}
$$

$$
\langle \lambda \bullet\_p \mu\_1 \,\mu\_1 \,\lambda \bullet\_l v\_1 \rangle \in \mathbf{1} \text{-PFN}.\tag{30}
$$

#### **Proof of Theorem 6.**

1. For Equation (27): h*µ*1, *v*1i,h*µ*2, *v*2i ∈ **1-PFN** iff *µ*<sup>1</sup> + *v*<sup>1</sup> ≤ 1, *µ*<sup>2</sup> + *v*<sup>2</sup> ≤ 1 if and only if *µ*<sup>1</sup> ≤ 1 − *v*1, *µ*<sup>2</sup> ≤ 1 − *v*2.

Hence and from the monotonicity of the s-norm and its determination by t-norm:

*µ*<sup>1</sup> •*<sup>s</sup> µ*<sup>2</sup> ≤ (1 − *v*1) •*<sup>s</sup>* (1 − *v*2) = 1 − (1 − (1 − *v*1) •*<sup>s</sup>* (1 − *v*2) = 1 − *v*<sup>1</sup> •*<sup>t</sup> v*<sup>2</sup> iff *µ*<sup>1</sup> •*<sup>s</sup> µ*<sup>2</sup> + *v*<sup>1</sup> •*<sup>t</sup> v*<sup>2</sup> ≤ 1 iff h*µ*<sup>1</sup> •*<sup>s</sup> µ*2, *v*<sup>1</sup> •*<sup>t</sup> v*2i ∈ **1-PFN**.


$$\begin{aligned} \langle \mu\_1 v\_1 \rangle &\in \mathbf{1} \mathbf{P} \mathbf{N} \text{ iff } \mu\_1 + v\_1 \le 1; \\ \lambda \bullet\_l \mu\_1 &= f\_s^{-1}[\lambda f\_s(\mu\_1)] = \lambda \mu\_1 \text{ and } \lambda \bullet\_p v\_1 = f\_s^{-1}[\lambda f\_s(v\_1)] = 1 - \lambda(1 - v\_1); \\ \lambda \bullet\_l \mu\_1 + \lambda \bullet\_p v\_1 &= \lambda \mu\_1 + 1 - \lambda(1 - v\_1) = 1 - \lambda + \lambda(\mu\_1 + v\_1); \\ \text{Since } \lambda(\mu\_1 + v\_1) &\le \lambda, \text{ so } 0 \le 1 - \lambda + \lambda(\mu\_1 + v\_1) \le 1. \end{aligned}$$

4. For Equation (30): let *µ* •*<sup>s</sup> v* = max{*µ*, *v*}, *µ* •*<sup>t</sup> v* = min{*µ*, *v*}, then *fs*(*x*) = *x*, *ft*(*x*) = 1˘*x*; h*µ*1, *v*1i ∈ **1-PFN** iff *µ*<sup>1</sup> + *v*<sup>1</sup> ≤ 1 iff h*v*1, *µ*1i ∈ **1-PFN**. Hence, and from point 3, there is h*λ* •*<sup>l</sup> v*1, *λ* •*<sup>p</sup> µ*1i ∈ **1-PFN**, which is equivalent to h*λ* •*<sup>p</sup> µ*1, *λ* •*<sup>l</sup> v*1i ∈ **1-PFN**.

$$\square$$

**Remark 1.** *Assuming generators of triangular norms from the Example 2 λ* •*<sup>l</sup> µ*<sup>1</sup> = *λ* 1/*pµ*1, *<sup>λ</sup>* •*<sup>p</sup> <sup>v</sup>*<sup>1</sup> <sup>=</sup> 1 − *λ* 1/*p* (1 − *v*1)*, for µ*<sup>1</sup> = 1/2, *v*<sup>1</sup> = 7/8, *λ* = 1/4 *and p* = 2*, it is obtained that* h*λ* •*<sup>l</sup> µ*1, *λ* •*<sup>p</sup> v*1i = h1/8, 15/16i ∈/ **1***-PFN*,(1 < 1/8 + 15/16)*.*

**Theorem 7.** *Let the system* **SYager** = h[0, 1], •*<sup>t</sup>* , •*<sup>s</sup>* , •*p*, •*<sup>l</sup>* , 0, 1i *conditions from Equations (27)–(30) of the Theorem 6 apply. Then, for any natural number n* > 1*, for any* h*µ*1, *v*1i,h*µ*2, *v*2i ∈ *n-PFN, and number λ* ∈ [0, 1] *the following conditions are satisfied:*

$$<\langle (\mu\_1^n \bullet\_s \mu\_2^n)^{1/n}, (v\_1^n \bullet\_t v\_2^n)^{1/n} \rangle \in \mathfrak{n} \text{-PFN},\tag{31}$$

$$<\langle (\mu\_1^n \bullet\_t \mu\_2^n)^{1/n}, (v\_1^n \bullet\_s v\_2^n)^{1/n} \rangle \in \mathfrak{n}\text{-PFN},\tag{32}$$

$$<\langle (\lambda \bullet\_l \mu\_1^n)^{1/n}, (\lambda \bullet\_p v\_1^n)^{1/n} \rangle \in \mathfrak{n} \text{-PFN},\tag{33}$$

$$<\langle (\lambda \bullet\_p \mu\_1^n)^{1/n}, (\lambda \bullet\_l v\_1^n)^{1/n} \rangle \in \mathfrak{n}\text{-PFN}.\tag{34}$$

#### **Proof of Theorem 7.**

$$
\langle \mu\_1, v\_1 \rangle, \langle \mu\_2, v\_2 \rangle \in \mathbf{n} \cdot \mathbf{FFN} \text{ iff } \langle \mu\_1^{\text{n}}, v\_1^{\text{n}} \rangle, \langle \mu\_2^{\text{n}}, v\_2^{\text{n}} \rangle \in \mathbf{1} \cdot \mathbf{FFN}.\tag{35}
$$

Then, the conditions of Theorem 6 are satisfied, which are equivalent to the above conditions (31)–(34).

**Definition 4.** *In the system* **SYager** = h[0, 1], •*<sup>t</sup>* , •*s* , •*p*, •*<sup>l</sup>* , 0, 1i*, the following aggregation operators are defined: the Yager operators on n-PFN: for any* h*µ*1, *v*1i,h*µ*2, *v*2i ∈ *n-PFN and number λ* ∈ [0, 1]*.*

*When conditions (27)–(30) of the Theorem 6 are satisfied:*

$$<\langle \mu\_1, v\_1 \rangle \oplus \langle \mu\_2, v\_2 \rangle = \langle (\mu\_1^n \bullet\_s \mu\_2^n)^{1/n}, (v\_1^n \bullet\_t v\_2^n)^{1/n} \rangle,\tag{36}$$

$$<\langle \mu\_1, \upsilon\_1 \rangle \oplus \langle \mu\_2, \upsilon\_2 \rangle = \langle (\mu\_1^n \bullet\_1 \mu\_2^n)^{1/n}, (\upsilon\_1^n \bullet\_s \upsilon\_2^n)^{1/n} \rangle,\tag{37}$$

$$
\langle \lambda \langle \mu\_1, v\_1 \rangle = \langle (\lambda \bullet\_{\mathfrak{l}} \mu\_1^n)^{1/n}, (\lambda \bullet\_{\mathfrak{p}} v\_1^n)^{1/n} \rangle,\tag{38}
$$

$$
\langle \mu\_1, v\_1 \rangle \lambda = \langle (\lambda \bullet\_p \mu\_1^n)^{1/n}, (\lambda \bullet\_l v\_1^n)^{1/n} \rangle. \tag{39}
$$

*when* h(*λ* •*<sup>l</sup> µ n* 1 ) 1/*n* ,(*λ* •*<sup>p</sup> v n* 1 ) 1/*n* i ∈/ *n-PFN, then:*

$$
\lambda \langle \mu\_1, v\_1 \rangle = \langle 1, 0 \rangle,\tag{40}
$$

*or when* h(*λ* •*<sup>p</sup> µ n* 1 ) 1/*n* ,(*λ* •*<sup>l</sup> v n* 1 ) 1/*n* i ∈/ *n-PFN, then:*

$$
\langle \mu\_1, v\_1 \rangle^{\lambda} = \langle 0, 1 \rangle. \tag{41}
$$

Hence, in any system **SYager** = h[0, 1], •*<sup>t</sup>* , •*s* , •*p*, •*<sup>l</sup>* , 0, 1i, using the Theorem 4, there is:

**Theorem 8.** *For any* h*µ*1, *v*1i,h*µ*2, *v*2i,h*µ*3, *v*3i ∈ *n-PFN and number λ* ∈ [0, 1]*:*

$$
\langle \mu\_1, \upsilon\_1 \rangle \oplus \langle 0, 1 \rangle = \langle \mu\_1, \upsilon\_1 \rangle,\\
\langle \mu\_1, \upsilon\_1 \rangle \oplus \langle 1, 0 \rangle = \langle 1, 0 \rangle,\tag{42}
$$

$$
\langle \mu\_1, v\_1 \rangle \oplus \langle \mu\_2, v\_2 \rangle = \langle \mu\_2, v\_2 \rangle \oplus \langle \mu\_1, v\_1 \rangle,\tag{43}
$$

$$(\langle \mu\_1, \upsilon\_1 \rangle \oplus \langle \mu\_2, \upsilon\_2 \rangle) \oplus \langle \mu\_3, \upsilon\_3 \rangle = \langle \mu\_1, \upsilon\_1 \rangle \oplus (\langle \mu\_2, \upsilon\_2 \rangle \oplus \langle \mu\_3, \upsilon\_3 \rangle),\tag{44}$$

$$
\langle \mu\_1, \upsilon\_1 \rangle \oplus \langle 1, 0 \rangle = \langle \mu\_1, \upsilon\_1 \rangle,\\
\langle \mu\_1, \upsilon\_1 \rangle \otimes \langle 0, 1 \rangle = \langle 0, 1 \rangle,\tag{45}
$$

$$<\langle \mu\_1, v\_1 \rangle \oplus \langle \mu\_2, v\_2 \rangle = \langle \mu\_2, v\_2 \rangle \oplus \langle \mu\_1, v\_1 \rangle,\tag{46}$$

$$(\langle \mu\_1, \upsilon\_1 \rangle \oplus \langle \mu\_2, \upsilon\_2 \rangle) \oplus \langle \mu\_3, \upsilon\_3 \rangle = \langle \mu\_1, \upsilon\_1 \rangle \oplus (\langle \mu\_2, \upsilon\_2 \rangle \oplus \langle \mu\_3, \upsilon\_3 \rangle),\tag{47}$$

$$
\lambda \langle \langle \mu\_1, \upsilon\_1 \rangle \oplus \langle \mu\_2, \upsilon\_2 \rangle \rangle = \lambda \langle \mu\_1, \upsilon\_1 \rangle \oplus \lambda \langle \mu\_2, \upsilon\_2 \rangle,\tag{48}
$$

$$(\langle \mu\_1, v\_1 \rangle \oplus \langle \mu\_2, v\_2 \rangle)^\lambda = \langle \mu\_1, v\_1 \rangle^\lambda \oplus \langle \mu\_2, v\_2 \rangle^\lambda,\tag{49}$$

$$
\langle \lambda\_1 + \lambda\_2 \rangle \langle \mu\_1, \upsilon\_1 \rangle = \lambda\_1 \langle \mu\_1, \upsilon\_1 \rangle \oplus \lambda\_2 \langle \mu\_1, \upsilon\_1 \rangle,\tag{50}
$$

$$
\langle \mu\_1, v\_1 \rangle^{\lambda\_1 + \lambda\_2} = \langle \mu\_1, v\_1 \rangle^{\lambda\_1} \oplus \langle \mu\_1, v\_1 \rangle^{\lambda\_2}.\tag{51}
$$

#### **4. Triangular Norms in the n-PFN and the n-PFS Algebra**

**Definition 5.** *For any* h*µ*1, *v*1i,h*µ*2, *v*2i ∈ *n-PFN:*

$$
\langle \mu\_1, v\_1 \rangle \le\_n \langle \mu\_2, v\_2 \rangle \text{ iff } \mu\_1 \le \mu\_2, v\_1 \ge v\_2. \tag{52}
$$

*The results of operations maximum and minimum for any A* ⊆ *n-PFN are described for the relation* ≤*<sup>n</sup> and are denoted by:* max*<sup>n</sup> A*, min*<sup>n</sup> A.*

**Fact 3.** *For any x*, *y* ∈ [0, 1]*:*


**Fact 4.** *There is:*

$$\mathfrak{n}\text{-PFN} = \{ \langle \mathfrak{x}, y \rangle \in [0, 1] \times [0, 1] : \langle 0, 1 \rangle \le\_{\mathfrak{n}} \langle \mathfrak{x}, y \rangle \le\_{\mathfrak{n}} \langle 1, 0 \rangle \}. \tag{53}$$

**Definition 6.** *There are:*

	- *(a) boundary conditions*

$$
\langle \emptyset, 1 \rangle \circ\_t \langle \mu\_1, \upsilon\_1 \rangle = \langle 0, 1 \rangle,\\
\langle \mu\_1, \upsilon\_1 \rangle \circ\_t \langle 1, 0 \rangle = \langle \mu\_1, \upsilon\_1 \rangle,\tag{54}
$$

*(b) monotonicity*

$$
\langle \mu\_1, \upsilon\_1 \rangle \circ\_t \langle \mu\_2, \upsilon\_2 \rangle \leq\_n \langle \mu\_3, \upsilon\_3 \rangle \circ\_t \langle \mu\_2, \upsilon\_2 \rangle, \text{ when } \langle \mu\_1, \upsilon\_1 \rangle \leq\_n \langle \mu\_3, \upsilon\_3 \rangle,\tag{55}
$$

*(c) commutativity*

$$
\langle \mu\_1, v\_1 \rangle \circ\_t \langle \mu\_2, v\_2 \rangle = \langle \mu\_2, v\_2 \rangle \circ\_t \langle \mu\_1, v\_1 \rangle,\tag{56}
$$

*(d) associativity*

$$
\langle \mu\_1, \upsilon\_1 \rangle \circ\_t (\langle \mu\_2, \upsilon\_2 \rangle \circ\_t \langle \mu\_3, \upsilon\_3 \rangle) = (\langle \mu\_1, \upsilon\_1 \rangle \circ\_t \langle \mu\_2, \upsilon\_2 \rangle) \circ\_t \langle \mu\_3, \upsilon\_3 \rangle. \tag{57}
$$

	- *(a) boundary conditions*

$$
\langle \mathbf{1}, \mathbf{0} \rangle \circ\_{\sf s} \langle \mu\_1, \upsilon\_1 \rangle = \langle \mathbf{1}, \mathbf{0} \rangle,\\
\langle \mu\_1, \upsilon\_1 \rangle \circ\_{\sf s} \langle \mathbf{0}, \mathbf{1} \rangle = \langle \mu\_1, \upsilon\_1 \rangle,\tag{58}
$$

*(b) monotonicity*

$$
\langle \mu\_1, \upsilon\_1 \rangle \circ\_s \langle \mu\_2, \upsilon\_2 \rangle \leq\_n \langle \mu\_3, \upsilon\_3 \rangle \circ\_s \langle \mu\_2, \upsilon\_2 \rangle, \text{ when } \langle \mu\_1, \upsilon\_1 \rangle \leq\_n \langle \mu\_3, \upsilon\_3 \rangle,\tag{59}
$$

*(c) commutativity*

$$
\langle \mu\_1, v\_1 \rangle \circ\_s \langle \mu\_2, v\_2 \rangle = \langle \mu\_2, v\_2 \rangle \circ\_s \langle \mu\_1, v\_1 \rangle,\tag{60}
$$

*(d) associativity*

$$
\langle \mu\_1, \upsilon\_1 \rangle \circ\_{\sf s} (\langle \mu\_2, \upsilon\_2 \rangle \circ\_{\sf s} \langle \mu\_3, \upsilon\_3 \rangle) = (\langle \mu\_1, \upsilon\_1 \rangle \circ\_{\sf s} \langle \mu\_2, \upsilon\_2 \rangle) \circ\_{\sf s} \langle \mu\_3, \upsilon\_3 \rangle. \tag{61}
$$

**Theorem 9.** *The Yager operator* ⊗ *on the n-PFN is a t-norm in the set n-PFN and the operator* ⊕ *is a s-norm in the set n-PFN.*

**Proof of Theorem 9.** Conditions (45)–(47) of the Theorem 8 proof that the operator ⊗ satisfies conditions (a),(c), and (d) of the Definition 6 (1) of the t-norm in the set **n-PFN**. It is enough to prove that this operation is monotonous.

For any h*µ*1, *v*1i,h*µ*2, *v*2i,h*µ*3, *v*3i ∈ **n-PFN** h*µ*1, *v*1i ⊗ h*µ*2, *v*2i = h(*µ n* 1 •*<sup>t</sup> µ n* 2 ) 1/*n* ,(*v n* 1 •*<sup>s</sup> v n* 2 ) 1/*n* i, h*µ*3, *v*3i ⊗ h*µ*2, *v*2i = h(*µ n* 3 •*<sup>t</sup> µ n* 2 ) 1/*n* ,(*v n* 3 •*<sup>s</sup> v n* 2 ) 1/*n* i. Let h*µ*1, *v*1i ≤*<sup>n</sup>* h*µ*3, *v*3i. Then *µ*<sup>1</sup> ≤ *µ*3, *v*<sup>1</sup> ≥ *v*3. Hence, and from the monotonicity of the t-norm and s-norm, it is obtained that: *n n n n n n n n*

*µ* 1 •*<sup>t</sup> µ* <sup>2</sup> ≤ *µ* 3 •*<sup>t</sup> µ* 2 and *v* 3 •*<sup>s</sup> v* <sup>2</sup> ≤ *v* 1 •*<sup>s</sup> v* 2 iff (*µ n* 1 •*<sup>t</sup> µ n* 2 ) 1/*<sup>n</sup>* <sup>≤</sup> (*<sup>µ</sup> n* 3 •*<sup>t</sup> µ n* 2 ) 1/*<sup>n</sup>* and (*v n* 1 •*<sup>s</sup> v n* 2 ) 1/*<sup>n</sup>* <sup>≥</sup> (*<sup>v</sup> n* 3 •*<sup>s</sup> v n* 2 ) 1/*n* iff h(*µ n* 1 •*<sup>t</sup> µ n* 2 ) 1/*n* ,(*v n* 1 •*<sup>s</sup> v n* 2 ) 1/*n* i ≤*<sup>n</sup>* h(*µ n* 3 •*<sup>t</sup> µ n* 2 ) 1/*n* ,(*v n* 3 •*<sup>s</sup> v n* 2 ) 1/*n* i iff h*µ*1, *v*1i ⊗ h*µ*2, *v*2i ≤*<sup>n</sup>* h*µ*3, *v*3i ⊗ h*µ*2, *v*2i.

Proof that the operator ⊕ satisfies conditions of the Definition 6 (2) about the s-norm in the set **n-PFN** is analogical.

Summarizing, for the knowledge of operations and relationships introduced in the **n-PFN**, the following operations and conclusion relationships can be determined for the **n-PFS**:

**Definition 7.** *For any p*1, *p*<sup>2</sup> ∈ *n-PFS, and number λ* ∈ [0, 1]*:*

$$p\_1 \oplus p\_2 = \{ \langle \mathbf{x}, \langle \mu\_{p\_1}(\mathbf{x}), v\_{p\_1}(\mathbf{x}) \rangle \oplus \langle \mu\_{p\_2}(\mathbf{x}), v\_{p\_2}(\mathbf{x}) \rangle \rangle : \mathbf{x} \in \mathbf{X} \},\tag{62}$$

$$p\_1 \otimes p\_2 = \{ \langle \mathbf{x}, \langle \mu\_{p\_1}(\mathbf{x}), \upsilon\_{p\_1}(\mathbf{x}) \rangle \otimes \langle \mu\_{p\_2}(\mathbf{x}), \upsilon\_{p\_2}(\mathbf{x}) \rangle \rangle : \mathbf{x} \in \mathcal{X} \},\tag{63}$$

$$
\lambda p\_1 = \{ \langle \mathbf{x}, \lambda \langle \mu\_{p\_1}(\mathbf{x}), v\_{p\_1}(\mathbf{x}) \rangle \rangle : \mathbf{x} \in \mathbf{X} \}, \tag{64}
$$

$$p\_1^{\lambda} = \{ \langle \mathbf{x}, \langle \mu\_{p\_1}(\mathbf{x}), v\_{p\_1}(\mathbf{x}) \rangle^{\lambda} \rangle : \mathbf{x} \in X \},\tag{65}$$

$$\text{supp}(p\_1) = \{ \mathbf{x} \in X : \mu\_{p\_1}(\mathbf{x}) > 0, v\_{p\_1}(\mathbf{x}) > 0 \},\tag{66}$$

$$p\_1 \subseteq\_n p\_2 \text{ iff for any } \mathbf{x} \in X, \langle \mu\_{p\_1}(\mathbf{x}), \upsilon\_{p\_1}(\mathbf{x}) \rangle \le\_n \langle \mu\_{p\_2}(\mathbf{x}), \upsilon\_{p\_2}(\mathbf{x}) \rangle. \tag{67}$$

The system n-PFS, with defined in the Definition 7 operations (t-norm, s-norm, p-norm, l-norm, and support) and inclusion relations, is called the **n-PFS algebra**.

Let **1** =*d f* h0, 1i, **0** =*d f* h1, 0i. Then from the Definition 7 and the Theorem 8 there are:

**Theorem 10.** *In the algebra n-PFS, for any p*1, *p*2, *p*<sup>3</sup> ∈ *n-PFN and the number λ* ∈ [0, 1]*:*

$$p\_1 \oplus \mathbf{0} = p\_1, p\_1 \oplus \mathbf{1} = \mathbf{1},\tag{68}$$

$$p\_1 \oplus p\_2 = p\_2 \oplus p\_{1\prime} \tag{69}$$

$$(p\_1 \oplus p\_2) \oplus p\_3 = p\_1 \oplus (p\_2 \oplus p\_3),\tag{70}$$

$$p\_1 \otimes \mathbf{1} = p\_1, p\_1 \otimes \mathbf{0} = \mathbf{0},\tag{71}$$

$$p\_1 \otimes p\_2 = p\_2 \otimes p\_1. \tag{72}$$

$$(p\_1 \otimes p\_2) \otimes p\_3 = p\_1 \otimes (p\_2 \otimes p\_3),\tag{73}$$

$$
\lambda(p\_1 \oplus p\_2) = \lambda p\_1 \oplus \lambda p\_2.\tag{74}
$$

$$(p\_1 \otimes p\_2)^{\lambda} = p\_1^{\lambda} \otimes p\_2^{\lambda},\tag{75}$$

$$(\lambda\_1 + \lambda\_2)p\_1 = \lambda\_1 p\_1 \oplus \lambda\_2 p\_1. \tag{76}$$

$$p\_1^{\lambda\_1 + \lambda\_2} = p\_1^{\lambda\_1} \otimes p\_1^{\lambda\_2}.\tag{77}$$

#### **5. Conclusions**

This paper presents the elements of deductive theory of the n-PFS, where the membership degree *µ* and the non-membership degree *v* determine not only in the square scale, but in any power scale, i.e., 0 ≤ *µ <sup>n</sup>* + *v <sup>n</sup>* <sup>≤</sup> 1. As a result, any local deductions in the n-PFS range can be formulated. It may be interesting to use the described model to create similar models but based on other functional scales, for example for the function of scale *fn*(*x*) = *x*/*n* : 0 ≤ *µ*/*n* + *v*/*n* ≤ 1 or *fn*(*x*) = 1 + log*<sup>n</sup>* (*x* + 1), for *x* ∈ [0, 1], where *f*(*x*) < *x* : 0 ≤ (*l* + log*<sup>n</sup>* (*µ* + 1)) + (1 + log*<sup>n</sup>* (*v* + 1)) ≤ 1. In the research, the n-PFS theory can be used to describe n-PFS as a system of information granules [19].

**Funding:** This research received no external funding.

**Conflicts of Interest:** The authors declare no conflict of interest.

## **References**


**Publisher's Note:** MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
