Introduction

Considering the imprecision in decision-making, Zadeh [1] introduced the idea of fuzzy set which has a membership function, \(\mu \) that assigns to each element of the universe of discourse, a number from the unit interval [0, 1] to indicate the degree of belongingness to the set under consideration. The notion of fuzzy sets generalizes classical sets theory by allowing intermediate situations between the whole and nothing. In a fuzzy set, a membership function is defined to describe the degree of membership of an element to a class. The membership value ranges from 0 to 1, where 0 shows that the element does not belong to a class, 1 means belongs, and other values indicate the degree of membership to a class. For fuzzy sets, the membership function replaced the characteristic function in crisp sets.

Albeit, the concept of fuzzy sets theory seems to be inconclusive because of the exclusion of nonmembership function and the disregard for the possibility of hesitation margin. Atanassov critically studied these shortcomings and proposed a concept called intuitionistic fuzzy sets (IFSs) [2,3,4,5]. The construct (that is, IFSs) incorporates both membership function, \(\mu \) and nonmembership function, \(\nu \) with hesitation margin, \(\pi \) (that is, neither membership nor nonmembership functions), such that \(\mu +\nu \le 1\) and \(\mu +\nu +\pi =1\). Atanassov [6] introduced intuitionistic fuzzy sets of second type (IFSST) with the property that the sum of the square of the membership and nonmembership degrees is less than or equal to one. This concept generalizes IFSs in a way. The notion of IFSs provides a flexible framework to elaborate uncertainty and vagueness. The idea of IFS seems to be resourceful in modeling many real-life situations like medical diagnosis [7,8,9,10,11], career determination [12], selection process [13], and multi-criteria decision-making [14,15,16], among others.

There are situations where \(\mu +\nu \ge 1\) unlike the cases capture in IFSs. This limitation in IFS naturally led to a construct, called Pythagorean fuzzy sets (PFSs). Pythagorean fuzzy set (PFS) proposed in [17,18,19] is a new tool to deal with vagueness considering the membership grade, \(\mu \) and nonmembership grade, \(\nu \) satisfying the conditions \(\mu +\nu \le 1\) or \(\mu +\nu \ge 1\), and also, it follows that \(\mu ^2+\nu ^2+\pi ^2=1\), where \(\pi \) is the Pythagorean fuzzy set index. In fact, the origin of Pythagorean fuzzy sets emanated from IFSST earlier studied in the literature. As a generalized set, PFS has close relationship with IFS. The construct of PFSs can be used to characterize uncertain information more sufficiently and accurately than IFS. Garg [20] presented an improved score function for the ranking order of interval-valued Pythagorean fuzzy sets (IVPFSs). Based on it, a Pythagorean fuzzy technique for order of preference by similarity to ideal solution (TOPSIS) method by taking the preferences of the experts in the form of interval-valued Pythagorean fuzzy decision matrices was discussed. Other explorations of the theory of PFSs can be found in [21,22,23,24,25,26,27].

Pythagorean fuzzy set has attracted great attentions of many researchers, and subsequently, the concept has been applied to many application areas such as decision-making, aggregation operators, and information measures. Rahman et al. [28] worked on some geometric aggregation operators on interval-valued PFSs (IVPFSs) and applied same to group decision-making problem. Perez-Dominguez [29] presented a multiobjective optimization on the basis of ratio analysis (MOORA) under PFS setting and applied it to MCDM problem. Liang and Xu [30] proposed the idea of PFSs in hesitant environment and its MCDM ability by employing TOPSIS using energy project selection model. Mohagheghi et al. [31] offered a novel last aggregation group decision-making process for the weight of decision-makers using PFSs. Rahman et al. [32] proposed some approaches to multi-attribute group decision-making based on induced interval-valued Pythagorean fuzzy Einstein aggregation operator.

Garg [33, 34] unveiled some new logarithmic operational laws and their aggregation operator for PFS with some applications and discussed a decision-making problem under Pythagorean fuzzy environment by proposing some generalized aggregation operators. Garg [35] proposed an improved score function for solving MCDM problem with partially known weight information, such that the preferences related to the criteria are taken in the form of interval-valued Pythagorean fuzzy sets. Garg [36, 37] developed a new decision-making model with probabilistic information, using the concept of immediate probabilities to aggregate the information under the Pythagorean fuzzy set environment, and defined two new exponential operational laws about IVPFS and their corresponding aggregation operators with application to MCDM. Other applications of PFSs and IVPFSs, respectively, in conjunction to decision-making problems, especially in MCDM and MADM, have been studied in [38,39,40,41,42,43,44,45,46,47,48,49,50,51].

In this paper, we are motivated to investigate the resourcefulness of PFSs in tackling career placements problem via max–min–max rule because of its wider scope of applications in real-life problems imbedded with imprecision. The paper is aimed at exploring the notion of PFSs and its application to career placements on the basis of academic performance using max–min–max composition. To achieve this aim, we reiterate the concept of PFSs, outline some properties of PFSs, and deduce some theorems with respect to score and accuracy functions studied in the literature hitherto. The idea of Pythagorean fuzzy relation is proposed as an extension of fuzzy relation, as well as intuitionistic fuzzy relation introduced in [8, 52], respectively. Conclusively, a new application of Pythagorean fuzzy sets is explicated in career placements on the basis of academic performance using the proposed relation. The rest of the paper are thus presented: Sect. 2 provides some preliminaries on fuzzy sets and IFSs as foundations to the idea of PFSs, while Sect. 3 covers the notion of PFSs with some theorems. We present Pythagorean fuzzy relation and its numerical verifications in Sect. 4. An application of Pythagorean fuzzy relation (max–min–max composition) is supplied in a hypothetical case study in Sect. 5. Finally, Sect. 6 concludes the paper and provides direction for future studies.

Preliminaries

We recall some basic notions of fuzzy sets and IFSs.

Fuzzy sets

Definition 2.1

(See [1]) Let X be a nonempty set. A fuzzy set A in X is characterized by a membership function:

$$\begin{aligned}\mu _A:X\rightarrow [0,1]. \end{aligned}$$

That is:

$$\begin{aligned} \mu _A(x) = \left\{ \begin{array}{ll} 1, &{}\quad \text {if}\, x\in X\\ 0, &{}\quad \text {if}\, x\notin X\\ (0,1) &{}\quad \text {if}\, x\, \text {is partly in}\, X. \end{array} \right. \end{aligned}$$

Alternatively, a fuzzy set A in X is an object having the form

$$\begin{aligned} A=\lbrace \langle x, \mu _A(x)\rangle \mid x\in X\rbrace \, \quad \text {or}\quad \, A=\left\{ \left\langle \dfrac{\mu _A(x)}{x} \right\rangle \mid x\in X\right\} , \end{aligned}$$

where the function

$$\begin{aligned} \mu _A(x): X\rightarrow [0,1] \end{aligned}$$

defines the degree of membership of the element, \(x\in X\).

The closer the membership value \(\mu _A(x)\) to 1, the more x belongs to A, where the grades 1 and 0 represent full membership and full nonmembership. Fuzzy set is a collection of objects with graded membership, that is, having degree of membership. Fuzzy set is an extension of the classical notion of set. In classical set theory, the membership of elements in a set is assessed in binary terms according to a bivalent condition; an element either belongs or does not belong to the set. Classical bivalent sets are in fuzzy set theory called crisp sets. Fuzzy sets are generalized classical sets, since the indicator function of classical sets is special cases of the membership functions of fuzzy sets, if the latter only take values 0 or 1. Fuzzy sets theory permits the gradual assessment of the membership of element in a set; this is described with the aid of a membership function valued in the real unit interval [0, 1].

Let us consider two examples:

  1. (i)

    all employees of XYZ who are over 1.8 m in height;

  2. (ii)

    all employees of XYZ who are tall.

The first example is a classical set with a universe (all XYZ employees) and a membership rule that divides the universe into members (those over 1.8 m) and nonmembers. The second example is a fuzzy set, because some employees are definitely in the set and some are definitely not in the set, but some are borderline.

This distinction between the ins, the outs, and the borderline is made more exact by the membership function, \(\mu \). If we return to our second example and let A represent the fuzzy set of all tall employees and x represent a member of the universe X (i.e. all employees), then \(\mu _A(x)\) would be \(\mu _A(x)=1\) if x is definitely tall or \(\mu _A(x)=0\) if x is definitely not tall or \(0<\mu _A(x)<1\) for borderline cases.

Intuitionistic fuzzy sets

Definition 2.2

(See [2,3,4,5]) Let a nonempty set X be fixed. An IFS A in X is an object having the form:

$$\begin{aligned} A=\lbrace \langle x, \mu _A(x), \nu _A(x) \rangle \mid x\in X\rbrace \end{aligned}$$

or

$$\begin{aligned} A=\left\{ \left\langle \dfrac{\mu _A(x), \nu _A(x)}{x} \right\rangle \mid x\in X\right\} , \end{aligned}$$

where the functions

$$\begin{aligned} \mu _A(x): X\rightarrow [0,1] \,\quad \text {and}\, \quad \nu _A(x): X\rightarrow [0,1] \end{aligned}$$

define the degree of membership and the degree of nonmembership, respectively, of the element \(x\in X\) to A, which is a subset of X, and for every \(x\in X\):

$$\begin{aligned} 0\le \mu _A(x)+ \nu _A(x)\le 1. \end{aligned}$$

For each A in X:

$$\begin{aligned} \pi _A(x)= 1-\mu _A(x)-\nu _A(x) \end{aligned}$$

is the intuitionistic fuzzy set index or hesitation margin of x in X. The hesitation margin \(\pi _A (x)\) is the degree of nondeterminacy of \(x\in X\), to the set A and \(\pi _A (x)\in [0,1]\). The hesitation margin is the function that expresses lack of knowledge of whether \(x\in X\) or \(x\notin X\). Thus:

$$\begin{aligned} \mu _A(x)+\nu _A(x)+\pi _A(x)=1. \end{aligned}$$

Example 2.1

Let \(X=\lbrace x,y,z \rbrace \) be a fixed universe of discourse and

$$\begin{aligned} A=\left\{ \left\langle \dfrac{0.6,0.1}{x}\right\rangle , \left\langle \dfrac{0.8,0.1}{y}\right\rangle , \left\langle \dfrac{0.5,0.3}{z}\right\rangle \right\} \end{aligned}$$

be the intuitionistic fuzzy set in X. The hesitation margins of the elements xyz to A are as follows:

$$\begin{aligned} \pi _A(x)=0.3, \, \pi _A(y)=0.1\quad \, \text {and}\quad \, \pi _A(z)=0.2. \end{aligned}$$

Construct of Pythagorean fuzzy sets

Definition 3.1

(See [17,18,19]) Let X be a universal set. Then, a Pythagorean fuzzy set A, which is a set of ordered pairs over X, is defined by the following:

$$\begin{aligned} A=\lbrace \langle x, \mu _A(x), \nu _A(x) \rangle \mid x\in X\rbrace \end{aligned}$$

or

$$\begin{aligned} A=\left\{ \left\langle \dfrac{\mu _A(x), \nu _A(x)}{x} \right\rangle \mid x\in X\right\} , \end{aligned}$$

where the functions

$$\begin{aligned} \mu _A(x): X\rightarrow [0,1] \quad \, \text {and}\,\quad \nu _A(x): X\rightarrow [0,1] \end{aligned}$$

define the degree of membership and the degree of nonmembership, respectively, of the element \(x\in X\) to A, which is a subset of X, and for every \(x\in X\):

$$\begin{aligned} 0\le (\mu _A(x))^2 + (\nu _A(x))^2 \le 1. \end{aligned}$$

Supposing \((\mu _A(x))^2 + (\nu _A(x))^2 \le 1\), then there is a degree of indeterminacy of \(x\in X\) to A defined by \(\pi _A(x)=\sqrt{1-[(\mu _A(x))^2 + (\nu _A(x))^2]}\) and \(\pi _A(x)\in [0,1]\). In what follows, \((\mu _A(x))^2 + (\nu _A(x))^2 + (\pi _A(x))^2=1\). Otherwise, \(\pi _A(x)=0\) whenever \((\mu _A(x))^2 + (\nu _A(x))^2 =1\).

We denote the set of all PFSs over X by PFS(X).

Example 3.1

Let \(A\in \) PFS(X). Suppose that \(\mu _A(x)=0.7\) and \(\nu _A(x)=0.5\) for \(X=\lbrace x\rbrace \). Clearly, \(0.7+0.5\nleq 1\), but \(0.7^2+0.5^2\le 1\). Thus, \(\pi _A(x)=0.5099\), and hence, \((\mu _A(x))^2 + (\nu _A(x))^2 + (\pi _A(x))^2=1\).

Table 1 explains the difference between Pythagorean fuzzy sets and intuitionistic fuzzy sets.

Table 1 Pythagorean fuzzy sets and intuitionistic fuzzy sets

Theorem 3.1

Let \(X=\lbrace x_i\rbrace \) be a universal set, for \(i=1,...,n\) and \(A\in \mathrm{PFS}(X)\). Suppose that \(\pi _A(x_i)=0\), and then, the following hold:

  1. (i)

    \(|\mu _A(x_i)|=\sqrt{|(\nu _A(x_i)+1)(\nu _A(x_i)-1)|}\).

  2. (ii)

    \(|\nu _A(x_i)|=\sqrt{|(\mu _A(x_i)+1)(\mu _A(x_i)-1)|}\).

Proof

Suppose that \(x_i\in X\) and \(A\in \mathrm{PFS}(X)\). Then, we prove (i) and (ii). Assume that \(\pi _A(x_i)=0\) for \(x_i\in X\):

(i) we have the following:

$$\begin{aligned}&(\mu _A(x_i))^2 + (\nu _A(x_i))^2 =1 \Rightarrow -(\mu _A(x_i))^2= (\nu _A(x_i))^2-1\\&\quad \Rightarrow -(\mu _A(x_i))^2= (\nu _A(x_i)+1)(\nu _A(x_i)-1)\\&\quad \Rightarrow |(\mu _A(x_i))^2|= |(\nu _A(x_i)+1)(\nu _A(x_i)-1)|\\&\quad \Rightarrow |\mu _A(x_i)|^2= |(\nu _A(x_i)+1)(\nu _A(x_i)-1)|\\&\quad \Rightarrow |\mu _A(x_i)|= \sqrt{|(\nu _A(x_i)+1)(\nu _A(x_i)-1)|}. \end{aligned}$$

(ii) Similar to (i). \(\square \)

Example 3.2

Suppose \(A\in \mathrm{PFS}(X)\) and \(\nu _A(x_i)=0.8\). Then:

$$\begin{aligned} |\mu _A(x_i)|= \sqrt{|(1.8)(-0.2)|}=\sqrt{0.36}=0.6. \end{aligned}$$

Thus, \(\mu _A(x_i)=0.6\). Hence, \((\mu _A(x_i))^2 + (\nu _A(x_i))^2 =1\) implies \(\pi _A(x_i)=0\).

Definition 3.2

[19] Let \(A\in \mathrm{PFS}(X)\). Then, the complement of A denoted by \(A^c\) is defined as follows:

$$\begin{aligned} A^c=\lbrace \langle x, \nu _A(x), \mu _A(x)\rangle |x\in X \rbrace . \end{aligned}$$

Remark 3.1

It is noticed that \((A^c)^c=A\). This shows the validity of complementary law in PFS.

Definition 3.3

[19] Let \(A,B\in \mathrm{PFS}(X)\). Then, the following define union and intersection of A and B:

  1. (i)

    \(A\cup B=\lbrace \langle x, \max (\mu _A(x),\mu _B(x)), \min (\nu _A(x),\nu _B(x)) \rangle |x\in X \rbrace \).

  2. (ii)

    \(A\cap B=\lbrace \langle x, \min (\mu _A(x),\mu _B(x)), \max (\nu _A(x),\nu _B(x)) \rangle |x\in X \rbrace \).

Definition 3.4

[19] Let \(A,B\in \mathrm{PFS}(X)\). Then, the sum of A and B is defined as follows:

$$\begin{aligned}&A\oplus B =\bigg \lbrace \langle x, \sqrt{(\mu _A(x))^2+(\mu _B(x))^2-(\mu _A(x))^2(\mu _B(x))^2},\\&\quad \nu _A(x)\nu _B(x) \rangle |x\in X \bigg \rbrace , \end{aligned}$$

and the product of A and B is defined as follows:

$$\begin{aligned}&A\otimes B =\bigg \lbrace \langle x, \mu _A(x)\mu _B(x),\\&\quad \sqrt{(\nu _A(x))^2+(\nu _B(x))^2-(\nu _A(x))^2(\nu _B(x))^2} \rangle |x\in X \bigg \rbrace . \end{aligned}$$

Remark 3.2

Let \(A,B,C\in \mathrm{PFS}(X)\). Then, the following properties hold:

  1. (a)

    Idempotent:

    1. (i)

      \(A\cap A=A\)

    2. (ii)

      \(A\cup A=A\)

    3. (iii)

      \(A\oplus A\ne A\)

    4. (iv)

      \(A\otimes A\ne A\).

  2. (b)

    Commutativity:

    1. (i)

      \(A\cap B=B\cap A\)

    2. (ii)

      \(A\cup B=B\cup A\)

    3. (iii)

      \(A\oplus B=B\oplus A\)

    4. (iv)

      \(A\otimes B=B\otimes A\).

  3. (c)

    Associativity:

    1. (i)

      \(A\cap (B\cap C)=(A\cap B)\cap C\)

    2. (ii)

      \(A\cup (B\cup C)=(A\cup B)\cup C\)

    3. (iii)

      \(A\oplus (B\oplus C)=(A\oplus B)\oplus C\)

    4. (iv)

      \(A\otimes (B\otimes C)=(A\otimes B)\otimes C\).

  4. (d)

    Distributivity:

    1. (i)

      \(A\cap (B\cup C)= (A\cap B)\cup (A\cap C)\)

    2. (ii)

      \(A\cup (B\cap C)= (A\cup B)\cap (A\cup C)\)

    3. (iii)

      \(A\oplus (B\cup C)= (A\oplus B)\cup (A\oplus C)\)

    4. (iv)

      \(A\oplus (B\cap C)= (A\oplus B)\cap (A\oplus C)\)

    5. (v)

      \(A\otimes (B\cup C)= (A\otimes B)\cup (A\otimes C)\)

    6. (vi)

      \(A\otimes (B\cap C)= (A\otimes B)\cap (A\otimes C)\).

  5. (e)

    DeMorgan’s laws;

    1. (i)

      \((A\cap B)^c=A^c\cup B^c\)

    2. (ii)

      \((A\cup B)^c=A^c\cap B^c\)

    3. (iii)

      \((A\oplus B)^c=A^c\otimes B^c\)

    4. (iv)

      \((A\otimes B)^c=A^c\oplus B^c\).

Definition 3.5

[53] Let \(A\in \mathrm{PFS}(X)\). Then, the score function, s, of A is defined by \(s(A)=(\mu _A(x))^2-(\nu _A(x))^2\), where \(s(A)\in [-1,1]\).

Definition 3.6

[53] Let \(A\in \mathrm{PFS}(X)\). Then, the accuracy function, a, of A is defined by \(a(A)=(\mu _A(x))^2+(\nu _A(x))^2\) for \(a(A)\in [0,1]\).

Example 3.3

Let \(A\in \mathrm{PFS}(X)\). Suppose that \(a(A)=0.6\) and \(\nu _A(x)=0.7\). Then, \(\mu _A(x)=0.3317\), \(s(A)=-0.38\), and \(\pi _A(x)=0.6325\).

In addition, suppose that \(s(A)=-0.5\) and \(a(A)=0.8\). Then, it follows that \(\mu _A(x)=0.3873\), \(\nu _A(x)=0.8062\), and \(\pi _A(x)=0.4472\).

Theorem 3.2

Let \(A\in \mathrm{PFS}(X)\). Then, the following hold \(\forall x\in X\):

  1. (i)

    \(s(A)=0 \Leftrightarrow \mu _A(x)=\nu _A(x)\).

  2. (ii)

    \(s(A)=1 \Leftrightarrow |\nu _A(x)|=\sqrt{|(1+\mu _A(x))(1-\mu _A(x))|}\).

  3. (iii)

    \(s(A)=-1 \Leftrightarrow \mu _A(x)=\sqrt{(\nu _A(x)+1)(\nu _A(x)-1)}\).

Proof

(i) Suppose \(s(A)=0\). Then, \((\mu _A(x))^2=(\nu _A(x))^2\Rightarrow \mu _A(x)=\nu _A(x)\) \(\forall x\in X\).

Conversely, assume that \(\mu _A(x)=\nu _A(x)\). It follows immediately that, \(\forall x\in X\), \((\mu _A(x))^2=(\nu _A(x))^2\). Thus, \((\mu _A(x))^2-(\nu _A(x))^2=0\). Hence, \(s(A)=0\).

(ii) Suppose \(s(A)=1\). Then:

$$\begin{aligned}&1-(\mu _A(x))^2=-(\nu _A(x))^2 \\&\quad \Rightarrow (1+\mu _A(x))(1-\mu _A(x))=-(\nu _A(x))^2\\&\quad \Rightarrow |(1+\mu _A(x))(1-\mu _A(x))|=|\nu _A(x)|^2\\&\quad \Rightarrow |\nu _A(x)|=\sqrt{|(1+\mu _A(x))(1-\mu _A(x))|} \end{aligned}$$

\(\forall x\in X\).

Conversely, assume that \(|\nu _A(x)|=\sqrt{|(1+\mu _A(x))(1-\mu _A(x))|}\). Therefore, we get the following:

$$\begin{aligned} |\nu _A(x)|^2=\sqrt{|1-(\mu _A(x))^2|}\Rightarrow & {} (\nu _A(x))^2=1-(\mu _A(x))^2 \end{aligned}$$

or

$$\begin{aligned} |\nu _A(x)|^2=\sqrt{|1-(\mu _A(x))^2|}\Rightarrow & {} -(\nu _A(x))^2=1-(\mu _A(x))^2. \end{aligned}$$

Take \(-(\nu _A(x))^2=1-(\mu _A(x))^2\) \(\Rightarrow \) \((\mu _A(x))^2-(\nu _A(x))^2=1\) \(\Rightarrow \) \(s(A)=1\).

(iii) Suppose that \(s(A)=-1\). Then

$$\begin{aligned}&(\nu _A(x))^2-1=(\mu _A(x))^2 \Rightarrow (\nu _A(x)-1)(\nu _A(x)+1)\\&\quad =(\mu _A(x))^2 \Rightarrow \mu _A(x)=\sqrt{(\nu _A(x)-1)(\nu _A(x)+1)}. \end{aligned}$$

Conversely, suppose \(\mu _A(x)=\sqrt{(\nu _A(x)-1)(\nu _A(x)+1)}\). Then

$$\begin{aligned} (\mu _A(x))^2=(\nu _A(x))^2-1\Rightarrow & {} (\mu _A(x))^2-(\nu _A(x))^2=-1\\\Rightarrow & {} s(A)=-1. \end{aligned}$$

\(\square \)

Theorem 3.3

Let \(A\in \mathrm{PFS}(X)\). Then, the following statements hold \(\forall x\in X\):

  1. (i)

    \(a(A)=1 \Leftrightarrow \pi _A(x)=0\).

  2. (ii)

    \(a(A)=0 \Leftrightarrow |\mu _A(x)|=|\nu _A(x)|\).

Proof

(i) Suppose \(a(A)=1\). Therefore, we have \((\mu _A(x))^2+(\nu _A(x))^2=1\), that is, \(\pi _A(x)=0\), since \(\pi _A(x)=\sqrt{1-[(\mu _A(x))^2+(\nu _A(x))^2]}\).

Conversely, assume that \(\pi _A(x)=0\). Then, it follows that:

$$\begin{aligned} (\mu _A(x))^2+(\nu _A(x))^2=1 \Rightarrow a(A)=1. \end{aligned}$$

(ii) Suppose \(a(A)=0\). Then, \((\mu _A(x))^2=-(\nu _A(x))^2\) or \((\nu _A(x))^2=-(\mu _A(x))^2\) \(\Leftrightarrow \) \(|\mu _A(x)|^2=|\nu _A(x)|^2\) \(\Leftrightarrow \) \(|\mu _A(x)|=|\nu _A(x)|\). \(\square \)

Definition 3.7

Let \(A,B\in \mathrm{PFS}(X)\). Then, \(A=B\) \(\Leftrightarrow \) \(\mu _A(x)=\mu _B(x)\) and \(\nu _A(x)=\nu _B(x)\) \(\forall x\in X\), and \(A\subseteq B\) \(\Leftrightarrow \) \(\mu _A(x)\le \mu _B(x)\) and \(\nu _A(x)\ge \nu _B(x)\) (or \(\nu _A(x)\le \nu _B(x)\)) \(\forall x\in X\). We say \(A\subset B\) \(\Leftrightarrow \) \(A\subseteq B\) and \(A\ne B\).

Definition 3.8

Let \(A,B\in \mathrm{PFS}(X)\). Then, A and B are comparable to each other if \(A\subseteq B\) and \(B\subseteq A\).

We state the following theorems without prove because of their straightforwardness.

Theorem 3.4

Let \(A, B\in \mathrm{PFS}(X)\). Then, the following statements hold:

  1. (i)

    \(s(A)=s(B)\Leftrightarrow A=B\).

  2. (ii)

    \(s(A)\le s(B)\Leftrightarrow A\subseteq B\).

  3. (iii)

    \(s(A)< s(B)\Leftrightarrow A\subseteq B\) and \(A\ne B\).

Theorem 3.5

Let \(A, B\in \mathrm{PFS}(X)\). Then, the following hold:

  1. (i)

    \(a(A)=a(B)\Leftrightarrow A=B\).

  2. (ii)

    \(a(A)\le a(B)\Leftrightarrow A\subseteq B\).

  3. (iii)

    \(a(A)< a(B)\Leftrightarrow A\subseteq B\) and \(A\ne B\).

Pythagorean fuzzy relation

In this section, we propose Pythagorean fuzzy relation as an extension of both fuzzy relation and intuitionistic fuzzy relation [8, 52]. The notions of extension principle for fuzzy sets [54, 55] and intuitionistic fuzzy set [56], respectively, are paramount to Pythagorean fuzzy relation. In what follows, we define the extension principle for Pythagorean fuzzy sets.

Definition 4.1

Let X and Y be sets and let f be a function from X to Y. Suppose that A and B are Pythagorean fuzzy sets of X and Y, respectively. Then:

  1. (i)

    the image of A under f, denoted by f(A), is a Pythagorean fuzzy set of Y defined by the following:

    $$\begin{aligned} \mu _{f(A)} (y) = \left\{ \begin{array}{ll} \bigvee _{x\in f^{-1} (y) } \mu _A (x), &{}\quad f^{-1} (y)\ne \emptyset \\ 0, &{}\quad \text {otherwise} \end{array} \right. \end{aligned}$$

    and

    $$\begin{aligned} \nu _{f(A)} (y) = \left\{ \begin{array}{ll} \bigwedge _{x\in f^{-1} (y) } \nu _A (x), &{}\quad f^{-1} (y)\ne \emptyset \\ 1, &{}\quad \text {otherwise}; \end{array} \right. \end{aligned}$$

    for each \(y\in Y\).

  2. (ii)

    the inverse image of B under f, denoted by \(f^{-1} (B)\), is a Pythagorean fuzzy set of X defined by the following:

    $$\begin{aligned} \mu _{f^{-1}(B)}(x)=\mu _B(f(x))\, \quad \text {and}\, \\ \quad \nu _{f^{-1}(B)}(x)=\nu _B(f(x))\, \forall x\in X. \end{aligned}$$

Definition 4.2

Let X and Y be two nonempty sets. A Pythagorean fuzzy relation (PFR), R, from X to Y is a PFS of \(X\times Y\) characterized by the membership function, \(\mu _R\) and nonmembership function, \(\nu _R\). A PF relation or PFR from X to Y is denoted by \(R(X\rightarrow Y)\).

Definition 4.3

Let \(A\in \mathrm{PFS}(X)\). Then, the max–min–max composition of \(R(X\rightarrow Y)\) with A is a PFS B of Y denoted by \(B=R\circ A\), such that its membership and nonmembership functions are defined by the following:

$$\begin{aligned} \mu _B(y)=\bigvee _{x}(\min [\mu _A(x), \mu _R(x,y)]) \end{aligned}$$

and

$$\begin{aligned} \nu _B(y)=\bigwedge _{x}(\max [\nu _A(x), \nu _R(x,y)]) \end{aligned}$$

\(\forall x\in X\) and \(y\in Y\), where \(\bigvee =\)maximum, \(\bigwedge =\)minimum.

Definition 4.4

Let \(Q(X\rightarrow Y)\) and \(R(Y\rightarrow Z)\) be two PFRs. Then, the max–min–max composition \(R\circ Q\) is a PFR from X to Z, such that its membership and nonmembership functions are defined by the following:

$$\begin{aligned} \mu _{R\circ Q}(x,z)=\bigvee _{y}(\min [\mu _Q(x,y), \mu _R(y,z)]) \end{aligned}$$

and

$$\begin{aligned} \nu _{R\circ Q}(x,z)=\bigwedge _{y}(\max [\nu _Q(x,y), \nu _R(y,z)]) \end{aligned}$$

\(\forall (x,z)\in X\times Z\) and \(\forall y\in Y\).

Remark 4.1

From Definitions 4.3 and 4.4, the max–min–max composition B or \(R\circ Q\) is calculated by the following:

$$\begin{aligned}B=\mu _B(y)-\nu _B(y)\pi _B(y)\end{aligned}$$

\(\forall y\in Y\) or

$$\begin{aligned}R\circ Q=\mu _{R\circ Q}(x,z)-\nu _{R\circ Q}(x,z)\pi _{R\circ Q}(x,z)\end{aligned}$$

\(\forall (x,z)\in X\times Z\).

Proposition 4.1

If R and S are two PFRs on \(X\times Y\) and \(Y\times Z\), respectively. Then:

  1. (i)

    \((R^{-1})^{-1}=R\).

  2. (ii)

    \((S\circ R)^{-1}=R^{-1}\circ S^{-1}\).

Numerical examples

Before applying this relation to career placements, we discuss the procedures of the approach step-wisely.

Example 4.1

Let \(E,F\in \mathrm{PFS}(X)\) for \(X=\lbrace x_1,x_2,x_3\rbrace \). Suppose that

$$\begin{aligned} E=\left\{ \left\langle \dfrac{0.6,0.2}{x_1}\right\rangle , \left\langle \dfrac{0.4,0.6}{x_2}\right\rangle , \left\langle \dfrac{0.5,0.3}{x_3}\right\rangle \right\} \end{aligned}$$

and

$$\begin{aligned} F=\left\{ \left\langle \dfrac{0.8,0.1}{x_1}\right\rangle , \left\langle \dfrac{0.7,0.3}{x_2}\right\rangle , \left\langle \dfrac{0.6,0.1}{x_3}\right\rangle \right\} . \end{aligned}$$

We find the composition B using Definitions 4.3 and 4.4, respectively, as follows:

$$\begin{aligned} \min [\mu _R(e_i, x_j), \mu _S(x_j, f_k)]=0.6,0.4,0.5, \end{aligned}$$

implying that

$$\begin{aligned} \mu _B(e_i,f_k)=\bigvee _{x_j\in X}(0.6,0.4,0.5) =0.6. \end{aligned}$$

Again:

$$\begin{aligned} \max [\nu _R(e_i, x_j), \nu _S(x_j, f_k)]=0.2,0.6,0.3, \end{aligned}$$

implying that

$$\begin{aligned} \nu _B(e_i,f_k)=\bigwedge _{x_j\in X}(0.2,0.6,0.3) =0.2. \end{aligned}$$

Then

$$\begin{aligned} B=0.6-(0.2\times 0.7746)=0.4451. \end{aligned}$$

Now, we consider a situation where the elements of PFSs are not equal.

Example 4.2

Let \(G,H\in \mathrm{PFS}(X)\) for \(X=\lbrace x_1,x_2,x_3,x_4,x_5\rbrace \). Suppose that

$$\begin{aligned} G=\left\{ \left\langle \dfrac{0.8,0.4}{x_1}\right\rangle , \left\langle \dfrac{0.5,0.7}{x_2}\right\rangle ,\left\langle \dfrac{0.8,0.4}{x_3}\right\rangle ,\left\langle \dfrac{0.7,0.2}{x_5}\right\rangle \right\} \end{aligned}$$

and

$$\begin{aligned} H=\left\{ \left\langle \dfrac{0.7,0.3}{x_1}\right\rangle , \left\langle \dfrac{0.4,0.7}{x_3}\right\rangle ,\left\langle \dfrac{0.9,0.2}{x_4}\right\rangle \right\} . \end{aligned}$$

Before calculating the max–min–max composition, we rewrite the PFSs; thus:

$$\begin{aligned} G= & {} \left\{ \left\langle \dfrac{0.8,0.4}{x_1}\right\rangle , \left\langle \dfrac{0.5,0.7}{x_2}\right\rangle ,\left\langle \dfrac{0.8,0.4}{x_3}\right\rangle , \left\langle \dfrac{0.0,1.0}{x_4}\right\rangle ,\right. \\&\left. \left\langle \dfrac{0.7,0.2}{x_5}\right\rangle \right\} \end{aligned}$$

and

$$\begin{aligned} H= & {} \left\{ \left\langle \dfrac{0.7,0.3}{x_1}\right\rangle , \left\langle \dfrac{0.0,1.0}{x_2}\right\rangle , \left\langle \dfrac{0.4,0.7}{x_3}\right\rangle ,\left\langle \dfrac{0.9,0.2}{x_4}\right\rangle ,\right. \\&\left. \left\langle \dfrac{0.0,1.0}{x_5}\right\rangle \right\} . \end{aligned}$$

Now, we find B as follows. Using Definitions 4.3 and 4.4, we get

$$\begin{aligned} \min [\mu _R(g_i, x_j), \mu _S(x_j, h_k)]=0.7,0.0,0.4,0.0,0.0, \end{aligned}$$

implying that

$$\begin{aligned} \mu _B(g_i,h_k)=\bigvee _{x_j\in X}(0.7,0.0,0.4,0.0,0.0)=0.7. \end{aligned}$$

Again

$$\begin{aligned} \max [\nu _R(g_i, x_j), \nu _S(x_j, h_k)]=0.4,1.0,0.7,1.0,1.0, \end{aligned}$$

implying that

$$\begin{aligned} \nu _B(g_i,h_k)=\bigwedge _{x_j\in X}(0.4,0.7,0.7,0.2,0.2)=0.4. \end{aligned}$$

Thus

$$\begin{aligned} B=0.7-(0.4\times 0.5916)=0.4634. \end{aligned}$$

Application of max–min–max composition for Pythagorean fuzzy sets to career placements

We localize the idea of PFR as follows. Let

$$\begin{aligned}S=\lbrace s_1,...,s_l\rbrace , C=\lbrace c_1,...,c_m\rbrace \,\quad \text {and} \quad \, A=\lbrace a_1,...,a_n\rbrace \end{aligned}$$

be finite set of subjects related to the courses, finite set of courses, and finite set of applicants, respectively.

Suppose we have two PFRs, \(R(A\rightarrow S)\) and \(U(S\rightarrow C)\), such that

$$\begin{aligned} R=\lbrace \langle (a,s), \mu _R(a,s), \nu _R(a,s)\rangle | (a,s)\in A\times S \rbrace \end{aligned}$$

and

$$\begin{aligned} U=\lbrace \langle (s,c), \mu _U(s,c), \nu _U(s,c)\rangle | (s,c)\in S\times C \rbrace , \end{aligned}$$

where \(\mu _R(a,s)\) represents the degree to which the applicant, a, passes the related subject requirement, s, and \(\nu _R(a,s)\) represents the degree to which the applicant, a does not pass the related subject requirement, s. Similarly, \(\mu _U(s,c)\) represents the degree to which the related subject requirement, s determines the course, c, and \(\nu _U(s,c)\) represents the degree to which the related subject requirement, s, does not determine the course, c.

The composition, T, of R and U is given as \(T=R\circ U\). This describes the state in which the applicants, \(a_i\) with respect to the related subjects requirement, \(s_j\) fit the courses, \(c_k\). Thus:

$$\begin{aligned} \mu _T(a_i,c_k)=\bigvee _{s_j\in S}\lbrace \min [\mu _R(a_i,s_j), \mu _U(s_j,c_k)]\rbrace \end{aligned}$$

and

$$\begin{aligned} \nu _T(a_i,c_k)=\bigwedge _{s_j\in S}\lbrace \max [\nu _R(a_i,s_j), \nu _U(s_j,c_k)]\rbrace \end{aligned}$$

\(\forall a_i\in A\) and \(c_k\in C\), where ij and k take values from 1, ..., n.

Table 2 \(R(A\rightarrow S)\)
Table 3 \(U(S\rightarrow C)\)

The values of \(\mu _{R\circ U}(a_i,c_k)\) and \(\nu _{R\circ U}(a_i,c_k)\) of the composition \(T=R\circ U\) are as follows (Table 4):

Table 4 \(\mu _{R\circ U}(a_i,c_k)\) and \(\nu _{R\circ U}(a_i,c_k)\)

The career placement can be achieved if the value of T is given by the following:

$$\begin{aligned} T=\mu _T(a_i,c_k)-\nu _T(a_i,c_k) \pi _T(a_i,c_k), \end{aligned}$$

as computed from R and U for the placements of \(a_i\) into any \(c_k\) with respect to \(s_j\) is the greatest.

Application example

We apply this method using a hypothetical case with a quasi-real data. Let

$$\begin{aligned} A=\lbrace \text {Ada, Ene, Ehi, Ebo, Ela}\rbrace \end{aligned}$$

be the set of applicants for the course placements;

$$\begin{aligned} C=\lbrace \text {medicine, pharmacy, surgery, anatomy, physiology}\rbrace \end{aligned}$$

be the set of courses the applicants are vying for;

$$\begin{aligned} S= & {} \lbrace \text {English Lang., Maths, Biology, Physics,}\\&\text {Chemistry, Health Sci.}\rbrace \end{aligned}$$

be the set of related subjects requirement to the set of courses.

Suppose the PFR, \(R(A\rightarrow S)\) is given in Table 2. These data in PF values are assumably gotten after the aforementioned applicants sat for a multiple choice qualification examination on the itemized subjects within a stipulated time.

The first entry is the membership value, \(\mu \), representing the Pythagorean fuzzy value of the marks allocated to the questions that the applicants answered, and the second entry is the nonmembership value, \(\nu \), representing the Pythagorean fuzzy value of the marks allocated to the questions failed.

Again, the PFR, \(U(S\rightarrow C)\), is the institution benchmark for admission into the aforesaid courses in PF values. The data are in Table 3.

We now find the indeterminate degree, \(\pi \), for each applicants against the courses. The value of \(\pi \) is the marks loss due to the hesitation in answering within a stipulated time. It is gotten by \(\sqrt{1-[\mu ^2+\nu ^2]}\). The values of \(\pi \) enable us to calculate T.

Decision-making on course/career placements

We present two forms of decision-making, viz: (1) horizontal decision with respect to applicant against courses, and (2) vertical decision with respect to course against applicants. Decisions are made based on the greatest value of relation between applicants and courses.

In accordance to the institution’s benchmark for admission and applicants’ performance in the qualification examination within a stipulated time, we make the following decisions from Table 5.

Horizontal decision This decision-making is based on relation/suitability of the applicants to the list of courses.

  • Ada is suitable to study any of medicine, pharmacy, anatomy, and physiology.

  • Ene is suitable to study any of medicine, pharmacy, and anatomy.

  • Ehi is suitable to study either medicine or pharmacy.

  • Ebo is suitable to study only pharmacy.

  • Ela is more suitable to study any of the courses; Ada is suitable to study.

Vertical decision Vertical decision is centered on relation/suitability and competition. It is noticed that:

  • medicine is suitable to be studied by Ela (0.7408) and Ene (0.6293);

  • pharmacy is suitable to be studied by Ela (0.7408) and Ebo (0.6869);

  • surgery is suitable to be studied by Ela (0.6869) and any of Ebo (0.5056), Ehi (0.5056), and Ene (0.5056);

  • anatomy is suitable to be studied by Ela (0.7408) and Ene (0.6293);

  • physiology is suitable to be studied by Ela (0.7408), Ebo (0.5629), and Ene (0.5629).

Table 5 \(T=\mu _T-\nu _T \pi _T\)

Observations

The following observations are deducible from the decisions above.

  1. (i)

    Vertical decision is the most reliable, because it considers suitability/relation and mental ability, and it is competitive.

  2. (ii)

    Ela is the most brilliant applicant with the ability to study all the courses ahead of the other applicants in the order: medicine (0.7408), pharmacy (0.7408), anatomy (0.7408), physiology (0.7408), and surgery (0.6869).

  3. (iii)

    Ene has the ability to study the following courses in the order: medicine (0.6293), anatomy (0.6293), physiology (0.5629), and surgery (0.5056).

  4. (iv)

    Ebo has the ability to study the following courses in the order: pharmacy (0.6869), physiology (0.5629), and surgery (0.5056).

  5. (v)

    Ehi has the ability to study only surgery (0.5056) with the same ability as Ene and Ebo.

  6. (vi)

    Ada is not suitable to study any of the courses in a competitive environment.

From the aforesaid discussion, it is meet to assert that the max–min–max composition approach explored in this study is very suitable and decisive, especially in a critical decision-making problem like career placements. In fact, without this approach, this exercise would have been compromised with a consequent effect on performance and efficiency.

Conclusion

The notion of Pythagorean fuzzy sets is a relatively novel mathematical framework in the fuzzy family with higher ability to cope imprecision imbedded in decision-making. In this paper, we have studied the concept of PFS more expressly with relevant illustrations, where necessary. Some important remarks were drawn which differentiated PFSs from IFSs. It was observed that every IFS is PFS, but the converse is not always true. Some theorems on PFSs were deduced and proved, especially on the ideas of score and accuracy functions. We also extended the concept of relation to PFSs, called PF relation (or PFR), and illustrated the concept using numerical examples. Finally, an application of PFSs was explored on course placements based on academic performance using the proposed composition relation.

The max–min–max composition introduced in this paper could be used as a viable tool in applying PFSs to MCDM problems, MADM problems, pattern recognition problems, etc. Notwithstanding, it is suggestible to consider this approach from object-oriented perspective for quick output in further research. In addition, some theoretic notions of PFSs and PF relation could still be exploited, and the concept of PFSs could be applied to solve more real-life problems imbedded with imprecision.