Skip to Content
MathematicsMathematics
  • Article
  • Open Access

29 August 2026

32 Pages

Fuzzy Aura Topological Spaces: Čech Closure Operators, Generalized Open Sets, and Rough Approximation

and
1
Department of Mathematics, Faculty of Science and Literature, Balıkesir University, Çağış Campus, 10145 Balıkesir, Türkiye
2
Department of Mathematics, American University of the Middle East, Egaila 54200, Kuwait
*
Author to whom correspondence should be addressed.
This article belongs to the Section B: Geometry and Topology

Abstract

We introduce a fuzzy aura topological space ( X , τ ˜ , a ˜ ) : a Chang-type fuzzy topological space carrying a fuzzy scope function a ˜ : X → τ ˜ with a ˜ ( x ) ( x ) = 1 , generalizing the crisp aura spaces. The scope function is a graded, per-point observation window; narrowing it turns the induced rough approximation into a variable-resolution model whose boundary shrinks as the window sharpens (refinement monotonicity), illustrated by closed-form multi-resolution segmentation examples on the line and in the plane. The fuzzy aura-closure cl a ˜ is a fuzzy additive Čech closure operator; it need not be idempotent, but its countable iteration is a fuzzy Kuratowski closure with the same fixed points, so both operators induce one fuzzy aura topology τ ˜ a ˜ , which, unlike in the crisp theory, need not be contained in τ ˜ . We introduce five classes of generalized fuzzy open sets forming a strict hierarchy, study fuzzy a ˜ -continuity and its decompositions, and define separation axioms fuzzy a ˜ - T i ( i = 0 , 1 , 2 ) and fuzzy a ˜ -regularity that depend on the scope function rather than the topology, together with a graded level variant of T 1 suited to continuous scope functions. The approximation operators coincide with the Dubois–Prade pair of the associated reflexive fuzzy relation and recover the Pawlak and crisp aura models as special cases.

1. Introduction

Topological spaces are often equipped with an auxiliary set-theoretic structure. Ideal topological spaces ( X , τ , I ) , rooted in the work of Kuratowski [1] and Vaidyanathaswamy [2], were systematically developed by Janković and Hamlett [3]. Dual and related structures, namely filters (Cartan [4]), grills (Choquet [5], Roy and Mukherjee [6], Al-Omari and Noiri [7]), and the recent primals (Acharjee, Özkoç, and Issaka [8]), have each led to their own closure operators and derived topologies; Al-Omari and Alqahtani [9] developed the closure-operator side of primal structures in detail, and Alghamdi [10] carried compactness into the primal setting.
Alongside these crisp developments, topology has been combined with fuzzy sets (Zadeh [11], Chang [12], Lowen [13]), soft sets (Molodtsov [14], Shabir and Naz [15]), and rough sets (Pawlak [16]). Each carries its own topology, and the combinations have been worked out from many angles; El-Bably, Fleifel, and Embaby [17] approached rough approximations through closure operators, Lin [18] recast rough interior and closure operators in categorical terms, and Zhan and Alcantud [19] put soft rough coverings to work on group decision problems. Per-point neighborhood systems remain an active route to rough approximation, as in the cardinality rough neighborhoods of Al-shami et al. [20], while Mareay, Abu-Gdairi, and Badr [21] hybridize the fuzzy and rough sides directly through covering-based soft rough fuzzy sets, and Wang, Xie, and Zhi [22] extend S-approximation spaces to a pair of fuzzy universes. Within fuzzy topology itself, generalized open sets and ideal-based structures continue to be developed, as in the fuzzy maximal μ -open sets of Swaminathan and Sheela [23], the fuzzy ideal supra structures of Abbas [24], and the fuzzy h I -open sets that a fuzzy ideal induces [25].
Fuzzy topology and rough sets have a long shared history. Dubois and Prade [26] built fuzzy rough sets from fuzzy relations, Radzikowska and Kerre [27] compared the models that followed, Yao [28] developed the constructive and algebraic sides of the theory, and Chacón-Gómez, Cornejo, and Medina [29] examined how decision rules operate inside fuzzy rough set theory.
Açıkgöz recently introduced the concept of an aura topological space  ( X , τ , a ) [30], where a scope function a : X → τ with x ∈ a ( x ) assigns to each point a fixed open neighborhood. This simple axiom yields an additive Čech closure operator, five generalized open-set classes, separation axioms depending on the scope function, and a rough set model that requires no equivalence relation.
The present paper generalizes aura topological spaces to the fuzzy setting. Working with Chang-type fuzzy topological spaces [12], we define a fuzzy scope function  a ˜ : X → τ ˜ satisfying a ˜ ( x ) ( x ) = 1 and call the resulting triple ( X , τ ˜ , a ˜ ) a fuzzy aura topological space. Moving from characteristic functions to membership grades is not just a change of notation. The closure and interior operators behave less rigidly, their link to the ambient topological closure is harder to pin down, and the rough set model must now handle graded uncertainty. Three differences from the crisp theory deserve emphasis at the outset. First, in the crisp case every a-open set is open in the ambient topology, whereas the fuzzy aura topology τ ˜ a ˜ can escape τ ˜ entirely (Example 6). Second, membership now spreads by degrees: a point can acquire partial closure membership through a cross-aura value even though no crisp intersection forms (Example 5). Third, the scope width becomes a continuously tunable resolution parameter whose effect on the rough boundary is monotone (Theorem 20), something the crisp model can imitate only by discrete refinement.
Why should this matter to a reader outside topology? For work on image or signal segmentation the payoff is concrete: the lower approximation of a foreground is its certain core, the upper approximation is its possible region, and the gap between them is the uncertain edge band, so Theorem 20 says that sharpening the observation window can only shrink that band, never widen it. For granular computing the same statement reads differently: the granulation carried by a ˜ can be refined along a continuum, with approximation quality improving monotonically all the way, instead of being switched between finitely many prescribed granulations. Section 7 works this out in closed form, for a one-dimensional signal and for a two-dimensional foreground.
A scope function is best read as a graded observation window: a ˜ ( x ) ( y ) is the degree to which y is visible from x, and a ˜ ( x ) ( x ) = 1 says each point sees itself sharply. The window is local and it is adjustable, and both properties matter for everything that follows. Narrowing it, for instance by shrinking the width σ of a Gaussian aura a ˜ σ ( x ) ( y ) = e − ( x − y ) 2 / σ 2 , sharpens the resolution at which a point sees its surroundings, and the induced rough approximation responds monotonically: the boundary region shrinks as the window narrows (Theorem 20). A single model therefore carries a resolution that can be tuned continuously, with the Pawlak, Dubois–Prade, and crisp aura models recovered at particular settings. A fixed ideal or grill cannot do this, because it fixes its auxiliary datum globally, once and for all. Section 7 develops this point, and the worked example on R there makes the resolution parameter explicit.
We should say plainly where the construction stands relative to fuzzy rough set theory. The two operators studied below are not new ones. Currying a scope function gives a reflexive fuzzy relation R ( x , y ) = a ˜ ( x ) ( y ) , and the fuzzy aura-closure and interior then coincide with the Dubois–Prade upper and lower approximations under R; they do not generalize that pair, and nothing beyond reflexivity enters the identification (Remark 4). The operator theory of such relational approximations is well developed, from the axiomatics of Morsi and Yakout [31] and the constructive theory of Wu, Mi, and Zhang [32] to the correspondence between reflexive transitive fuzzy relations and fuzzy topologies worked out by Qin and Pei [33] and Lai and Zhang [34], and the covering-based fuzzy neighborhood operators of D’eer, Cornelis, and Godo [35]. What the aura structure adds is not the operators but the pairing with an ambient fuzzy topology: the scope values are required to be fuzzy open, and the generalized open sets of Section 4 mix the ambient interior with the aura closure, producing a hierarchy and a failure of the Njåstad α -topology property, neither of which has a counterpart on the purely relational side. The separation axioms of Section 6 and the resolution reading of Section 7 are statements about this interplay. Two results below show how much rests on the openness requirement: a fuzzy topological space admits a scope function satisfying the strongest separation axioms precisely when its crisp singletons are fuzzy open (Proposition 8), and on the real line the aura closure acts on triangular and Gaussian profiles by adding widths, so it maps these fuzzy open profiles to fuzzy open profiles (Proposition 6). Concretely, what we claim as new is this: the hierarchy of five mixed classes and the strictness of every inclusion in it (Theorem 9, Example 7); the failure of the Njåstad property, which persists even under transitivity (Remark 12) and blocks the usual topological reading of a ˜ - α -continuity; the scale-additivity law and its consequence that the closure preserves fuzzy openness on the triangular and Gaussian families (Proposition 6); the collapse of the ungraded separation axioms together with the exact criterion for a topology to admit a separating scope function, and the graded level- α axiom that replaces them for continuous auras (Corollary 3, Proposition 8, Definition 18). Each of these statements involves both τ ˜ and a ˜ , and none of them can be formulated for a bare fuzzy relation.
The paper is organized as follows. Section 2 fixes notation and recalls what we need from fuzzy topology and rough set theory. Section 3 builds the fuzzy aura-closure and interior and the topology they induce, Section 4 the five classes of generalized fuzzy open sets, Section 5 the corresponding continuity notions and their decompositions, and Section 6 the separation axioms, ungraded and graded. Section 7 turns to the rough approximation operators, refinement monotonicity, and the segmentation reading, and Section 8 places the aura beside fuzzy ideals, fuzzy grills, fuzzy closure spaces, fuzzy neighborhood operators, and the Dubois–Prade model. Section 9 closes with the limitations we are aware of and the questions they leave open.

2. Preliminaries

We recall the basic definitions from fuzzy set theory, fuzzy topology, and rough set theory.

2.1. Fuzzy Sets and Fuzzy Topology

Definition 1
([11]). A fuzzy set on a non-empty set X is a function μ : X → [ 0 , 1 ] . We denote by I X the collection of all fuzzy sets on X. The fuzzy sets 0 ¯ and 1 ¯ are defined by 0 ¯ ( x ) = 0 and 1 ¯ ( x ) = 1 for all x ∈ X .
For fuzzy sets μ , ν ∈ I X , we write μ ≤ ν if μ ( x ) ≤ ν ( x ) for all x ∈ X , and define:
( μ ∨ ν ) ( x ) = max { μ ( x ) , ν ( x ) } , ( μ ∧ ν ) ( x ) = min { μ ( x ) , ν ( x ) } , μ c ( x ) = 1 − μ ( x ) .
For α ∈ [ 0 , 1 ] , the α-level set of μ is μ α = { x ∈ X : μ ( x ) ≥ α } , and the strong α-level set is μ α > = { x ∈ X : μ ( x ) > α } .
Definition 2
([12]). A Chang-type fuzzy topology on X is a subcollection τ ˜ ⊆ I X such that:
(FT1) 
0 ¯ , 1 ¯ ∈ τ ˜ ;
(FT2) 
λ , μ ∈ τ ˜ ⇒ λ ∧ μ ∈ τ ˜ ;
(FT3) 
{ λ i } i ∈ J ⊆ τ ˜ ⇒ ⋁ i ∈ J λ i ∈ τ ˜ .
Members of τ ˜ are fuzzy open; μ is fuzzy closed if μ c ∈ τ ˜ .
Definition 3
([12]). Let ( X , τ ˜ ) be a Chang-type fuzzy topological space. The fuzzy closure and fuzzy interior of μ ∈ I X are:
cl ( μ ) = ⋀ { ν ∈ I X : ν is fuzzy closed and μ ≤ ν } , int ( μ ) = ⋁ { λ ∈ τ ˜ : λ ≤ μ } .
Throughout the paper, cl and int without a subscript always denote these two ambient operators, computed in τ ˜ ; the aura operators carry the subscript a ˜ .
Definition 4.
Let ( X , τ ˜ ) be a fuzzy topological space and μ ∈ I X . Then μ is called:
(a) 
fuzzy semi-open [36] if μ ≤ cl ( int ( μ ) ) ;
(b) 
fuzzy pre-open [37] if μ ≤ int ( cl ( μ ) ) ;
(c) 
fuzzy α -open [37] if μ ≤ int ( cl ( int ( μ ) ) ) ;
(d) 
fuzzy β -open [38] if μ ≤ cl ( int ( cl ( μ ) ) ) .
The crisp antecedents of these notions go back to Levine [39] and Njåstad [40], and their fuzzy study was initiated by Mashhour, Ghanim, and Fath Alla [41]. The collections are denoted FSO ( X ) , FPO ( X ) , F α O ( X ) , F β O ( X ) , respectively. Both operators occurring here are the ambient ones of Definition 3: this definition belongs to the fuzzy topological space alone, and no scope function has been introduced at this stage. The aura counterparts are Definition 14, where the ambient closure is replaced by cl a ˜ and the ambient interior is deliberately kept; Remark 10 explains that choice.
Lemma 1
(Distributivity in the unit interval). Let a ∈ [ 0 , 1 ] and let { b i } i ∈ J , { c i } i ∈ J be non-empty families in [ 0 , 1 ] . Then
(a) 
min a , sup i b i = sup i min { a , b i } ;
(b) 
max a , inf i b i = inf i max { a , b i } ;
(c) 
inf i min { b i , c i } = min inf i b i , inf i c i , and dually
sup i max { b i , c i } = max sup i b i , sup i c i .
Proof. 
(a)
Each min { a , b i } is at most min { a , sup j b j } , so the supremum on the right does not exceed the left-hand side. For the converse, let t < min { a , sup j b j } . Then t < a and t < sup j b j , so b i > t for some i, whence min { a , b i } > t . As t was arbitrary below the left-hand side, the two sides agree.
(b)
Apply (a) to 1 − a and { 1 − b i } and use 1 − min { u , v } = max { 1 − u , 1 − v } together with 1 − sup i ( 1 − b i ) = inf i b i .
(c)
Write b = inf i b i and c = inf i c i . Since min { b i , c i } ≤ b i and min { b i , c i } ≤ c i for every i, the left-hand side is at most min { b , c } ; conversely min { b i , c i } ≥ min { b , c } for every i, so it is at least min { b , c } . The dual statement follows by complementation.
□
Parts (a)–(c) are the only lattice facts used repeatedly in the proofs below, where they let us interchange a supremum or an infimum with a minimum or a maximum without further comment.

2.2. Rough Sets

Definition 5
([16]). Let R be an equivalence relation on a non-empty set U, and write [ x ] R for the equivalence class of x. For A ⊆ U :
apr ̲ R ( A ) = { x ∈ U : [ x ] R ⊆ A } , apr ¯ R ( A ) = { x ∈ U : [ x ] R ∩ A ≠ ∅ } .
Definition 6
([26]). Let R : U × U → [ 0 , 1 ] be a reflexive fuzzy relation on a non-empty set U, that is, R ( x , x ) = 1 for every x ∈ U . The Dubois–Prade fuzzy rough approximations of μ ∈ I U are:
apr ̲ R ( μ ) ( x ) = inf y ∈ U max { 1 − R ( x , y ) , μ ( y ) } , apr ¯ R ( μ ) ( x ) = sup y ∈ U min { R ( x , y ) , μ ( y ) } .
Definition 7
([42]). A function c : I X → I X is a fuzzy Čech closure operator if c ( 0 ¯ ) = 0 ¯ , μ ≤ c ( μ ) , and μ ≤ ν ⇒ c ( μ ) ≤ c ( ν ) . It is additive if c ( μ ∨ ν ) = c ( μ ) ∨ c ( ν ) , and a Kuratowski closure if additionally c ( c ( μ ) ) = c ( μ ) .

3. Fuzzy Aura Topological Spaces

3.1. Fuzzy Scope Function and Fuzzy a ˜ -Spaces

Definition 8.
Let ( X , τ ˜ ) be a fuzzy topological space. A function a ˜ : X → τ ˜ is called a fuzzy scope function on ( X , τ ˜ ) if
a ˜ ( x ) ( x ) = 1 for every x ∈ X .
The triple ( X , τ ˜ , a ˜ ) is called a fuzzy aura topological space (briefly, a fuzzy a ˜ -space).
Remark 1.
The value a ˜ ( x ) ( y ) ∈ [ 0 , 1 ] represents the degree to which y lies within the aura of x. The axiom a ˜ ( x ) ( x ) = 1 ensures full self-membership. When all a ˜ ( x ) are characteristic functions, the fuzzy a ˜ -space reduces to the crisp aura topological space of [30].
Example 1.
Let X = { p , q , r } and τ ˜ = { 0 ¯ , 1 ¯ , λ 1 , λ 2 , λ 3 , λ 4 } where λ 1 = ( 1 , 0.4 , 0 ) , λ 2 = ( 0.6 , 1 , 0.3 ) , λ 3 = ( 1 , 1 , 0.3 ) , λ 4 = ( 0.6 , 0.4 , 0 ) ; here a triple ( u , v , w ) records the values at p, q, r. This family is closed under ∧ and ∨ (in particular λ 1 ∧ λ 2 = λ 4 and λ 1 ∨ λ 2 = λ 3 ), so it is a Chang fuzzy topology. Define a ˜ ( p ) = λ 1 , a ˜ ( q ) = λ 2 , a ˜ ( r ) = 1 ¯ . The triple ( X , τ ˜ , a ˜ ) is then a fuzzy a ˜ -space. We return to this space in Example 5, once the aura closure is available.
Example 2.
Let ( R , τ ˜ u ) be the real line with the fuzzy topology generated by triangular fuzzy neighborhoods λ x 0 , ε ( x ) = max { 0 , 1 − | x − x 0 | / ε } . For fixed ε > 0 , define a ˜ ε ( x ) = λ x , ε . Then ( R , τ ˜ u , a ˜ ε ) is a fuzzy a ˜ -space with uniform aura radius.
Example 3.
On ( R , τ ˜ u ) , define a ˜ ( x ) ( y ) = 1 / ( 1 + ( x − y ) 2 ) . Then a ˜ ( x ) ( x ) = 1 and the aura decays as a Cauchy profile. For instance, at x = 0 the aura takes the values a ˜ ( 0 ) ( 0 ) = 1 , a ˜ ( 0 ) ( 1 ) = 0.5 , a ˜ ( 0 ) ( 2 ) = 0.2 , decaying smoothly to zero at large distances. This models settings where influence between points is heavy-tailed, decaying slowly with distance rather than being confined to a bounded neighborhood.
Example 4.
On ( R , τ ˜ u ) , for fixed σ > 0 , define a ˜ σ ( x ) ( y ) = exp ( − ( x − y ) 2 / σ 2 ) . Then a ˜ σ ( x ) ( x ) = 1 and the aura decays as a Gaussian profile of width σ, e.g., a ˜ σ ( 0 ) ( σ ) = e − 1 ≈ 0.368 and a ˜ σ ( 0 ) ( 2 σ ) = e − 4 ≈ 0.018 . This models the opposite regime: rapid (super-polynomial) decay beyond a characteristic scale σ. A detailed analysis of the resulting rough approximations, including refinement monotonicity as σ varies, is carried out in Section 7.
Remark 2.
The Cauchy and Gaussian profiles of Examples 3 and 4 do belong to τ ˜ u , so both define fuzzy scope functions. Indeed, the minimum of two generators, λ c − d , ε ∧ λ c + d , ε , is a clipped triangle with peak 1 − d / ε at c and slopes ± 1 / ε . If f : R → [ 0 , 1 ] is Lipschitz with constant L and 1 / ε ≥ L , the clipped triangle with peak f ( c ) at c lies below f and touches it at c, so f is the supremum of such members of τ ˜ u . The Cauchy profile is Lipschitz with L = 3 3 / 8 , and the Gaussian a ˜ σ ( x ) with L = 2 / e / σ .

3.2. Fuzzy Aura-Closure Operator

Definition 9.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space. The fuzzy aura-closure of μ ∈ I X is
cl a ˜ ( μ ) ( x ) = sup y ∈ X min { a ˜ ( x ) ( y ) , μ ( y ) } .
Remark 3.
The value cl a ˜ ( μ ) ( x ) is the degree to which the aura of x meets μ. When a ˜ ( x ) = χ a ( x ) and μ = χ A are crisp, cl a ˜ ( χ A ) ( x ) = 1 if and only if a ( x ) ∩ A ≠ ∅ , which recovers the crisp aura-closure of [30].
Example 5.
On the space of Example 1, take the test fuzzy set μ = ( 0.5 , 0 , 0.7 ) . Direct computation using Definition 9 gives
cl a ˜ ( μ ) ( p ) = max { min ( 1 , 0.5 ) , min ( 0.4 , 0 ) , min ( 0 , 0.7 ) } = 0.5 ,
cl a ˜ ( μ ) ( q ) = max { min ( 0.6 , 0.5 ) , min ( 1 , 0 ) , min ( 0.3 , 0.7 ) } = 0.5 ,
cl a ˜ ( μ ) ( r ) = max { min ( 1 , 0.5 ) , min ( 1 , 0 ) , min ( 1 , 0.7 ) } = 0.7 ,
i.e., cl a ˜ ( μ ) = ( 0.5 , 0.5 , 0.7 ) . Note that μ ( q ) = 0 while cl a ˜ ( μ ) ( q ) = 0.5 : the membership concentrated at p propagates to q through the cross-value a ˜ ( q ) ( p ) = 0.6 , displaying the spreading effect of the fuzzy aura.
Remark 4.
Currying turns a fuzzy scope function into a reflexive fuzzy relation R ( x , y ) = a ˜ ( x ) ( y ) , and Formula (2) is then precisely the Dubois–Prade upper approximation apr ¯ R ( μ ) of Definition 6; dually, the fuzzy aura-interior of Definition 10 below is the lower approximation. No symmetry or transitivity is involved in this identification (compare Theorem 8, where R becomes a fuzzy equivalence). The fuzzy aura structure is thus a relational fuzzy rough structure in the sense of [31,32], carrying one additional piece of data: the ambient topology τ ˜ , to which the scope values are required to belong. Section 4, Section 5 and Section 6 concern the interplay between the two.
Theorem 1.
For all μ , ν ∈ I X , the operator cl a ˜ : I X → I X satisfies:
(a) 
cl a ˜ ( 0 ¯ ) = 0 ¯ .
(b) 
μ ≤ cl a ˜ ( μ ) (extensivity).
(c) 
μ ≤ ν ⇒ cl a ˜ ( μ ) ≤ cl a ˜ ( ν ) (monotonicity).
(d) 
cl a ˜ ( μ ∨ ν ) = cl a ˜ ( μ ) ∨ cl a ˜ ( ν ) (finite additivity).
Hence, cl a ˜ is a fuzzy additive Čech closure operator.
Proof. 
(a)
cl a ˜ ( 0 ¯ ) ( x ) = sup y min { a ˜ ( x ) ( y ) , 0 } = 0 .
(b)
cl a ˜ ( μ ) ( x ) ≥ min { a ˜ ( x ) ( x ) , μ ( x ) } = min { 1 , μ ( x ) } = μ ( x ) .
(c)
μ ≤ ν gives min { a ˜ ( x ) ( y ) , μ ( y ) } ≤ min { a ˜ ( x ) ( y ) , ν ( y ) } for all y, and suprema are ordered.
(d)
By Lemma 1(a) applied to the two-element family { μ ( y ) , ν ( y ) } , and then by the dual part of Lemma 1(c) to interchange the supremum over y with the maximum:
cl a ˜ ( μ ∨ ν ) ( x ) = sup y min { a ˜ ( x ) ( y ) , max { μ ( y ) , ν ( y ) } } = sup y max { min { a ˜ ( x ) ( y ) , μ ( y ) } , min { a ˜ ( x ) ( y ) , ν ( y ) } } = max { sup y min { a ˜ ( x ) ( y ) , μ ( y ) } , sup y min { a ˜ ( x ) ( y ) , ν ( y ) } } = ( cl a ˜ ( μ ) ∨ cl a ˜ ( ν ) ) ( x ) .
□
Lemma 2
(Complete additivity). For any family { μ i } i ∈ J ⊆ I X , cl a ˜ ⋁ i ∈ J μ i = ⋁ i ∈ J cl a ˜ ( μ i ) .
Proof. 
By Lemma 1(a) and the interchange of the two suprema,
cl a ˜ ⋁ i μ i ( x ) = sup y min a ˜ ( x ) ( y ) , sup i μ i ( y ) = sup i sup y min { a ˜ ( x ) ( y ) , μ i ( y ) } = ⋁ i cl a ˜ ( μ i ) ( x ) .
□
Remark 5.
Theorem 1 says precisely that ( X , cl a ˜ ) is a fuzzy closure space in the sense of Mashhour and Ghanim [43]. What the aura structure adds to that setting is the provenance of the closure, namely one fuzzy open set per point, together with the ambient topology τ ˜ those sets are drawn from. Lemma 2 strengthens finite additivity to arbitrary suprema; it is used in Proposition 6 below.
Theorem 2.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space, μ ∈ I X , and α ∈ [ 0 , 1 ] .
(a) 
For the strong level sets,
( cl a ˜ ( μ ) ) α > = { x ∈ X : ∃ y ∈ X , a ˜ ( x ) ( y ) > α and μ ( y ) > α } .
(b) 
If X is finite, then ( cl a ˜ ( μ ) ) α = { x ∈ X : ∃ y ∈ X , a ˜ ( x ) ( y ) ≥ α and μ ( y ) ≥ α } .
Proof. 
(a)
By Definition 9, cl a ˜ ( μ ) ( x ) > α holds if and only if sup y min { a ˜ ( x ) ( y ) , μ ( y ) } > α , which happens if and only if some y ∈ X satisfies min { a ˜ ( x ) ( y ) , μ ( y ) } > α , i.e., a ˜ ( x ) ( y ) > α and μ ( y ) > α .
(b)
When X is finite the supremum is a maximum, so cl a ˜ ( μ ) ( x ) ≥ α holds if and only if some y ∈ X attains min { a ˜ ( x ) ( y ) , μ ( y ) } ≥ α , which is equivalent to a ˜ ( x ) ( y ) ≥ α and μ ( y ) ≥ α .
□
Remark 6.
Part (b) genuinely needs the supremum to be attained. On X = N with the trivial aura a ˜ ( x ) = 1 ¯ and μ ( n ) = α ( 1 − 1 n + 2 ) for a fixed α ∈ ( 0 , 1 ] , every x satisfies cl a ˜ ( μ ) ( x ) = α , yet no y satisfies μ ( y ) ≥ α : the level set ( cl a ˜ ( μ ) ) α is all of X, while the right-hand side of (b) is empty.
Theorem 3.
The operator cl a ˜ is not idempotent in general.
Proof. 
We construct an explicit counterexample. Let X = { p , q , r } with the discrete fuzzy topology τ ˜ = I X . Define the fuzzy scope function by
a ˜ ( p ) = ( 1 , 0.8 , 0 ) , a ˜ ( q ) = ( 0 , 1 , 0.7 ) , a ˜ ( r ) = ( 0 , 0 , 1 ) ,
where the triple ( u , v , w ) denotes the values at p, q, r, respectively. The scope axiom a ˜ ( x ) ( x ) = 1 holds for each x ∈ X , so ( X , τ ˜ , a ˜ ) is a fuzzy a ˜ -space. Take the test set μ = ( 0 , 0 , 0.6 ) .
Computing cl a ˜ ( μ ) . By Definition 9, cl a ˜ ( μ ) ( x ) = sup y min { a ˜ ( x ) ( y ) , μ ( y ) } . The only y with μ ( y ) > 0 is y = r , so
cl a ˜ ( μ ) ( p ) = min { a ˜ ( p ) ( r ) , 0.6 } = min { 0 , 0.6 } = 0 ,
cl a ˜ ( μ ) ( q ) = min { a ˜ ( q ) ( r ) , 0.6 } = min { 0.7 , 0.6 } = 0.6 ,
cl a ˜ ( μ ) ( r ) = min { a ˜ ( r ) ( r ) , 0.6 } = min { 1 , 0.6 } = 0.6 .
Hence cl a ˜ ( μ ) = ( 0 , 0.6 , 0.6 ) .
Computing cl a ˜ ( cl a ˜ ( μ ) ) . Now cl a ˜ ( μ ) has nonzero values at q and r:
cl a ˜ ( cl a ˜ ( μ ) ) ( p ) = max min { a ˜ ( p ) ( q ) , 0.6 } , min { a ˜ ( p ) ( r ) , 0.6 } = max { min { 0.8 , 0.6 } , 0 } = 0.6 .
Similar computations give cl a ˜ ( cl a ˜ ( μ ) ) ( q ) = 0.6 and cl a ˜ ( cl a ˜ ( μ ) ) ( r ) = 0.6 , so cl a ˜ ( cl a ˜ ( μ ) ) = ( 0.6 , 0.6 , 0.6 ) . Since the first coordinates differ ( 0 ≠ 0.6 ), cl a ˜ ( cl a ˜ ( μ ) ) ≠ cl a ˜ ( μ ) , proving non-idempotency. □
Lemma 3.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space. For any constant fuzzy set α ¯ (where α ¯ ( x ) = α for all x), cl a ˜ ( α ¯ ) = α ¯ .
Proof. 
We compute cl a ˜ ( α ¯ ) ( x ) directly from Definition 9:
cl a ˜ ( α ¯ ) ( x ) = sup y ∈ X min { a ˜ ( x ) ( y ) , α ¯ ( y ) } = sup y ∈ X min { a ˜ ( x ) ( y ) , α } .
Since α does not depend on y, Lemma 1(a) pulls it out of the supremum:
cl a ˜ ( α ¯ ) ( x ) = min sup y ∈ X a ˜ ( x ) ( y ) , α .
The scope axiom a ˜ ( x ) ( x ) = 1 forces sup y a ˜ ( x ) ( y ) = 1 , so cl a ˜ ( α ¯ ) ( x ) = min { 1 , α } = α = α ¯ ( x ) . As this holds for every x ∈ X , cl a ˜ ( α ¯ ) = α ¯ . □
Lemma 4.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space. For μ ∈ I X and α ∈ [ 0 , 1 ] :
cl a ˜ ( μ ∧ α ¯ ) = cl a ˜ ( μ ) ∧ α ¯ .
Proof. 
We compute cl a ˜ ( μ ∧ α ¯ ) ( x ) = sup y min { a ˜ ( x ) ( y ) , min { μ ( y ) , α } } . Since min ( a , min ( b , c ) ) = min ( min ( a , b ) , c ) , this equals, using Lemma 1(a) once more,
sup y min min { a ˜ ( x ) ( y ) , μ ( y ) } , α = min sup y min { a ˜ ( x ) ( y ) , μ ( y ) } , α = min { cl a ˜ ( μ ) ( x ) , α } .
□
Lemma 3 is the special case μ = 1 ¯ of Lemma 4; we single it out because constants are exactly the closure-invariant sets produced by the trivial aura (Proposition 4 below).

3.3. Fuzzy Aura-Interior Operator

Definition 10.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space. The fuzzy aura-interior of μ ∈ I X is
int a ˜ ( μ ) ( x ) = inf y ∈ X max { 1 − a ˜ ( x ) ( y ) , μ ( y ) } .
Theorem 4.
For all μ , ν ∈ I X :
(a) 
int a ˜ ( 1 ¯ ) = 1 ¯ .
(b) 
int a ˜ ( μ ) ≤ μ .
(c) 
μ ≤ ν ⇒ int a ˜ ( μ ) ≤ int a ˜ ( ν ) .
(d) 
int a ˜ ( μ ∧ ν ) = int a ˜ ( μ ) ∧ int a ˜ ( ν ) .
(e) 
int a ˜ ( μ ) = ( cl a ˜ ( μ c ) ) c (duality).
Proof. 
(a)
int a ˜ ( 1 ¯ ) ( x ) = inf y max { 1 − a ˜ ( x ) ( y ) , 1 } = 1 .
(b)
int a ˜ ( μ ) ( x ) ≤ max { 1 − a ˜ ( x ) ( x ) , μ ( x ) } = max { 0 , μ ( x ) } = μ ( x ) .
(c)
If μ ≤ ν , then max { 1 − a ˜ ( x ) ( y ) , μ ( y ) } ≤ max { 1 − a ˜ ( x ) ( y ) , ν ( y ) } .
(d)
The first step is Lemma 1(b) applied to the two-element family { μ ( y ) , ν ( y ) } , the second is Lemma 1(c):
int a ˜ ( μ ∧ ν ) ( x ) = inf y max { 1 − a ˜ ( x ) ( y ) , min { μ ( y ) , ν ( y ) } } = inf y min { max { 1 − a ˜ ( x ) ( y ) , μ ( y ) } , max { 1 − a ˜ ( x ) ( y ) , ν ( y ) } } = min { int a ˜ ( μ ) ( x ) , int a ˜ ( ν ) ( x ) } .
(e)
( cl a ˜ ( μ c ) ) c ( x ) = 1 − sup y min { a ˜ ( x ) ( y ) , 1 − μ ( y ) } = inf y ( 1 − min { a ˜ ( x ) ( y ) , 1 − μ ( y ) } ) = inf y max { 1 − a ˜ ( x ) ( y ) , μ ( y ) } = int a ˜ ( μ ) ( x ) .
□
Proposition 1.
int a ˜ ( μ ∨ ν ) ≥ int a ˜ ( μ ) ∨ int a ˜ ( ν ) . The inequality can be strict.
Proof. 
int a ˜ ( μ ∨ ν ) ( x ) = inf y max { 1 − a ˜ ( x ) ( y ) , max { μ ( y ) , ν ( y ) } } ≥ inf y max { 1 − a ˜ ( x ) ( y ) , μ ( y ) } = int a ˜ ( μ ) ( x ) . Similarly int a ˜ ( μ ∨ ν ) ≥ int a ˜ ( ν ) , so int a ˜ ( μ ∨ ν ) ≥ int a ˜ ( μ ) ∨ int a ˜ ( ν ) .
Strictness. Take X = { p , q } , τ ˜ = I X , a ˜ ( p ) = a ˜ ( q ) = 1 ¯ , and μ = ( 1 , 0 ) , ν = ( 0 , 1 ) . Then μ ∨ ν = ( 1 , 1 ) = 1 ¯ , so int a ˜ ( μ ∨ ν ) = 1 ¯ by Theorem 4(a). On the other hand, the trivial aura makes every complemented value 1 − a ˜ ( x ) ( y ) vanish, so each infimum is simply the minimum of the two values of μ : int a ˜ ( μ ) ( p ) = int a ˜ ( μ ) ( q ) = min { 1 , 0 } = 0 , that is, int a ˜ ( μ ) = 0 ¯ , and similarly int a ˜ ( ν ) = 0 ¯ . Therefore int a ˜ ( μ ) ∨ int a ˜ ( ν ) = 0 ¯ ≠ 1 ¯ = int a ˜ ( μ ∨ ν ) , confirming strict inequality. □

3.4. Fuzzy Aura Topology

Definition 11.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space. A fuzzy set μ ∈ I X is fuzzy a ˜ -open if it is a fixed point of the fuzzy aura-interior, that is, if int a ˜ ( μ ) = μ . The collection of all fuzzy a ˜ -open sets is denoted by
τ ˜ a ˜ = { μ ∈ I X : int a ˜ ( μ ) = μ } ,
and is called the fuzzy aura topology of ( X , τ ˜ , a ˜ ) ; Theorem 5 justifies the name. Since int a ˜ ( μ ) ≤ μ always holds (Theorem 4(b)), the condition int a ˜ ( μ ) = μ is equivalent to μ ≤ int a ˜ ( μ ) .
Theorem 5.
τ ˜ a ˜ is a fuzzy topology on X.
Proof. 
0 ¯ , 1 ¯ ∈ τ ˜ a ˜ by Theorem 4(a,b). Finite intersection: int a ˜ ( μ ∧ ν ) = int a ˜ ( μ ) ∧ int a ˜ ( ν ) = μ ∧ ν . Arbitrary union: for μ = ⋁ i μ i with each μ i ∈ τ ˜ a ˜ , int a ˜ ( μ ) ≤ μ . For the reverse, μ i = int a ˜ ( μ i ) ≤ int a ˜ ( μ ) by monotonicity, so μ = ⋁ i μ i ≤ int a ˜ ( μ ) . □
Remark 7.
In the crisp theory every a-open set is open in the ambient topology. The fuzzy analogue fails: τ ˜ a ˜ need not be contained in τ ˜ . Example 6 gives a two-point witness, and Proposition 4 below yields a systematic supply: under the trivial aura every constant fuzzy set is a ˜ -open, while a Chang topology need not contain any constant other than 0 ¯ and 1 ¯ .
Example 6.
Let X = { p , q } , λ = ( 1 , 0.5 ) , and τ ˜ = { 0 ¯ , 1 ¯ , λ } , a Chang fuzzy topology. Define a ˜ ( p ) = λ and a ˜ ( q ) = 1 ¯ ; both values are fuzzy open and equal 1 at their own point. Take μ = ( 0.3 , 0.1 ) . Since X has two points, the infimum in Definition 10 is a minimum of two terms, one for y = p and one for y = q . At x = p the complemented aura values are 1 − a ˜ ( p ) ( p ) = 1 − 1 = 0 and 1 − a ˜ ( p ) ( q ) = 1 − 0.5 = 0.5 , so
int a ˜ ( μ ) ( p ) = min max { 0 , 0.3 } , max { 0.5 , 0.1 } = min { 0.3 , 0.5 } = 0.3 .
At x = q both complemented values vanish because a ˜ ( q ) = 1 ¯ , so
int a ˜ ( μ ) ( q ) = min max { 0 , 0.3 } , max { 0 , 0.1 } = min { 0.3 , 0.1 } = 0.1 .
Hence int a ˜ ( μ ) = ( 0.3 , 0.1 ) = μ , so μ ∈ τ ˜ a ˜ , although μ ∉ τ ˜ = { 0 ¯ , 1 ¯ , λ } .
Proposition 2.
A fuzzy set γ is fuzzy a ˜ -closed (i.e., γ c ∈ τ ˜ a ˜ ) if and only if cl a ˜ ( γ ) = γ .
Proof. 
By definition, γ is fuzzy a ˜ -closed if and only if γ c ∈ τ ˜ a ˜ , i.e., int a ˜ ( γ c ) = γ c . The duality int a ˜ ( μ ) = ( cl a ˜ ( μ c ) ) c (Theorem 4(e)) applied with μ = γ c turns this into ( cl a ˜ ( γ ) ) c = γ c , and taking complements once more gives cl a ˜ ( γ ) = γ . □

3.5. Iterating the Closure

Definition 12.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space. For μ ∈ I X , the iterates of the fuzzy aura-closure are defined by cl a ˜ 0 ( μ ) = μ and cl a ˜ n + 1 ( μ ) = cl a ˜ ( cl a ˜ n ( μ ) ) for n ≥ 0 , and their supremum by cl a ˜ ∞ ( μ ) = ⋁ n = 0 ∞ cl a ˜ n ( μ ) .
Theorem 6.
cl a ˜ ∞ is a fuzzy Kuratowski closure operator.
Proof. 
Extensivity and monotonicity of cl a ˜ ∞ are immediate from the corresponding properties of each cl a ˜ n , and cl a ˜ ∞ ( 0 ¯ ) = 0 ¯ . Additivity follows by induction: cl a ˜ n ( μ ∨ ν ) = cl a ˜ n ( μ ) ∨ cl a ˜ n ( ν ) for every n by Theorem 1(d), and taking suprema over n on both sides gives cl a ˜ ∞ ( μ ∨ ν ) = cl a ˜ ∞ ( μ ) ∨ cl a ˜ ∞ ( ν ) .
For idempotency, Lemma 1(a) applied to the increasing family { cl a ˜ n ( μ ) ( y ) } n ≥ 0 yields
cl a ˜ ( cl a ˜ ∞ ( μ ) ) ( x ) = sup y min a ˜ ( x ) ( y ) , sup n cl a ˜ n ( μ ) ( y ) = sup n sup y min { a ˜ ( x ) ( y ) , cl a ˜ n ( μ ) ( y ) } = sup n cl a ˜ n + 1 ( μ ) ( x ) ,
which equals cl a ˜ ∞ ( μ ) ( x ) because the chain cl a ˜ n ( μ ) is increasing in n. Hence cl a ˜ ( cl a ˜ ∞ ( μ ) ) = cl a ˜ ∞ ( μ ) , and by induction cl a ˜ n ( cl a ˜ ∞ ( μ ) ) = cl a ˜ ∞ ( μ ) for every n; taking the supremum over n gives cl a ˜ ∞ ( cl a ˜ ∞ ( μ ) ) = cl a ˜ ∞ ( μ ) . □
Proposition 3.
Write τ ˜ a ˜ ∞ = { μ ∈ I X : cl a ˜ ∞ ( μ c ) = μ c } for the fuzzy topology whose closed sets are the fixed points of cl a ˜ ∞ . Then τ ˜ a ˜ ∞ = τ ˜ a ˜ : iterating the closure produces no new topology.
Proof. 
By Proposition 2 it suffices to show that cl a ˜ and cl a ˜ ∞ have the same fixed points. If cl a ˜ ( γ ) = γ , then by induction cl a ˜ n ( γ ) = γ for every n, so cl a ˜ ∞ ( γ ) = ⋁ n cl a ˜ n ( γ ) = γ . Conversely, if cl a ˜ ∞ ( γ ) = γ , then extensivity gives γ ≤ cl a ˜ ( γ ) ≤ cl a ˜ ∞ ( γ ) = γ , so cl a ˜ ( γ ) = γ . □
Remark 8.
If X is finite with | X | = n , then cl a ˜ n ( μ ) = cl a ˜ ∞ ( μ ) . To see this, unfold the definition with Lemma 1(a): for every k ≥ 1 ,
cl a ˜ k ( μ ) ( x ) = sup min { a ˜ ( y 0 ) ( y 1 ) , … , a ˜ ( y k − 1 ) ( y k ) , μ ( y k ) } : x = y 0 , y 1 , … , y k ∈ X ,
the supremum being taken over all chains of length k starting at x. If such a chain visits a point twice, say y i = y j with i < j , then deleting the segment between them leaves a shorter chain with the same endpoint whose minimum is taken over a subset of the same numbers, hence is at least as large. Every chain value is therefore dominated by the value of a chain with no repeated point, and such a chain has at most n vertices, that is, length at most n − 1 . Since the sequence cl a ˜ k ( μ ) increases with k by extensivity, the supremum over all k is already reached at k = n − 1 , so cl a ˜ n − 1 ( μ ) = cl a ˜ ∞ ( μ ) and in particular cl a ˜ n ( μ ) = cl a ˜ ∞ ( μ ) .

3.6. Special Types of Fuzzy Aura Functions

Definition 13.
A fuzzy scope function a ˜ on ( X , τ ˜ ) is called: trivial if a ˜ ( x ) = 1 ¯ for all x; crisp if a ˜ ( x ) ∈ { 0 , 1 } X for all x; symmetric if a ˜ ( x ) ( y ) = a ˜ ( y ) ( x ) for all x , y ; transitive if min { a ˜ ( x ) ( y ) , a ˜ ( y ) ( z ) } ≤ a ˜ ( x ) ( z ) for all x , y , z .
Proposition 4.
If a ˜ is trivial, then cl a ˜ ( μ ) ( x ) = sup y μ ( y ) and τ ˜ a ˜ = { α ¯ : α ∈ [ 0 , 1 ] } , the family of constant fuzzy sets.
Proof. 
If a ˜ is trivial, a ˜ ( x ) ( y ) = 1 for every x , y ∈ X . Substituting in Definition 9,
cl a ˜ ( μ ) ( x ) = sup y min { a ˜ ( x ) ( y ) , μ ( y ) } = sup y min { 1 , μ ( y ) } = sup y μ ( y ) ,
which is independent of x. Hence cl a ˜ ( μ ) is the constant fuzzy set β ¯ with β = sup y μ ( y ) . By the duality int a ˜ ( μ ) = ( cl a ˜ ( μ c ) ) c , int a ˜ ( μ ) is also a constant fuzzy set with value 1 − sup y μ c ( y ) = inf y μ ( y ) . A fuzzy set μ is fuzzy a ˜ -open if and only if int a ˜ ( μ ) = μ , which forces μ to be constant. Hence τ ˜ a ˜ consists exactly of the constant fuzzy sets α ¯ , α ∈ [ 0 , 1 ] . □
Proposition 5.
If a ˜ is symmetric, then cl a ˜ ( χ { y } ) ( x ) = a ˜ ( x ) ( y ) = a ˜ ( y ) ( x ) = cl a ˜ ( χ { x } ) ( y ) .
Proof. 
The characteristic fuzzy set χ { y } takes value 1 at y and 0 elsewhere. By Definition 9,
cl a ˜ ( χ { y } ) ( x ) = sup z ∈ X min { a ˜ ( x ) ( z ) , χ { y } ( z ) } .
For z ≠ y , χ { y } ( z ) = 0 so min { a ˜ ( x ) ( z ) , 0 } = 0 , while for z = y , min { a ˜ ( x ) ( y ) , 1 } = a ˜ ( x ) ( y ) . The supremum is therefore attained at z = y , giving cl a ˜ ( χ { y } ) ( x ) = a ˜ ( x ) ( y ) . By symmetry a ˜ ( x ) ( y ) = a ˜ ( y ) ( x ) , and the same computation with the roles of x and y swapped gives cl a ˜ ( χ { x } ) ( y ) = a ˜ ( y ) ( x ) . □
Theorem 7.
If a ˜ is transitive, then cl a ˜ is idempotent; consequently cl a ˜ ∞ = cl a ˜ .
Proof. 
Fix μ ∈ I X and x ∈ X . By Definition 9,
cl a ˜ ( cl a ˜ ( μ ) ) ( x ) = sup y ∈ X min a ˜ ( x ) ( y ) , sup z ∈ X min { a ˜ ( y ) ( z ) , μ ( z ) } .
By Lemma 1(a), the iterated supremum collapses to a single supremum over pairs:
cl a ˜ ( cl a ˜ ( μ ) ) ( x ) = sup y , z ∈ X min { a ˜ ( x ) ( y ) , a ˜ ( y ) ( z ) , μ ( z ) } .
Now apply transitivity. The hypothesis min { a ˜ ( x ) ( y ) , a ˜ ( y ) ( z ) } ≤ a ˜ ( x ) ( z ) implies
min { a ˜ ( x ) ( y ) , a ˜ ( y ) ( z ) , μ ( z ) } ≤ min { a ˜ ( x ) ( z ) , μ ( z ) }
for every choice of y and z. Taking the supremum on both sides,
cl a ˜ ( cl a ˜ ( μ ) ) ( x ) ≤ sup z ∈ X min { a ˜ ( x ) ( z ) , μ ( z ) } = cl a ˜ ( μ ) ( x ) .
Conversely, extensivity (Theorem 1(b)) applied to cl a ˜ ( μ ) gives cl a ˜ ( μ ) ≤ cl a ˜ ( cl a ˜ ( μ ) ) . The two inequalities yield cl a ˜ ( cl a ˜ ( μ ) ) = cl a ˜ ( μ ) , i.e., cl a ˜ is idempotent. Consequently the increasing chain cl a ˜ 0 ( μ ) ≤ cl a ˜ ( μ ) ≤ cl a ˜ 2 ( μ ) ≤ … stabilizes after one step, so cl a ˜ ∞ = cl a ˜ . (By Proposition 3 the induced topology is τ ˜ a ˜ with or without transitivity; what transitivity adds is the operator identity.) □
Remark 9.
In relational language, Theorem 7 restates a known fact: under a reflexive and min-transitive fuzzy relation, that is, a fuzzy preorder, the Dubois–Prade upper approximation is idempotent, and this lies at the heart of the correspondence between fuzzy preorders and fuzzy topologies [33,34]. We keep the short direct proof to remain self-contained; what is specific to the aura setting is the pairing with τ ˜ , not the operator identity.
Theorem 8.
If a ˜ is both symmetric and transitive, then R ( x , y ) = a ˜ ( x ) ( y ) is a fuzzy equivalence relation on X. The fuzzy aura approximation operators are then the Dubois–Prade operators of a fuzzy equivalence relation, as in the classical fuzzy rough set model.
Proof. 
Define the binary fuzzy relation R : X × X → [ 0 , 1 ] by R ( x , y ) = a ˜ ( x ) ( y ) . We verify the three defining properties of a fuzzy equivalence relation.
Reflexivity. The scope axiom a ˜ ( x ) ( x ) = 1 gives R ( x , x ) = 1 for every x ∈ X .
Symmetry. By the symmetry of a ˜ , R ( x , y ) = a ˜ ( x ) ( y ) = a ˜ ( y ) ( x ) = R ( y , x ) for all x , y .
Min-transitivity. By the transitivity of a ˜ , min { R ( x , y ) , R ( y , z ) } = min { a ˜ ( x ) ( y ) , a ˜ ( y ) ( z ) } ≤ a ˜ ( x ) ( z ) = R ( x , z ) for all x , y , z .
Hence R is a fuzzy equivalence relation in the sense of Zadeh.
The identification of the aura operators with the Dubois–Prade pair under R requires no hypothesis at all: it holds for every scope function by Remark 4. What the hypotheses add is that R is now a fuzzy equivalence, so the pair is the fuzzy rough approximation of the classical model of [26]. □

4. Generalized Fuzzy Open Sets

Definition 14.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space and μ ∈ I X . Then μ is called:
(a) 
fuzzy a ˜ -semi-open if μ ≤ cl a ˜ ( int ( μ ) ) ;
(b) 
fuzzy a ˜ -pre-open if μ ≤ int ( cl a ˜ ( μ ) ) ;
(c) 
fuzzy a ˜ - α -open if μ ≤ int ( cl a ˜ ( int ( μ ) ) ) ;
(d) 
fuzzy a ˜ - β -open if μ ≤ cl a ˜ ( int ( cl a ˜ ( μ ) ) ) ;
(e) 
fuzzy a ˜ -b-open if μ ≤ cl a ˜ ( int ( μ ) ) ∨ int ( cl a ˜ ( μ ) ) .
The collections are denoted a ˜ - FSO ( X ) , a ˜ - FPO ( X ) , a ˜ - F α O ( X ) , a ˜ - F β O ( X ) , and a ˜ - FbO ( X ) , respectively. Patterns (a)–(d) follow the classes recalled in Definition 4, with the aura closure in place of the topological one; the b-open pattern in (e) has its crisp origin in Andrijević [44] and its fuzzy counterpart in the fuzzy b-open sets of Benchalli and Karnel [45].
Remark 10.
Each pattern is obtained from Definition 4 by replacing the ambient closure with the aura closure cl a ˜ while leaving the interior ambient. The asymmetry is deliberate and is what the whole section rests on. Had we replaced both operators by their aura counterparts, every condition would have been a statement about the pair ( cl a ˜ , int a ˜ ) alone, that is, about the underlying reflexive fuzzy relation, with the ambient topology playing no part; conversely, with both operators ambient we would be back at Definition 4. Mixing them is what makes each class depend on τ ˜ and a ˜ simultaneously, and it is the source both of the hierarchy in Theorem 9 and of its most conspicuous defect, the failure of the Njåstad property recorded in Remark 12.
Theorem 9
(Complete Hierarchy). In any fuzzy a ˜ -space:
τ ˜ ⊆ a ˜ - F α O ( X ) ⊆ a ˜ - FSO ( X ) a ˜ - FPO ( X ) ⊆ a ˜ - FbO ( X ) ⊆ a ˜ - F β O ( X ) .
Proof. 
τ ˜ ⊆ a ˜ - F α O : Let μ ∈ τ ˜ , so int ( μ ) = μ . By extensivity, cl a ˜ ( μ ) ≥ μ , hence int ( cl a ˜ ( int ( μ ) ) ) = int ( cl a ˜ ( μ ) ) ≥ int ( μ ) = μ .
a ˜ - F α O ⊆ a ˜ - FSO : μ ≤ int ( cl a ˜ ( int ( μ ) ) ) ≤ cl a ˜ ( int ( μ ) ) .
a ˜ - F α O ⊆ a ˜ - FPO : int ( μ ) ≤ μ gives cl a ˜ ( int ( μ ) ) ≤ cl a ˜ ( μ ) , so μ ≤ int ( cl a ˜ ( int ( μ ) ) ) ≤ int ( cl a ˜ ( μ ) ) .
a ˜ - FSO , a ˜ - FPO ⊆ a ˜ - FbO : Immediate.
a ˜ - FbO ⊆ a ˜ - F β O : Since μ ≤ cl a ˜ ( μ ) , we have int ( μ ) ≤ int ( cl a ˜ ( μ ) ) , so
cl a ˜ ( int ( μ ) ) ≤ cl a ˜ ( int ( cl a ˜ ( μ ) ) ) .
Moreover, int ( cl a ˜ ( μ ) ) ≤ cl a ˜ ( int ( cl a ˜ ( μ ) ) ) by extensivity. Hence
μ ≤ cl a ˜ ( int ( μ ) ) ∨ int ( cl a ˜ ( μ ) ) ≤ cl a ˜ ( int ( cl a ˜ ( μ ) ) ) .
□
Example 7
(The hierarchy is strict). Let X = { p , q , r , s } and let τ ˜ be the fuzzy topology
0 ¯ , ( 0 , 0 , 0 , 1 2 ) , ( 0 , 0 , 0 , 1 ) , ( 0 , 1 , 0 , 1 2 ) , ( 0 , 1 , 0 , 1 ) , ( 1 , 0 , 1 2 , 1 ) , ( 1 , 1 , 1 2 , 1 ) , 1 ¯ .
Define the scope function by a ˜ ( p ) = ( 1 , 0 , 1 2 , 1 ) and a ˜ ( q ) = a ˜ ( r ) = a ˜ ( s ) = 1 ¯ ; both a ˜ ( x ) ( x ) = 1 and a ˜ ( x ) ∈ τ ˜ hold. The four fuzzy sets in Table 1 separate the consecutive classes.
Table 1. Membership of the four witness sets in the five generalized classes on the space of Example 7.
Take the first row, μ = ( 0 , 0 , 1 2 , 1 ) . Here int ( μ ) = ( 0 , 0 , 0 , 1 ) and cl a ˜ ( int ( μ ) ) = 1 ¯ , so int ( cl a ˜ ( int ( μ ) ) ) = 1 ¯ ≥ μ and μ is fuzzy a ˜ -α-open, while int ( μ ) ≠ μ shows it is not open; this gives τ ˜ ⊊ a ˜ - F α O ( X ) . The second row is semi-open but neither α-open nor pre-open, and the third is pre-open but neither α-open nor semi-open, so a ˜ - F α O ( X ) lies strictly inside both a ˜ - FSO ( X ) and a ˜ - FPO ( X ) , and these two classes are incomparable. The second row is b-open but not pre-open and the third is b-open but not semi-open, so a ˜ - FSO ( X ) , a ˜ - FPO ( X ) ⊊ a ˜ - FbO ( X ) . Finally the fourth row is fuzzy a ˜ -β-open but not b-open, giving a ˜ - FbO ( X ) ⊊ a ˜ - F β O ( X ) . Every inclusion in Theorem 9 is therefore strict.
Example 8.
Let X = { p , q , r , s } and τ ˜ = { 0 ¯ , 1 ¯ , λ 1 , λ 2 , λ 1 ∨ λ 2 } with λ 1 = ( 0.8 , 0 , 0.5 , 0 ) and λ 2 = ( 0 , 0.7 , 0 , 0.6 ) ; since λ 1 ∧ λ 2 = 0 ¯ , this is a Chang fuzzy topology. The only member of τ ˜ attaining the value 1 anywhere is 1 ¯ , so the trivial aura a ˜ ( x ) = 1 ¯ for all x is the unique fuzzy scope function on this space; by Proposition 4, cl a ˜ ( μ ) is the constant fuzzy set with value sup x μ ( x ) .
Take μ = ( 0.7 , 0.5 , 0 , 0 ) . No nonzero member of τ ˜ lies below μ (each of λ 1 , λ 2 , λ 1 ∨ λ 2 exceeds μ somewhere), so int ( μ ) = 0 ¯ , hence cl a ˜ ( int ( μ ) ) = 0 ¯ and μ is not fuzzy a ˜ -semi-open. On the other hand cl a ˜ ( μ ) = ( 0.7 , 0.7 , 0.7 , 0.7 ) , and the only nonzero member of τ ˜ below this constant is λ 2 , so int ( cl a ˜ ( μ ) ) = λ 2 = ( 0 , 0.7 , 0 , 0.6 ) . Since μ ( p ) = 0.7 > 0 = λ 2 ( p ) , μ is also not fuzzy a ˜ -pre-open. The example thus shows that a fuzzy set need not belong to any of the generalized classes.
Example 9.
Consider ( R , τ ˜ u , a ˜ ε ) with ε = 2 , the triangular aura a ˜ ε ( x ) ( y ) = max { 0 , 1 − | x − y | / 2 } of Example 2. Every member of τ ˜ u , being a supremum of finite minima of continuous triangular functions, is lower semicontinuous. The crisp foreground μ = χ [ 0 , 1 ] is therefore not fuzzy open: its strict superlevel set { x : μ ( x ) > 0 } = [ 0 , 1 ] is not open in R .
Nevertheless μ is fuzzy a ˜ -semi-open. First, int ( μ ) = χ ( 0 , 1 ) : the triangular generators supported inside ( 0 , 1 ) lie below μ and their supremum attains 1 at every interior point, while any lower semicontinuous g ≤ μ must vanish at 0 and 1. Then
cl a ˜ ( χ ( 0 , 1 ) ) ( x ) = sup y ∈ ( 0 , 1 ) a ˜ ε ( x ) ( y ) = max 0 , 1 − 1 2 d x , ( 0 , 1 ) ,
which equals 1 on all of [ 0 , 1 ] , so μ ≤ cl a ˜ ( int ( μ ) ) and μ ∈ a ˜ - FSO ( R ) ∖ τ ˜ u .
For fuzzy open μ this phenomenon cannot occur here: a direct computation gives, e.g., cl a ˜ ( λ 0 , 3 ) = λ 0 , 5 (the sup-min convolution of two triangular profiles is again triangular, with the half-widths added), so the aura closure of a generator stays open. The next proposition shows that this is a general law of the triangular and Gaussian families, not an accident of one computation.
Proposition 6
(Scale additivity). On ( R , τ ˜ u ) :
(a) 
for the triangular aura a ˜ ε of Example 2 and any generator λ c , δ ,
cl a ˜ ε ( λ c , δ ) = λ c , δ + ε ;
(b) 
for the Gaussian aura a ˜ σ of Example 4 and any Gaussian profile g c , δ ( y ) = exp ( − ( y − c ) 2 / δ 2 ) ,
cl a ˜ σ ( g c , δ ) = g c , σ + δ .
In both families the aura closure adds the width of the observation window to the width of the profile. Since generators are fuzzy open by definition and Gaussian profiles are fuzzy open by Remark 2, the closure maps each family into τ ˜ u , and by Lemma 2 the same holds for arbitrary suprema of members of either family.
Proof. 
We prove (b); the argument for (a) is the same with linear in place of Gaussian decay, noting that for | x − c | ≥ δ + ε the supports of the two tents meet in at most one point and both sides vanish.
Fix x and assume without loss of generality c ≤ x . Write m ( y ) = min { e − ( x − y ) 2 / σ 2 , e − ( y − c ) 2 / δ 2 } , so that cl a ˜ σ ( g c , δ ) ( x ) = sup y m ( y ) . For y ≥ x both distances | x − y | and | y − c | increase as y moves right, so m is nonincreasing there and sup y ≥ x m ( y ) = m ( x ) ; symmetrically sup y ≤ c m ( y ) = m ( c ) . On the segment c ≤ y ≤ x the first factor increases in y and the second decreases, so the minimum is largest where the two factors agree, i.e., where ( x − y ) / σ = ( y − c ) / δ . Since ( x − y ) + ( y − c ) = x − c on the segment, the crossing point satisfies x − y * = σ ( x − c ) / ( σ + δ ) , and the common value is exp ( − ( x − c ) 2 / ( σ + δ ) 2 ) . The endpoint values m ( x ) = e − ( x − c ) 2 / δ 2 and m ( c ) = e − ( x − c ) 2 / σ 2 do not exceed it, because δ ≤ σ + δ and σ ≤ σ + δ . Hence sup y m ( y ) = exp ( − ( x − c ) 2 / ( σ + δ ) 2 ) = g c , σ + δ ( x ) . □
Remark 11.
Read through the lens of Section 7, part (b) is a semigroup law: observing a Gaussian feature of scale δ through a Gaussian window of scale σ produces a Gaussian of scale σ + δ . This is a sup-min counterpart of the scale semigroup of linear Gaussian scale-space [46], where variances rather than widths add under convolution. In fuzzy-arithmetic terms the computation behind the proposition is the sup-min convolution of the extension principle, under which triangular and Gaussian shapes are well known to add their spreads [47]; what the aura reading adds is the topological consequence, namely that the closure maps fuzzy open profiles to fuzzy open profiles.
Theorem 10.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space.
(a) 
Arbitrary unions of fuzzy a ˜ -semi-open sets are fuzzy a ˜ -semi-open.
(b) 
Arbitrary unions of fuzzy a ˜ -pre-open sets are fuzzy a ˜ -pre-open.
(c) 
Arbitrary unions of fuzzy a ˜ -α-open sets are fuzzy a ˜ -α-open.
(d) 
Arbitrary unions of fuzzy a ˜ -β-open sets are fuzzy a ˜ -β-open.
(e) 
Arbitrary unions of fuzzy a ˜ -b-open sets are fuzzy a ˜ -b-open.
All five classes are therefore closed under arbitrary unions; only finite intersections behave differently, and there only for the α class (Remark 12).
Proof. 
Write μ = ⋁ i ∈ J μ i and note that μ i ≤ μ for every i. Each of the five defining expressions is built from int and cl a ˜ by composition and join, and both operators are monotone (Theorem 1(c) and the definition of int ), so each expression is monotone in its argument. Consequently, if E denotes the right-hand side of the defining inequality for the class in question, then μ i ≤ E ( μ i ) ≤ E ( μ ) for every i, and taking the supremum over i gives μ ≤ E ( μ ) , which is the assertion. Written out, this reads as follows.
(a)
Let { μ i } i ∈ J ⊆ a ˜ - FSO ( X ) and μ = ⋁ i μ i . For each i, μ i ≤ cl a ˜ ( int ( μ i ) ) ≤ cl a ˜ ( int ( μ ) ) by monotonicity. Hence μ = ⋁ i μ i ≤ cl a ˜ ( int ( μ ) ) .
(b)
Similarly, μ i ≤ int ( cl a ˜ ( μ i ) ) ≤ int ( cl a ˜ ( μ ) ) , so μ ≤ int ( cl a ˜ ( μ ) ) .
(c)
μ i ≤ int ( cl a ˜ ( int ( μ i ) ) ) ≤ int ( cl a ˜ ( int ( μ ) ) ) , so μ ≤ int ( cl a ˜ ( int ( μ ) ) ) .
(d)
μ i ≤ cl a ˜ ( int ( cl a ˜ ( μ i ) ) ) ≤ cl a ˜ ( int ( cl a ˜ ( μ ) ) ) , so μ ≤ cl a ˜ ( int ( cl a ˜ ( μ ) ) ) .
(e)
μ i ≤ cl a ˜ ( int ( μ i ) ) ∨ int ( cl a ˜ ( μ i ) ) ≤ cl a ˜ ( int ( μ ) ) ∨ int ( cl a ˜ ( μ ) ) , so μ ≤ cl a ˜ ( int ( μ ) ) ∨ int ( cl a ˜ ( μ ) ) .
□
Remark 12.
In contrast to the union statement of Theorem 10, which holds for all five classes, the fuzzy a ˜ -α-open sets need not be closed under finite intersection, even when a ˜ is transitive. This is a genuine departure from the classical Njåstad theory, in which the α-open sets form a topology. The reason is structural: the interior int is computed in the ambient topology τ ˜ , while the closure cl a ˜ is the aura closure, so the two operators need not cooperate on meets. Example 10 records the failure.
Example 10.
Let X = { p , q , r } with membership values in { 0 , 1 2 , 1 } and ambient fuzzy topology
τ ˜ = 0 ¯ , 1 ¯ , ( 0 , 1 2 , 0 ) , ( 0 , 1 2 , 1 ) , ( 1 , 1 2 , 0 ) , ( 1 , 1 2 , 1 ) .
Take the trivial aura a ˜ ( p ) = a ˜ ( q ) = a ˜ ( r ) = 1 ¯ , which is transitive since min { 1 , 1 } ≤ 1 . Here cl a ˜ ( μ ) is the constant fuzzy set with value sup x μ ( x ) .
Consider μ = ( 0 , 1 2 , 1 ) and ν = ( 1 , 1 2 , 1 2 ) . For μ we have int ( μ ) = ( 0 , 1 2 , 1 ) , hence cl a ˜ ( int ( μ ) ) = 1 ¯ and int ( cl a ˜ ( int ( μ ) ) ) = 1 ¯ ≥ μ , so μ is fuzzy a ˜ -α-open. The same computation with int ( ν ) = ( 1 , 1 2 , 0 ) gives int ( cl a ˜ ( int ( ν ) ) ) = 1 ¯ ≥ ν , so ν is fuzzy a ˜ -α-open.
For the meet μ ∧ ν = ( 0 , 1 2 , 1 2 ) , however, int ( μ ∧ ν ) = ( 0 , 1 2 , 0 ) , so cl a ˜ ( int ( μ ∧ ν ) ) = ( 1 2 , 1 2 , 1 2 ) and int ( cl a ˜ ( int ( μ ∧ ν ) ) ) = ( 0 , 1 2 , 0 ) . Since ( 0 , 1 2 , 1 2 ) ≰ ( 0 , 1 2 , 0 ) , the meet μ ∧ ν is not fuzzy a ˜ -α-open.
Remark 13
(What the failure costs in Section 5). It is worth recording what Example 10 costs us later, since the classical theory draws real mileage from the property that fails here. Classically the α-open sets form a topology, so α-continuity is ordinary continuity with respect to that finer topology, and a number of standard results follow from this single observation. That route is closed in the present setting, in three specific ways. First, fuzzy a ˜ -α-continuity (Definition 15(d)) cannot be read as continuity into a topology on X, so the implications of Theorem 11 have to be obtained from the inclusions of Theorem 9 directly, one class at a time, and not by comparing topologies. Second, the decomposition of Theorem 12 and Corollary 1 does identify a ˜ - F α O ( X ) with a ˜ - FSO ( X ) ∩ a ˜ - FPO ( X ) when a ˜ is transitive, but it does not make either side a topology: the aura in Example 10 is the trivial one, which is transitive, so that intersection is not closed under finite meets either. Third, the usual argument that a composition of two α-continuous maps is again α-continuous runs through the topology property and is therefore unavailable; this is why Theorem 13 composes a weak variant with a fuzzy continuous map rather than with a second weak variant. What survives without any hypothesis is closure under arbitrary unions, and it survives for all five classes at once (Theorem 10), which is all the proofs in Section 5 actually use. The semi-open and pre-open classes lose nothing by comparison, since they are not closed under finite meets in the classical theory either; the α class is the one whose classical topology property does not survive the passage to auras.

5. Fuzzy Aura-Continuity

Definition 15.
Let ( X , τ ˜ 1 , a ˜ 1 ) and ( Y , τ ˜ 2 , a ˜ 2 ) be fuzzy a ˜ -spaces. A function f : X → Y is called:
(a) 
fuzzy a ˜ -continuous if f − 1 ( ν ) ∈ τ ˜ a ˜ 1 for every ν ∈ τ ˜ a ˜ 2 ;
(b) 
fuzzy a ˜ -semi-continuous if f − 1 ( ν ) ∈ a ˜ 1 - FSO ( X ) for every ν ∈ τ ˜ 2 ;
(c) 
fuzzy a ˜ -pre-continuous if f − 1 ( ν ) ∈ a ˜ 1 - FPO ( X ) for every ν ∈ τ ˜ 2 ;
(d) 
fuzzy a ˜ - α -continuous if f − 1 ( ν ) ∈ a ˜ 1 - F α O ( X ) for every ν ∈ τ ˜ 2 ;
(e) 
fuzzy a ˜ - β -continuous if f − 1 ( ν ) ∈ a ˜ 1 - F β O ( X ) for every ν ∈ τ ˜ 2 ;
(f) 
fuzzy a ˜ -b-continuous if f − 1 ( ν ) ∈ a ˜ 1 - FbO ( X ) for every ν ∈ τ ˜ 2 .
Here τ ˜ a ˜ 1 and τ ˜ a ˜ 2 are the fuzzy aura topologies of ( X , τ ˜ 1 , a ˜ 1 ) and ( Y , τ ˜ 2 , a ˜ 2 ) in the sense of Definition 11, formed with int a ˜ 1 and int a ˜ 2 respectively; by Remark 7 they need not be comparable with the ambient topologies τ ˜ 1 and τ ˜ 2 . Preimages are taken pointwise, f − 1 ( ν ) = ν ∘ f for ν ∈ I Y .
In what follows, P ranges over the five labels semi, pre, α , β , b; we write a ˜ - P O ( X ) for the corresponding collection of Definition 14 and fuzzy a ˜ - P -continuous for the corresponding item (b)–(f) above. A fuzzy set is fuzzy a ˜ - P -closed if its complement belongs to a ˜ - P O ( X ) . This lets us state the composition and characterization results once for all five variants instead of five times over.
Remark 14.
Item (a) uses the aura topologies on both sides, so fuzzy a ˜ -continuity compares the two derived structures. Items (b)–(f) keep the ambient topology on the codomain, in line with the classical weak-continuity variants, and it is in this form that they enter the implication chain below.
Theorem 11.
For any function f : ( X , τ ˜ 1 , a ˜ 1 ) → ( Y , τ ˜ 2 , a ˜ 2 ) between fuzzy a ˜ -spaces:
fuzzy continuous ⇒ a ˜ - α - cont . ⇒ a ˜ - semi - cont . a ˜ - pre - cont . ⇒ a ˜ - b - cont . ⇒ a ˜ - β - cont .
Proof. 
Recall that f : ( X , τ ˜ 1 ) → ( Y , τ ˜ 2 ) is fuzzy continuous if f − 1 ( ν ) ∈ τ ˜ 1 for every ν ∈ τ ˜ 2 . Let ν ∈ τ ˜ 2 throughout the proof.
Fuzzy continuous ⇒ a ˜ -α-continuous. If f is fuzzy continuous, then f − 1 ( ν ) ∈ τ ˜ 1 . By Theorem 9, τ ˜ 1 ⊆ a ˜ 1 - F α O ( X ) , hence f − 1 ( ν ) ∈ a ˜ 1 - F α O ( X ) .
a ˜ -α-continuous ⇒ a ˜ -semi-continuous and a ˜ -pre-continuous. By Theorem 9, a ˜ 1 - F α O ( X ) ⊆ a ˜ 1 - FSO ( X ) and a ˜ 1 - F α O ( X ) ⊆ a ˜ 1 - FPO ( X ) . Therefore f − 1 ( ν ) ∈ a ˜ 1 - F α O ( X ) implies f − 1 ( ν ) lies in both a ˜ 1 - FSO ( X ) and a ˜ 1 - FPO ( X ) .
a ˜ -semi-continuous (or a ˜ -pre-continuous) ⇒ a ˜ -b-continuous ⇒ a ˜ -β-continuous. By Theorem 9,
a ˜ 1 - FSO ( X ) ∪ a ˜ 1 - FPO ( X ) ⊆ a ˜ 1 - FbO ( X ) ⊆ a ˜ 1 - F β O ( X ) ,
and the memberships transfer to f − 1 ( ν ) for each ν ∈ τ ˜ 2 . □
Theorem 12
(Decomposition). If a ˜ 1 is transitive, then f is fuzzy a ˜ -α-continuous if and only if f is both fuzzy a ˜ -semi-continuous and fuzzy a ˜ -pre-continuous.
Proof. 
(⇒) is Theorem 11. (⇐): Let μ = f − 1 ( ν ) for ν ∈ τ ˜ 2 . Semi-continuity gives
μ ≤ cl a ˜ 1 ( int ( μ ) ) ,
and pre-continuity gives μ ≤ int ( cl a ˜ 1 ( μ ) ) . From the first,
cl a ˜ 1 ( μ ) ≤ cl a ˜ 1 cl a ˜ 1 ( int ( μ ) ) = cl a ˜ 1 ( int ( μ ) )
by idempotency (transitivity of a ˜ 1 ). Taking interiors: int ( cl a ˜ 1 ( μ ) ) ≤ int ( cl a ˜ 1 ( int ( μ ) ) ) . Hence μ ≤ int ( cl a ˜ 1 ( int ( μ ) ) ) . □
Corollary 1.
If a ˜ is transitive, then a ˜ - F α O ( X ) = a ˜ - FSO ( X ) ∩ a ˜ - FPO ( X ) .
Proof. 
The inclusion ⊆ is Theorem 9 and needs no transitivity. For ⊇, the argument in the proof of Theorem 12 applies verbatim to an arbitrary μ ∈ I X in place of f − 1 ( ν ) : if μ ≤ cl a ˜ ( int ( μ ) ) and μ ≤ int ( cl a ˜ ( μ ) ) , then idempotency of cl a ˜ (Theorem 7) gives cl a ˜ ( μ ) ≤ cl a ˜ ( int ( μ ) ) , hence μ ≤ int ( cl a ˜ ( μ ) ) ≤ int ( cl a ˜ ( int ( μ ) ) ) . □
Theorem 13
(Composition).
(a) 
Composition of fuzzy a ˜ -continuous functions is fuzzy a ˜ -continuous.
(b) 
Let P be any one of the five labels semi, pre, α, β, b. If f is fuzzy a ˜ - P -continuous and g is fuzzy continuous, then g ∘ f is fuzzy a ˜ - P -continuous.
Proof. 
Let ( X , τ ˜ 1 , a ˜ 1 ) , ( Y , τ ˜ 2 , a ˜ 2 ) , and ( Z , τ ˜ 3 , a ˜ 3 ) be fuzzy a ˜ -spaces, and consider f : X → Y and g : Y → Z .
(a)
Assume both f and g are fuzzy a ˜ -continuous. Let λ ∈ τ ˜ a ˜ 3 . Since g is fuzzy a ˜ -continuous, g − 1 ( λ ) ∈ τ ˜ a ˜ 2 . Since f is fuzzy a ˜ -continuous, f − 1 ( g − 1 ( λ ) ) ∈ τ ˜ a ˜ 1 . Using the identity ( g ∘ f ) − 1 ( λ ) = f − 1 ( g − 1 ( λ ) ) , we obtain ( g ∘ f ) − 1 ( λ ) ∈ τ ˜ a ˜ 1 for every λ ∈ τ ˜ a ˜ 3 . Hence g ∘ f is fuzzy a ˜ -continuous.
(b)
Assume f is fuzzy a ˜ - P -continuous and g is fuzzy continuous, and let ν ∈ τ ˜ 3 . Since g is fuzzy continuous, g − 1 ( ν ) ∈ τ ˜ 2 , and since f is fuzzy a ˜ - P -continuous, f − 1 ( g − 1 ( ν ) ) ∈ a ˜ 1 - P O ( X ) . Therefore ( g ∘ f ) − 1 ( ν ) = f − 1 ( g − 1 ( ν ) ) ∈ a ˜ 1 - P O ( X ) for every ν ∈ τ ˜ 3 , so g ∘ f is fuzzy a ˜ - P -continuous. The argument uses nothing about the class P beyond its definition through preimages, which is why one proof covers all five.
□
Theorem 14
(Characterization). Let P be any one of the five labels semi, pre, α, β, b. A function f : ( X , τ ˜ 1 , a ˜ 1 ) → ( Y , τ ˜ 2 ) is fuzzy a ˜ 1 - P -continuous if and only if f − 1 ( γ ) is fuzzy a ˜ 1 - P -closed for every fuzzy closed γ in Y.
Proof. 
Throughout, we use the identity f − 1 ( γ c ) = ( f − 1 ( γ ) ) c , valid for all γ ∈ I Y .
(⇒) Suppose f is fuzzy a ˜ 1 - P -continuous and let γ be fuzzy closed in Y. Then γ c ∈ τ ˜ 2 , so f − 1 ( γ c ) ∈ a ˜ 1 - P O ( X ) by hypothesis. By the identity above, ( f − 1 ( γ ) ) c ∈ a ˜ 1 - P O ( X ) , which says precisely that f − 1 ( γ ) is fuzzy a ˜ 1 - P -closed.
(⇐) Suppose every preimage of a fuzzy closed set is fuzzy a ˜ 1 - P -closed, and let ν ∈ τ ˜ 2 . Then ν c is fuzzy closed in Y, so f − 1 ( ν c ) is fuzzy a ˜ 1 - P -closed, that is, its complement lies in a ˜ 1 - P O ( X ) . Since f − 1 ( ν c ) = ( f − 1 ( ν ) ) c , this complement is f − 1 ( ν ) , so f − 1 ( ν ) ∈ a ˜ 1 - P O ( X ) for every ν ∈ τ ˜ 2 and f is fuzzy a ˜ 1 - P -continuous.
Only the duality between a class and its complements is used here, so, as in Theorem 13(b), the five variants are covered at once. □

6. Fuzzy Aura-Separation Axioms

Graded separation built from generalized fuzzy open sets remains an active line of study; Saleh, Al-shami, Azzam, and Hosny [48], for instance, analyzed stronger forms of fuzzy pre-separation and regularity axioms. Separation here is governed by the scope function a ˜ rather than by the ambient topology. Fixing the fuzzy topology and changing the auras can make a separation axiom hold or fail, a phenomenon with no counterpart in ordinary fuzzy topology.
Definition 16.
A fuzzy a ˜ -space ( X , τ ˜ , a ˜ ) is called:
(a) 
fuzzy a ˜ - T 0  if for every pair of distinct points x , y ∈ X , there exists μ ∈ τ ˜ a ˜ such that μ ( x ) ≠ μ ( y ) ;
(b) 
fuzzy a ˜ - T 1  if for every pair of distinct points x , y ∈ X , there exist μ , ν ∈ τ ˜ a ˜ such that μ ( x ) = 1 , μ ( y ) = 0 and ν ( y ) = 1 , ν ( x ) = 0 ;
(c) 
fuzzy a ˜ - T 2 (or fuzzy a ˜ -Hausdorff) if for every pair of distinct points x , y ∈ X , there exist μ , ν ∈ τ ˜ a ˜ such that μ ( x ) = 1 , ν ( y ) = 1 and μ ∧ ν = 0 ¯ .
Theorem 15.
Fuzzy a ˜ - T 2 ⇒ fuzzy a ˜ - T 1 ⇒ fuzzy a ˜ - T 0 . Moreover, when | X | ≥ 2 there is a scope function under which fuzzy a ˜ - T 0 (and hence every higher axiom) fails, no matter how separating the ambient topology τ ˜ is.
Proof. 
a ˜ - T 2 ⇒ a ˜ - T 1 . Let x ≠ y . By a ˜ - T 2 , there exist μ , ν ∈ τ ˜ a ˜ with μ ( x ) = 1 , ν ( y ) = 1 , and μ ∧ ν = 0 ¯ . From μ ∧ ν = 0 ¯ we have min { μ ( y ) , ν ( y ) } = 0 ; combined with ν ( y ) = 1 this forces μ ( y ) = 0 . Symmetrically ν ( x ) = 0 . The pair ( μ , ν ) witnesses a ˜ - T 1 for the points x and y.
a ˜ - T 1 ⇒ a ˜ - T 0 . Let x ≠ y . By a ˜ - T 1 , there exists μ ∈ τ ˜ a ˜ with μ ( x ) = 1 and μ ( y ) = 0 ; in particular μ ( x ) ≠ μ ( y ) , which gives a ˜ - T 0 .
Last statement. Take the trivial aura a ˜ ( x ) = 1 ¯ for all x, a legitimate scope function on any fuzzy topological space. By Proposition 4, τ ˜ a ˜ consists of constant fuzzy sets only, and when | X | ≥ 2 these cannot distinguish any two points; hence ( X , τ ˜ , a ˜ ) fails fuzzy a ˜ - T 0 regardless of how separating the ambient τ ˜ is: replacing τ ˜ by the aura topology can collapse separation entirely. □
Proposition 7.
If ( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 0 , then a ˜ ( x ) ≠ a ˜ ( y ) (as functions on X) for every pair of distinct points x , y ∈ X .
Proof. 
Suppose a ˜ ( x ) = a ˜ ( y ) for some x ≠ y . For any μ ∈ τ ˜ a ˜ ,
μ ( x ) = int a ˜ ( μ ) ( x ) = inf z max { 1 − a ˜ ( x ) ( z ) , μ ( z ) } = inf z max { 1 − a ˜ ( y ) ( z ) , μ ( z ) } = int a ˜ ( μ ) ( y ) = μ ( y ) .
Thus no fuzzy a ˜ -open set separates x from y, and the space is not fuzzy a ˜ - T 0 . □
Example 11.
Distinctness of the auras is not sufficient for fuzzy a ˜ - T 0 . Let X = { p , q , r } , τ ˜ = I X , and take the crisp auras a ˜ ( p ) = χ { p , q } , a ˜ ( q ) = 1 ¯ , a ˜ ( r ) = χ { r } , which are pairwise distinct. For a crisp aura, int a ˜ ( μ ) ( x ) = min y ∈ a ( x ) μ ( y ) , so μ ∈ τ ˜ a ˜ forces μ ( p ) = min { μ ( p ) , μ ( q ) } and μ ( q ) = min { μ ( p ) , μ ( q ) , μ ( r ) } ; the first gives μ ( p ) ≤ μ ( q ) and the second gives μ ( q ) ≤ μ ( p ) . Every fuzzy a ˜ -open set therefore takes the same value at p and q, and the space is not fuzzy a ˜ - T 0 .
Theorem 16.
( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 1 if and only if for every x ∈ X , cl a ˜ ( χ { x } ) = χ { x } , i.e., every crisp point (the characteristic function χ { x } of a singleton) is fuzzy a ˜ -closed.
Proof. 
(⇒): Let y ≠ x . By a ˜ - T 1 , there exists μ ∈ τ ˜ a ˜ with μ ( y ) = 1 , μ ( x ) = 0 . Then μ c ( y ) = 0 , μ c ( x ) = 1 , i.e., χ { x } ≤ μ c . Since μ c is a ˜ -closed for every such y, cl a ˜ ( χ { x } ) ≤ ⋀ y ≠ x μ y c . Evaluating at y: cl a ˜ ( χ { x } ) ( y ) ≤ μ y c ( y ) = 0 . Thus, cl a ˜ ( χ { x } ) ( y ) = 0 for all y ≠ x , and cl a ˜ ( χ { x } ) ( x ) = 1 .
(⇐): If cl a ˜ ( χ { y } ) = χ { y } for all y, then χ { y } c = 1 − χ { y } is a ˜ -open. For x ≠ y : χ { y } c ( x ) = 1 , χ { y } c ( y ) = 0 . Symmetrically for the other direction. □
Corollary 2.
( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 1 if and only if for every x ≠ y , a ˜ ( y ) ( x ) = 0 .
Proof. 
By Theorem 16, a ˜ - T 1 is equivalent to cl a ˜ ( χ { x } ) = χ { x } for every x ∈ X . We translate this condition pointwise. For any y ∈ X ,
cl a ˜ ( χ { x } ) ( y ) = sup z ∈ X min { a ˜ ( y ) ( z ) , χ { x } ( z ) } = min { a ˜ ( y ) ( x ) , 1 } = a ˜ ( y ) ( x ) ,
since the only nonzero contribution to the supremum is at z = x . The equality cl a ˜ ( χ { x } ) = χ { x } requires cl a ˜ ( χ { x } ) ( y ) = 0 for every y ≠ x (and the value at y = x is automatically a ˜ ( x ) ( x ) = 1 ). Hence a ˜ - T 1 holds if and only if a ˜ ( y ) ( x ) = 0 for all distinct pairs x ≠ y , which is the stated condition with the roles of x and y interchanged. □
Example 12.
Let X = { p , q , r } , τ ˜ = I X (the fuzzy discrete topology), and a ˜ ( p ) = a ˜ ( q ) = a ˜ ( r ) = 1 ¯ (the trivial aura). Then a ˜ ( p ) = a ˜ ( q ) , so by Proposition 7 the space is not fuzzy a ˜ - T 0 (and consequently fails a ˜ - T 1 and a ˜ - T 2 ). Thus even the finest ambient topology cannot rescue separation when a ˜ collapses to the trivial aura: the failure is structural, controlled entirely by a ˜ .
Example 13.
Let X = { p , q } , τ ˜ = I X , a ˜ ( p ) = ( 1 , 0 ) = χ { p } , a ˜ ( q ) = ( 0 , 1 ) = χ { q } . Then a ˜ ( p ) ( q ) = 0 and a ˜ ( q ) ( p ) = 0 , so by Corollary 2 the space is fuzzy a ˜ - T 1 . For a ˜ - T 2 : the sets a ˜ ( p ) , a ˜ ( q ) ∈ τ ˜ a ˜ satisfy a ˜ ( p ) ( p ) = 1 , a ˜ ( q ) ( q ) = 1 , and
a ˜ ( p ) ∧ a ˜ ( q ) = ( min ( 1 , 0 ) , min ( 0 , 1 ) ) = ( 0 , 0 ) = 0 ¯ ,
so the pair ( a ˜ ( p ) , a ˜ ( q ) ) witnesses a ˜ - T 2 . The space therefore satisfies all three separation axioms, in contrast to Example 12, despite both having τ ˜ = I X .
Definition 17.
( X , τ ˜ , a ˜ ) is fuzzy a ˜ -regular if for every fuzzy a ˜ -closed set γ and every x with γ ( x ) = 0 , there exist μ , ν ∈ τ ˜ a ˜ with μ ( x ) = 1 , γ ≤ ν , and μ ∧ ν = 0 ¯ .
Theorem 17.
If a ˜ is crisp and discrete (i.e., a ˜ ( x ) = χ { x } ), then ( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 2 and fuzzy a ˜ -regular.
Proof. 
Assume a ˜ ( x ) = χ { x } for every x ∈ X (this requires χ { x } ∈ τ ˜ for every x, e.g., when τ ˜ is the fuzzy discrete topology).
Fuzzy aura topology is discrete. For any μ ∈ I X and x ∈ X ,
int a ˜ ( μ ) ( x ) = inf y ∈ X max { 1 − χ { x } ( y ) , μ ( y ) } .
For y = x , 1 − χ { x } ( x ) = 0 , so max { 0 , μ ( x ) } = μ ( x ) . For y ≠ x , 1 − χ { x } ( y ) = 1 , so the max equals 1. The infimum is therefore min { μ ( x ) , 1 } = μ ( x ) . Hence int a ˜ ( μ ) = μ for every μ , so τ ˜ a ˜ = I X .
Fuzzy a ˜ - T 2 . For distinct x ≠ y , the fuzzy sets χ { x } , χ { y } ∈ τ ˜ a ˜ satisfy χ { x } ( x ) = 1 , χ { y } ( y ) = 1 , and χ { x } ∧ χ { y } = 0 ¯ since { x } ∩ { y } = ∅ .
Fuzzy a ˜ -regular. Let γ be fuzzy a ˜ -closed with γ ( x 0 ) = 0 . Take μ = χ { x 0 } and ν = γ (which is in τ ˜ a ˜ = I X since the aura topology is discrete, hence γ is both closed and open). Then μ ( x 0 ) = 1 , γ ≤ ν , and μ ( y ) ∧ ν ( y ) = χ { x 0 } ( y ) ∧ γ ( y ) = 0 for every y: at y = x 0 , ν ( x 0 ) = γ ( x 0 ) = 0 ; at y ≠ x 0 , χ { x 0 } ( y ) = 0 . Hence μ ∧ ν = 0 ¯ , proving fuzzy a ˜ -regularity. □
Corollary 3
(Collapse of the ungraded axioms). For a fuzzy a ˜ -space ( X , τ ˜ , a ˜ ) the following are equivalent:
(a) 
( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 1 ;
(b) 
( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 2 ;
(c) 
a ˜ ( x ) = χ { x } for every x ∈ X .
Any of these conditions forces χ { x } ∈ τ ˜ for every x and implies fuzzy a ˜ -regularity.
Proof. 
We prove the cycle (a) ⇒ (c) ⇒ (b) ⇒ (a), and then write out the composite implication (a) ⇒ (b) in full, since it is the one that carries the content of the corollary.
(a) ⇒ (c). Assume ( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 1 . By Corollary 2 this means a ˜ ( y ) ( x ) = 0 for every pair of distinct points x ≠ y . Fix y ∈ X . The scope axiom of Definition 8 gives a ˜ ( y ) ( y ) = 1 , so the fuzzy set a ˜ ( y ) takes the value 1 at y and the value 0 at every other point; that is, a ˜ ( y ) = χ { y } . Since scope values are fuzzy open by Definition 8, this also proves the auxiliary claim χ { y } ∈ τ ˜ for every y.
(c) ⇒ (b), together with fuzzy a ˜ -regularity. This is Theorem 17.
(b) ⇒ (a). This is the first implication of Theorem 15.
(a) ⇒ (b), explicitly. Assume fuzzy a ˜ - T 1 and let x ≠ y be given. By the first step, a ˜ ( z ) = χ { z } for every z ∈ X , so for any μ ∈ I X and any z,
int a ˜ ( μ ) ( z ) = inf w ∈ X max { 1 − χ { z } ( w ) , μ ( w ) } = min { μ ( z ) , 1 } = μ ( z ) ,
because the term at w = z equals μ ( z ) and every term at w ≠ z equals 1. Hence int a ˜ is the identity and τ ˜ a ˜ = I X ; in particular χ { x } and χ { y } are fuzzy a ˜ -open. They satisfy χ { x } ( x ) = 1 , χ { y } ( y ) = 1 , and χ { x } ∧ χ { y } = 0 ¯ because { x } ∩ { y } = ∅ . The pair therefore witnesses fuzzy a ˜ - T 2 for x and y, and since x ≠ y were arbitrary, the space is fuzzy a ˜ - T 2 . □
Remark 15.
The equivalence of a ˜ - T 1 and a ˜ - T 2 may look surprising, since in ordinary topology the two axioms are far apart. The reason it holds here is that both are decided by the same finite piece of data, the cross-aura values a ˜ ( y ) ( x ) for x ≠ y . Fuzzy a ˜ - T 1 already forces every one of them to vanish (Corollary 2), and once they vanish the aura interior is the identity, so the aura topology is all of I X and the strongest separation available comes for free. There is no intermediate regime in which the cross-auras vanish but the aura topology is still too coarse for T 2 , which is exactly the room that the classical hierarchy needs.
The corollary cuts two ways. It shows that the ungraded axioms a ˜ - T 1 and a ˜ - T 2 are all-or-nothing: they hold exactly when the aura carries no fuzzy information, and in particular no continuous scope function on R (Examples 2–4) satisfies them, since a ˜ ( y ) ( x ) > 0 for x close to y. Regularity does not collapse in the same way: under the trivial aura the fuzzy a ˜ -closed sets are the constants, so the only one vanishing at some point is 0 ¯ , and the pair μ = 1 ¯ , ν = 0 ¯ then meets Definition 17; that space is fuzzy a ˜ -regular while failing a ˜ - T 0 whenever | X | ≥ 2 . The graded axiom introduced below restores content for genuinely fuzzy auras.
Proposition 8
(Achievability of separation). A fuzzy topological space ( X , τ ˜ ) admits a fuzzy scope function a ˜ making ( X , τ ˜ , a ˜ ) fuzzy a ˜ - T 1 (equivalently, fuzzy a ˜ - T 2 ) if and only if χ { x } ∈ τ ˜ for every x ∈ X .
Proof. 
If some scope function realizes fuzzy a ˜ - T 1 , Corollary 3 forces a ˜ ( x ) = χ { x } for every x, and these values lie in τ ˜ by Definition 8. Conversely, if every χ { x } is fuzzy open, then a ˜ ( x ) = χ { x } defines a fuzzy scope function, and Theorem 17 applies. □
Remark 16.
Proposition 8 is where the openness requirement in Definition 8 carries real weight. On the purely relational side every reflexive fuzzy relation is admissible and separation is a property of the relation alone; here the ambient topology decides in advance whether the strongest separation behavior is achievable at all. Remark 18 below is the opposite extreme of the same mechanism: an indiscrete τ ˜ admits only the trivial aura and therefore no separation whatsoever.
Definition 18
(Graded T 1 ). Let α ∈ ( 0 , 1 ] . A fuzzy a ˜ -space ( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 1 at level α if a ˜ ( y ) ( x ) < α for all x , y ∈ X with x ≠ y .
Remark 17.
The levels are nested: if α ≤ β , then fuzzy a ˜ - T 1 at level α implies fuzzy a ˜ - T 1 at level β. The classical axiom is the strongest point of the scale: by Corollary 2, ( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 1 if and only if it is fuzzy a ˜ - T 1 at every level α ∈ ( 0 , 1 ] .
Proposition 9
(Level characterization). ( X , τ ˜ , a ˜ ) is fuzzy a ˜ - T 1 at level α if and only if ( cl a ˜ ( χ { x } ) ) α = { x } for every x ∈ X , i.e., the α-level set of the aura closure of every crisp point is that point alone.
Proof. 
As computed in the proof of Corollary 2, cl a ˜ ( χ { x } ) ( y ) = a ˜ ( y ) ( x ) . Hence ( cl a ˜ ( χ { x } ) ) α = { y ∈ X : a ˜ ( y ) ( x ) ≥ α } , which always contains x because a ˜ ( x ) ( x ) = 1 ≥ α . It equals { x } for every x exactly when a ˜ ( y ) ( x ) < α for all pairs y ≠ x , which is Definition 18. □
Example 14
(Sampled Gaussian aura). Continuous auras on R satisfy neither of the ungraded axioms a ˜ - T 1 and a ˜ - T 2 (Remark 15), but sampling changes the picture. Fix a sampling step δ > 0 and let X = δ Z carry the discrete fuzzy topology τ ˜ = I X and the restricted Gaussian aura a ˜ σ ( x ) ( y ) = exp ( − ( x − y ) 2 / σ 2 ) for x , y ∈ X . The largest cross-aura value is attained at adjacent samples, sup x ≠ y a ˜ σ ( x ) ( y ) = e − δ 2 / σ 2 , so the space is fuzzy a ˜ - T 1 at level α exactly when
α > e − δ 2 / σ 2 .
The threshold e − δ 2 / σ 2 falls as the window sharpens ( σ → 0 ) or the sampling coarsens ( δ → ∞ ), and in the limit σ → 0 every level is reached: the crisp axiom a ˜ - T 1 is recovered. In the opposite regime δ / σ → 0 the threshold tends to 1 and every graded level α < 1 eventually fails, matching the continuum obstruction of Remark 15. Separation is thus quantitatively coupled to the same resolution parameter that drives the rough approximations of Section 7.
Theorem 18.
Let ( X , τ ˜ ) be a fuzzy topological space with | X | ≥ 2 such that χ { x } ∈ τ ˜ for every x ∈ X (e.g., the discrete fuzzy topology I X ). Then there exist fuzzy scope functions a ˜ 1 , a ˜ 2 on ( X , τ ˜ ) such that ( X , τ ˜ , a ˜ 1 ) is fuzzy a ˜ - T 2 while ( X , τ ˜ , a ˜ 2 ) is not fuzzy a ˜ - T 0 .
Proof. 
We construct two scope functions on the same underlying space yielding opposite separation behavior; the hypothesis χ { x } ∈ τ ˜ makes the first of them legitimate.
a ˜ 1 - T 2 realization. Define a ˜ 1 ( x ) = χ { x } for every x ∈ X . By Theorem 17, ( X , τ ˜ , a ˜ 1 ) is fuzzy a ˜ - T 2 .
a ˜ 2 failure of a ˜ - T 0 . Define a ˜ 2 ( x ) = 1 ¯ for every x ∈ X (the trivial aura). By Proposition 4, τ ˜ a ˜ 2 consists exclusively of constant fuzzy sets. Since | X | ≥ 2 , pick any two distinct points x , y ; for every constant α ¯ , α ¯ ( x ) = α = α ¯ ( y ) . Hence no fuzzy a ˜ 2 -open set distinguishes x from y, so ( X , τ ˜ , a ˜ 2 ) fails fuzzy a ˜ - T 0 . Thus on the same fuzzy topological space, two different scope functions can yield drastically different separation properties; the separation axioms are governed by the choice of a ˜ , not by τ ˜ alone. □
Remark 18.
Some richness hypothesis on τ ˜ is necessary in Theorem 18. On the indiscrete topology τ ˜ = { 0 ¯ , 1 ¯ } the scope axiom a ˜ ( x ) ( x ) = 1 leaves the trivial aura as the only fuzzy scope function, and by Proposition 4 the resulting space is never fuzzy a ˜ - T 0 when | X | ≥ 2 .

7. Fuzzy Aura-Based Rough Approximations

Before the formal statement, here is what the two approximations measure. The upper approximation apr ¯ a ˜ ( μ ) ( x ) records how far μ reaches into the aura of x, and the lower approximation apr ̲ a ˜ ( μ ) ( x ) records how deeply x lies inside μ . Their difference is the boundary, and a finer a ˜ makes it smaller; Theorem 20 makes this precise.
Definition 19.
Let ( X , τ ˜ , a ˜ ) be a fuzzy a ˜ -space and μ ∈ I X . The fuzzy aura lower and upper approximations are defined by
apr ̲ a ˜ ( μ ) ( x ) = int a ˜ ( μ ) ( x ) = inf y ∈ X max { 1 − a ˜ ( x ) ( y ) , μ ( y ) } ,
apr ¯ a ˜ ( μ ) ( x ) = cl a ˜ ( μ ) ( x ) = sup y ∈ X min { a ˜ ( x ) ( y ) , μ ( y ) } .
The fuzzy aura boundary is defined by bnd a ˜ ( μ ) ( x ) = apr ¯ a ˜ ( μ ) ( x ) − apr ̲ a ˜ ( μ ) ( x ) .
Theorem 19.
For all μ , ν ∈ I X :
(a) 
apr ̲ a ˜ ( μ ) ≤ μ ≤ apr ¯ a ˜ ( μ ) .
(b) 
apr ̲ a ˜ ( 0 ¯ ) = apr ¯ a ˜ ( 0 ¯ ) = 0 ¯ and apr ̲ a ˜ ( 1 ¯ ) = apr ¯ a ˜ ( 1 ¯ ) = 1 ¯ .
(c) 
apr ̲ a ˜ ( μ ∧ ν ) = apr ̲ a ˜ ( μ ) ∧ apr ̲ a ˜ ( ν ) .
(d) 
apr ¯ a ˜ ( μ ∨ ν ) = apr ¯ a ˜ ( μ ) ∨ apr ¯ a ˜ ( ν ) .
(e) 
μ ≤ ν ⇒ apr ̲ a ˜ ( μ ) ≤ apr ̲ a ˜ ( ν ) and apr ¯ a ˜ ( μ ) ≤ apr ¯ a ˜ ( ν ) .
(f) 
apr ̲ a ˜ ( μ c ) = ( apr ¯ a ˜ ( μ ) ) c and apr ¯ a ˜ ( μ c ) = ( apr ̲ a ˜ ( μ ) ) c .
(g) 
apr ̲ a ˜ ( apr ̲ a ˜ ( μ ) ) ≤ apr ̲ a ˜ ( μ ) and apr ¯ a ˜ ( μ ) ≤ apr ¯ a ˜ ( apr ¯ a ˜ ( μ ) ) .
Proof. 
All seven properties follow from the operator identities apr ̲ a ˜ = int a ˜ and apr ¯ a ˜ = cl a ˜ (Definition 19) together with the established properties of these operators in Theorems 1 and 4.
(a)
By Theorem 4(b), apr ̲ a ˜ ( μ ) = int a ˜ ( μ ) ≤ μ . By Theorem 1(b), μ ≤ cl a ˜ ( μ ) = apr ¯ a ˜ ( μ ) . Chaining gives apr ̲ a ˜ ( μ ) ≤ μ ≤ apr ¯ a ˜ ( μ ) .
(b)
By Theorem 1(a), apr ¯ a ˜ ( 0 ¯ ) = cl a ˜ ( 0 ¯ ) = 0 ¯ . For apr ̲ a ˜ ( 0 ¯ ) , expand the definition:
apr ̲ a ˜ ( 0 ¯ ) ( x ) = inf y ∈ X max { 1 − a ˜ ( x ) ( y ) , 0 } = inf y ∈ X ( 1 − a ˜ ( x ) ( y ) ) = 1 − sup y ∈ X a ˜ ( x ) ( y ) = 1 − 1 = 0 ,
where the last equality uses the scope axiom a ˜ ( x ) ( x ) = 1 . Hence apr ̲ a ˜ ( 0 ¯ ) = 0 ¯ . Symmetrically, by Theorem 4(a), apr ̲ a ˜ ( 1 ¯ ) = int a ˜ ( 1 ¯ ) = 1 ¯ , while
apr ¯ a ˜ ( 1 ¯ ) ( x ) = sup y ∈ X min { a ˜ ( x ) ( y ) , 1 } = sup y ∈ X a ˜ ( x ) ( y ) ≥ a ˜ ( x ) ( x ) = 1 ,
so apr ¯ a ˜ ( 1 ¯ ) = 1 ¯ .
(c)
By Theorem 4(d), apr ̲ a ˜ ( μ ∧ ν ) = int a ˜ ( μ ∧ ν ) = int a ˜ ( μ ) ∧ int a ˜ ( ν ) = apr ̲ a ˜ ( μ ) ∧ apr ̲ a ˜ ( ν ) .
(d)
By Theorem 1(d), apr ¯ a ˜ ( μ ∨ ν ) = cl a ˜ ( μ ∨ ν ) = cl a ˜ ( μ ) ∨ cl a ˜ ( ν ) = apr ¯ a ˜ ( μ ) ∨ apr ¯ a ˜ ( ν ) .
(e)
Suppose μ ≤ ν . By monotonicity of int a ˜ (Theorem 4(c)), apr ̲ a ˜ ( μ ) = int a ˜ ( μ ) ≤ int a ˜ ( ν ) = apr ̲ a ˜ ( ν ) . By monotonicity of cl a ˜ (Theorem 1(c)), apr ¯ a ˜ ( μ ) = cl a ˜ ( μ ) ≤ cl a ˜ ( ν ) = apr ¯ a ˜ ( ν ) .
(f)
The duality relation (Theorem 4(e)) states int a ˜ ( μ ) = ( cl a ˜ ( μ c ) ) c . Substituting μ c for μ :
apr ̲ a ˜ ( μ c ) = int a ˜ ( μ c ) = ( cl a ˜ ( μ ) ) c = ( apr ¯ a ˜ ( μ ) ) c .
For the second identity, the original duality int a ˜ ( μ ) = ( cl a ˜ ( μ c ) ) c rearranges to cl a ˜ ( μ c ) = ( int a ˜ ( μ ) ) c , i.e., apr ¯ a ˜ ( μ c ) = ( apr ̲ a ˜ ( μ ) ) c .
(g)
For the upper inequality, apply extensivity (Theorem 1(b)) to the fuzzy set apr ¯ a ˜ ( μ ) : apr ¯ a ˜ ( μ ) ≤ cl a ˜ ( apr ¯ a ˜ ( μ ) ) = apr ¯ a ˜ ( apr ¯ a ˜ ( μ ) ) . For the lower inequality, part (a) gives apr ̲ a ˜ ( μ ) ≤ μ , so by monotonicity (just proved in (e)), apr ̲ a ˜ ( apr ̲ a ˜ ( μ ) ) ≤ apr ̲ a ˜ ( μ ) .
□
Remark 19.
The fuzzy aura rough set model relates to the standard models as follows:
(i) 
Crisp aura model  [30]: recovered as the special case a ˜ ( x ) = χ a ( x ) , μ = χ A .
(ii) 
Dubois–Prade model [26]: by Remark 4, the identification apr ¯ a ˜ = apr ¯ R and apr ̲ a ˜ = apr ̲ R with R ( x , y ) = a ˜ ( x ) ( y ) holds for every scope function, so the aura pair does not generalize the Dubois–Prade pair; it coincides with it, subject to the admissibility requirement that each foreset R ( x , · ) be fuzzy open. Conversely, every reflexive fuzzy relation with fuzzy open foresets arises from a scope function.
(iii) 
Pawlak model  [16]: recovered as the special case a ˜ ( x ) = χ [ x ] R , μ = χ A for an equivalence relation R.
Theorem 20
(Refinement Monotonicity). If a ˜ 2 ( x ) ( y ) ≤ a ˜ 1 ( x ) ( y ) for all x , y (finer aura), then:
(a) 
apr ̲ a ˜ 1 ( μ ) ≤ apr ̲ a ˜ 2 ( μ ) ;
(b) 
apr ¯ a ˜ 2 ( μ ) ≤ apr ¯ a ˜ 1 ( μ ) ;
(c) 
bnd a ˜ 2 ( μ ) ( x ) ≤ bnd a ˜ 1 ( μ ) ( x ) .
Proof. 
Fix μ ∈ I X and x ∈ X , and assume a ˜ 2 ( x ) ( y ) ≤ a ˜ 1 ( x ) ( y ) for every y ∈ X .
(a)
Since a ˜ 2 ( x ) ( y ) ≤ a ˜ 1 ( x ) ( y ) , we have 1 − a ˜ 2 ( x ) ( y ) ≥ 1 − a ˜ 1 ( x ) ( y ) for every y. Combining with the trivial inequality μ ( y ) ≥ μ ( y ) and using that max preserves the order in each argument,
max { 1 − a ˜ 2 ( x ) ( y ) , μ ( y ) } ≥ max { 1 − a ˜ 1 ( x ) ( y ) , μ ( y ) } .
Since the inequality holds pointwise in y, taking the infimum over y preserves the order:
apr ̲ a ˜ 2 ( μ ) ( x ) = inf y ∈ X max { 1 − a ˜ 2 ( x ) ( y ) , μ ( y ) } ≥ inf y ∈ X max { 1 − a ˜ 1 ( x ) ( y ) , μ ( y ) } = apr ̲ a ˜ 1 ( μ ) ( x ) .
This is precisely apr ̲ a ˜ 1 ( μ ) ≤ apr ̲ a ˜ 2 ( μ ) .
(b)
Using a ˜ 2 ( x ) ( y ) ≤ a ˜ 1 ( x ) ( y ) and the order-preservation of min,
min { a ˜ 2 ( x ) ( y ) , μ ( y ) } ≤ min { a ˜ 1 ( x ) ( y ) , μ ( y ) } .
Taking the supremum over y:
apr ¯ a ˜ 2 ( μ ) ( x ) = sup y ∈ X min { a ˜ 2 ( x ) ( y ) , μ ( y ) } ≤ sup y ∈ X min { a ˜ 1 ( x ) ( y ) , μ ( y ) } = apr ¯ a ˜ 1 ( μ ) ( x ) .
(c)
From parts (a) and (b), the upper approximation under a ˜ 2 is smaller while the lower approximation under a ˜ 2 is larger. Hence
bnd a ˜ 2 ( μ ) ( x ) = apr ¯ a ˜ 2 ( μ ) ( x ) − apr ̲ a ˜ 2 ( μ ) ( x ) ≤ apr ¯ a ˜ 1 ( μ ) ( x ) − apr ̲ a ˜ 1 ( μ ) ( x ) = bnd a ˜ 1 ( μ ) ( x ) .
Thus a finer aura function produces a tighter approximation pair and a smaller boundary region, as claimed.
□
Remark 20.
The computation is the standard monotonicity argument of relational fuzzy rough set theory and is valid for arbitrary reflexive fuzzy relations; it is implicit in the constructive theory of [32], and comparisons across granulations of this kind drive the multigranulation rough set models initiated by Qian, Liang, Yao, and Dang [49]. We state it in aura notation because the segmentation reading below applies it to scope functions on a fixed fuzzy topological space.
Definition 20.
For finite X and μ ∈ I X with μ ≠ 0 ¯ , the fuzzy aura accuracy and roughness are defined as
ρ a ˜ ( μ ) = ∑ x apr ̲ a ˜ ( μ ) ( x ) ∑ x apr ¯ a ˜ ( μ ) ( x ) , κ a ˜ ( μ ) = 1 − ρ a ˜ ( μ ) ;
the denominator is positive because apr ¯ a ˜ ( μ ) ≥ μ ≠ 0 ¯ .
Remark 21.
The construction above has a clean reading on the real line, where refinement monotonicity (Theorem 20) turns into a statement about the width of a Gaussian observation window. We close the section with that example, read as multi-resolution segmentation.

Illustrative Examples: Multi-Resolution Segmentation of a Signal and of a Planar Foreground

The fuzzy aura construction has a direct reading in multi-resolution image and signal segmentation, and this is the setting in which the resolution parameter becomes concrete. Picture a one-dimensional signal whose foreground is the region [ 0 , 1 ] , observed through a scope function that plays the role of the imaging window: each point x takes in its surroundings through the Gaussian window a ˜ σ ( x ) ( y ) = e − ( x − y ) 2 / σ 2 , whose width σ is the resolution of the observation. Under this reading the two approximation operators are the two natural segmentations of the foreground. The lower approximation is the certain core, the points whose whole window stays inside the foreground; the upper approximation is the possible region, the points whose window still meets it; and the boundary is the uncertain edge band lying between the two. Sharpening the resolution, that is decreasing σ , sharpens the segmentation, and Theorem 20 guarantees that the edge band can only shrink, never grow. In morphological terms the upper and lower approximations are the fuzzy dilation and fuzzy erosion of the foreground by the structuring element a ˜ σ , and the link between rough approximations and mathematical morphology is classical [50]; what the aura framework contributes is the topological reading of the same operators and the monotonicity guarantee.
  • Setting.
Let ( R , τ ˜ u ) be the real line with the triangular-neighborhood fuzzy topology of Example 2, and let a ˜ σ be the Gaussian aura of Example 4,
a ˜ σ ( x ) ( y ) = exp − ( x − y ) 2 σ 2 , x , y ∈ R ,
for σ > 0 . The scope axiom a ˜ σ ( x ) ( x ) = 1 holds trivially, and a ˜ σ ( x ) ∈ τ ˜ u by Remark 2. The parameter σ sets how widely a point x takes in its surroundings: small σ confines attention to a thin neighborhood, while large σ spreads it broadly.
  • The foreground.
Take the foreground to be the unit interval, μ = χ [ 0 , 1 ] , a crisp object sitting inside the fuzzy framework.
  • Closed-form approximations.
A direct computation gives the upper approximation
apr ¯ a ˜ σ ( μ ) ( x ) = sup y ∈ [ 0 , 1 ] exp − ( x − y ) 2 σ 2 = exp ( − x 2 / σ 2 ) , x ≤ 0 , 1 , 0 ≤ x ≤ 1 , exp ( − ( x − 1 ) 2 / σ 2 ) , x ≥ 1 ,
and the lower approximation
apr ̲ a ˜ σ ( μ ) ( x ) = inf y ∈ R max 1 − exp − ( x − y ) 2 σ 2 , χ [ 0 , 1 ] ( y ) = 1 − exp − d ( x ) 2 σ 2 , 0 < x < 1 , 0 , otherwise ,
where d ( x ) = min { x , 1 − x } is the distance from x to the boundary of [ 0 , 1 ] . The boundary function bnd a ˜ σ ( μ ) ( x ) = apr ¯ a ˜ σ ( μ ) ( x ) − apr ̲ a ˜ σ ( μ ) ( x ) thus takes a clean closed form on each region.
  • Numerical sample (refinement).
Table 2 compares two scales σ 1 = 0.5 and σ 2 = 0.2 at several points of the real line.
Table 2. Upper approximation, lower approximation, and boundary of the foreground μ = χ [ 0 , 1 ] at the coarse scale σ 1 = 0.5 and the fine scale σ 2 = 0.2 .
Figure 1 displays the two resolutions side by side. Since σ 2 < σ 1 gives a ˜ σ 2 ( x ) ( y ) ≤ a ˜ σ 1 ( x ) ( y ) pointwise, Theorem 20 predicts apr ̲ a ˜ σ 1 ≤ apr ̲ a ˜ σ 2 , apr ¯ a ˜ σ 2 ≤ apr ¯ a ˜ σ 1 , and bnd a ˜ σ 2 ≤ bnd a ˜ σ 1 . Reading the table in segmentation terms, the certain core grows and the uncertain band shrinks as the resolution sharpens from σ = 0.5 to σ = 0.2 ; all three inequalities can be read off directly.
Figure 1. Multi-resolution segmentation of the foreground μ = χ [ 0 , 1 ] through a Gaussian observation window. The certain core (lower), the possible region (upper), and the uncertain boundary band (shaded) are shown at a coarse resolution σ = 0.5 and a fine resolution σ = 0.2 . As the resolution sharpens, the boundary band shrinks: its total area falls from 1.63 to 0.71 , in line with the refinement monotonicity of Theorem 20. The dotted rectangle in each panel is the foreground μ itself, labelled “object” in the left panel.
  • Asymptotic behavior.
The closed-form expressions yield clean limits. For any interior point x ∈ ( 0 , 1 ) with d ( x ) > 0 ,
lim σ → 0 + apr ̲ a ˜ σ ( μ ) ( x ) = lim σ → 0 + 1 − e − d ( x ) 2 / σ 2 = 1 , lim σ → 0 + bnd a ˜ σ ( μ ) ( x ) = 0 ,
so as the window narrows, the two segmentations close in on the foreground itself: perfect resolution in the interior. In the opposite limit,
lim σ → ∞ apr ̲ a ˜ σ ( μ ) ( x ) = 0 , lim σ → ∞ apr ¯ a ˜ σ ( μ ) ( x ) = 1 ( for any x ∈ R ) ,
the trivial-aura behavior of Proposition 4: once the resolution is gone the boundary saturates everywhere and the segmentation tells us nothing.
  • Locally varying resolution.
The same closed-form analysis goes through when σ depends on the point, σ = σ ( x ) varying along R . This is exactly the locally adaptive resolution one wants in practice, where a segmentation is allowed to be sharp in some regions and coarse in others, and it is the continuous counterpart of the variable scope function from the crisp aura construction of [30].
  • A two-dimensional foreground.
Nothing in the computation is tied to the line, and the planar case is the one an image carries. Let ( R 2 , τ ˜ u ( 2 ) ) be the plane with the fuzzy topology generated by the conical neighborhoods λ c , ε ( y ) = max { 0 , 1 − ∥ y − c ∥ / ε } , and put a ˜ σ ( x ) ( y ) = exp ( − ∥ x − y ∥ 2 / σ 2 ) . The Lipschitz argument of Remark 2 uses only the metric and the generators, so it applies here word for word: a ˜ σ ( x ) ∈ τ ˜ u ( 2 ) , and a ˜ σ is a fuzzy scope function on the plane. Take the foreground to be the unit square S = [ 0 , 1 ] 2 and μ = χ S . Write d ( x , S ) for the Euclidean distance from x to S and d ( x , S c ) for the distance from x to the complement of S. The two computations run exactly as on the line and give
apr ¯ a ˜ σ ( μ ) ( x ) = exp − d ( x , S ) 2 σ 2 , apr ̲ a ˜ σ ( μ ) ( x ) = 1 − exp − d ( x , S c ) 2 σ 2 ,
the first because the window is a decreasing function of distance, so its supremum over S is taken at the point of S nearest to x; the second because the terms with y ∈ S contribute 1 to the infimum in (5) while those with y ∉ S contribute 1 − exp ( − ∥ x − y ∥ 2 / σ 2 ) , and among the latter the nearest point outside S decides. For x in the interior of S one has d ( x , S c ) = min { x 1 , 1 − x 1 , x 2 , 1 − x 2 } , and apr ̲ a ˜ σ ( μ ) ( x ) = 0 for every other x.
Table 3 reads like Table 2, and the three inequalities of Theorem 20 can again be checked row by row. What the plane adds is the corner. Outside the square, the diagonal point ( − 0.5 , − 0.5 ) already has a much weaker possible-region value than the side point ( − 0.5 , 0.5 ) , because its distance to S is larger by a factor 2 ; inside, the near-corner point ( 0.1 , 0.1 ) keeps a wide boundary value even at the fine scale, where the point ( 0.25 , 0.5 ) near the middle of an edge has largely resolved. Corners therefore sharpen later than edges as σ decreases, which is the behavior one expects from erosion and dilation by a radially symmetric structuring element and which here falls straight out of the closed forms.
Table 3. The planar analogue of Table 2: approximations of the square foreground μ = χ [ 0 , 1 ] 2 at the coarse scale σ 1 = 0.5 and the fine scale σ 2 = 0.2 .
  • What these examples do and do not show.
Both computations are illustrations of the theory rather than an empirical validation of a segmentation method. There is no real image or benchmark dataset here, and no comparison against existing fuzzy or rough segmentation algorithms. What they do is exhibit the two operators in closed form, make the resolution parameter visible, and confirm the qualitative content of Theorem 20 in cases where every quantity can be computed by hand. An experimental study on real data, with such a comparison, is a separate undertaking and we have not attempted it here; Section 9 returns to this point.

8. Comparison with Existing Fuzzy Auxiliary Structures

Where does the fuzzy aura sit among the other auxiliary structures on a fuzzy topological space? Table 4 lines it up against fuzzy ideals, fuzzy grills, and the Dubois–Prade fuzzy rough set model; the crisp version of this comparison appears in Section 7 of [30]. By Remark 4 the aura and Dubois–Prade columns share their operators, so the differences lie in the data carried and in the interaction with τ ˜ . The correspondence between reflexive transitive fuzzy relations and fuzzy topologies is itself classical [33,34]; the aura sits on the non-transitive side of it, where the closure is genuinely Čech.
Table 4. How the fuzzy aura compares with the other auxiliary structures on a fuzzy topological space ( X , τ ˜ ) .
The main point the table makes is that the aura is not lighter data than a relation; it is a reflexive fuzzy relation, packaged per point, with the additional compatibility requirement that each foreset be fuzzy open. That requirement is precisely what lets the aura interact with the ambient topology: the mixed operators of Section 4 compose the ambient interior with the aura closure, and no purely relational or ideal-theoretic construction produces the resulting hierarchy or its failures (Remark 12). There is also a contrast of direction: where an ideal or a grill refines τ ˜ , the aura replaces it. Under the trivial aura the induced τ ˜ a ˜ can even collapse to the constants (Proposition 4), erasing every separation property of the ambient space, which is something a refining construction can never force. The closure itself is only Čech in general (Theorem 3) and turns Kuratowski when a ˜ is transitive (Theorem 7); by Proposition 3, iterating it never produces a topology beyond τ ˜ a ˜ itself.
The table compresses several distinct relationships into one column, so it is worth walking through the neighboring frameworks one at a time; the aura stands at a different distance from each.
Fuzzy relations without reflexivity. Formulas (2) and (4) make sense for any fuzzy relation, but the scope axiom a ˜ ( x ) ( x ) = 1 is exactly reflexivity, and it is what delivers extensivity of cl a ˜ and contractivity of int a ˜ (Theorem 1(b), Theorem 4(b)). Drop it and the pair is no longer a closure–interior pair at all, so nothing topological survives; every result in this paper uses reflexivity from the first line.
Reflexive fuzzy relations. Here the relationship is an equality rather than a specialization: by Remark 4 the aura operators are the Dubois–Prade operators of R ( x , y ) = a ˜ ( x ) ( y ) , and conversely every reflexive fuzzy relation whose foresets R ( x , · ) are fuzzy open is a scope function (Remark 19(ii)). In data, therefore, the aura is a restricted relation; in statements it is the wider setting, because the ambient topology can be quantified over. Proposition 8, which decides from τ ˜ alone whether any separating scope function exists at all, and Theorem 18, which fixes τ ˜ and varies a ˜ , are both of this kind and have no formulation on the purely relational side.
Fuzzy neighborhood operators. A scope function is a fuzzy neighborhood operator in the sense used for covering-based fuzzy rough sets by D’eer, Cornelis, and Godo [35]: it assigns one fuzzy set to each point, and the induced approximations are the usual ones. Two differences are worth naming. Their neighborhoods are derived from a covering and inherit whatever regularity the covering has, whereas ours are prescribed directly and are constrained only by fuzzy openness; and the generalized open sets of Section 4 pair the neighborhood-induced closure with the ambient interior, a combination that does not arise when the topology is absent (Remark 10).
Fuzzy rough sets. As a model of graded indiscernibility, the aura pair is the Dubois–Prade model [26]; the comparative account of Radzikowska and Kerre [27], the constructive and axiomatic theory of Yao [28], Morsi and Yakout [31], and Wu, Mi, and Zhang [32], all apply to it unchanged. When a ˜ is symmetric and transitive we are in the fuzzy equivalence case of the classical model (Theorem 8), and the refinement statement of Theorem 20 is the comparison across granulations that multigranulation models exploit [49]. What the aura contributes is not a new approximation model but a topological environment for an existing one.
Fuzzy closure spaces. By Theorem 1 the pair ( X , cl a ˜ ) is a fuzzy closure space in the sense of Mashhour and Ghanim [43], and by Theorem 6 its iteration is Kuratowski. The aura ones form a proper subclass: cl a ˜ is completely additive (Lemma 2), which a fuzzy Čech closure need not be, and it is determined by its values on the crisp points, since cl a ˜ ( χ { y } ) ( x ) = a ˜ ( x ) ( y ) and complete additivity recovers cl a ˜ ( μ ) from these. Its provenance is what a general fuzzy closure space lacks, and it is what makes the scale-additivity law of Proposition 6 and the achievability criterion of Proposition 8 expressible at all.

9. Conclusions

We introduced fuzzy aura topological spaces ( X , τ ˜ , a ˜ ) , generalizing the crisp aura spaces to the fuzzy setting. The central operator is the fuzzy aura-closure cl a ˜ , a fuzzy additive Čech closure that is not idempotent in general; we gave a counterexample and showed it becomes idempotent once a ˜ is transitive. Its iteration is a Kuratowski closure with the same fixed points, so the derived fuzzy aura topology τ ˜ a ˜ is unambiguous; unlike in the crisp theory, it need not be contained in the ambient topology, as a two-point example shows. From cl a ˜ and its dual interior we built five classes of generalized fuzzy open sets and placed them in a hierarchy, with counterexamples on finite spaces and on the real line showing each inclusion to be strict. On the real line the closure obeys a scale-additivity law: it maps triangular and Gaussian profiles to profiles of the same family with the widths added (Proposition 6), so the aura closure of these fuzzy open profiles stays fuzzy open.
We then studied fuzzy a ˜ -continuity, proving decomposition theorems and in particular the identity a ˜ - F α O = a ˜ - FSO ∩ a ˜ - FPO under transitivity (Corollary 1). The separation axioms fuzzy a ˜ - T i ( i = 0 , 1 , 2 ) and fuzzy a ˜ -regularity were tied to the scope function: distinctness of the auras is necessary for fuzzy a ˜ - T 0 though not sufficient, fuzzy a ˜ - T 1 is characterized completely by the vanishing of the cross-auras, and the discrete crisp aura forces both fuzzy a ˜ - T 2 and fuzzy a ˜ -regularity; separation thus rests on the auras and not on the ambient topology. In fact the ungraded T 1 and T 2 axioms collapse: they are equivalent to each other and to the aura being discrete and crisp (Corollary 3), and a space admits such a scope function precisely when its crisp singletons are fuzzy open (Proposition 8). The graded, level-indexed variant of T 1 restores nontrivial content for continuous auras; the sampled Gaussian aura, for instance, is separated exactly above the level e − δ 2 / σ 2 set by the sampling step and the window width. The rough approximation operators coincide with the Dubois–Prade pair of the associated reflexive fuzzy relation and recover the Pawlak and crisp aura models as special cases, and the refinement monotonicity theorem turns the scope width into a resolution parameter, with finer auras giving tighter approximations and smaller boundaries. Section 7 reads that statement as multi-resolution segmentation.
Two limitations should be stated plainly. The first concerns novelty: the approximation operators themselves are the Dubois–Prade operators of a reflexive fuzzy relation, and every result about them alone belongs to the existing relational theory. What we claim as new lives in the interaction between the scope function and the ambient topology, and the reader can locate it precisely: the hierarchy of the five mixed classes and its strictness, the failure of the Njåstad property and what that failure costs (Remark 13), the scale-additivity law, the collapse of the ungraded separation axioms with the criterion for admitting a separating scope function, and the graded level- α axiom. The second concerns the segmentation reading of Section 7. The one- and two-dimensional computations there are illustrations, not experiments: they involve no real image or benchmark data and no comparison with existing segmentation methods, and they should be read as showing what the operators look like at two resolutions rather than as evidence of practical performance. Testing the construction on real data, against the standard fuzzy and rough alternatives, is the obvious next step and is not undertaken here.
A few questions are left open. In the crisp theory the containment τ a ⊆ τ makes aura-compactness easier to reach than ordinary compactness; in the fuzzy setting this containment can fail, so even the correct comparison between aura-compactness and fuzzy compactness is unsettled. We have not pursued it here, though the recent treatment of compactness via primal structures [10] suggests one route. Products and subspaces are also untreated, and it is not clear when refinement monotonicity survives them. One could also combine the scope function and a fuzzy ideal in a single local function, which would sit between the aura-closure cl a ˜ and the ideal-closure cl * and tie together two structures that have each been studied at length [24,25].

Author Contributions

Conceptualization, A.A. and A.G.; formal analysis, A.A. and A.G.; investigation, A.A. and A.G.; writing—original draft preparation, A.A. and A.G.; writing—review and editing, A.A. and A.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors would like to thank the anonymous referees for their careful reading of the manuscript and for their valuable comments. During the preparation of this manuscript, the authors used Haiku 4.6 (Anthropic) to assist with the visual preparation of the two panels of Figure 1; the closed-form expressions and the numerical values displayed there were derived and verified by the authors, who take full responsibility for the content of this publication. The authors are also grateful to the Editorial Office of Mathematics for their assistance throughout the production process.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Kuratowski, K. Topologie I; Monografje Matematyczne: Warsaw, Poland, 1933. [Google Scholar]
  2. Vaidyanathaswamy, R. The localisation theory in set-topology. Proc. Indian Acad. Sci. 1945, 20, 51–61. [Google Scholar] [CrossRef] [Scilit]
  3. Janković, D.; Hamlett, T.R. New topologies from old via ideals. Am. Math. Mon. 1990, 97, 295–310. [Google Scholar] [CrossRef] [Scilit]
  4. Cartan, H. Théorie des filtres. C. R. Acad. Sci. Paris 1937, 205, 595–598. [Google Scholar]
  5. Choquet, G. Sur les notions de filtre et de grille. C. R. Acad. Sci. Paris 1947, 224, 171–173. [Google Scholar]
  6. Roy, B.; Mukherjee, M.N. On a typical topology induced by a grill. Soochow J. Math. 2007, 33, 771–786. [Google Scholar]
  7. Al-Omari, A.; Noiri, T. On ΨG-sets in grill topological spaces. Filomat 2011, 25, 187–196. [Google Scholar] [CrossRef] [Scilit]
  8. Acharjee, S.; Özkoç, M.; Issaka, F.Y. Primal topological spaces. Bol. Soc. Parana. Mat. 2025, 43, 1–9. [Google Scholar] [CrossRef] [Scilit]
  9. Al-Omari, A.; Alqahtani, M.H. Primal structure with closure operators and their applications. Mathematics 2023, 11, 4946. [Google Scholar] [CrossRef] [Scilit]
  10. Alghamdi, O. On the compactness via primal topological spaces. AIMS Math. 2024, 9, 32124–32137. [Google Scholar] [CrossRef] [Scilit]
  11. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
  12. Chang, C.L. Fuzzy topological spaces. J. Math. Anal. Appl. 1968, 24, 182–190. [Google Scholar] [CrossRef] [Scilit]
  13. Lowen, R. Fuzzy topological spaces and fuzzy compactness. J. Math. Anal. Appl. 1976, 56, 621–633. [Google Scholar] [CrossRef] [Scilit]
  14. Molodtsov, D. Soft set theory—First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Scilit]
  15. Shabir, M.; Naz, M. On soft topological spaces. Comput. Math. Appl. 2011, 61, 1786–1799. [Google Scholar] [CrossRef] [Scilit]
  16. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef] [Scilit]
  17. El-Bably, M.K.; Fleifel, K.K.; Embaby, O.A. Topological approaches to rough approximations based on closure operators. Granul. Comput. 2022, 7, 1–14. [Google Scholar] [CrossRef] [Scilit]
  18. Lin, E.-B. Categorical structures in rough set theory and information systems. Mathematics 2026, 14, 369. [Google Scholar] [CrossRef] [Scilit]
  19. Zhan, J.; Alcantud, J.C.R. A novel type of soft rough covering and its application to multicriteria group decision making. Artif. Intell. Rev. 2019, 52, 2381–2410. [Google Scholar] [CrossRef] [Scilit]
  20. Al-shami, T.M.; Hosny, R.A.; Mhemdi, A.; Hosny, M. Cardinality rough neighborhoods with applications. AIMS Math. 2024, 9, 31366–31392. [Google Scholar] [CrossRef] [Scilit]
  21. Mareay, R.; Abu-Gdairi, R.; Badr, M. Soft rough fuzzy sets based on covering. AIMS Math. 2024, 9, 11180–11193. [Google Scholar] [CrossRef] [Scilit]
  22. Wang, R.; Xie, X.; Zhi, H. Bi-fuzzy S-approximation spaces. Mathematics 2025, 13, 324. [Google Scholar] [CrossRef] [Scilit]
  23. Swaminathan, A.; Sheela, M. Applications of fuzzy maximal μ-open sets in generalized fuzzy topology and fuzzy quasi topology. Bol. Soc. Parana. Mat. 2026, 44, 1–5. [Google Scholar]
  24. Abbas, F. Fuzzy ideal supra topological spaces. Adv. Fuzzy Syst. 2020, 2020, 8824296. [Google Scholar] [CrossRef] [Scilit]
  25. Açıkgöz, A. New fuzzy topologies via ideals and generalized openness. Mathematics 2026, 14, 904. [Google Scholar] [CrossRef] [Scilit]
  26. Dubois, D.; Prade, H. Rough fuzzy sets and fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef] [Scilit]
  27. Radzikowska, A.M.; Kerre, E.E. A comparative study of fuzzy rough sets. Fuzzy Sets Syst. 2002, 126, 137–155. [Google Scholar] [CrossRef] [Scilit]
  28. Yao, Y.Y. Constructive and algebraic methods of the theory of rough sets. Inf. Sci. 1998, 109, 21–47. [Google Scholar] [CrossRef] [Scilit]
  29. Chacón-Gómez, F.; Cornejo, M.E.; Medina, J. Decision making in fuzzy rough set theory. Mathematics 2023, 11, 4187. [Google Scholar] [CrossRef] [Scilit]
  30. Açıkgöz, A. Generalized open sets and closure operators via point-to-neighborhood assignments. Mathematics 2026, 14, 1013. [Google Scholar] [CrossRef] [Scilit]
  31. Morsi, N.N.; Yakout, M.M. Axiomatics for fuzzy rough sets. Fuzzy Sets Syst. 1998, 100, 327–342. [Google Scholar] [CrossRef] [Scilit]
  32. Wu, W.-Z.; Mi, J.-S.; Zhang, W.-X. Generalized fuzzy rough sets. Inf. Sci. 2003, 151, 263–282. [Google Scholar] [CrossRef] [Scilit]
  33. Qin, K.; Pei, Z. On the topological properties of fuzzy rough sets. Fuzzy Sets Syst. 2005, 151, 601–613. [Google Scholar] [CrossRef] [Scilit]
  34. Lai, H.; Zhang, D. Fuzzy preorder and fuzzy topology. Fuzzy Sets Syst. 2006, 157, 1865–1885. [Google Scholar] [CrossRef] [Scilit]
  35. D’eer, L.; Cornelis, C.; Godo, L. Fuzzy neighborhood operators based on fuzzy coverings. Fuzzy Sets Syst. 2017, 312, 17–35. [Google Scholar] [CrossRef] [Scilit]
  36. Azad, K.K. On fuzzy semicontinuity, fuzzy almost continuity and fuzzy weakly continuity. J. Math. Anal. Appl. 1981, 82, 14–32. [Google Scholar] [CrossRef] [Scilit]
  37. Bin Shahna, A.S. On fuzzy strong semicontinuity and fuzzy precontinuity. Fuzzy Sets Syst. 1991, 44, 303–308. [Google Scholar] [CrossRef] [Scilit]
  38. Thakur, S.S.; Singh, S. On fuzzy semi-preopen sets and fuzzy semi-precontinuity. Fuzzy Sets Syst. 1998, 98, 383–391. [Google Scholar] [CrossRef] [Scilit]
  39. Levine, N. Semi-open sets and semi-continuity in topological spaces. Am. Math. Mon. 1963, 70, 36–41. [Google Scholar] [CrossRef] [Scilit]
  40. Njåstad, O. On some classes of nearly open sets. Pac. J. Math. 1965, 15, 961–970. [Google Scholar] [CrossRef] [Scilit]
  41. Mashhour, A.S.; Ghanim, M.H.; Fath Alla, M.A. On fuzzy non-continuous mappings. Bull. Calcutta Math. Soc. 1986, 78, 57–69. [Google Scholar]
  42. Čech, E. Topological Spaces; Wiley: London, UK, 1966. [Google Scholar]
  43. Mashhour, A.S.; Ghanim, M.H. Fuzzy closure spaces. J. Math. Anal. Appl. 1985, 106, 154–170. [Google Scholar] [CrossRef] [Scilit]
  44. Andrijević, D. On b-open sets. Mat. Vesn. 1996, 48, 59–64. [Google Scholar]
  45. Benchalli, S.S.; Karnel, J.J. On fuzzy b-open sets in fuzzy topological spaces. J. Comput. Math. Sci. 2010, 1, 127–134. [Google Scholar] [CrossRef] [Scilit]
  46. Lindeberg, T. Scale-Space Theory in Computer Vision; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1994. [Google Scholar]
  47. Dubois, D.; Prade, H. Operations on fuzzy numbers. Int. J. Syst. Sci. 1978, 9, 613–626. [Google Scholar] [CrossRef] [Scilit]
  48. Saleh, S.; Al-shami, T.M.; Azzam, A.A.; Hosny, M. Stronger forms of fuzzy pre-separation and regularity axioms via fuzzy topology. Mathematics 2023, 11, 4801. [Google Scholar] [CrossRef] [Scilit]
  49. Qian, Y.; Liang, J.; Yao, Y.; Dang, C. MGRS: A multi-granulation rough set. Inf. Sci. 2010, 180, 949–970. [Google Scholar] [CrossRef] [Scilit]
  50. Bloch, I. On links between mathematical morphology and rough sets. Pattern Recognit. 2000, 33, 1487–1496. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.