Generalized plithogenic whole hypersoft set,PFHSS-Matrix,operators and applications as COVID-19 data structures

Abstract

This article is a preliminary draft for initiating and commencing a new pioneer dimension of expression. To deal with higher-dimensional data or information flowing in this modern era of information technology and artificial intelligence, some innovative super algebraic structures are essential to be formulated. In this paper, we have introduced such matrices that have multiple layers and clusters of layers to portray multi-dimensional data or massively dispersed information of the plithogenic universe made up of numerous subjects their attributes, and sub-attributes. For grasping that field of parallel information, events, and realities flowing from the micro to the macro level of universes, we have constructed hypersoft and hyper-super-soft matrices in a Plithogenic Fuzzy environment. These Matrices classify the non-physical attributes by accumulating the physical subjects and further sort the physical subjects by accumulating their non-physical attributes. We presented them as Plithogenic Attributive Subjectively Whole Hyper-Super-Soft-Matrix (PASWHSS-Matrix) and Plithogenic Subjective Attributively Whole-Hyper-Super-Soft-Matrix (PSAWHSS-Matrix). Several types of views and level-layers of these matrices are described. In addition, some local aggregation operators for Plithogenic Fuzzy Hypersoft Set (PPFHS-Set) are developed. Finally, few applications of these matrices and operators are used as numerical examples of COVID-19 data structures.

1 Introduction

Classical mathematics and its applications are based on certain laws and results, while they can be observed in everyday life. When the human mind makes decisions about scientific, philosophical, or economic facts, it is not 100% sure of its results. The natural human brain exhibits a certain uncertainty factor and precariousness in its judgments and conclusions due to different opinions about attributes, events, and information. Therefore, to manage this vagueness in the study of mathematics In 1965 Zadeh [1] introduced fuzzy mathematics. In the theory of fuzzy mathematics, all laws and results are discussed by considering some degree of certainty or truth (membership) and some degree of uncertainty or the opposite of truth (non-membership), so that the combined effect of membership and non-membership is considered complete. That means if membership value of any element x ∈ X with respect some attribute A is represented by, μ _A  (x) ∈ [0, 1] , ∀ x ∈ X and non-membership is represented by υ _A  (x) ∈ [0, 1] , ∀ x ∈ X such that μ _A  (x) + υ _A  (x) =1, ∀ x ∈ X, then the general representation of a fuzzy set is {x : μ _A  (x)}.

In 1986 Atanassov developed the Intuitionistic Fuzzy Set Theory (IFS) [2, 3]. In IFS theory, Atanassov expanded the vagueness of the human mind by addressing the doubt which arises in assigning membership and non-membership. The doubt which is evoked in decision making was quantified by using linguistic scales and expressed by assigning a numeric value between “0” and “1". Atanassov named this doubt the level of hesitation that was measured by assigning a degree to the hesitation denoted by ι _A  (x) ∈ [0, 1] ∀ x ∈ X. The elements of IFS are expressed as {x : (μ _A  (x) , υ _A  (x))} with a modified condition μ _A  (x) + υ _A  (x) + ι _A  (x) = 1,  ∀ x ∈ X. It is observed that the degree of hesitation of IFS is a dependent factor. Smarandache further expanded the Cloud of vagueness by introducing Neutrosophic Set [4–6]. He introduced indeterminacy and considered the degrees of membership, non-membership, and hesitation/indeterminacy as independent factors. These three factors are represented in a unit cube with the non-standard unit interval ] 0^-,1⁺]. The neutrosophic set was represented as {x : (μ _A  (x) , υ _A  (x) , ι _A  (x))} with modified condition 0 ⩽ (μ _A  (x) + υ _A  (x) + ι _A  (x) ⩽ 3. Some further latest dilation and modernization of neutrosophic set are portrayed in [7–12]. In 1999, Molodtsov introduced the soft set [13], where he represented the elements of this set as a parameterized family of the subset of the universal set and thereafter some of the further extensions of the soft set were discussed in, [14–16].

Later, in 2018, Smarandache [17, 18] introduced Hypersoft set and plithogenic hypersoft set. In these sets he transformed the function of a single attribute into a multi-attribute/sub-attribute function and assigned a combined membership μ_{A1×A2×…×A N}  (x), non-membership υ_{A1×A2×…×A N}  (x), and Indeterminacy ι_{A1×A2×…×A N}  (x) , ∀ x ∈ X with condition A _i  ∩ A _j  = φ for the case of hypersoft set. Whereas individual memberships non-memberships and indeterminacies were assigned for each given attribute for the case of the plithogenic Hypersoft-Set. And introduced hybrids of Crisp/Fuzzy/Intuitionistic Fuzzy and Neutrosophic Hypersoft-Set and Plithogenic Hypersoft-Set. By introducing these sets he raised many open problems for the development of new literature, such as the development of appropriate modern algebraic structures for expressing such widely dispersed higher-dimensional information and the formulation of MADM techniques.

In 2019 Rana et al. [19] extended the Plithogenic Hyper-Soft Set to Plithogenic Whole-Hyper-Soft Set and introduced a new path of organized expression as hypersoft-matrix and Hyper-super-soft-matrix and formulated some local aggregation operators. When these local operators were applied to the Plithogenic Fuzzy Hyper-Soft Set (PFHSS), a new type of soft set emerged called the Plithogenic Fuzzy Whole Hyper-Soft Set (PFWHSS). In addition, the Plithogenic Fuzzy Hyper-Soft Set and the Plithogenic Fuzzy Whole Hyper-Soft Set were presented as a modern extended matrix in the fuzzy environment called Plithogenic Fuzzy Hyper-Soft Matrix (PFHS-Matrix) and Plithogenic Fuzzy Whole Hyper-Soft Matrix. These Hypersoft Matrices are made up of the parallel layers of ordinary matrices that represent parallel universes, parallel realities, parallel events, or parallel information.

In the next phase, Rana et al. [20] further generalized the Plithogenic Whole Hyper-Soft Set to Plithogenic Crisp/Fuzzy/Intuitionistic/Neutrosophic Subjective Hyper-Soft Set and represented it in the expanded version of Soft-Matrix in the fuzzy environment known as the plithogenic subjective hyper-super-soft matrix. Furthermore, these modern matrix expressions were used to develop a new higher dimensional ranking model called the Local-Global Universal Subjective Ranking Model. It is also revealed that the Plithogenic Whole Hyper-Soft Matrix (PWHS Matrix) is a special case of the Plithogenic Subjective Hyper-Super-Soft Matrix (PSHSS Matrix). Additional literature on Hyper-Soft Set and Plithogency can be found in [21–26].

This article, structured as, Section 2, describes materials such as some new concepts of the expanded plithogenic universe, such as universal collective consciousness, clustered data of the accelerated universe, and some Preliminaries. Section 3 contains a brief description of the Generalized Plithogenic Fuzzy Whole HyperSoft and its novelties with some basic concepts and new definitions of Plithogenic Hypersoft Set/Matrix, index-based views of parallel matrix layers. Section 4 describes the development of local aggregation operators for PFHSS matrix. Section 5 presents the construction of hyper-supersoft matrices and their application as COVID-19 data structures. Section 6 mentions conclusions, discussions, and some open questions for future research.

2 Materials, methods, and preliminaries

In this article, on the first level, we have expanded the previously presented Plithogenic Fuzzy Whole HyperSoft Set and Plithogenic Subjective HyperSoft Set [19, 20] to Plithogenic Attributive Subjectively Whole HyperSoft Set (PASWHS Set) and Plithogenic Subjective Attributively Whole HyperSoft Set (PSAWHS Set). To represent these newly introduced hypersoft sets, a new type of matrix structure of connected matrix layers (hypersoft matrix) and connected clusters of matrix layers (hyper-super-soft matrix) is designed. These super-algebraic matrix structures are initially formulated in a fuzzy environment named the Plithogenic Attributive Subjectively Whole Hyper-Super-Soft-Matrix (PASWHSS-Matrix) and the Plithogenic Subjective Attributively Whole-Hyper-Super-Soft-Matrix (PSAWHSS-Matrix). These advanced types of matrices are generated by the hybridization of hyper matrices, super matrices, and soft matrices [13–20, 24–27]. These hypersoft matrices are sets/clusters of connected parallel matrix layers that represent clusters of parallel universes, parallel realities, Parallel events, or parallel information (a combination of attributes and sub-attributes relating to subjects). Furthermore, these modern matrices are rank three and four tensors with three and four variation indices, respectively. Later on, various types of cross-sectional sights are described as parallel layers of hypersoft matrices. These cross-sectional sights are formulated by taking multiple variations in numerous ways and exhibit some symmetries in their structures regarding their number of rows and columns. Furthermore, some aggregation operators are structured. Application of these aggregation operators and Hyper-Super-Soft Matrices are provided as COVID-19 Data structures.

Now comes the query, “Why do we use HyperSoft and Hyper-Super-Soft matrices specifically for the expression of Plithogenic HyperSoft Set, Plithogenic Subjective HyperSoft Set, and Plithogenic Attributive HyperSoft Set?” The answer described in (2.1–2.3), and (3.1.1–3.1.5) could certainly be convincing.

2.1 Expanded plithogenic universe

This Plithogenic Universe is so huge and expanded in its interior (like having Fuzzy, Intuitionistic Fuzzy, Neutrosophic environments with Memberships, Non-Memberships, and Indeterminacies) and its exterior (manages many attributes, sub-attributes and might be sub-sub-attributes concerning to its subjects). To organize and analyze the dispersed information of such an expanded plithogenic universe we are in great need to formulate some super algebraic structures like these hyper-super-soft matrices.

2.2 Universal collective consciousness

Imagine you are a part of a lot of information, events, realities that are constantly flowing all around you. Like everything you see, everything you look at, everything you observe, is in a parallel view. By the way, we are all observing from a different angle so we all are getting a different piece of information, event, or a reality. Because of this connectedness with this universe and its universal attributes, we are actually collectively producing diversity in this flow of information, events, thoughts, and even realities (i.e., Universal Data, Universal Space, Universal Events, Universal Consciousness). That is why this universe is giving different sets of information and numerous interpretations of the same thing (Subject, Attributes, Sub-Attributes, Sub-Sub-Attributes Collectively All as Consciousness). We are gathering this information in terms of observing different events, realities, universes as one reality and not as parallel realities, and thus, we are feeding them back to space through our brain structure into the atomic structure and into the vacuum state though they are underlying numerous angles, thoughts, events, visions, etc. In the end, this universal feedback returns and changes those attributes, events a little bit different from each other and makes parallel realities for which we have no expressions. Therefore, these hypersoft and hyper-super-soft matrices are initiatives towards a way of expression for the Universal Collective Consciousness.

2.3 Clustered Data of accelerated universe

In order to find and pave the way for the expression of those parallel realities for such a massively accelerated huge universe. This is, of course, not viable through using regular algebra or matrices therefore, for the handling of this expanded universe along with its clustered and littered data, we are in dire need to construct like super-algebra or hypersoft and hyper-super-soft matrices and likely many more.

2.4 Preliminaries

This section describes some basic definitions of Soft-Sets, Fuzzy-Soft-Sets, Hypersoft-Sets, Fuzzy-Hypersoft-Sets, Plithogen-Hypersoft-Sets, and Plithogen-Fuzzy-Hypersoft-Sets, etc. These definitions are useful in developing literature and widely dispersed data modeling structures.

Definition 2.4.1 [13](Soft Set)

Let U be the initial universe of discourse, and E be a set of parameters or attributes with respect to U let P (U) denote the power set of U, and A ⊆ E is a set of attributes. Then pair (F, A), where F : A→ P (U) is called Soft Set over U. Fore e ∈ A, F (e) may be considered as a set of e elements or e approximate elements $\left(F,A\right)=\left\{\begin{array}{c}\hfill \left(F\left(e\right)\in P(U\right):\hfill \\ \hfill e\in E,F\left(e\right)=\phi \mathit{ife}\notin A\hfill \\ \hfill \hfill \end{array}\right\}$(2.1)

Definition 2.4.2 [1] (Fuzzy set)

Let U be the universe. A fuzzy set X over U is a set defined by a membership function μ _X representing a mapping μ _X  : U → [0, 1]

The value of μ _X  (x) for the fuzzy set X is called the membership value of the grade of membership of x ∈ U. The membership value represents the degree of belonging to fuzzy set X. A fuzzy set X on U can be expressed as follows. $X=\left\{\left({\mu }_X\left(x\right)/x\right):x\in U,{\mu }_X\left(x\right)\in \left[0,1\right]\right\}$(2.2)

Definition 2.4.3 [14] (Fuzzy soft set)

Let U be the initial universe of discourse, F (U) be all fuzzy sets over U. E be the set of all parameters or attributes with respect to U and A ⊆ E is a set of attributes. A fuzzy soft set Γ _A on the universe U is defined by the set of ordered pairs as follows, ${\Gamma }_A=\left\{x,{\gamma }_A\left(x\right):x\in E,{\gamma }_A\left(x\right)\in F\left(U\right)\right\}$(2.3) where γ _A  : E→ F (U) such that γ _A  (x) = φ if x ∉ A ${\gamma }_A\left(x\right)=\left\{{\mu }_{{\gamma }_A\left(x\right)}\left(u\right)/u:u\in U,{\mu }_{{\gamma }_A\left(x\right)}\left(u\right)\in \left[0,1\right]\right\}$

Definition 2.4.4 [17] (HyperSoft Set)

Let U be the initial universe of discourse P (U) the power set of U let a₁, a₂, …, a _n for n ⩾ 1 be n distinct attributes, whose corresponding attributes values are respectively the sets A₁, A₂, …, A _n with A _i  ∩ A _j  = φ for i ≠ j and i, j∈ { 1, 2, …, n }.

Then the pair (F, A₁ × A × ⋯ × A _n ) where, $F:A_1\times A\times \cdots \times A_n\to P\left(U\right),$(2.4) is called a Hypersoft set over U

Definition 2.4.5 [17] (Crisp Universe of Discourse)

A Universe of Discourse U _C is called Crisp if ∀x ∈ U _c x∈ 100 % to U _C or membership of x T (x) with respect to A in M is 1 denoted as x (1).

Definition 2.4.6 [17] (Fuzzy Universe of Discourse)

A Universe of Discourse U _F is called Fuzzy if ∀x ∈ U _C x partially belongs to U _F or membership of x T (x) ⊆ [0, 1] where T (x) may be a subset, an interval, a hesitant set, a single value set, denoted as x T (x).

Definition 2.4.7 [17] (Crisp Hypersoft-Set set)

Let U _c be the initial universe of discourse P (U _c ) the power set of U.

let a₁, a₂, …, a _n for n ⩾ 1 be n distinct attributes, whose corresponding attributes values are respectively the sets A₁, A₂, …, A _n with A _i  ∩ A _j  = φ for i ≠ j and i, j∈ { 1, 2, …, n }, Then the pair, {(F _c , A₁ × A × … × A _n ) s . t $F_c:A_1\times A\times \cdots \times A_n\to P\left(U_c\right)\},$(2.5) is called Crisp Hypersoft set over U _c

Definition 2.4.8 [17] (Fuzzy Hypersoft set)

Let U _F be the initial universe of discourse P (U _F ) the power set of U _F .

let a₁, a₂, …, a _n for n ⩾ 1 be n distinct attributes, whose corresponding attributes values are respectively the sets A₁, A₂, …, A _n with A _i  ∩ A _j  = φ for i ≠ j and i, j∈ { 1, 2, …, n }.

Then the pair

{ (F _F , A₁, A₂, …, A _n ), s.t $F_F:A_1\times A\times \cdots \times A_n\to P\left(U_F\right)\}$(2.6) is called Fuzzy Hypersoft set over U _c .

Special cases of Hypersoft set: Crisp, Fuzzy, Intuitionistic Fuzzy and Neutrosophic sets are special cases of Hypersoft set by taking N = 1 in the Combination of N attributes A₁ × A₂ × ⋯ × A _N .

Definition 2.4.9 [17] (Plithogenic, Crisp, Fuzzy, Intuitionistic Fuzzy, and Neutrosophic Hypersoft Set)

Now instead of assigning combined membership μ _{A 1×A2×⋯× A N}  (x) ∀x ∈ X for Hypersoft sets if each attribute A _j is assigned an individual membership μ _{A j}  (x), non-membership υ _{A j}  (x) and Indeterminacy ι _{A j}  (x) ∀ x ∈ X j = 1, 2, …, n in Crisp, Fuzzy, Intuitionistic and neutrosophic Hypersoft set then these generalized Crisp, Fuzzy, Intuitionistic and Neutrosophic Hypersoft sets are called Plithogenic, Crisp, Fuzzy, Intuitionistic Fuzzy and Neutrosophic Hypersoft Set.

Definition 2.4.10 [27, 28] (Super Matrices)

A Square or rectangular arrangements of numbers in rows and columns are matrices we shall call them simple matrices while a Super-Matrix is one whose elements are themselves matrices with elements that can be either scalars or other matrices.

$a=\left[\begin{array}{cc}\hfill a_{11}\hfill & \hfill a_{12}\hfill \\ \hfill a_{21}\hfill & \hfill a_{22}\hfill \\ \hfill \hfill \end{array}\right]$ , where

$a_{11}=\left[\begin{array}{cc}\hfill 2\hfill & \hfill -4\hfill \\ \hfill 0\hfill & \hfill 1\hfill \\ \hfill \hfill \end{array}\right]$ , $a_{12}=\left[\begin{array}{cc}\hfill 0\hfill & \hfill 40\hfill \\ \hfill 21\hfill & \hfill -12\hfill \\ \hfill \hfill \end{array}\right]$ ,

$a_{21}=\left[\begin{array}{cc}\hfill 3\hfill & \hfill -1\hfill \\ \hfill 5\hfill & \hfill 7\hfill \\ \hfill -2\hfill & \hfill 9\hfill \\ \hfill \hfill \end{array}\right]$ , $a_{22}=\left[\begin{array}{cc}\hfill 4\hfill & \hfill 12\hfill \\ \hfill -17\hfill & \hfill 6\hfill \\ \hfill 3\hfill & \hfill 7\hfill \\ \hfill \hfill \end{array}\right]$ a is a super-matrix.

Note: The elements of super-matrices are called sub-matrices i.e. a₁₁, a₁₂, a₂₁, a₂₂ are submatrices of the super-matrix a in this example, the order of super-matrix a is 2 × 2, and the order of sub-matrices a₁₁ is 2 × 2, a₁₂ is 2 × 2 a₂₁ is 3 × 2 and order of sub-matrix a₂₂ is 3 × 2, we can see that the order of super-matrix doesn’t tell us about the order of its sub-matrices.

Definition 2.4.11 [29, 30] (Hyper-matrices)

For n₁, …, n _d ∈N, a function, $f:\left(n_1\right)\times \cdots \times \left(n_d\right)\to F$(2.7) is a hyper-matrix, also called an order-d hyper-matrix or d-hyper-matrix. We often just write a_{k1…k d}

to denote the value f (k₁ … k _d ) of f at (k₁ … k _d ) and think of f (renamed as A) as specified by a d-dimensional

table of values, writing $A={\left[a_{k_1\dots k_d}\right]}_{k_1\dots k_d}^{n_1,\dots ,n_d}$

A 3-hypermatrix would be written down on a (2-dimensional) piece of paper as a list of usual matrices, called slices. For example, $A=\left[\begin{array}{ccccccc}\hfill a_{111}\hfill & \hfill a_{121}\hfill & \hfill a_{131}\hfill & \hfill .\hfill & \hfill a_{112}\hfill & \hfill a_{122}\hfill & \hfill a_{132}\hfill \\ \hfill a_{211}\hfill & \hfill a_{221}\hfill & \hfill a_{231}\hfill & \hfill .\hfill & \hfill a_{212}\hfill & \hfill a_{222}\hfill & \hfill a_{232}\hfill \\ \hfill a_{311}\hfill & \hfill a_{321}\hfill & \hfill a_{331}\hfill & \hfill .\hfill & \hfill a_{312}\hfill & \hfill a_{322}\hfill & \hfill a_{332}\hfill \\ \hfill \hfill \end{array}\right]$(2.8)

3 Generalized plithogenic fuzzy whole hypersoft set

In this section, some new concepts and definitions are described that would be utilized for the development of Generalized Plithogenic Fuzzy Whole Hyper-soft Set as PFASWHSS-Matrix and. PFSAHSS-Matrix. This literature is organized in three subsections in the following manner.

A brief description of the Generalized Plithogenic Fuzzy Whole Hyper-soft Set is presented and its novelties are discussed.

Some new concepts/definitions relevant to the Plithogenic hypersoft set are developed.

The index-based views of PFHS-Matrix are described through variation indices

3.1 Generalized Plithogenic Fuzzy Whole Hyper-Soft Set and its Novelties

3.1.1 Matrix of connected matrix-layers

The clusters of connected matrix layers that we will introduce in this article are the expanded versions of the previously presented [19] Plithogenic Fuzzy Whole HyperSoft Set (PFWHS Set). In PFWHS-Set the aggregation operators and the Plithogenic Frequency Matrix Multi-Attribute Decision Making Technique have been developed for a single required combination of attributes/sub-attributes related to some given subjects. While in the new generalized versions of connected matrix layers, the aggregation operators and ranking models are not only developed for a single combination of attributes/sub-attributes rather, these operators and ranking models are extended to several parallel-connected layers of combinations of attributes/sub-attributes related to the given subjects.

For the development of this ranking model (FMMADM-Model), a novel type of Hyper-Soft and Hyper- Super-Soft Matrices are introduced. These special types of matrices would organize and utilize the widely expanded higher dimensional dispersed information. This information consists of several attributes, sub-attributes, and subjects that are connected by the cluster of matrix layers. These clusters of matrix layers are formulated as Hypersoft and Hyper-Super-Soft matrices. To preserve the expansion of the article inside the required limits of this journal, all of the expanded literature is first presented in the fuzzy environment.

In this version, some new definitions and concepts of the Generalized Plithogenic Fuzzy whole hypersoft set are developed. In addition, their representation is organized as hypersoft, and hyper-super-soft matrix. After the formulation of these hypersoft matrices, some aggregation operators are developed as the set laws of operations for these matrices. The application of these aggregation operators and the Hyper-Super-Matrix as a ranking model for the organization and classification of the conditions of COVID-19 patients will be presented later. This ranking model is called the classification model for COVID-19 states.

3.1.2 Multi-dimensional mathematical ways of expression

One novelty of this model is modern multi-dimensional mathematical form of expression. It is observed that from the fuzzy set to its extended versions such as intuitionistic, neutrosophic, and other extended fuzzy sets. The membership, non-membership, and indeterminacy were assigned to a specific element or subject concerning to its specific attribute. While in generalized plithogenic Whole-Hypersoft-Set, the fuzzy memberships were assigned to several subjects (elements of the universe) concerning their numerous attributes /sub-attributes separately as individual fuzzy memberships and at the same time collectively as whole fuzzy memberships. If these whole fuzzy memberships are constructed to accumulate information subject-wise for several subjects and being displayed for each attribute, then it is subjectively a whole hype-super-soft matrix. And if these whole fuzzy memberships are constructed to accumulate information attribute-wise for several given attributes while being displayed for each subject it is the case of attributively whole hyper-super-soft-matrix. In addition, this individual and collective information is organized in certain required time levels. Therefore, these hyper-super-soft matrices offer the viewer multiple inspecting expression options by observing many subjects with their numerous attributes/sub-attributes on multiple time levels and expressing their individual and collective states in many environments with different levels of ambiguity. For example, one possibility is to express individual and collective states/information in a crisp environment. This means expressing two opposing states of mind, either true (yes) or false (no). Another expression is the fuzzy environment, which contains some doubts about two opposite states, or an intuitionistic environment an expression with expanded doubts, or a neutrosophic environment that includes indeterminacy. Or some kind of combined environment that expresses different states of mind in one expression. Therefore, this novel form of expression and its mathematical structures are introduced to deal with higher-dimensional data/information/states of subjects by observing them through several angles of vision. The model of this article will first be expressed in the fuzzy environment in order to maintain the length restrictions of the article, further extended expressions will be introduced in future articles. To illustrate these multi-vision expressions, consider that a field is visited with several types of flowers, and it is observed that each type of flower has some specific beneficial properties (attributes) and property levels (sub-attributes) When, for a certain type of flower, its collective level of utility is expressed in a statement taking into account all attributes and expressed as a numerical value using fuzzy linguistic scales. It is a form of the whole expression (case of an attributively whole Hyper-Supersoft-Matrix). When, for a particular type of flower, the utility for each property (attribute) is expressed as a single statement or as a numerical value using fuzzy linguistic scales. It is another form of expression called individual expression (in the case of the Hypersoft Matrix) and the choice of environment will represent the state of mind of the observer or decision-maker.

3.1.3 Whole dilated and compact vision of the shattered information

This mathematical model describes such novel expressions (originally constructed in the plithogenic fuzzy environment) through the formulation and use of accumulated fuzzy memberships. This means that the entire vision of the scattered information/states/universe could be represented as a single numerical value (whole fuzzy membership) that offers a compact view of information/events/universe. Whereas the detailed insight view of the information/events/universe is indicated by certain numerical values that are called individual fuzzy memberships

3.1.4 Higher-dimensional Matrix with multi-layers and clusters of layers

To organize and analyze all relations between several subjects, their attributes (subject states), and sub-attributes (levels of states of subjects) by considering their individual and collective states and then expressing them in a single mathematical structure was not possible by using the classical algebra of ordinary matrices. To represent such higher dimensional information, some super algebraic structures like these hyper super matrices had to be constructed. These hyper-super-matrices can absorb such multidimensional information by using their multilayered structures. These higher dimensional matrices with multiple layers and clusters of layers are another novelty that is being introduced into matrix theory for the first time.

3.1.5 New framework of modeling

In this article, we have developed a new modeling framework that can not only organize the high dimensional numerical data/information, but rather would accept information in any form and transform it into the required mathematical form through linguistic scales. It would also expand or contract the information through the use of established operators. The elements of classical matrices are usually numbers and they follow the classical rules of addition, multiplication, or inversion, rather these modern high-dimensional matrix structures would interact through the modern flexible laws of Set theory such as soft set theory or extended fuzzy set theory, etc. These matrices would interact within the matrix through Local Operators which will be developed in this article. They would also interact outside the matrix through global operators that would be introduced in the next upcoming versions.

3.2 Definitions and concepts of GPFWHSS

In order to develop a better understanding of the literature, some new definitions and concepts are presented below.

Let’s consider a brief description of the mathematical terms and expressions used to develop the model.

Definition 3.2.1 (Universe of discourse):

U _F (X) ={ x _i  } is the fuzzy universe of discourse where x _i , i = 1, 2, …, M represents the number of subjects (elements of the universe). The subject can be perceived as a physical entity that is being discussed.

Definition 3.2.2 (Attributes): A _j j = 1, 2, …, N are N number of attributes under consideration. These are the states of subjects i.e. characteristics or behaviors associated with the elements of the set (physical subjects).

Definition 3.2.3 Sub-Attributes: $A_j^k$ j = 1, 2, …, N k = 1, 2, …, L where j represents the given number of attributes (states of matter-bodies or subjects) and each attribute is categorized into a number of levels, which are referred to as sub-attributes (substates of subjects). Attributes or sub-attributes are considered to be non-physical aspects of the physical bodies (subjects) under consideration.

Definition 3.2.4 ( Plithogenic Fuzzy HyperSoft-Matrix (PFHS-Matrix)):

Let U_F be the Fuzzy universe of discourse, P (U _F ) be the power set of U_F, A _j^k is a combination of attributes/Sub-Attributes for some j = 1, 2, 3, …, N Attributes, k = 1, 2, 3, …, L Sub-Attributes and x _i i = 1, 2, 3, …, M subjects under consideration then PFHS-Matrix, is a mapping F from the cross product of attributes/sub-attributes on the power set P (U _F ) represented in matrix form. This mapping with its matrix form in the plithogenic fuzzy environment is described in Equation 3.1 or Equation 3.2 respectively. $F:A_1^k\times A_2^k\times A_3^k\times \cdots \times A_N^k\to P\left(U_F\right)$(3.1) $F=\left[{\mu }_{A_j^k}\left(x_i\right)\right]$(3.2) s.t ${\mu }_{A_j^k}\left(x_i\right)+{\upsilon }_{A_j^k}\left(x_i\right)=1$ , ${\mu }_{A_j^k}\left(x_i\right)\in \left[0,1\right],{\upsilon }_{A_j^k}\left(x_i\right)\in \left[0,1\right]$

${\mu }_{A_j^k}\left(x_i\right)$ and ${\upsilon }_{A_j^k}\left(x_i\right)$ are fuzzy memberships and non-memberships for the given x _i subjects regarding each given $A_j^k$ attributes/sub-attributes where, $A_j^k$ is a combination of attributes/sub-attributes for some j = 1, 2, 3, …, N attributes, k = 1, 2, 3, …, L sub-attributes associated to x _i i = 1, 2, 3, …, M subjects under consideration. These fuzzy memberships are assigned by the relevant committees for the piece of universe/reality/event/information.

The expanded form of F is described, in Equation 3.3 $\begin{array}{cc}\hfill & A_1^k{A}_2^k\dots A_N^k\hfill \\ \hfill & F=\begin{array}{c}\hfill x_1\hfill \\ \hfill x_2\hfill \\ \hfill .\hfill \\ \hfill .\hfill \\ \hfill .\hfill \\ \hfill x_M\hfill \\ \hfill \hfill \end{array}\left[\begin{array}{cccccc}\hfill {\mu }_{A_1^k}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_1\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^k}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_2\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N}\left(x_2\right)\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill {\mu }_{A_1^k}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_M\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \end{array}$(3.3)

Example 1 (PFHS-Set and PFHS-Matrix expressions)

Let mapping F be defined as $F:A_1^k\times A_2^k\times A_3^k\times \cdots \times A_N^k\to ,P\left(U_F\right)$

(Taking some specific numeric values of $A_j^k$ )

Consider T ={ x₁, x₂, x₃ }, is a subset of P (U _F ) where x₁, x₂, x₃ represent x _i subjects under consideration with $A_j^k$ attributes/sub-Attributes for j = 1, 2, 3, 4 and k = 3, 1, 1, 2. The fuzzy memberships would be assigned to x₁, x₂, x₃ for the $A_1^3,A_2^1,A_3^1,A_4^2$ , attributes/sub-attributes i.e. a particular α-combination of attributes by the concerned bodies by using the linguistic five-point scale method see Ref. [31–34]. These plithogenic fuzzy memberships are the elements PFHS-Set represented as below, $F_{\alpha }\left(A_1^3,A_2^1,A_3^1,A_4^2\right)=F\left(\alpha \right)$ $=\left\{\begin{array}{c}\hfill x_1\left(0.3,0.6,0.5,0.5\right),\hfill \\ \hfill x_2\left(0.4,0.4,0.3,0.1\right),\hfill \\ \hfill x_3\left(0.6,0.3,0.4,0.7\right)\hfill \\ \hfill \hfill \end{array}\right\}$(3.4)

A more organized form of this PFHS-Set is expressed as a single layer of the PFHS-Matrix $F_{\mathit{ij}}^{\alpha }$ , $\left[A_1^3,A_2^1,A_3^1,A_4^2\right]$ $F_{\mathit{ij}}^{\alpha }=\begin{array}{c}\hfill x_1\hfill \\ \hfill x_2\hfill \\ \hfill x_3\hfill \\ \hfill \hfill \end{array}\left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.4\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.4\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]$(3.5)

Where $A_1^3{A}_2^1$ $A_3^1{A}_4^2$ is a specific combination of Attributes/Sub-Attributes associated with subjects x₁, x₂, x₃ and $F_{\mathit{ij}}^{\alpha }$ represents a single layer out of several possible layers of PFHS-Matrix. For further detailed descriptions and applications, see ref [19].

Example 2. Consider the example of Plithogenic Fuzzy HyperSoft matrix $F=\left[{\mu }_{A_j^k}\left(x_i\right)\right]$ for = 1, 2, 3, j = 1, 2, 3, 4 and, k = 1 (the first level layer) k = 2, (the second level layer). The fuzzy memberships that are assigned by the concerned bodies for the Part of universe/reality/event for Hypersoft Set are described as, let T ={ x₁, x₂, x₃ } be the set of three Subjects under consideration in PFHS-Set with respect to the given attribute. The fuzzy memberships are assigned by the concerned bodies using the five-point linguistic scale method [19–22]. These fuzzy memberships are assigned regarding each attribute $A_{\mathrm{j}}^{\mathrm{k}}$ at each level and are described underneath as PFHS-Set, $F\left(A_1^1,A_2^1,A_3^1,A_4^1\right)=\left\{\begin{array}{c}\hfill x_1\left(0.3,0.6,0.3,0.5\right),\hfill \\ \hfill x_2\left(0.4,0.5,0.2,0.1\right),\hfill \\ \hfill x_3\left(0.6,0.2,0.3,0.7\right)\hfill \\ \hfill \hfill \end{array}\right\}$(3.6) $F\left(A_1^2,A_2^2,A_3^2,A_4^2\right)=\left\{\begin{array}{c}\hfill x_1\left(0.5,0.4,0.2,0.6\right)\hfill \\ \hfill ,x_2\left(0.5,0.7,0.8,0.4\right),\hfill \\ \hfill x_3\left(0.7,0.6,0.5,0.9\right)\hfill \\ \hfill \hfill \end{array}\right\}$(3.7)

This information from the PFHS-Set is organized in the form of PFHS-Matrix F as, $\text{F}=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.2\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.4\hfill & \hfill 0.2\hfill & \hfill 0.6\hfill \\ \hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.8\hfill & \hfill 0.4\hfill \\ \hfill 0.7\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.9\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.8)

Detailed descriptions and applications can be found in Ref [20].

Definition 3.2.5 (Individual fuzzy memberships): Elements of PFHS-Matrix ${\mu }_{A_j^k}\left(x_i\right)$ represents Individual fuzzy memberships these memberships are individual fuzzy states of subjects given for each attribute i.e. fuzzy membership of a certain x _i -subject say for i = m, concerning to each $A_j^k$ attribute/sub-attribute. The elements of the Matrix $F_{\mathit{ij}}^{\alpha }$ and Matrix F in Equations (3.12) represent the individual fuzzy memberships. These Individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ are used to represent the inside view of the universe/reality/event/information as individual memberships.

Definition 3.2.6 (Whole fuzzy membership): Whole fuzzy memberships are accumulated states of subjects. Whether accumulated by subject or attribute. For example, if the individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ are accumulated for a given combination of attributes $A_j^k$ j = 1, 2, …, N and represented with respect to a certain subject x _i for some i = m, then they are called Whole Fuzzy Membership. The individual fuzzy memberships are accumulated to see the combined effect (e.g. average degree of membership) of the elements (subjects) with respect to a particular combination of attributes/sub-attributes. These are two types of whole fuzzy membership i.e.

Attributively-Whole Fuzzy Memberships.

Subjectively-Whole Fuzzy Memberships.

Definition 3.2.7 (Attributively-Whole Fuzzy Membership): Attributively-Whole Fuzzy Membership represents such fuzzy memberships that are accumulated (attribute-wise) along the rows of PFHS-Matrix by using any aggregation operator (t) represented by Ω _{A ^l}  (x _i ). These memberships are obtained by accumulating all given states (attributes) of a certain subject for a fixed sub-attribute level l. and represented with respect for a certain subject. The Whole Fuzzy Memberships ${\Omega }_{{\text{A}}^k}^t\left(x_{\mathrm{i}}\right)$ used to represent the subject-wise exterior view of the universe/reality/event/information revealing the attributive wholeness. For example the whole memberships ${\Omega }_{{\text{A}}^1}^t\left(x_1\right)$ given in Equation (3.9) represents subjectively-whole fuzzy memberships for the first subject with respect to all given attributes of first level. $\left[\begin{array}{cc}\hfill \left[{\mu }_{A_j^1}\left(x_1\right)\right]\hfill & \hfill \left[{\Omega }_{{\text{A}}^1}^t\left(x_1\right)\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.9)

Definition 3.2.8 ( Subjectively-Whole Fuzzy Membership): Subjectively-Whole Fuzzy Memberships representssuch fuzzy memberships that are accumulated (subject-wise) along with the columns of PFHS-Matrix by using any aggregation operator operator (t) represented by ${\Omega }_{A_j^l}\left(X\right)$ . The Subjectively-Whole Fuzzy Membership ${\Omega }_{{\mathrm{A}}_j^k}^t\left(X\right)$ used to represent the attribute-wise exterior view of the universe/reality/event/information revealing the subjective wholeness. For example the whole fuzzy memberships ${\Omega }_{A_j^1}^t\left(X\right)$ given in Equation (3.10) represents attributively-whole fuzzy memberships for first subject with respect to all given attributes of first level. $\left[\begin{array}{c}\hfill \left[{\mu }_{A_1^1}\left(x_i\right)\right]\hfill \\ \hfill \left[{\Omega }_{{\text{A}}_1^1}^t\left(X\right)\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.10)

Definition 3.2.9 (Individual Fuzzy Non-Membership: ${\upsilon }_{A_j^k}\left(x_i\right)$ represents fuzzy non-membership (level of non-belongingness) of a subject (x _i ) concerning a certain attribute/sub-attribute given in Equation (3.11) ${\upsilon }_{A_j^k}\left(x_i\right)=1-{\mu }_{A_j^k}\left(x_i\right)$(3.11)

Definition 3.2.10 ( Attributively-Whole Fuzzy Non-Membership): Attributively-Whole Fuzzy Non-Membership is described as the accumulated level of non-belongingness of a particular subject with respect to a combination of attributes given in Equation (3.12) ${\Phi }_{A^l}\left(x_i\right)=1-{\Omega }_{A^l}\left(x_i\right)$(3.12)

If one accumulates individual fuzzy non-memberships along rows of the PFHS matrix, one obtains a combined degree of non-membership with respect to all given attributes for a particular subject, called the attributively-whole fuzzy non-membership.

Definition 3.2.11 (Subjectively-Whole Fuzzy Non-Membership): Subjectively-Whole Fuzzy Non-Membership is described as the accumulated level of non-belongingness of any given $A_j^k$ attribute for fixed j = n, k = l regarding a specific combination of subjects. Subjectively whole fuzzy non-memberships are mathematically described as, ${\Phi }_{A_j^l}\left(X\right)=1-{\Omega }_{A_j^l}\left(X\right)$(3.13)

If one cumulate these fuzzy non-memberships column-wise for PFHS-Matrix, he gets a combined degree of non-membership with respect to all given subjects for a particular attribute/sub-attribute called Attributively-Whole Non-Membership for the fuzzy environment

Note: For a precise description and application of these terms and mathematical expression a detailed numerical example is constructed as COVID19 data structures in the section-5.

Definition 3.2.12 (Plithogenic Fuzzy Whole HyperSoft-Set)

Let U _F be the initial universe of discourse, in the Fuzzy environment and P (U _F ) be the power set of U _F . Let $A_1^k,A_2^k,\dots ,A_N^k$ for N ⩾ 1 be N distinct attributes, k = 1, 2, … L represents attribute values and F is a mapping from cross product of sub-attributes to the power set of U _F ( $F:A_1^k\times A_2^k\times \cdots \times A_{\mathrm{N}}^k\to P\left(U_F\right))$ Then $\left(F,A_1^k\times A_2^k\times \cdots \times A_{\mathrm{N}}^k\right)$ represented in the set form is called a Plithogenic Fuzzy Whole-Hypersoft-Set (PFWHS-Set) over U _F if its elements are expressed by both individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ and Combined fuzzy memberships Ω _{A α}  (x _i ), ∀x _i  ∈ U _F for the given α-combination of attributes sub-attributes regarding each subject. In PFWHS-Set F deals with a single specific combination of attributes/sub-attributes out of the complex cross products. It is observed that the individual fuzzy memberships ( ${\mu }_{A_j^k}\left(x_i\right))$ of subjects are expressed with respect to each given attribute/sub-attribute and the cumulative fuzzy memberships Ω_{A α} (x _i ) are aggregated by some operators and expressed for a specific α-combination of attributes/sub-attributes concerning the given subjects (case of an α universe, that expresses one of the possible reality/event/information in a fuzzy environment).

Definition 3.2.13 (PFSAWHSS-Matrix)

Let U _F be the initial universe of discourse, in the Fuzzy environment and P (U _F ) be the power set of U _F . Let $A_1^k,A_2^k,\dots ,A_N^k$ are N distinct attributes subattributes for j = 1, 2, … N, k = 1, 2, … L then the mapping F, from the cross product of the attributes sub-attributes to the powerset of U _F ( $F:A_1^k\times A_2^k\times \cdots \times A_{\mathrm{N}}^k\to P\left(U_F\right))$ represented in the matrix form in such a way that its elements consist of individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ as well as attributively aggregated fuzzy memberships ${\Omega }_{{\mathrm{A}}^k}^t\left(x_{\mathrm{i}}\right)$ , ∀x _i  ∈ U _F , then this matrix is called a Plithogenic Subjective Attributively Whole Hyper-Super-soft-Matrix (PFSAWHSS-Matrix).

The PFSAWHSS-Matrix F_{S t} is described underneath in Equation (3.14) and its expanded form is presented in Equation (3.15) $F_{{\text{S}}_t}=\left[\begin{array}{cc}\hfill \left[{\mu }_{A_j^k}\left(x_i\right)\right]\hfill & \hfill \left[{\Omega }_{{\mathrm{A}}^k}^t\left(x_{\mathrm{i}}\right)\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.14) $\begin{array}{cc}\hfill & F_{{\mathrm{S}}_t}=[\left[\begin{array}{cccccc}\hfill {\mu }_{A_1^k}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_1\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^k}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_2\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_2\right)\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill {\mu }_{A_1^k}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_M\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill & \left[\begin{array}{c}\hfill {\Omega }_{{\mathrm{A}}^k}^t\left(x_1\right)\hfill \\ \hfill {\Omega }_{{\mathrm{A}}^k}^t\left(x_2\right)\hfill \\ \hfill .\hfill \\ \hfill .\hfill \\ \hfill .\hfill \\ \hfill {\Omega }_{{\mathrm{A}}^k}^t\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]]\hfill \end{array}$(3.15)

F_{s t} is Plithogenic subjective attributively whole hyper-super-soft-matrix in the fuzzy environment, for further details see ref [20].

The elements of the last column of this matrix represented in (Equation 3.16) represent Attributively-Whole Fuzzy Memberships ${\Omega }_{{\mathrm{A}}^l}^t\left(x_{\mathrm{i}}\right)$ , $\left[\begin{array}{c}\hfill {\Omega }_{{\mathrm{A}}^k}^t\left(x_1\right)\hfill \\ \hfill {\Omega }_{{\mathrm{A}}^k}^t\left(x_2\right)\hfill \\ \hfill .\hfill \\ \hfill .\hfill \\ \hfill .\hfill \\ \hfill {\Omega }_{{\mathrm{A}}^k}^t\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]$(3.16)

t represents an aggregation operator that is used to accumulate the fuzzy memberships i.e. t = 1, (Disjunction operator), t = 2, (conjunction operator), t = 3 (averaging operator). This PFSAWHS-Matrix shows both an inner and outer interpretation of the universe. The inside state of the universe, event, or reality is reflected by individual memberships ${\mu }_{A_j^k}\left(x_i\right)$ of subjects while the outside state of the universe, event, or reality represented by attributively aggregated fuzzy memberships Ω _{A ^k}  (x _i ). Therefore, the PFSAWHS-Matrix would allow a subjective classification through attributive accumulation. Attributive aggregation is obtained by applying several suitable aggregation operators to ${\mu }_{A_j^k}\left(x_i\right)$ at the index j.

Definition 3.2.14 (PFASWHSS-Matrix)

Let U _F be the initial universe of discourse, in the Fuzzy environment and P (U _F ) be the power set of U _F . Let $A_1^k,A_2^k,\dots ,A_N^k$ are N distinct attributes/subattributes for j = 1, 2, … N, k = 1, 2, … L then the mapping F, from the cross product of the attributes sub-attributes to the powerset of the fuzzy universe of discourse $F:A_1^k\times A_2^k\times \cdots \times A_{\mathrm{N}}^k\to P\left(U_F\right)$ represented in the matrix form in such a way that its elements consist of individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ as well as subjectively aggregated fuzzy memberships ${\Omega }_{A_{\mathrm{j}}^k}\left(X\right)$ , ∀x _i  ∈ U _F , then this matrix is called a Plithogenic Fuzzy Attributive Subjectively Whole Hyper-Super-soft-Matrix (PFASWHSS-Matrix).

The PFSAWHSS-Matrix F_{A t} is described underneath in (Equation 3.17) $F_{{\text{A}}_t}=\left[\begin{array}{c}\hfill \left[{\mu }_{A_j^k}\left(x_i\right)\right]\hfill \\ \hfill \left[{\Omega }_{{\text{A}}_j^k}^t\left(X\right)\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.17)

It is observed that his matrix is represented by both individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ (individual fuzzy states of subjects regarding each attribute) and the aggregated fuzzy memberships ${\Omega }_{A_{\mathrm{j}}^k}\left(X\right)$ (subject-wise aggregated states). The expanded form of this matrix is described below. $F_{{\mathrm{A}}_t}=\left[\begin{array}{c}\hfill \left[\begin{array}{cccccc}\hfill {\mu }_{A_1^k}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_1\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^k}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_2\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_2\right)\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill \\ \hfill {\mu }_{A_1^k}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^k}\left(x_M\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\mu }_{A_N^k}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \begin{array}{c}\hfill \hfill \\ \hfill \left[\begin{array}{cccccc}\hfill {\Omega }_{{\mathrm{A}}_1^k}^t\left(X\right)\hfill & \hfill {\Omega }_{{\mathrm{A}}_2^k}^t\left(X\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\Omega }_{{\mathrm{A}}_N^k}^t\left(X\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\hfill \\ \hfill \hfill \end{array}\right]$(3.18)

The elements of the last column-matrix as given below, in Equation 3.19 are subjectively-Whole Fuzzy Memberships ( ${\Omega }_{{\mathrm{A}}_N^k}^t\left(X\right)$ ) of PFASWHSS-Matrix. $\begin{array}{c}\hfill \hfill \\ \hfill \left[\begin{array}{cccccc}\hfill {\Omega }_{{\mathrm{A}}_1^k}^t\left(X\right)\hfill & \hfill {\Omega }_{{\mathrm{A}}_2^k}^t\left(X\right)\hfill & \hfill .\hfill & \hfill .\hfill & \hfill .\hfill & \hfill {\Omega }_{{\mathrm{A}}_N^k}^t\left(X\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \end{array}$(3.19)

Note: The whole fuzzy memberships Ω _{A α}  (x _i ) and ${\Omega }_{{\mathrm{A}}_j}^k\left(X\right)$ that are aggregated attribute-wise and subject-wise respectively and whole fuzzy non-memberships Φ _{A α}  (x _i ) and ${\Phi }_{{\mathrm{A}}_j}^k\left(X\right)$ are dependent on individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ , and non-membership ${\upsilon }_{A_j^k}\left(x_i\right)$ .

Definition 3.2.15 (Hyper-Super-Matrices): Hyper Super Matrices are clusters of super-matrix-layers. These are such Hyper-matrices that have several layers of super-matrices represented by more than two variation indices (d ≻ 2) and further their elements are matrices or scalars.

As we know, all ordinary M × N Matrices on real vector space are tensors of rank 2, i.e., these ordinary matrices are represented by the use of two variation indices. For example [a_ij] is an ordinary matrix having represents one variation by index i as rows of the Matrix and the second variation by index j represents columns of the Matrix. While the hyper-super-matrices are constructed using four variation indices which represent four types of variations that occur together. The hyper-super-matrices are rank-4 tensors. While the hypermatrices represented by three variation indices that describe three types of variations at a time are rank-3 tensors.

These Hyper Super matrices are formulated by hybridizing hyper-matrices and super-matrices.

A = [a _ijk ] is a Hyper-Matrix. This hypermatrix represents three kinds of variations, described by the use of three indices i, j and k where the i, j, k are positive integers.

$\mathrm{B}=\left[\begin{array}{c}\hfill \left[b_{\mathit{ijk}}\right]\hfill \\ \hfill \left[a_{\mathit{jkt}}\right]\hfill \\ \hfill \hfill \end{array}\right]$ represents a Hyper-Super-Matrix that represents four types of variations described by the use of four indices i, j, k and t.

Definition 3.2.16 (HyperSoft-Matrix): Let U be the initial universe of discourse, and P (U) be the power set of U. Let $A_1^k,A_2^k,\dots ,A_n^k$ for n ⩾ 1 be n distinct attributes, k = 1, 2, … L represents attributes values, a function $F:A_1^k\times A_2^k\times \cdots \times A_{\mathrm{n}}^k\to P\left(U\right)$ is a hypersoft matrix, also called an order-M × N × L hypersoft matrix or d-hypersoft Matrix (d = 3) i.e., a matrix that represents a hypersoft-set is a hypersoft-matrix (HS-Matrix). An HS-Matrix with d ≻ 3 (More than three variations) and whose elements are matrices is called a Hyper-Super-Soft-Matrices (HSS-Matrix). This HSS-Matrix consisted of clusters of several parallel layers of ordinary matrices, and elements of these matrix layers are matrices or scalars.

Note: All simple M × N Matrices on real vector space are tensors of rank 2. The new HyperSoft-Matrix (HS- Matrix) with three variation indices is a rank three tensor and the Hyper-Super-Soft matrix (HSS matrix) with four variation indices is a Fourth rank tensor. The HS-Matrix (third rank tensors) and HSS-Matrix (fourth rank tensors) are a generalized version of the ordinary matrices (second rank tensors).

3.3 PFHS-Matrix and index-based views

The Plithogenic Fuzzy HyperSoft Set in matrix form is expressed as, $F=\left[{\mu }_{A_j^k}\left(x_i\right)\right]$

Plithogenic Fuzzy HyperSoft-Matrix represents three types of variation indices used to portray the fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ . The first variation on index i is with respect to subjects representing M rows of M × N × L Matrix while the second variation on index j is concerning to attributes representing N columns of M × N × L Matrix, i and j represent arrangements of rows and columns in the form of simple M × N Matrix-layer.

However, when we consider sub-attributes of respective attributes, the third type of variation arises. This third variation is on the index k that is used to portray sub-attributes (attribute levels). These sub-attributes are displayed in the form of L level layers of an M × N Matrix. The hyper-matrix is generated by these parallel layers of M × N ordinary matrices.

These level layers of hyper-matrix are categorized into three types:

The front to back and inner Vertical level layers are generated byL number of matrix layers. Where each layer is an ordinary matrix of order M × N.

The left to right and inner vertical level layers are generated by N number of matrix layers such that each layer is a Matrix of order M × L.

The top to bottom horizontal and inner level layers are generated by M number of matrix layers of order, L × N.

Consider The PFHS-Matrix $F=\left[{\mu }_{A_j^k}\left(x_i\right)\right]$ and its dilated version described in Equation 3.3, the three types of level layers of this PFHS-Matrix F are described as under,

3.3.1 Type-1 level-layers of PFHS-Matrix

If the Equation 3.3 is further expanded with respect to k by varying k from 1 to L, then L number of front to back, and inner level layers of PFHS-Matrix, would be constructed where each layer is a matrix of order M × N. We can describe numerous layers of PFHS-Matrix in three different ways, i.e., parallel layers of type-1 are obtained by vertically cutting a box matrix of order M × N × L from front to back. These level cuts are called level-layers of type 1. They can be expressed on a two-dimensional page by giving step-by-step variation to the index k in Equation (3.3) and represented as described below in Equation (3.20). $F=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^2}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^2}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^2}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill ⋮\hfill & \hfill \hfill & \hfill \hfill & \hfill \hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^L}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^k}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^L}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^L}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.20)

Example 3. Consider the PFHS-Matrix F described in Equation (3.8) $F=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.2\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.4\hfill & \hfill 0.2\hfill & \hfill 0.6\hfill \\ \hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.8\hfill & \hfill 0.4\hfill \\ \hfill 0.7\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.9\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$

F represents the front view of PFHS-Matrix and its front to back two Matrix-layers are given bellow, $\begin{array}{cc}\hfill & \mathrm{First}\mathrm{layer},\left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.2\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill & \mathit{for}k=1\hfill \end{array}$(3.21) $\begin{array}{cc}\hfill & \mathrm{Second}\mathrm{layer},\left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.4\hfill & \hfill 0.2\hfill & \hfill 0.6\hfill \\ \hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.8\hfill & \hfill 0.4\hfill \\ \hfill 0.7\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.9\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill & \mathit{for}k=2\hfill \end{array}$(3.22)

3.3.2 Type-2 level layers of PFHS-Matrix level layers of PFHS-Matrix

Similarly, on the other hand, each column of the M × N matrix when expanded at its rear side creates a matrix of order M × L which expands N (attribute) into vertical layers (attribute leves) i.e., like creating vertical sections from left to right of the box matrix of the dimension M × N × L.

These vertical slices from left to right are level layers of type 2 and are expressed on the two-dimensional page by varying the index j as represented in Equation (3.23). $F=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_1^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_1^L}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_1^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_1^L}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_1^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_1^L}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_2^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_2^L}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_2^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_2^L}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_2^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_2^L}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill ⋮\hfill & \hfill \hfill & \hfill \hfill & \hfill \hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_N^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_N^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_N^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_N^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_N^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_N^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.23)

3.3.3 Type-3 level layers of PFHS-Matrix

In a similar manner, level layers of type-3 are top to bottom and middle inner layers. These parallel layers are combined to create M layers of L × N Matrix.

These top to bottom M number of slices are level layers of type-3 and can be expressed on the two-dimensional page by gradually varying the index i as described below in Equation (3.24). $F=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_1^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_1^L}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_2^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_2^L}\left(x_1\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_N^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_N^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_1\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_1^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_1^L}\left(x_2\right)\hfill \\ \hfill {\mu }_{A_2^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_N^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_N^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_2\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill ⋮\hfill & \hfill \hfill & \hfill \hfill & \hfill \hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_1^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_1^L}\left(x_M\right)\hfill \\ \hfill {\mu }_{A_2^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_2^L}\left(x_M\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_N^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_N^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(3.24)

4 Local aggregation operators for PFHSS-Matrix

In this section, local aggregation operators such as disjunction operators, conjunction operators, averaging operators, and complements for the plithogenic fuzzy hypersoft set/matrix are constructed. These operators would be used to formulate PFASWHSS matrix and PFSAWHSS matrix. The Whole (combined) memberships ${\Omega }_{{\text{A}}_j^k}^t\left(X\right)$ for Plithogenic HyperSoft-Matrix would be developed by using the following operators.

In PFASWHSS-Matrix $F_{{\text{A}}_t}=\left[\begin{array}{c}\hfill \left[{\mu }_{A_j^k}\left(x_i\right)\right]\hfill \\ \hfill \left[{\Omega }_{{\text{A}}_j^k}^t\left(X\right)\right]\hfill \\ \hfill \hfill \end{array}\right]$ the last row of collective memberships ${\Omega }_{{\text{A}}_j^k}^t\left(X\right)$ is accomplished by using three local aggregation operators i.e t = 1 represents Max-operator t = 2 represents the Min-operator, and t = 3 represents Averaging-operator. In addition, t = 4 stands for Complement.

In PFSAWHS-Matrix, $F_{{\text{S}}_t}=[\left[{\mu }_{A_j^k}\left(x_i\right)\right]$ $\left[{\Omega }_{{\mathrm{A}}^k}^t\left(x_{\mathrm{i}}\right)\right]]$ the last column of cumulative memberships Ω _{A ^k}  (x _i ) is acquired by using three local aggregation operators, t = 1, the Max-operator t = 2, the Min-operator, and t = 3 the Averaging-operator. And t = 4 represents the Complement.

These four operators are structured as follows,

4.1 Local Disjunction Operator for construction of PFASWHSS-Matrix

${\cup }_i\left({\mu }_{A_j^k}\left(x_i\right)\right)=\underset{i}{\mathit{Max}}\left({\mu }_{A_j^k}\left(x_i\right)\right)={\Omega }_{{\text{A}}_j^k}^1\left(X\right),$(4.1)

forsome k = l

Choose maximum membership from j _th col of PFHS-Matrix.

4.2 Local Disjunction Operator for construction of PFSAWHSS-Matrix

${\cup }_j\left({\mu }_{A_j^k}\left(x_i\right)\right)=\underset{j}{\mathit{Max}}\left({\mu }_{A_j^k}\left(x_i\right)\right)={\Omega }_{{\mathrm{A}}^k}^1\left(x_{\mathrm{i}}\right),$(4.2)

forsome k = l

(Choose maximum membership from i _th row of PFHS-Matrix)

4.3 Local Conjunction Operator for construction of PFASWHSS-Matrix

${\cap }_i\left({\mu }_{A_j^k}\left(x_i\right)\right)=\underset{i}{\mathit{Min}}\left({\mu }_{A_j^k}\left(x_i\right)\right)={\Omega }_{{\text{A}}_j^k}^2\left(X\right),$(4.3)

forsome k = l

Choose minimum membership from j _th col of PFHS-Matrix.

4.4 Local Conjunction Operator for construction of PFSAWHSS-Matrix

${\cap }_j\left({\mu }_{A_j^k}\left(x_i\right)\right)=\underset{j}{\mathit{Min}}\left({\mu }_{A_j^k}\left(x_i\right)\right)={\Omega }_{{\mathrm{A}}^k}^2\left(x_{\mathrm{i}}\right),$(4.4)

forsome k = l

Choose minimum membership from i _th row of PFHS-Matrix.

4.5 Local averaging Operator for construction of PFASWHSS-Matrix

${\Gamma }_i\left({\mu }_{A_j^k}\left(x_i\right)\right)=\frac{\sum _i\left({\mu }_{A_j^k}\left(x_i\right)\right)}{M}={\Omega }_{{\text{A}}_j^k}^3\left(X\right),$(4.5)

forsome k = l

Take the average of memberships of j _th col) of given specific k _th -layer.

4.6 Local averaging Operator for construction of PFSAWHSS-Matrix

${\Gamma }_j\left({\mu }_{A_j^k}\left(x_i\right)\right)=\frac{\sum _j\left({\mu }_{A_j^k}\left(x_i\right)\right)}{N}={\Omega }_{{\mathrm{A}}^k}^3\left(x_{\mathrm{i}}\right),$(4.6)

forsome k = l

Take the average of memberships of i _th row of PFHS-Matrix of given specific k _th -layer.

In ${\mu }_{A_j^k}\left(x_i\right)$ i offers a row-wise variation of states of subjects, j gives a column-wise variation of states and k produces variations of states as sub-attributes in the form of matrix layers.

4.7 Local Complement for construction of PFASWHSS-Matrix

$C_{\mathit{loc}}\left(F\right)=\left\{\begin{array}{c}\hfill {\mathit{Max}}_i\left(1-{\mu }_{A_j^k}\left(x_i\right)\right)\hfill \\ \hfill {\mathit{Min}}_i\left(1-{\mu }_{A_j^k}\left(x_i\right)\right)\hfill \\ \hfill \sum _{i=1}^M\frac{\left(1-{\mu }_{A_j^k}\left(x_i\right)\right)}{M}\hfill \\ \hfill \hfill \end{array}\right\}$(4.7)

forsome k = l

4.8 Local Complement for construction of PFSAWHSS-Matrix

$C_{\mathit{loc}}\left(F\right)=\left\{\begin{array}{c}\hfill {\mathit{Max}}_j\left(1-{\mu }_{A_j^k}\left(x_i\right)\right)\hfill \\ \hfill {\mathit{Min}}_j\left(1-{\mu }_{A_j^k}\left(x_i\right)\right)\hfill \\ \hfill \sum _{j=1}^N\frac{\left(1-{\mu }_{A_j^k}\left(x_i\right)\right)}{N}\hfill \\ \hfill \hfill \end{array}\right\}$(4.8)

forsome k = l

Here C _loc represent the local Complement of PFHS-Matrix F for a certain level of attributes k = l. This Complement is applied across PFHS-Matrix F by taking the Complement of each fuzzy membership ${\mu }_{A_j^k}\left(x_i\right)$ and then choosing either maximum or minimum or an average membership from the established column or row.

Further description and application of these local aggregation operators are presented in Sec-5.

5 Construction of PFASWHSS-Matrix, PFSAWHSS-Matrix, and Application of local aggregation operators as COVID-19 Data Structures

5.1 (Plithogenic Fuzzy Attributive Subjectively-Whole Hyper-Super-Soft-Matrix)

The matrix representation of Plithogenic Attributive Subjectively Whole HyperSoft Set in the fuzzy environment named, PFASWHSS-Matrix. The elements of PFASWHSS-Matrix are matrix-layers, matrices, or scalars, so a PFASWHSS-Matrix is a hybridization of HS-Matrix and HSS-Matrix. The HSS-Matrix has such layers of matrices whose elements are further matrices or scalars. If one considers the HS-Matrix in a fuzzy environment then the subject-wise combined fuzzy memberships ( ${\Omega }_{{\mathrm{A}}_j^k}^t\left(\mathrm{X}\right)$ ) are constructed by using the aggregation operator, t such that t = 1, 2, 3, 4, represents local operators constructed in the previous section see Equation 4.1, to 4.8. The compact form of PFASWHSS-Matrix F _{A t} can be described as $F_{{\text{A}}_t}=\left[\begin{array}{c}\hfill \left[{\mu }_{A_{\mathrm{j}}^k}\left(x_{\mathrm{i}}\right)\right]\hfill \\ \hfill \left[{\Omega }_{{\text{A}}_{\mathrm{j}}^k}^t\left(X\right)\right]\hfill \\ \hfill \hfill \end{array}\right]$

In this PFASWHSS-Matrix, four types of diversification are described. These diversification /variations are described as under, the first Variation of i = 1, 2, … M would produce M rows of F _{A t} . The second variations on j = 1, 2, … N produce N columns, and the third variations on k = 1, 2, … L would generate L combinations of rows and columns as parallel matrix-layers of M × N matrix. The fourth variation on t = 1, 2, … P would provide P sets, i.e., P numbers of Clusters of L numbers of parallel layers of M × N matrices. These sets of parallel layers can represent clusters of parallel universes or parallel realities. These clusters in the form of expanded form of PFASWHSS-Matrix F _{A t} are described below in Equation 5.1. ${\text{F}}_{{\text{A}}_{\text{t}}}=\left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\Omega }_{{\text{A}}_1^1}^1\left(X\right)\hfill & \hfill {\Omega }_{{\text{A}}_2^1}^1\left(X\right)\hfill & \hfill \cdots \hfill & \hfill {\Omega }_{{\text{A}}_N^1}^1\left(X\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^2}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^2}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^2}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\Omega }_{{\text{A}}_2^1}^1\left(X\right)\hfill & \hfill {\Omega }_{{\text{A}}_2^2}^1\left(X\right)\hfill & \hfill \cdots \hfill & \hfill {\Omega }_{{\text{A}}_N^2}^1\left(X\right)\hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill ⋮\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^L}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^k}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^L}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^L}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\Omega }_{{\text{A}}_1^L}^1\left(X\right)\hfill & \hfill {\Omega }_{{\text{A}}_2^L}^1\left(X\right)\hfill & \hfill \cdots \hfill & \hfill {\Omega }_{{\text{A}}_N^1}^1\left(X\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill ⋮\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^1}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^1}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^1}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^1}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^1}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\Omega }_{{\text{A}}_1^1}^2\left(X\right)\hfill & \hfill {\Omega }_{{\text{A}}_2^1}^2\left(X\right)\hfill & \hfill \cdots \hfill & \hfill {\Omega }_{{\text{A}}_N^1}^2\left(X\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^2}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^2}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_2\right)\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill \cdots \hfill & \hfill ⋮\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^2}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^2}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^2}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\Omega }_{{\text{A}}_1^2}^2\left(X\right)\hfill & \hfill {\Omega }_{{\text{A}}_2^2}^2\left(X\right)\hfill & \hfill \cdots \hfill & \hfill {\Omega }_{{\text{A}}_N^2}^2\left(X\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill ⋮\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill {\mu }_{A_1^L}\left(x_1\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_1\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^k}\left(x_1\right)\hfill \\ \hfill {\mu }_{A_1^L}\left(x_2\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_2\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_2\right)\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill ·\hfill & \hfill ·\hfill & \hfill \cdots \hfill & \hfill ·\hfill \\ \hfill {\mu }_{A_1^L}\left(x_M\right)\hfill & \hfill {\mu }_{A_2^L}\left(x_M\right)\hfill & \hfill \cdots \hfill & \hfill {\mu }_{A_N^L}\left(x_M\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill {\Omega }_{{\text{A}}_1^L}^2\left(X\right)\hfill & \hfill {\Omega }_{{\text{A}}_2^L}^2\left(X\right)\hfill & \hfill \cdots \hfill & \hfill {\Omega }_{{\text{A}}_N^L}^2\left(X\right)\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.1)

The Hyper-Super-Soft Matrix consists of four clusters associated with four aggregation operators t = 1, 2, 3, 4. Every cluster has two matrix-layers associated with attribute-levels. Each matrix-layer has M rows and N columns.

These multiple clusters of parallel layers (parallel universes/realities/events/information) are accomplished by gradually varying the fourth index, which is used to represent multiple aggregation operators to accumulate the memberships of all subjects. These aggregation operators are called local operators.

5.2 (Plithogenic Fuzzy Subjective Attributive-Whole Hyper-Super-Soft-Matrix)

The Plithogenic Fuzzy Subjective Attributively-Whole Hyper-Super-Soft-Matrix is shown in (Equation 5.1a) and is described on a similar basis for further details see Ref. [20] $F_{{\text{S}}_t}=\left[\begin{array}{cc}\hfill \left[{\mu }_{A_j^k}\left(x_i\right)\right]\hfill & \hfill \left[{\Omega }_{{\mathrm{A}}^k}^t\left(x_{\mathrm{i}}\right)\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.1a)

5.3 Application as COVID-19 Data Structure

Example 4. Let U ={ x₁, x₂, x₃, x₄, x₅, x₆ } be the set of six patients who have visited the hospital with symptoms of COVID-19. They were examined by some doctors. Consider a medical exam case of a doctor who examined three of them by asking some questions about four symptoms (attributes), and each symptom is categorized into two sub-symptoms (sub-attributes). These three patients are considered to be test subjects. The information from their visits was recorded and organized as a plithogenic fuzzy hypersoft matrix and further represented and analyzed with the aid of the plithogenic fuzzy hyper super soft matrix.

Let T = { x₁, x₂, x₃ } ⊂ U be the set of these three patients considered by a doctor for examination.

Let the attributes be $A_j^k;$ j = 1, 2, 3, 4 with sub-attributes k=1, 2 are described as,

$A_1^k=$ Fever with numeric values, k = 1, 2,

$A_1^1=$ Mild fever, $A_1^2=$ High-grade fever

$A_2^k=$ Dry cough, with numeric values, k = 1, 2

$A_2^1=$ Dry cough, $A_2^2=$ Acute dry cough

$A_3^k=$ Breathing difficulty with numeric values, k = 1, 2

$A_3^1=$ Minor breathing difficulty,

$A_3^2=$ Swear breathing difficulty needs oxygen

$A_4^k=$ Nausea, with numeric values k = 1, 2

$A_4^1=$ Minor nausea $A_4^2=$ Strong nausea

PFHS-Set representation:

Let the Function F indicate these given attributes/sub-attributes as described below, $F:A_1^k\times A_2^k\times A_3^k\times A_4^k\to P\left(U\right)$(5.1) $\mathrm{S}.tF\left(A_1^1,A_2^1,A_3^1,A_4^1\right)=\left\{x_1,x_2,x_3\right\}$ be a hypersoft set. let we consider $A_1^1,A_2^1,A_3^1,A_4^1$ a combination (α combination) represents the first level of disease on the first visit)

$F\left(A_1^2,A_2^2,A_3^2,A_4^2\right)=\left\{x_1,x_2,x_3\right\}$ , $A_1^2,A_2^2,A_3^2,A_4^2$ a combination (β combination) represents the second level of disease. The patient with the second level, if necessary, would be admitted to the hospital for special care after a week through observation and analysis of conditions. The Individual fuzzy memberships are assigned using a linguistic scale and then represented in PFHS-Set. Consider the fuzzy memberships of elements of T={x₁, x₂, x₃} as ${\mu }_{A_j^k}\left(x_i\right)$ for i = 1, 2, 3 and j = 1 to 4. The Plithogenic Fuzzy Memberships that reflect the health-states of x _i subjects associated with α combination of attributes are organized as PFHS-Set shown in Equation (5.2). $\begin{array}{cc}\hfill & F\left(\alpha \right)=F\left(A_1^1,A_2^1,A_3^1,A_4^1\right)\hfill \\ \hfill & =\left\{\begin{array}{c}\hfill x_1\left(0.3,0.6,0.4,0.5\right),\hfill \\ \hfill x_2\left(0.4,0.5,0.3,0.1\right),\hfill \\ \hfill x_3\left(0.6,0.3,0.3,0.7\right)\hfill \\ \hfill \hfill \end{array}\right\}\hfill \end{array}$(5.2)

The information from the first visit (organized as a PFHS-Set) (shown in Equation (5.2) would generate the first level of the PFHS-Matrix.

Now regarding the states of patients for the second visit for β combination of attributes. Information is portrayed as PFHS-Set that is given in Equation (5.3). $\begin{array}{cc}\hfill & F\left(\beta \right)=F\left(A_1^1,A_2^1,A_3^1,A_4^1\right)\hfill \\ \hfill & =\left\{\begin{array}{c}\hfill x_1\left(0.5,0.7,0.5,0.8\right),\hfill \\ \hfill x_2\left(0.7,0.5,0.5,0.8\right),\hfill \\ \hfill x_3\left(0.6,0.5,0.6,0.7\right)\hfill \\ \hfill \hfill \end{array}\right\}\hfill \end{array}$(5.3)

F (β) is a Plithogenic fuzzy hypersoft set represents the second visit information as the second level of Matrix

PFHS-Matrix representation: Let F be the matrix form of PFHS-Set. Here the elements of rows represent states of subjects x₁, x₂, x₃ as fuzzy memberships. And elements of columns represent (the non-Physical aspect of subjects) $A_1^k,A_2^k,A_3^k,A_4^k$ Attributes.

The information of hypersoft set shown in Equations (5.3) are organized in the form of PFHS-Matrix F as follows, $F=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.4)

This PFHS matrix consists of two layers and represents an inner view of the universe

** Online mode ** $\left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right],\left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]$(5.5)

Equation (5.5) represents the First and Second level layers of PFHS-Matrix.

Individual fuzzy memberships ${\mu }_{A_j^k}\left(x_i\right)$ : The elements of This PFHS-Matrix represent individual fuzzy memberships s ${\mu }_{A_j^k}\left(x_i\right)$ .

5.3.1 Local Disjunction Operator for construction of PFASWHSS-Matrix

By applying local Disjunction operators i.e. the Max-operator (t = 1) described in Equation 4.1 on columns of F, we will get Subject-wise whole Fuzzy Memberships ${\Omega }_{{\text{A}}_j^k}^1\left(X\right)$ . These Subject-wise whole Fuzzy Memberships are represented in the last row of PFASWHS-Matrix F_A1 as shown below in Equation 5.6 $F_{{\mathrm{A}}_1}=\left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.6\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.6\hfill & \hfill 0.8\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.6)

$\left[\begin{array}{cccc}\hfill 0.6\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]$ and $\left[\begin{array}{cccc}\hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.6\hfill & \hfill 0.8\hfill \\ \hfill \hfill \end{array}\right]$ are Subject-wise whole Fuzzy Memberships ${\Omega }_{A_j^k}\left(X\right)$ are represented for each attribute of the first and second level-layer of the given matrix and represent the optimist outer view of the universe through the last row of F_A1.

$\left[\begin{array}{cccc}\hfill 0.4\hfill & \hfill 0.4\hfill & \hfill 0.6\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]$ and $\left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.4\hfill & \hfill 0.2\hfill \\ \hfill \hfill \end{array}\right]$ are Subject-wise whole fuzzy non-memberships ${\Phi }_{A_j^l}\left(X\right)$ for attributes of the first and second levels.

5.3.2 Local Disjunction Operator for construction of PFSAWHSS-Matrix:

When the aggregation operator, t = 1 (max-operator described in Equation 4.2) is applied across the rows of PFHS-Matrix, F (Equation 5.4) we will get attribute-wise whole fuzzy Memberships ${\Omega }_{{\mathrm{A}}^k}^1\left(x_{\mathrm{i}}\right)$ that are represented in the last column of PFSAWHS-Matrix F_S1 given bellow in Equation 5.7, $F_{{\mathrm{S}}_1}=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\left[\begin{array}{c}\hfill 0.6\hfill \\ \hfill 0.5\hfill \\ \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\left[\begin{array}{c}\hfill 0.8\hfill \\ \hfill 0.8\hfill \\ \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.7)

F_S1 is the Plithogenic Subjective Attributively Whole Hyper-Super Soft-Matrix.

$\left[\begin{array}{c}\hfill 0.6\hfill \\ \hfill 0.5\hfill \\ \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]$ , $\left[\begin{array}{c}\hfill 0.8\hfill \\ \hfill 0.8\hfill \\ \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]$ are Attributively Whole Fuzzy Memberships constructed for combination attributes of first and second levels of PFSAWHSS-Matrix F. These Attributively Whole Fuzzy Memberships represent the Subjectively optimist exterior manifestation of the universe.

Attributively Whole Fuzzy Non-Memberships Φ _{A ^l}  (x _i ) = (1 - Ω _{A ^l}  (x _i )) for attributes of first and second levels of PFSAWHSS-Matrix are $\left[\begin{array}{c}\hfill 0.4\hfill \\ \hfill 0.5\hfill \\ \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right],\left[\begin{array}{c}\hfill 0.2\hfill \\ \hfill 0.2\hfill \\ \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]$ . These are attributively whole Fuzzy Non-Memberships for attributes of first and second level of PFSAWHSS-Matrix F_S1 (Equation 5.7).

5.3.3 Local Conjunction Operator for construction of PFASWHSS-Matrix

The PFASWHSS-Matrix constructed by applying the local conjunction operator described in Equation 4.3 column-wise (t = 2) on each specific layer of PFHS-Matrix F (equation 5.4). By applying this aggregation operator on columns of F, we will get Subjectively whole Fuzzy Memberships ${\Omega }_{{\text{A}}_j^k}^2\left(X\right)$ that are represented in the last row of PFASWHS-Matrix F_A2 see Equation 5.8 $F_{{\mathrm{A}}_2}=\left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.8)

Where, $\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$ and $\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$ are two front and back vertical level-layers of type 1 of the given matrix F_A2 for k = 1 and k = 2 and in these layers the following matrices, $\left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.2\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right],\left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.4\hfill & \hfill 0.2\hfill & \hfill 0.6\hfill \\ \hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.8\hfill & \hfill 0.4\hfill \\ \hfill 0.7\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.9\hfill \\ \hfill \hfill \end{array}\right]$

The two matrix-layers given above represent the interior view of the universe by individual memberships while the last rows $\left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill \hfill \end{array}\right]$ and $\left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]$ of each layer represent the pessimist attributive exterior perception of the universe. The elements of these given rows represent the Whole memberships ${\Omega }_{A_j^k}\left(X\right)$ .

5.3.4 Local Conjunction Operator for construction of PFSAWHSS-Matrix

The PFSAWHS-Matrix is constructed using the local conjunction operator (t = 2) row-wise as described in Equation 4.4 on each specific layer of PFHS-Matrix F (Equation 5.4).

The attributively whole memberships ${\Omega }_{{\mathrm{A}}^k}^2\left(x_{\mathrm{i}}\right)$ , represented by the last column of F_S2 as shown below in Equation (5.9), $F_{{\mathrm{S}}_2}=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\left[\begin{array}{c}\hfill 0.3\hfill \\ \hfill 0.1\hfill \\ \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\left[\begin{array}{c}\hfill 0.5\hfill \\ \hfill 0.5\hfill \\ \hfill 0.5\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.9)

F_S2 is PFSAWHS-Matrix constructed by using the Local Conjunction Operator.

The elements of the last columns of the matrix are Attributively Whole Fuzzy Memberships for attributes of the first and second level of PFSAWHSS-Matrix F. Furthermore, these two columns are representing the pessimist Subjective exterior perception of the universe whaich is obtained by using the conjunction operator.

5.3.5 Local averaging Operator for construction of PFASWHSS-Matrix

The PFASWHSS-Matrix is constructed using local averaging operators (t = 3) (described in equation 4.5) for each specific layer of PFHS-Matrix F (Equation 5.4). This aggregation operator (Averaging-operator) is applied along the columns of PFHS-Matrix to get attributively whole Fuzzy Memberships ${\Omega }_{{\text{A}}_j^k}^3\left(X\right)$ . These Memberships are represented In the last row of the PFASWHSS-Matrix F_A3 as described below in Equation 5.10, $F_{{\mathrm{A}}_3}=\left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.43\hfill & \hfill 0.46\hfill & \hfill 0.33\hfill & \hfill 0.43\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.6\hfill & \hfill 0.56\hfill & \hfill 0.53\hfill & \hfill 0.76\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.10)

Where, $\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.43\hfill & \hfill 0.46\hfill & \hfill 0.33\hfill & \hfill 0.43\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right],$ $\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.6\hfill & \hfill 0.56\hfill & \hfill 0.53\hfill & \hfill 0.76\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$ are two front and back vertical level-layers of F _{A 3} for k = 1 and k = 2 and in these layers the rows $[\begin{array}{cccc}\hfill 0.43\hfill & \hfill 0.46\hfill & \hfill 0.33\hfill & \hfill 0.43\hfill \\ \hfill \hfill \end{array}]$ and $[\begin{array}{cccc}\hfill 0.6\hfill & \hfill 0.56\hfill & \hfill 0.53\hfill & \hfill 0.76\hfill \\ \hfill \hfill \end{array}]$ are representing the neutral attributive exterior view of the universe through the averaging operator.

5.3.6 Local averaging Operator for construction of PFSAWHSS-Matrix

The PFSAWHSS-Matrix is constructed by applying local averaging operators described in Equation (4.6) (t = 3) on each specific layer of PFHS-Matrix. The aggregation operator (Averaging-operator) is applied along the rows of PFHS-Matrix to get subjectively whole Memberships ${\Omega }_{{\mathrm{A}}^k}^3\left(x_{\mathrm{i}}\right)$ $F_{{\mathrm{S}}_3}=\left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\left[\begin{array}{c}\hfill 0.45\hfill \\ \hfill 0.32\hfill \\ \hfill 0.47\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\left[\begin{array}{c}\hfill 0.62\hfill \\ \hfill 0.75\hfill \\ \hfill 0.6\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.11)

F_S3is Plithogenic Subjective attributively Whole Hyper-Super Soft-Matrix. And the elements of the given last columns of F_S3 are Attributively Whole Fuzzy Memberships for attributes of first and second levels of PFSAWHSS-Matrix. These Whole fuzzy memberships represent the neutral Subjective outer view of the universe through the averaging operator.

5.3.7 Final PFASWHSS-Matrix

The final PFASWHSS-Matrix that is described in Equation 5.1 is obtained by combining the F_A1 (Equation 5.6), F_A2 (Equation 5.8) and F_A2 (Equation 5.10) in a single PFASWHSS-Matrix which is consisted of three Clusters of Matrices associated to the aggregation operators t = 1 (Max-operator) t = 2 (Min-operator), and t = 3 (averaging-operator). This Final PFASWHSS-Matrix is described bellow in Equation 5.12, $F_{A_t}=\left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.6\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.6\hfill & \hfill 0.8\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.43\hfill & \hfill 0.46\hfill & \hfill 0.33\hfill & \hfill 0.43\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.6\hfill & \hfill 0.56\hfill & \hfill 0.53\hfill & \hfill 0.76\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.12)

5.3.8 Final PFSAWHSS-Matrix

The final PFSAWHSS-Matrix that is described in (Equation 5.1a) is constructed by combining the F_s1(Equation 5.7), F_s2 (Equation 5.9) and F_s2 (Equation 5.11) in a single PFSAWHSS-Matrix which is consisted of three Clusters of Matrices associated to the aggregation operators t = 1 (Max-operator) t = 2 (Min-operator), and t = 3 (averaging-operator). This Final PFSAWHSS-Matrix is described in Equation 5.13 $F_{S_t}=\left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cc}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{c}\hfill 0.6\hfill \\ \hfill 0.5\hfill \\ \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cc}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{c}\hfill 0.8\hfill \\ \hfill 0.8\hfill \\ \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cc}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{c}\hfill 0.3\hfill \\ \hfill 0.1\hfill \\ \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cc}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{c}\hfill 0.5\hfill \\ \hfill 0.5\hfill \\ \hfill 0.5\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cc}\hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.6\hfill & \hfill 0.4\hfill & \hfill 0.5\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.1\hfill \\ \hfill 0.6\hfill & \hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{c}\hfill 0.45\hfill \\ \hfill 0.32\hfill \\ \hfill 0.47\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cc}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.7\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.8\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.6\hfill & \hfill 0.7\hfill \\ \hfill \hfill \end{array}\right]\hfill & \hfill \left[\begin{array}{c}\hfill 0.62\hfill \\ \hfill 0.75\hfill \\ \hfill 0.6\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.13)

5.3.9 The Global and Local Complement of PFSAWHSS-Matrix

The Global complement PFASWHSS-Matrix is constructed by applying Complement-operator (t = 4, described in Equation 4.7) on each specific layer of PFHS-Matrix F _{A t} (Equation 5.12). ${\text{F}}_{{\text{A}}_{4_{\text{t}}}}=\left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.7\hfill & \hfill 0.4\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.9\hfill \\ \hfill 0.4\hfill & \hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.9\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill \\ \hfill 0.3\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.4\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.7\hfill & \hfill 0.4\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.9\hfill \\ \hfill 0.4\hfill & \hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.4\hfill & \hfill 0.4\hfill & \hfill 0.6\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill \\ \hfill 0.3\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.4\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.4\hfill & \hfill 0.2\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.7\hfill & \hfill 0.4\hfill & \hfill 0.6\hfill & \hfill 0.5\hfill \\ \hfill 0.6\hfill & \hfill 0.5\hfill & \hfill 0.7\hfill & \hfill 0.9\hfill \\ \hfill 0.4\hfill & \hfill 0.7\hfill & \hfill 0.7\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.4\hfill & \hfill 0.4\hfill & \hfill 0.6\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{c}\hfill \left[\begin{array}{cccc}\hfill 0.5\hfill & \hfill 0.3\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill \\ \hfill 0.3\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.2\hfill \\ \hfill 0.4\hfill & \hfill 0.5\hfill & \hfill 0.4\hfill & \hfill 0.3\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \left[\begin{array}{cccc}\hfill 0.3\hfill & \hfill 0.3\hfill & \hfill 0.4\hfill & \hfill 0.2\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]\hfill \\ \hfill \hfill \end{array}\right]$(5.14)

The Local Attributive Subjectively Whole Complement Matrices are achieved by applying three specific aggregation operators, t = 1 (Max-operator) t = 2 (Min-operator), and t = 3 (averaging-operator).

$F_A{{}_4}_{{}_1}=\left[\begin{array}{c}\left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.7& 0.7& 0.7& 0.9\end{array}\right]\end{array}\right]\\ \left[\begin{array}{c}\left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.5& 0.5& 0.5& 0.3\end{array}\right]\end{array}\right]\end{array}\right]$(5.14a) $F_A{{}_4}_{{}_2}=\left[\begin{array}{c}\left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.4& 0.4& 0.6& 0.3\end{array}\right]\end{array}\right]\\ \left[\begin{array}{c}\left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.3& 0.3& 0.4& 0.2\end{array}\right]\end{array}\right]\end{array}\right]$(5.14b) $F_A{{}_4}_{{}_3}=\left[\begin{array}{c}\left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.56& 0.53& 0.67& 0.56\end{array}\right]\end{array}\right]\\ \left[\begin{array}{c}\left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.4& 0.43& 0.46& 0.23\end{array}\right]\end{array}\right]\end{array}\right]$(5.14c)

index t = 4 represents the complement operator of F, and its subscript 1,2,3 represents the subjective accumulation of complements of fuzzy memberships through the following given three operators. Here the Attributive Complement Hyper-Super-Soft Matrix represented by equation 5.14 is a cluster of HSS-matrices,, represented by Equation 5.14a, Equation 5.14b, Equation 5.14c respectively. these are the three attributive subjectively whole complement matrix-layers of this cluster. These matrices are constructed using the complement operator described in Equation 4.7. The last row of each matrix layer represents the whole complement fuzzy memberships.

5.3.10 The global and local complement of PFSAWHSS-Matrix

The Global Complement PFSAWHSS-Matrix is constructed by applying Complement-operator as described in Equation. 4.8 (t = 4) on each specific layer of PFHS-Matrix F _{S t} (Equation 5.13) and represented as under,

$F_S{{}_4}_{{}_t}=\left[\begin{array}{c}\left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\left[\begin{array}{c}0.7\\ 0.9\\ 0.7\end{array}\right]\\ \left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\left[\begin{array}{c}0.5\\ 0.5\\ 0.5\end{array}\right]\end{array}\right]\\ \left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\left[\begin{array}{c}0.4\\ 0.5\\ 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\left[\begin{array}{c}0.2\\ 0.2\\ 0.3\end{array}\right]\end{array}\right]\\ \left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\left[\begin{array}{c}0.55\\ 0.67\\ 0.52\end{array}\right]\\ \left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\left[\begin{array}{c}0.62\\ 0.37\\ 0.4\end{array}\right]\end{array}\right]\end{array}\right]$(5.15)

The Local Subjective Attributively-Whole Complement Matrices are achieved by applying three specific aggregation operators, t = 1 (Max-operator) t = 2 (Min-operator), and t = 3 (averaging-operator). Are described as under

$F_S{{}_4}_{{}_1}=\left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\left[\begin{array}{c}0.7\\ 0.9\\ 0.7\end{array}\right]\\ \left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\left[\begin{array}{c}0.5\\ 0.5\\ 0.5\end{array}\right]\end{array}\right]$(5.15a) $F_S{{}_4}_{{}_2}=\left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\left[\begin{array}{c}0.4\\ 0.5\\ 0.3\end{array}\right]\\ \left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\left[\begin{array}{c}0.2\\ 0.2\\ 0.3\end{array}\right]\end{array}\right]$(5.15b) $F_S{{}_4}_{{}_3}=\left[\begin{array}{c}\left[\begin{array}{cccc}0.7& 0.4& 0.6& 0.5\\ 0.6& 0.5& 0.7& 0.9\\ 0.4& 0.7& 0.7& 0.3\end{array}\right]\left[\begin{array}{c}0.55\\ 0.67\\ 0.52\end{array}\right]\\ \left[\begin{array}{cccc}0.5& 0.3& 0.5& 0.2\\ 0.3& 0.5& 0.5& 0.2\\ 0.4& 0.5& 0.4& 0.3\end{array}\right]\left[\begin{array}{c}0.62\\ 0.37\\ 0.4\end{array}\right]\end{array}\right]$(5.15c) 6 Conclusions and discussions

The classical matrices would connect several equations and variables by rows and columns which is a limited approach to organize the higher-dimensional data consists of scattered information in numerous forms and vagueness levels therefore to broaden the approach of organizing the higher-dimensional data this unique Model of hyper-super-soft matrix is constructed. The set operations can be performed at each position (i, j) with a localized computation that is applied within the Matrix layer. This is a huge constructed matrix that first connects rows and columns like the classical matrix and then connects the sets of rows and columns as matrix layers. At this stage, it is called the hyper matrix. In each hyper-matrix layer, more matrices would be connected known as super-matrix and these super-matrices would be further connected as hyper-super-matrix, as described in the presented model. Equations 5.12, and 5.15 present examples of this Connected Hyper-Super-Matrix.

In this article, we developed the Max, Min, Averaging, and Complement operators for the PFASWHSS-Matrix and PFSAWHSS-Matrix. Applying the aggregation operator to a particular layer of the PFHS-Matrix would compress the entire layer of rows and columns into a single column (case of constructing PFSAWHSS matrix) or a single row (in constructing PFASWHSS matrix)

The final PFASWHSS-Matrix and the PFSAWHSS-Matrix are designed to organize the COVID-19 data structure and are presented in Equation 5.13. The matrix is made up of three clusters associated with three aggregation operators, and each cluster has two layers, with each layer representing the information from each visit.

The final PFSAWHSS-Matrix created for the COVID-19 data structure is shown in Equation 5.12 and would be utilized to classify the non-physical attributes (symptoms of COVID-19). It is observed from subjectively whole fuzzy memberships, which are shown in PFASWHSS-Matrix F _{A 1} , the sub-attributes $A_4^1,A_4^2$ which represent minor nausea and acute nausea, respectively, being the dominant attributes on the first and second visit levels

The final PFSAWHSS-Matrix that is constructed for the COVID-19 data Structure is shown in Equation 5.13 and would be utilized to classify the physical subjects (patients of COVID-19)

The patient whose membership of the cumulative attributes as fuzzy membership is 80% or more than 80% should be hospitalized for intensive care. Therefore, subjects x₁, x₂ would be admitted on their second visit as their attributively whole Fuzzy memberships are 80%.

It is observed that the Global Complement PFASWHSS-Matrix $F_A{{}_4}_{{}_t}$ described by Equation 5.14 is a higher-dimensional matrix, consisting of three clusters of matrices each cluster being described in Equation 5.14a, Equation 5.14b. equation 5.14c i.e. represents a local complement. While each cluster described has two matrix layers and each layer has two sub-matrices, the first sub-matrix of the layer represents a detailed attributive view of the local complement. And the last row-matrix of the matrix-layer reflects the compact view of the attributive complement. The Global Complement of PFSAWHSS-Matrix is $F_S{{}_4}_{{}_t}$ described by Equation 5.14 and its Clusters are given in (Equation 5.15a, Equation 5.15b. Equation 5.15c)

This modern hyper-super-matrix has shown the individual and cumulative effect of universe/event/reality/information through several angles of visions in a fuzzy environment. These angles of vision are described through the use of Max, Min, Averaging, and complement operators. These operators represent optimistic, pessimistic, neutral, and antithetical behavior of the universe in the fuzzy environment.

6.1 Future open problems

In this article, we have developed the Max, Min, Averaging, and Complement operators for PFASW HSS-Matrix and PFSAWHSS-Matrix which represent a Hyper-Neutrosophic approach of considering Optimist, Pessimist, Neutral and Antithetical behavior of the Universe/Event/Reality/Information. In addition, some other local operators can be developed to express a broader approach.

The choice of a suitable environment like Crisp, Fuzzy, Intuitionistic, or Neutrosophic would reflect the state of mind of the observer. Moreover, this Model of expression (Hyper-Super-Matrix) has the capability of the adoption of any suitable environment to reflect the worth style nature with its physical and non-physical aspects.

The aggregation operators are applied row-wise to compact a certain Matrix-layer into a single column and applied column-wise to compact a certain layer of the Matrix into a single row. This procedure of development and application of aggregation operators was carried out by considering only the front view of the dilated Matrix i.e. Type-1 level-layers of PFHS-Matrix described In equation 3.14. This development and Application would be extended to Type-2 level layers of PFHS-Matrix described in equation 3.17. This unique construction model is presented, as an example in the Fuzzy environments by considering the front view of the dilated Matrix i.e Type-1 level-layers of PFHS-Matrix described In Equation 3.14 to preserve the duration of the article within the required limits of this general. later, the proposed unique built examples would be constructed in various suitable environments taking into account other described views of the matrix.

By considering Type-3 level layers of PFHS-Matrix described in Equation 3.18. and using the proposed extensions Extended Attributive and Subjective Models would be constructed.