Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2026 Jan 6;16:1562. doi: 10.1038/s41598-025-29405-4

An investigation on Pythagorean fuzzy Inline graphic fraction dense space using Pythagorean fuzzy frames

N B Gnanachristy 1, G K Revathi 1,
PMCID: PMC12800029  PMID: 41495098

Abstract

The concept of frame is a generalisation of the concept of category of topological space open subsets. As a result, each frame acts as an open set in this context and the Pythagorean fuzzy sets is defined as a frame. The primary goal of this research unit is to investigate the behaviour of Pythagorean fuzzy frames. Pythagorean fuzzy Inline graphic structure space is defined using Pythagorean fuzzy frames. Pythagorean fuzzy Inline graphic closed sets, Pythagorean fuzzy dense set, Pythagorean fuzzy nowhere dense set, Pythagorean fuzzy somewhere dense set is established in order to investigate the Pythagorean fuzzy frames defined in Pythagorean fuzzy Inline graphic structure space. Further, Pythagorean fuzzy Inline graphic continuous function is explored in this manuscript. Separation axioms of the Pythagorean fuzzy Inline graphic structure space is established in order to comprehend the Pythagorean fuzzy frame. Additionally Pythagorean fuzzy Inline graphic fraction dense space and Pythagorean fuzzy Inline graphic space is defined and explored to examine the behaviour of defined Pythagorean fuzzy frames.

Keywords: Pythagorean fuzzy frames, Pythagorean fuzzy Inline graphic structure space, Pythagorean fuzzy Inline graphic fraction dense space

Subject terms: Engineering, Mathematics and computing

Introduction

The idea of uncertainty has been one of the most important developments in science and mathematics in the twenty-first century. The traditional perspective, which holds that uncertainty is undesirable in research and should be avoided at all costs has gradually given way to an alternate approach which is tolerant of uncertainty and holds that science cannot escape it. In an effort to address these challenges Zadeh developed the idea of fuzzy sets in 1965 to mathematically describe ambiguity. He did this by giving each member of a given set a certain grade of membership. A fuzzy set can be mathematically defined by giving each feasible individual in the universal of discourse a value that represents their degree of participation in the fuzzy set. The non-membership function was then introduced by Atanassov1. Pythagorean fuzzy sets were introduced by Yager2 as an extension of intuitionistic fuzzy sets. These Pythagorean fuzzy sets are described in this article as being framed under a few criteria. A category of open subsets in a space that may be more general than a topological space is comparable to a frame. Anything that has a collection of open subsets that function essentially like topological space open subsets can be used to define this. Currently, studies have emphasized the concept of frame category. This attempt to visualize frames makes use of the Pythagorean fuzzy set.

In this study, the novelty lies in the introduction and comprehensive examination of Pythagorean fuzzy frames as a generalization of open sets in topological spaces. Several classical topological notions such as closed sets, dense sets, nowhere dense sets, and somewhere dense sets are extended to the Pythagorean fuzzy environment within the newly developed Pythagorean fuzzy Inline graphic structure space. Moreover, the study introduces the separation axioms and investigates the characteristics of fraction dense spaces, Inline graphic spaces and Pythagorean fuzzy Inline graphic continuous functions which have not been previously explored in this setting. This novel study provides a new and meaningful perspective for analyzing and generalizing topological properties within the Pythagorean fuzzy context.

Review of literature

The term frame was introduced by Duffin and Schaeffer3 in non-harmonic fourier series. Later Dowker and Papert4 first studied frames in topology. He defined the complete lattice as the open subsets of a topological space5. They also demonstrated that the non-tautological statement of point-set topology can be verified in frame theory, or topology without points. Structured frames has been studied by Frith6. He established the category of uniform frames and quasi uniform frames. He also investigated the links between various frames. Later paracompactness is studied using frames by Pultr and Ulehla7. This study defined frames as paracompact and properties of paracompact frames were examined. This study also proved the frames are normal. Closure and compactness of frames were also studied by Masuret8. Rajesh and Thrivikraman9 investigated frames in fuzzy and intuitionistics fuzzy contexts. Various properties of fuzzy frames and intuitionistic frames were discussed in this study. Later Lattice valued fuzzy frames(L-Frames) were discussed by El-Saady10. This study defined the concept of L-fuzzy sub-frames of a given ordinary frame related to traditional frames analogously to how L-fuzzy topological spaces related to L-topological spaces. Some properties of L-fuzzy sub-frames are explored. The notion of the existence of L-fuzzy sub-frames of a particular ordinary frame was put forward in this work in the same way as L-fuzzy topological spaces were defined in relation to L-topological spaces. Also11 Studies in categorical topology have examined the relationship between topological spaces and frames in presheaf toposes of Msets, exploring internalizations, functorial connections, and conditions for adjunctions, with special focus on sobriety and spatiality when M is a group. Later fuzzy frames were studied via fuzzy posets Yao12. Yao’s intention was to define an L-frame using an L-ordered set that included more restrictions. All of these works illustrate how frames have been investigated in a variety of circumstances. Frames are explored in fraction dense space in this article. Zhang13 investigated a general frame in intuitionistic rough set and defined intuitionistic fuzzy relation and its properties using lattice. Thumbakara14defined intuitionistic fuzzy frame and coframe and also explored intuitionistic fuzzy filters in coframe context15. have explored ideals generated by frame homomorphisms where structures are used to form frame congruences and sublocales and the resulting locale is analyzed for compactness conditions linking algebraic and topological properties16, have explored semilattice-based structures such as S-bases, D-bases, and L-bases to generalize frame completeness properties and unify classical classes like zero-dimensional, completely regular, and coherent frames.. These classical study paved way to define a structure space using frames in Pythagorean fuzzy context in the present study. Furthermore, continuity is defined in the present study based on1721 and these are the basic study to define the fuzzy continuous function. So these references are reviewed to define continuity in Pythagorean fuzzy frame. Separation axioms are also included based on the study of16,2226. Since these separation axioms gives the detail study of open sets. The separation axioms defined in the study is based on above mentioned study. The concept of fraction dense space was given by Hager and Martinez27 in algebra. It was insisted that Fraction-dense algebras arise naturally in the consideration of quotient rings, and they give rise to an interesting class of topological spaces.

Contribution of the study

The paramount goal of this scholarly article is to analyse the behaviour of Pythagorean fuzzy frames which is defined as Pythagorean fuzzy sets in various spaces.

  • (i)

    The paper constructively deal with the an introduction of Pythagorean fuzzy frames, which is novel and represents an extension of existing intuitionistic fuzzy frames.

  • (ii)

    Pythagorean fuzzy Inline graphic structure space is established using Pythagorean fuzzy frames. Then Pythagorean fuzzy Inline graphic closed sets is defined. Also continuity, separation axioms of the Pythagorean fuzzy Inline graphic structure space are meticulously investigated in order to study the Pythagorean fuzzy Inline graphic open sets of the Pythagorean fuzzy Inline graphic structure space.

  • (iii)

    Pythagorean fuzzy Inline graphic structure space is carving the path toward the conceptualization of Pythagorean fuzzy Inline graphic fraction dense space.

  • (iv)

    The conceptual framework Pythagorean Fuzzy Inline graphic fraction dense space enhances the investigation of how the frames behave as sets in the new space established.

  • (v)

    The Pythagorean fuzzy Inline graphic space is defined to study the relationship between the PFInline graphicRCS and Pythagorean fuzzy Inline graphic closed sets.

Structure of the paper

In this study, section “Preliminaries”, consists of the basic definitions used for the study. Section “Pythagorean fuzzy frame (PFF)”, gives the definition for Pythagorean fuzzy frames and Pythagorean fuzzy Inline graphic structure space is explained. Also Pythagorean fuzzy Inline graphic closed set is defined in the Pythagorean fuzzy Inline graphic structure space. Various properties of Pythagorean fuzzy Inline graphic structure space is discussed. In section 6, Pythagorean fuzzy Inline graphic fraction dense space is defined. In section 7, Pythagorean fuzzy Inline graphic space defined and the characterisations are explored. The flowchart provides the framework of the study Fig. 1.

Fig. 1.

Fig. 1

Framework of the Pythagorean fuzzy Inline graphic fraction dense space.

Preliminaries

This section provides the basic definition for this study and the nomenclature used for this study is given in the Table 1.

Table 1.

Nomenclature of this study.

Expansion Abbreviation
Pythagorean fuzzy frame PFF
Pythagorean fuzzy Inline graphic structure space PFInline graphicSS
Pythagorean fuzzy Inline graphic open set PFInline graphicOS
Pythagorean fuzzy Inline graphic closed set PFInline graphicCS
Pythagorean fuzzy Inline graphic closed set PFInline graphicCS
Pythagorean fuzzy Inline graphic closed set PFInline graphicCS
Pythagorean fuzzy Inline graphic regular open set PFInline graphicROS
Pythagorean fuzzy Inline graphic regular closed set PFInline graphicRCS
Pythagorean fuzzy dense set PFDS
Pythagorean fuzzy nowhere dense set PFnWDS
Pythagorean somewhere dense set PFsWDS
Pythagorean fuzzy cs-dense set PFcsDS
Pythagorean fuzzy Inline graphic continuous function PFInline graphicCF
Pythagorean fuzzy Inline graphic fraction dense space PFInline graphicFDS
Pythagorean fuzzy Inline graphic space PFInline graphic S

Definition 1

28A lattice is the partial ordered elements of the power set Inline graphic of a universal set Inline graphic (or any subset of Inline graphic) can be ordered by the set inclusion S in which the join (least upper bound, supremum) and meet (greatest lower bound, infimum) of any pair of sets Inline graphic is given by Inline graphic and Inline graphic, respectively.

Definition 2

5A partially ordered set(poset) is a set L with a relation Inline graphic, such that

  1. if Inline graphic and Inline graphic then Inline graphic and

  2. if Inline graphic and Inline graphic then Inline graphic.

Definition 3

5A complete lattice is a partially ordered set such that every subset A of L has a least upper bound. The least upper bound is unique and usually called the join of A and written as Inline graphic or in terms of elements, Inline graphic or Inline graphic.

Definition 4

29A frame is a complete lattice L satisfying the distributivity law Inline graphic for any subset Inline graphic and any Inline graphic.

Definition 5

30A Pythagorean fuzzy set R of Inline graphic is a pair Inline graphic such that Inline graphic for any Inline graphic where the fuzzy set Inline graphic,Inline graphic are the membership value and non-membership value respectively and Inline graphic is the strength of commitment at a point.

Definition 6

30Let Inline graphic be a family of Pythagorean fuzzy set of Inline graphic. If

  • (i)

    Inline graphic

  • (ii)

    Inline graphic, we have Inline graphic where I is an arbitrary index set .

  • (iii)

    Inline graphic, then Inline graphic, where Inline graphic and Inline graphic, then Inline graphic is called a Pythagorean fuzzy topology on Inline graphic and the pair Inline graphic be a Pythagorean fuzzy topological space.

Definition 7

30Let Inline graphic and Inline graphic be two Pythagorean fuzzy sets of a non-empty set Inline graphic. Then,

  • (iv)

    Inline graphic or Inline graphic if Inline graphic and Inline graphic

Definition 8

31Let Inline graphic be a Pythagorean fuzzy topological space and Inline graphic be a Pythagorean fuzzy set in Inline graphic. Then the Pythagorean fuzzy interior and Pythagorean fuzzy closure are defined by,

  • (i)

    int(R)= Inline graphic{G|G is a PFOS in Inline graphic and Inline graphic}

  • (ii)

    cl(R)= Inline graphic{K|K is a PFCS in Inline graphic andInline graphic}

Pythagorean fuzzy frame (PFF)

In this section PFF and Pythagorean fuzzy Inline graphic structure space(PFInline graphicSS) is defined using PFFs. Further Pythagorean fuzzy Inline graphic closed set(PFInline graphicCS) is defined in Pythagorean fuzzy Inline graphic structure space. Various sets Pythagorean fuzzy dense set, Pythagorean fuzzy nowhere dense sets, Pythagorean fuzzy somewhere dense set, Pythagorean fuzzy cs-dense set is also defined and the continuous function of the defined PFInline graphicSS is discussed.

Definition 9

Let Inline graphic be the frame in Inline graphic, then the Pythagorean fuzzy set Inline graphic is said to be PFF in Inline graphic, if it satisfies the following conditions:

  • (i)

    Inline graphic Inline graphic for every arbitrary Inline graphic.

  • (ii)

    Inline graphic Inline graphicfor every Inline graphic.

  • (iii)

    Inline graphic Inline graphic for all Inline graphic where Inline graphic and Inline graphic are unit and zero element of the frame Inline graphic.

Example 1

Let Inline graphic on Inline graphic where Inline graphic be the frame and Inline graphic where Inline graphic

Inline graphic is a PFF of Inline graphic.

Definition 10

Let Inline graphic be the frame of any non-empty set Inline graphic and let Inline graphic be a collection of PFFs. If this collection satisfies the following axioms

  • (i)

    Inline graphic,Inline graphic

  • (ii)

    for any Inline graphic, where have Inline graphic

  • (iii)

    for any Inline graphic Inline graphic, then (Inline graphic) is called Pythagorean fuzzy Inline graphicstructure space(PFInline graphicSS). Each member in (Inline graphic) is Pythagorean fuzzy Inline graphic open set(PFInline graphicOS) and its complement is called Pythagorean fuzzy Inline graphic closed set(PFInline graphicCS).

Example 2

Consider the frame Inline graphic. The PFFs Inline graphic are defined as Inline graphic, Inline graphic, Inline graphic where,Inline graphic

Inline graphic

Inline graphic

Inline graphic

Inline graphic

Inline graphic.

Therefore the collection of PFFs Inline graphic is a PFInline graphic structure. Then the structure Inline graphic is a PFInline graphicSS.

Definition 11

Pythagorean fuzzy Inline graphic closure and Pythagorean fuzzy Inline graphic interior of a PFS is defined by,

Inline graphic is Inline graphic closed in Inline graphic Inline graphic is Inline graphic open in Inline graphic

Definition 12

A PFF P of a PFInline graphicSS Inline graphic is called PFInline graphicCS if Inline graphic whenever Inline graphic where Inline graphic is a PFInline graphicOS and Inline graphic. The counterpart of PFInline graphicCS is the PFInline graphicOS.

Notation: Inline graphic will indicate the assortment of all PFInline graphicCS in Inline graphic.

Definition 13

A PFF P of a PFInline graphicSS Inline graphic is called PFInline graphicCS if Inline graphic wheneverInline graphic where Inline graphic is a PFOS and Inline graphic. The counterpart of PFInline graphicCS is the PFInline graphicOS.

Definition 14

The collection Inline graphic is PFInline graphicCS in Inline graphic. The counterpart of PFInline graphicCS is PFInline graphicOS.

Notation: Inline graphic will indicate the assortment of all PFInline graphicCS in Inline graphic.

Definition 15

Let Inline graphic be PFInline graphicSS. A PFF R is called a Pythagorean fuzzy Inline graphic regular open set (PFInline graphicROS) if and only if Inline graphic; A PFS S is called a Pythagorean fuzzy Inline graphic regular closed (PFInline graphicRCS) if and only if Inline graphic

Proposition 1

Let Inline graphic be PFInline graphicSS, Then

  • (i)

    The closure of PFInline graphicOS is a PFInline graphicRCS.

  • (ii)

    The interior of PFInline graphicCS is a PFInline graphicROS.

Proof

(i) Let K be a PFInline graphicOS in Inline graphic. Clearly, Inline graphic implies that Inline graphic. Now K is open implies that Inline graphic and hence Inline graphic. Thus Inline graphic is a PFInline graphicRCS.

(ii) The proof is similar to (i) . Inline graphic

Proposition 2

For a PFF E of a PFInline graphicSS Inline graphic. Then

  • (i)

    Inline graphic.

  • (ii)

    Inline graphic.

Proof

(i) Inline graphic

Inline graphic

Inline graphic

Inline graphic where Inline graphic.

(ii) Inline graphic

Inline graphic

Inline graphic

Inline graphic where Inline graphic. Inline graphic

Definition 16

A PFF K is a PFInline graphicSS Inline graphic is called

  • (i)

    PFDS if there exists no PFInline graphicCS G in Inline graphic such that Inline graphic that is Inline graphic in Inline graphic.

  • (ii)

    PFnWDS if there exists no non-zero PFInline graphicOS F in Inline graphic such that Inline graphic that is Inline graphic in Inline graphic.

  • (iii)

    PFsWDS if there exists a non-zero PFInline graphicOS G in Inline graphic such that Inline graphic that is Inline graphic in Inline graphic and Inline graphic is called a complement of PFsWDS in Inline graphic and is denoted as PFcs-DS in Inline graphic.

Proposition 3

If K is a PFsWDS in a PFInline graphicFDS Inline graphic, then there exists a PFInline graphicRCS N in Inline graphic such that Inline graphic.

Proof

Let E be a PFsWDS in Inline graphic. Then, there exists PFInline graphicOS in Inline graphic such that Inline graphic. Now Inline graphic. Since F is a PFInline graphicOS by Proposition 6.2.51, the closure of F is a PFInline graphicRCS in Inline graphic. Let Inline graphic. Then for the PFsWDS in K in Inline graphic there exists a PFInline graphicRCS N in Inline graphic such that Inline graphic. Inline graphic

Proposition 4

If K is a PFcs-DS in PFInline graphicFDS Inline graphic then,

  • (i)

    Inline graphic is not a PFDS in Inline graphic.

  • (ii)

    There exists a PFInline graphicROS in Inline graphic such that Inline graphic.

Proof

(i) Let K be a PFcs-DS in Inline graphic. Then Inline graphic is a PFsWDS in Inline graphic. Thus Inline graphic

Inline graphic in Inline graphic. This implies that Inline graphic. So Inline graphic. Hence Inline graphic is not a PFDS in Inline graphic.

(ii) By (i) Inline graphic is not a PFDS in Inline graphic. Then there exists a PFInline graphicCS F in Inline graphic such that Inline graphic. Thus Inline graphic. That is Inline graphic in Inline graphic. Since F is a PFInline graphicCS in Inline graphic. By Proposition 6.2.51 Inline graphic is a PFInline graphicROS in Inline graphic. Let Inline graphic. Then there exists a PFInline graphicROS N in Inline graphic such that Inline graphic. Inline graphic

Continuous function in PFInline graphicSS

Definition 17

Let Inline graphic and Inline graphic be any two PFInline graphicSS and let Inline graphic be a function. If for any Inline graphic of Inline graphic, Inline graphic is a Inline graphic in Inline graphic, then Inline graphic is said to be a Pythagorean fuzzy Inline graphic continuous function (PFInline graphicCF).

Proposition 5

Let Inline graphic and Inline graphic be any two PFInline graphicSS and let Inline graphic be PFInline graphicCF. Then for every PFF in Inline graphic, Inline graphic.

Proof

Let K be a PFF in Inline graphic. Since Inline graphic is a PFInline graphicCS and Inline graphic is a PFInline graphicCF. Inline graphic is a PFInline graphicCS and Inline graphic. Now Inline graphic. Therefore, Inline graphic. Inline graphic

Proposition 6

Let Inline graphic and Inline graphic be any two PFInline graphicSS. If E is PFInline graphicCS in Inline graphic and if Inline graphic be a PFInline graphicCF then Inline graphic is a PFInline graphicCS in Inline graphic.

Proof

Let K be a PFInline graphicOS in Inline graphic. If Inline graphic then Inline graphic in Inline graphic. Since E is a PFInline graphicCS and Inline graphic is a PFInline graphicOS in Inline graphic. Then Inline graphic implies Inline graphic. By assumption, Inline graphic is PFInline graphicCS in Inline graphic and Inline graphic. Hence Inline graphic is PFInline graphicCS. Inline graphic

Proposition 7

Let Inline graphic and Inline graphic be two PFInline graphicSS and Inline graphic. Then the following statements are equivalent:

  • (i)

    Inline graphic is PFInline graphicCF.

  • (ii)

    Inline graphic for each E in Inline graphic.

  • (iii)

    Inline graphic for each E in Inline graphic.

Proof

Inline graphic from (i) Inline graphic is PFInline graphicCF. Let E be a Pythagorean fuzzy frame. By the definition of PFInline graphicCF Inline graphic is a PFF in Inline graphic. Inline graphic is a PFF in Inline graphic then Inline graphic is a PFF in Inline graphic. Therefore, Inline graphic.

Inline graphic. Given Inline graphic. Let E be a PFF in Inline graphic. Let E be a PFInline graphicOS in Inline graphic. Since Inline graphic, Inline graphic. By (i) Inline graphic. Therefore Inline graphic. Hence Inline graphic. Therefore Inline graphic is a PFF in Inline graphic. Hence Inline graphic is PFInline graphicCF.

Inline graphic Given Inline graphic is PFInline graphicCF. Let E is a PFF in Inline graphic and Inline graphic. By Proposition 6.2.55, Inline graphic. Thus Inline graphic.

Inline graphic Inline graphic. To prove Inline graphic is PFInline graphicCF. It is enough to prove the inverse image of each PFF in Inline graphic is a PFF in Inline graphic. Let E be a PFF in Inline graphic. To show that Inline graphic is PFF in Inline graphic. Since Inline graphic. Inline graphic but Inline graphic. Hence Inline graphic. Therefore Inline graphic is PFF in Inline graphic. This proves Inline graphic is a PFInline graphicCF. Inline graphic

Separation axioms on Pythagorean fuzzy Inline graphic structure space

In this section, separation axioms are discussed on Pythagorean fuzzy Inline graphic structure space in detail. Four different Inline graphic spaces are defined and the characterisations are investigated.

Definition 18

A Inline graphic Inline graphic is called

  • (i)

    Inline graphic space a) if for all Inline graphic there exists a Inline graphic such that Inline graphic or Inline graphic.

  • (ii)

    Inline graphic space b) if for all Inline graphic there exists a Inline graphic such that Inline graphic or Inline graphic.

  • (iii)

    Inline graphic space c) if for all Inline graphic there exists a Inline graphic such that Inline graphic or Inline graphic.

  • (iv)

    Inline graphic space d) if for all Inline graphic there exists a Inline graphic such that Inline graphic or Inline graphic.

Proposition 8

Let Inline graphic be a Inline graphic. Then the following implications hold and it is given in Fig. 2

Fig. 2.

Fig. 2

This diagram depicts the implication of Inline graphic space.

Proof

To prove Inline graphic. Let Inline graphic be a Inline graphic by definition of Inline graphic for all Inline graphic there exists Inline graphic such that Inline graphic implies Inline graphic, which is Inline graphic. Hence Inline graphic.

Similarly, Inline graphic

Inline graphic,

Inline graphic,

Inline graphic. Inline graphic

Remark 1

The converse of the above implications is not true. It can be seen through the following Examples 6.3.31, 6.3.32, 6.3.33.

Example 3

Consider the frame Inline graphic. The PFFs Inline graphic are defined as Inline graphic, Inline graphic, Inline graphic

Inline graphic, Inline graphic where,

Inline graphic

Inline graphic

Inline graphic

Inline graphic

Inline graphic

Inline graphic.

Inline graphic

Inline graphic.

Then Inline graphic is a Inline graphic but not Inline graphic.

Example 4

Consider the frame Inline graphic. The PFFs Inline graphic are defined as Inline graphic, Inline graphic where,

Inline graphic

Inline graphic

Inline graphic

Inline graphic

Then Inline graphic is a Inline graphic but not Inline graphic.

Example 5

Consider the frame Inline graphic. The PFFs Inline graphic are defined as Inline graphic, Inline graphic where,

Inline graphic

Inline graphic

Inline graphic

Inline graphic

Then Inline graphic is a Inline graphic but not Inline graphic.

Proposition 9

Let Inline graphic be a Inline graphic, Inline graphic and Inline graphic be the characteristic function of Q and Inline graphic then

  • (i)

    Inline graphic is Inline graphic is Inline graphic

  • (ii)

    Inline graphic is Inline graphic is Inline graphic

  • (iii)

    Inline graphic is Inline graphic is Inline graphic

  • (iv)

    Inline graphic is Inline graphic is Inline graphic

Proof

Let Inline graphic is a Inline graphic space a). Let Inline graphic. Let Inline graphic then Inline graphic as Inline graphic. Since Inline graphic is Inline graphica)space then there exists Inline graphic such that Inline graphic and Then R are Inline graphic in Q such that Inline graphic. Then Q is also Inline graphica) space.

The proof of (ii), (iii), (iv) is obvious. Inline graphic

Definition 19

A Inline graphic Inline graphic is called

  • (i)

    Inline graphic space a) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic

  • (ii)

    Inline graphic space b) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic

  • (iii)

    Inline graphic space c) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic

  • (iv)

    Inline graphic space d) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic

Proposition 10

Let Inline graphic be a Inline graphic. Then the following implications hold and it is given in Fig. 3

Fig. 3.

Fig. 3

This diagram depicts the implication of Inline graphic space.

Proof

To prove Inline graphic. Let Inline graphic be a Inline graphic by definition of Inline graphic for all Inline graphic there exists Inline graphic such that Inline graphic and Inline graphic implies Inline graphic Inline graphic, which is Inline graphic. Hence Inline graphic. Similarly, Inline graphic

Inline graphic,

Inline graphic,

Inline graphic. Inline graphic

Remark 2

None of the above implications are true. It can be proved by the following similar examples.

Proposition 11

Let Inline graphic be a Inline graphic, Inline graphic and Inline graphic be the characteristic function of Q and Inline graphic then

  • (i)

    Inline graphic is Inline graphic is Inline graphic

  • (ii)

    Inline graphic is Inline graphic is Inline graphic

  • (iii)

    Inline graphic is Inline graphic is Inline graphic

  • (iv)

    Inline graphic is Inline graphic is Inline graphic

Proof

Let Inline graphic is a Inline graphic space a). Let Inline graphic. Let Inline graphic then Inline graphic as Inline graphic. Since Inline graphic is Inline graphica)space then there exists Inline graphic such that Inline graphic and Inline graphic. Then RS are Inline graphic in Q such that Inline graphic and Inline graphic. Then Q is also Inline graphica) space.

The proof of (ii), (iii), (iv) is obvious. Inline graphic

Definition 20

A Inline graphic is called

  • (i)

    Inline graphic space a) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic

  • (ii)

    Inline graphic space b) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic where Inline graphic

  • (iii)

    Inline graphic space c) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic where Inline graphic

  • (iv)

    Inline graphic space d) if for all Inline graphic there exists a Inline graphic such that Inline graphic and Inline graphic where Inline graphic

Proposition 12

Let Inline graphic be a Inline graphic. Then the following implications hold and it is given in Fig. 4

Fig. 4.

Fig. 4

This diagram depicts the implication of Inline graphic space.

Proof

To prove Inline graphic. Let Inline graphic be a Inline graphic by definition of Inline graphic for all Inline graphic there exists Inline graphic such that Inline graphic and Inline graphic implies Inline graphic and Inline graphic where Inline graphic which is Inline graphic. Hence Inline graphic. Similarly, Inline graphic

Inline graphic,

Inline graphic,

Inline graphic. Inline graphic

Pythagorean fuzzy Inline graphic fraction dense space (PFInline graphicFDS)

In this section we define Pythagorean fuzzy Inline graphic fraction dense space using the Pythagorean fuzzy Inline graphic structure space.

Definition 21

A PFInline graphicSS (Inline graphic) is called Pythagorean fuzzy Inline graphic fraction dense space (PFInline graphicFDS) if for each Inline graphic M in Inline graphic, Inline graphic where F is a Inline graphic in Inline graphic.

Example 6

Consider the frame Inline graphic. The PFFs Inline graphic are defined as Inline graphic, Inline graphic, Inline graphic

Inline graphic where,Inline graphic

Inline graphic

Inline graphic

Inline graphic

Inline graphic

Inline graphic.

Therefore the collection of PFFs Inline graphic. Then the structure Inline graphic is a PFInline graphicSS. Let Inline graphic are the PFInline graphicCS in Inline graphic which is defined as,

Inline graphic

Inline graphic

Inline graphic

Inline graphic

Then the Inline graphic = Inline graphic is PFInline graphicS. Therefore, PFInline graphicSS Inline graphic is called PFInline graphicFDS.

Proposition 13

A PFInline graphicSS Inline graphic is a PFInline graphicDS if and only if for each PFInline graphicRCS F in Inline graphic, Inline graphic where N is a PFInline graphicCS in Inline graphic.

Proof

Let F be a PFInline graphicRCS in Inline graphic. Then Inline graphic in Inline graphic. Let Inline graphic. Then K is PFInline graphicOS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, Inline graphic where N is a PFInline graphicCS in Inline graphic. Thus Inline graphic and Inline graphic in Inline graphic. Conversely, let T be a PFInline graphicOS in Inline graphic. Then Inline graphic is a PF Inline graphic RCS in Inline graphic. By Proposition 4.10 Inline graphic where K is a PFInline graphicCS in Inline graphic and then Inline graphic is PFInline graphicFDS. Inline graphic

Proposition 14

If Inline graphic is a PFInline graphicFDS and L is a PFInline graphicROS in Inline graphic then Inline graphic where R is a PFInline graphic in Inline graphic.

Proof

Let L is a PFInline graphicROS in Inline graphic. Inline graphic is a PFInline graphicRCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS by Proposition 6.3 Inline graphic where K is a PFInline graphicCS in Inline graphic. Then Inline graphic by Proposition 4.11. Let Inline graphic where K is a PFInline graphicOS in Inline graphic. Hence Inline graphic where R is a PFInline graphicOS in Inline graphic. Inline graphic

Proposition 15

If K is a PFInline graphicOS in PFInline graphicFDS Inline graphic, then there exists a PFInline graphicCS G in Inline graphic such that Inline graphic.

Proof

Let K be a PFInline graphicOS in Inline graphic. Since Inline graphic is a PFInline graphicFDS. Inline graphic where S is a PFInline graphicCS in Inline graphic. Inline graphic implies Inline graphic. Inline graphic

Proposition 16

If K is a PFInline graphicOS in a PFInline graphicDS in Inline graphic, then there exists a PFInline graphicCS S in Inline graphic such that Inline graphic.

Proof

Let K be a PFInline graphicOS in Inline graphic. Now Inline graphic in Inline graphic. Since Inline graphic is a PFInline graphicFDS, Inline graphic. Then K is PFInline graphicCS in Inline graphic. Thus there exists a PFInline graphicCS K in Inline graphic such that Inline graphic. Inline graphic

Proposition 17

If K is a PFInline graphicOS in PFInline graphicFDS in Inline graphic, then there exists PFInline graphicCS G and S in Inline graphic such that Inline graphic.

Proof

Let K be a PFInline graphicOS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, by Proposition 6.5, there exists a PFInline graphicCS G in Inline graphic such that Inline graphic. Also by Proposition 6.6, there exists a PFInline graphicCS E in Inline graphic such that Inline graphic. Then Inline graphic. Since Inline graphic in Inline graphic, for a PFInline graphicOS K in Inline graphic, Inline graphic. Inline graphic

Proposition 18

If Q is a PFInline graphicCS in PFInline graphicFDS Inline graphic, then there exists a PFInline graphicOS R in Inline graphic such that Inline graphic.

Proof

Let Q is a PFInline graphicCS. Then Inline graphic is a PFInline graphicOS in Inline graphic. Since Inline graphic is a PFInline graphicFDS by Proposition 6.5 there exists a PFInline graphicCS G in Inline graphic, Inline graphic. Then, Inline graphic by Proposition 4.11. This implies that Inline graphic. Let Inline graphic. Then Inline graphic is a PFInline graphicOS and Inline graphic in Inline graphic. Inline graphic

Proposition 19

If Q is a PFInline graphicCS in PFInline graphicFDS Inline graphic, then there exists a PFInline graphicOS M in Inline graphic such that Inline graphic.

Proof

Let Q is a PFInline graphicCS in Inline graphic. Then Inline graphic is PFInline graphicOS in Inline graphic. Since Inline graphic is PFInline graphicFDS by Proposition 6.6, there exists a PFInline graphicCS in Inline graphic such that Inline graphic. then, Inline graphic and by Proposition 4.11 Inline graphic. Let Inline graphic and M is a PFInline graphicOS in Inline graphic and Inline graphic in Inline graphic. Inline graphic

Proposition 20

If Q is a PFInline graphicCS in PFInline graphicFDS in Inline graphic, then there exists PFInline graphicOS M and R in Inline graphic such that Inline graphic in Inline graphic.

Proof

Let Q be a PFInline graphicCS in Inline graphic. Since Inline graphic is PFInline graphicFDS, by Proposition 6.8 there exists a PFInline graphicOS R in Inline graphic such that Inline graphic. Also by Proposition 6.9, there exists a PFInline graphicOS M in Inline graphic such that Inline graphic, then Inline graphic in Inline graphic. This implies that Inline graphic in Inline graphic. Inline graphic

Proposition 21

If L is a PFInline graphicROS in a PFInline graphicFDS Inline graphic then there exists a PFInline graphicOS R with Inline graphic in Inline graphic such that Inline graphic.

Proof

Let L be a PFInline graphicROS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, by Proposition 6.4, there exists a PFInline graphicOS R in Inline graphic such that Inline graphic. Now Inline graphic. This implies Inline graphic and thus Inline graphic. Thus there is a PFInline graphicOS R with Inline graphic in Inline graphic such that Inline graphic. Inline graphic

Corollary 1

If L is a PFInline graphicROS in a PFInline graphicFDS Inline graphic, then there exists a PFsWDS R in Inline graphic such that Inline graphic.

Proof

Let L be a PFInline graphic ROS in Inline graphic.Since Inline graphic is a PFInline graphicFDS,by Proposition 6.11 there exists a PFInline graphicOS R with Inline graphic in Inline graphic such that Inline graphic. Now Inline graphic Inline graphic implies that R is a PFsWDS in Inline graphic. Inline graphic

Proposition 22

If M is a PFInline graphicRCS in PFInline graphicFDS Inline graphic, then there exists a PFInline graphicCS Q in Inline graphic such that Inline graphic.

Proof

Let M be a PFInline graphicRCS in Inline graphic. Then Inline graphic is a PFInline graphicROS in Inline graphic. Since Inline graphic is a PFInline graphicFDS by Proposition 6.11 there exists a PFInline graphicOS R in Inline graphic such that Inline graphic then Inline graphic. Let Inline graphic Let Q is a PFInline graphicCS in Inline graphic. Hence there exists a PFInline graphicCS Q in Inline graphic such that Inline graphic. Inline graphic

Corollary 2

If M is a PFInline graphicRCS in PFInline graphicFDS Inline graphic, then there exists a PFcs-DS Q in Inline graphic such that Inline graphic.

Proof

Let M be a PFInline graphicRCS in Inline graphic. Then Inline graphic is a PFInline graphicROS in Inline graphic. Since Inline graphic is a PFInline graphicFDS by Corollary 6.12, there exists a PFsWDS R in Inline graphic such that Inline graphic in Inline graphic. Then Inline graphic. Let Inline graphic. Then Q is a PFcs-DS in Inline graphic and Inline graphic. Inline graphic

Proposition 23

If Inline graphic is a PFInline graphicFDS, then there exists a PFInline graphicCS K and PFInline graphicOS R in Inline graphic such that Inline graphic.

Proof

Let L be a PFInline graphicROS in Inline graphic. Since Inline graphic is PFInline graphicFDS by Proposition 6.11 there exists a PFInline graphicOS R in Inline graphic such that Inline graphic and then Inline graphic in Inline graphic. Since a PFInline graphicROS is a PFInline graphicOS in Inline graphic, by Proposition 6.5. there exists a PFInline graphicCS K in Inline graphic such that Inline graphic. Then Inline graphic and thus Inline graphic in Inline graphic. Inline graphic

The following Propositions from Proposition 6.16 to Proposition 6.23 shows that PFInline graphicCS are not PFnWDS and the PFInline graphicOS are not PFDS in PFInline graphicFDS.

Proposition 24

If Q is a PFInline graphicCS in PFInline graphicFDS Inline graphic, then Q is not a PFnWDS in Inline graphic.

Proof

Let Q be a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS,by Proposition 6.9 there exists a PFInline graphicOS M in Inline graphic such that Inline graphic. Then Inline graphic and Inline graphic implies Inline graphic in Inline graphic. Hence Q is not a PFnWDS in Inline graphic. Inline graphic

Proposition 25

If K is a PFInline graphicOS in PFInline graphicFDS Inline graphic then K is not a PFDS in Inline graphic.

Proof

Let K is a PFInline graphicOS in Inline graphic. Suppose that Inline graphic in Inline graphic. Then Inline graphic. This implies that the PFInline graphicCS Inline graphic is a PFnWDS in the PFInline graphicFDS Inline graphic, a contradiction by Proposition 6.16. Hence K is a not a PFDS in Inline graphic. Inline graphic

Proposition 26

If Q is a PFInline graphicCS in PFInline graphicFDS Inline graphic there exists a PFInline graphicRCS K in Inline graphic such that Inline graphic.

Proof

Let Q is a PFInline graphicCS in Inline graphic, then Inline graphic. Since Inline graphic is a PFInline graphicFDS, Proposition 6.16, Q is a not a PFnWDS in Inline graphic and then Inline graphic in Inline graphic. Now Inline graphic and then there exists a PFInline graphicOS K in Inline graphic such that Inline graphic. Then Inline graphic and Inline graphic is a PFInline graphicRCS in Inline graphic by Proposition 4.10. Let Inline graphic. Hence there exists a PFInline graphicRCS K in Inline graphic such that Inline graphic. Inline graphic

Proposition 27

If K is a PFInline graphicOS in a PFInline graphicFDS Inline graphic then there exists a PFInline graphicROS L in Inline graphic such that Inline graphic.

Proof

Let K is a PFInline graphicOS in Inline graphic. Then Inline graphic is a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS by Proposition 6.18 there exists a PFInline graphicRCS K in Inline graphic such that Inline graphic. Then Inline graphic. Let Inline graphic and L is a PFInline graphicROS in Inline graphic and Inline graphic. Inline graphic

Proposition 28

If K is a PFnWDS in PFInline graphicFDS Inline graphic, then there exists a PFcs-DS Q in Inline graphic such that Inline graphic.

Proof

Let K be a PFnWDS in Inline graphic and then Inline graphic is a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, by Proposition 6.18 there exists a PFInline graphicRCS N in Inline graphic such that Inline graphic. By Corollary 6.14 there exists a PFcs-DS Q in Inline graphic such that Inline graphic and then Inline graphic. Inline graphic

Proposition 29

If K is a PFnWDS in a PFInline graphicFDS Inline graphic, then there exists no non-zero PFInline graphicRCS N in Inline graphic such that Inline graphic.

Proof

Let K is a PFnWDS in Inline graphic and Inline graphic. Since Inline graphic is a PFInline graphicFDS by Proposition 6.18. there exists a PFInline graphicRCS N in Inline graphic such that Inline graphic, then Inline graphic and Inline graphic. This implies that Inline graphic and Inline graphic. Thus, there exists no non-zero PFInline graphicRCS K in Inline graphic such that Inline graphic. Inline graphic

Proposition 30

Let K is a PFInline graphicFDS Inline graphic, then there exists a PFInline graphicOS R in Inline graphic such that Inline graphic.

Proof

Let K be a PFInline graphicROS in Inline graphic. Then Inline graphic in Inline graphic. Now Inline graphic is a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, by Proposition 6.9, there exists a PFInline graphicOS R in Inline graphic such that Inline graphic. Then Inline graphic and Inline graphic in Inline graphic. Inline graphic

Proposition 31

If K is a PFInline graphicROS in a PFInline graphicFDS Inline graphic, then there exists a PFInline graphicOS R and T in Inline graphic such that Inline graphic.

Proof

Let K be a PFInline graphicROS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, by Proposition 6.11, there exists a PFInline graphicOS in Inline graphic such that Inline graphic. Also by Proposition 6.22, there exists a PFInline graphicOS T in Inline graphic such that Inline graphic. Thus Inline graphic in Inline graphic. Inline graphic

Pythagorean fuzzy Inline graphic fraction dense space and Pythagorean fuzzy Inline graphic space (PFInline graphicS)

In this section Pythagorean fuzzy Inline graphic space is defined and it is proved that PFInline graphicRCS are PFInline graphicCS, also PFInline graphicROS are PFInline graphicOS in PFInline graphicFDS and PFInline graphicS.

Definition 22

A PFInline graphicFDS Inline graphic is called PFInline graphicS if each PFInline graphicOS in Inline graphic is PFInline graphicOS in Inline graphic.

Proposition 32

If F is a PFInline graphic RCS in a PFInline graphicFDS and PFInline graphicS Inline graphic, then F is a PFInline graphicCS in Inline graphic.

Proof

Let F be a PFInline graphicRCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, by Proposition 6.3. Inline graphic where K is a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicS, PFInline graphicCS K is a PFInline graphicCS and then Inline graphic in Inline graphic. Hence PFInline graphicRCS F is a PFInline graphicCS in Inline graphic. Inline graphic

Corollary 3

If K is PFInline graphicROS in PFInline graphicFDS and PFInline graphicS Inline graphic, then K is a PFInline graphicOS in Inline graphic.

Proof

Let K be a PFInline graphicROS in Inline graphic. Then Inline graphic is a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS, by Proposition 7.2. Inline graphic is PFInline graphicCS in Inline graphic and thus K is a PFInline graphicOS in Inline graphic. Inline graphic

Proposition 33

If F is a PFInline graphicCS in PFInline graphicFDS and PFInline graphicS Inline graphic, then F is a PFsWDS in Inline graphic.

Proof

Let F be a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicS, the PFInline graphicCS, F is a PFInline graphicCS and then by Proposition 6.16 F is not a PFnWDS in Inline graphic. Thus Inline graphic in Inline graphic. Hence F is a PFsWDS in Inline graphic. Inline graphic

Corollary 4

If K is a PFInline graphicOS in PFInline graphicFDS and PFInline graphicS Inline graphic, then K is a PFcs-DS in Inline graphic.

Proof

Let K is a PFInline graphicOS in PFInline graphicFDS Inline graphic. Then Inline graphic is a PFInline graphicCS in Inline graphic. Since Inline graphic is a PFInline graphicFDS by Proposition 7.4. Inline graphic is PFsWDS in Inline graphic and thus K is a PFcs-DS in Inline graphic. Inline graphic

Proposition 34

If F is a PFInline graphicOS in PFInline graphicFDS and PFInline graphicS Inline graphic, then there exists a PFInline graphicRCS N in Inline graphic such that Inline graphic.

Proof

Let F is a PFInline graphicOS in Inline graphic. Since Inline graphic is PFInline graphicFDS and PFInline graphicS by Proposition 7.4. F is PFsWDS in Inline graphic. By Proposition 4.13. there exists a PFInline graphicRCS N in Inline graphic such that Inline graphic. Inline graphic

Corollary 5

If K is a PFInline graphicOS in PFInline graphicFDS and PFInline graphicS Inline graphic, then there exists a PFInline graphicROS T in Inline graphic such that Inline graphic.

Proof

Let K be a PFInline graphicOS in Inline graphic. Then Inline graphic is a PFInline graphicCS in Inline graphic. Since Inline graphic is PFInline graphicFDS and PFInline graphicS by Proposition 7.6., there exists a PFInline graphicRCS N in Inline graphic such that Inline graphic. This implies Inline graphic and Inline graphic. Let Inline graphic. Then T is a PFInline graphicROS in Inline graphic and Inline graphic. Inline graphic

Proposition 35

If K is a PFInline graphicOS in a PFInline graphicFDS and PFInline graphicS, then

  • (i)

    Inline graphic in Inline graphic.

  • (ii)

    K is not a PFDS in Inline graphic.

Proof

(i) Let K be a PFInline graphicOS in Inline graphic. Then Inline graphic is a PFInline graphicCS in Inline graphic. Since Inline graphic is PFInline graphicFDS and PFInline graphicS, by Proposition 7.4 Inline graphic is a PFsWDS and Inline graphic in Inline graphic. Then Inline graphic and Inline graphic in Inline graphic.

(ii) Since Inline graphic is a PFInline graphicS, the PFInline graphicOS K is a PFInline graphicOS in Inline graphic. Also since Inline graphic is a PFInline graphicFDS by Proposition 6.6, there exists a PFInline graphicCS N in Inline graphic such that Inline graphic and Inline graphic is PFInline graphicCS in Inline graphic, implies that Inline graphic in Inline graphic. Hence K is not a PFDS in Inline graphic. Inline graphic

Proposition 36

If K is a PFInline graphicOS in a PFInline graphicFDS and PFInline graphicS Inline graphic, then Inline graphic is a PFInline graphicCS in Inline graphic.

Proof

Let K be a PFInline graphicOS in Inline graphic. Since Inline graphic is a PFInline graphicFDS Inline graphic, where F is PFInline graphicCS in Inline graphic. Also Inline graphic is a PFInline graphicS, the PFInline graphicCS F is a PFInline graphicCS in Inline graphic and then Inline graphic. Then Inline graphic, where F is a PFInline graphicCS in Inline graphic. Hence Inline graphic is a PFInline graphicCS in Inline graphic. Inline graphic

Corollary 6

If F is a PFInline graphicCS in PFInline graphicFDS and PFInline graphicS Inline graphic, then Inline graphic is a PFInline graphicOS in Inline graphic.

Proof

Let F be PFInline graphicCS in Inline graphic. Then Inline graphic is a PFInline graphicOS in PFInline graphicFDS and PFInline graphicS Inline graphic, by Proposition 7.9. Inline graphic is PFInline graphicCS in Inline graphic. By Proposition 4.11. Inline graphic. Hence Inline graphic is a PFInline graphicOS in Inline graphic. Inline graphic

Comparison with existing theory

In the existing literature, the concept of Pythagorean fuzzy frames has been primarily studied as an extension of classical fuzzy and intuitionistic fuzzy frameworks, focusing mainly on the representation of uncertainty and partial truth in algebraic or decision-theoretic contexts. Earlier studies have concentrated on defining Pythagorean fuzzy sets, relations and topological spaces establishing their basic properties and operations. However, the structural development of Pythagorean fuzzy frames particularly from a topological viewpoint has remained limited.

The current study advances this theoretical foundation by introducing a Pythagorean fuzzy Inline graphic structure space which generalizes the notion of open sets in topology using frame theory. Unlike previous works that treated fuzzy frames as abstract algebraic constructs this research systematically defines and investigates new topological components within the Pythagorean fuzzy frame setting such as Pythagorean fuzzy Inline graphic closed sets, dense, nowhere dense and somewhere dense sets, Inline graphic continuous functions and separation axioms.

Furthermore, the study introduces and explores new spaces Pythagorean fuzzy Inline graphic fraction dense spaces and Pythagorean fuzzy Inline graphicspaces which have not been previously formulated in existing theories. These additions enrich the structural and functional understanding of Pythagorean fuzzy frames bridging the gap between abstract lattice theoretic foundations and topological generalizations.

In summary, while existing theories laid the groundwork for representing uncertainty using Pythagorean fuzzy sets and relations, the current study extends this framework by developing a comprehensive topological model based on frames offering a more generalized and flexible approach for analyzing fuzzy structures.

Conclusion and future work

In this study, Pythagorean fuzzy frames, Pythagorean fuzzy Inline graphic structure space, Pythagorean fuzzy Inline graphic continuous function, separation axioms on Pythagorean fuzzy Inline graphic structure space is established. Various sets are investigated in Pythagorean fuzzy Inline graphic structure space. Pythagorean fuzzy Inline graphic fraction dense space is introduced to study the defined sets in structure space. Several characterizations of PFInline graphicFDS are investigated. Also the relationship between PFInline graphic CS, PFInline graphicOS, PFInline graphic, PFInline graphicCS are are explored in PFInline graphicFDS and PFInline graphicS. In future, relationship between PFInline graphicFDS and various other spaces like baire space, sober space, cellular spaces can be investigated. Pythagorean fuzzy coframes, Pythagorean fuzzy subframes can be discussed in various Pythagorean fuzzy topological spaces.

The system of open sets of a space where the relationships between these sets meet certain lattice qualities is represented by an algebraic structure called a frame in topology. Each open set can be described in terms of degrees of membership and non-membership expressing uncertainty and partial truth conditions that are prevalent in many real-world systems by extending this concept into a Pythagorean fuzzy frame. For instance, a medical diagnosis system that groups patients according to test results and symptoms. A symptom may be categorized as present or absence using traditional crisp sets. In reality though, a lot of symptoms are not absolute; a patient may display them to some degree. Each symptom (like an open set) can be represented with Pythagorean fuzzy membership values using Pythagorean fuzzy frames which capture the degree to which a symptom confirms or refutes a diagnosis. The Pythagorean fuzzy component captures the uncertainty present in medical assessment while the frame structure guarantees the algebraic preservation of links among various symptoms (intersections, unions, and inclusion relations). This makes decision-making more precise and adaptable particularly in cases where clinical data are inconsistent or lacking. Similarly, this approach can be extended to: Risk analysis, where uncertain parameters influence investment or safety decisions. Artificial intelligence, where fuzzy frames support learning and reasoning under uncertainty. Engineering control systems, where approximate measurements require adaptive modeling.

Author contributions

1. N.B. Idea, Writing, Methodology and discussions 2. G.K. Idea, Drafting and Editing

Funding

Open access funding provided by Vellore Institute of Technology. The authors received no funding for this work.

Data availability

No datasets were generated or analysed during the current study.

Competing interests

The authors declare no competing interests.

Footnotes

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Atanassov, K. T. & Atanassov, K. T. Intuitionistic Fuzzy Sets (Springer, 1999).
  • 2.Yager, R. R. Pythagorean membership grades in multicriteria decision making. IEEE Trans. Fuzzy Syst.22(4), 958–965 (2013). [Google Scholar]
  • 3.Duffin, R. J. & Schaeffer, A. C. A class of nonharmonic fourier series. Trans. Am. Math. Soc.72(2), 341–366 (1952). [Google Scholar]
  • 4.Dowker, C. H. & Papert, D. Quotient frames and subspaces. Proc. Lond. Math. Soc.3(1), 275–296 (1966). [Google Scholar]
  • 5.Dowker, C. H. On urysohn’s lemma. General topology and its relations to modern analysis and algebra 111–114 (1967).
  • 6.Frith, J. L. Structured frames (1986).
  • 7.Pultr, A. & Úlehla, J. Notes on characterization of paracompact frames. Comment. Math. Univ. Carol.30(2), 377–384 (1989). [Google Scholar]
  • 8.Masuret, J. Closure and compactness in frames. PhD thesis, Stellenbosch: University of Stellenbosch (2010).
  • 9.Rajesh, K. T. & Thrivikraman, T. A study of frames in the fuzzy and intuitionist fuzzy contexts. PhD thesis, Department of Mathematics (2006).
  • 10.El-Saady, K. Lattice-valued fuzzy frames. Inf. Sci.177(21), 4810–4819 (2007). [Google Scholar]
  • 11.Mojgan, M. & Nejah, A. H. Topological spaces versus frames in the topos of M-sets. Categor. Gener. Algebr. Struct. Appl.20, 1 (2024). [Google Scholar]
  • 12.Yao, W. An approach to fuzzy frames via fuzzy posets. Fuzzy Sets Syst.166(1), 75–89 (2011). [Google Scholar]
  • 13.Zhang, X., Zhou, B. & Li, P. A general frame for intuitionistic fuzzy rough sets. Inf. Sci.216, 34–49 (2012). [Google Scholar]
  • 14.Thumbakara, R. K. et al. On intuitionistic fuzzy filters of intuitionistic fuzzy coframes. J. Math.2013, 1452 (2013). [Google Scholar]
  • 15.Sabna, K. S. & Mangalambal, N. R. Ideals and congruence with respect to a frame homomorphism. Adv. Math. Sci. J.9(4), 2031–2037 (2020). [Google Scholar]
  • 16.Alqahtani, M. H., Abd, A. M. & El-latif, K. Separation axioms via novel operators in the frame of topological spaces and applications. AIMS Math.9(6), 14213–14227 (2024). [Google Scholar]
  • 17.Azad, K. K. On fuzzy semicontinuity, fuzzy almost continuity and fuzzy weakly continuity. J. Math. Anal. Appl.82(1), 14–32 (1981). [Google Scholar]
  • 18.Hanafy, I. M. Fuzzy -open sets and fuzzy -continuity. J. Fuzzy Math7(2), 419–430 (1999). [Google Scholar]
  • 19.Papageorgiou, N. S. Fuzzy topology and fuzzy multifunctions. J. Math. Anal. Appl.109(2), 397–425 (1985). [Google Scholar]
  • 20.Saha, S. Fuzzy -continuous mappings. J. Math. Anal. Appl.126(1), 130–142 (1987). [Google Scholar]
  • 21.Warren, R. H. Neighborhoods, bases and continuity in fuzzy topological spaces. Rocky Mountain J. Math.1978, 459–470 (1978). [Google Scholar]
  • 22.Ahmed, E. Separation Axioms in Intuitionistic Fuzzy Topological Spaces. PhD thesis, University of Rajshahi (2015).
  • 23.Ahmed, E., Hossain, M. S. & Ali, D. M. On intuitionistic fuzzy t1-spaces (2014).
  • 24.Islam, M. S., Hossain, M. S. & Asaduzzaman, Md. Level separation on intuitionistic fuzzy t2 spaces. J. Math. Comput. Sci.8(3), 353–372 (2018). [Google Scholar]
  • 25.Islam, R., Hossain, M. S. & Amin, M. R. Some remarks on intuitionistic l-t2 spaces. Anna. Pure Appl. Math.13(2), 249–255 (2017). [Google Scholar]
  • 26.Prova, T. T. & Hossain, M. S. Separation Axioms in Intuitionistic Topological Spaces (Springer, 2025).
  • 27.Hager, A. W. & Martinez, J. Fraction-dense algebras and spaces. Can. J. Math.45(5), 977–996 (1993). [Google Scholar]
  • 28.Klir, G. & Yuan, B. Fuzzy Sets and Fuzzy Logic, volume 4 (Prentice Hall, 1995).
  • 29.Picado, J. & Pultr, A. Frames and Locales: Topology Without Points (Springer Science and Business Media, 2011).
  • 30.Olgun, M., Ünver, M. & Yardimci, S. Pythagorean fuzzy topological spaces. Complex Intell. Syst.5(2), 177–183 (2019). [Google Scholar]
  • 31.Haydar, E. A. Connectedness in pythagorean fuzzy topological spaces. Int. J. Math. Trends Technol.65, 110–116 (2019). [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

No datasets were generated or analysed during the current study.


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES