Skip to Content
MathematicsMathematics
  • Article
  • Open Access

17 March 2026

13 Pages

Generalized Open Sets and Closure Operators via Point-to-Neighborhood Assignments

Department of Mathematics, Balikesir University, Cagis Campus, 10145 Balikesir, Turkey
This article belongs to the Section B: Geometry and Topology

Abstract

We equip a topological space ( X , τ ) with a function a : X → τ satisfying the single axiom x ∈ a ( x ) . The resulting triple ( X , τ , a ) , which we call an aura topological space, provides a point-to-open-set assignment that differs from all existing auxiliary structures in topology—ideals, filters, grills, primals, and the various non-classical frameworks based on fuzzy, soft, or neutrosophic sets. The aura-closure operator cl a ( A ) = { x ∈ X : a ( x ) ∩ A ≠ ⌀ } is shown to be an additive Čech closure operator; it satisfies extensivity, monotonicity, and finite additivity, but idempotency fails in general. Iterating cl a transfinitely yields a Kuratowski closure whose topology τ a ∞ satisfies τ a ∞ = τ a ⊆ τ , where τ a is the collection of all a -open sets. We introduce a -semi-open, a -pre-open, a - α -open, and a - β -open sets, determine the complete hierarchy among these classes and their classical counterparts, and separate all non-coinciding classes by counterexamples on finite spaces as well as on the real line. The notions of a -convergence of sequences and the corresponding continuity notions and their decompositions are studied. Separation axioms a - T i ( i   =   0 ,   1 ,   2 ) are introduced, and it is proved that a - T 1 and a - T 2 are equivalent. A detailed comparison with ideals, filters, grills, and primals highlights the distinctive features of the aura framework.

1. Introduction

Over the past several decades, a major trend in general topology has been to enrich topological spaces with additional set-theoretic or algebraic data. The ideal topological spaces ( X , τ , I ) , whose roots go back to Kuratowski [1] and Vaidyanathaswamy [2], were brought into the mainstream by Janković and Hamlett [3]. In this framework, an ideal I (a hereditary, finitely additive family containing ⌀) interacts with the topology through the local function A * ( I , τ ) and produces a finer topology τ * . A primal  P on ( X , τ ) is a dual notion to an ideal: P is a collection of subsets of X that is closed under supersets and satisfies X ∉ P ; it was introduced by Acharjee, Özkoç, and Issaka [4] and has since generated substantial activity on operators and compatibility [5,6], separation axioms [7], and compactness [8]. Dual notions also followed: Cartan’s filters [9], and Choquet’s grills [10] revived by Roy and Mukherjee [11].
Alongside these developments, topology has been blended with fuzzy sets (Zadeh [12], Chang [13]), soft sets (Molodtsov [14], Shabir and Naz [15]), neutrosophic sets (Smarandache [16], Salama and Alblowi [17]), and rough sets (Pawlak [18]). The soft topology framework, in particular, has undergone rapid development in recent works, with significant advances in compactness [19], primal soft topology [20], and continuity properties [21]. In a parallel direction, Császár’s generalized topology [22] and recent works on generalized open sets in various settings [23] have shown that weakening topological axioms can lead to rich and applicable theories. If one steps back and looks at the picture as a whole, the existing auxiliary structures can be grouped as follows: (i) subcollections of P ( X ) (ideals, filters, grills, primals); (ii) second topologies as in Kelly’s bitopological spaces [24]; (iii) membership-grade functions (fuzzy, intuitionistic fuzzy, neutrosophic); (iv) parametric families (soft sets); and (v) equivalence relations (Pawlak rough sets).
The starting point of the present work is the observation that none of these structures captures the idea of assigning to each point a single fixed open neighborhood. We propose exactly this: a function a : X → τ satisfying x ∈ a ( x ) for all x ∈ X . We call a a scope function and the triple ( X , τ , a ) an aura topological space. The name is meant to suggest that each point x carries a “scope of influence” a ( x ) around it. We stress that a is not a subcollection of P ( X ) , not a second topology, not a membership function, and not a relation; it is a point-to-open-set assignment.
We should note that neighborhood assignments ϕ : X → τ with x ∈ ϕ ( x ) already appear in the theory of D-spaces (van Douwen and Pfeffer [25]). There, however, such assignments serve as universally quantified variables—one says “for every neighborhood assignment ϕ …”—rather than as a fixed ingredient of the space. Our approach takes the opposite viewpoint: we fix a once and for all and then derive operators, open-set classes, continuity notions, and separation axioms from it.
The need for such a structure becomes apparent when one considers phenomena that existing frameworks cannot naturally model. In ideal or primal topological spaces, the auxiliary structure is a single subcollection of the power set P ( X ) ; it does not distinguish individual points. By contrast, a scope function assigns different open neighborhoods to different points, making it possible to model a variable-resolution observation: a sensor network where each node has a different detection range, or a diagnostic system where each patient has a different similarity scope. Moreover, the failure of idempotency of the aura-closure operator cl a —a feature absent in all classical auxiliary structures—gives rise to a natural transfinite iteration process that produces the equalities and inclusions τ a ∞ = τ a ⊆ τ , capturing different levels of “reachability” from the original topology. The comparison table in Section 7 provides a systematic comparison with ideals, filters, grills, and primals.
The paper is structured as follows. Section 2 recalls the necessary preliminaries. Section 3 introduces aura topological spaces and establishes the basic properties of cl a and int a ; in particular, cl a is shown to be an additive Čech closure operator whose iteration cl a ∞ is a Kuratowski closure, and the topology τ a of a -open sets is proved to satisfy τ a ∞ = τ a ⊆ τ . In Section 4, we define five generalized open-set classes and construct a complete implication diagram, using counterexamples on both finite spaces and the real line. Section 5 treats a -continuity, its decompositions, and a -convergence of sequences. Section 6 introduces a - T 0 , a - T 1 , and a - T 2 separation axioms, and establishes the equivalence of a - T 1 and a - T 2 . Section 7 provides a detailed comparison of the aura framework with existing auxiliary structures. Section 8 gathers concluding remarks and open problems.

2. Preliminaries

Throughout this paper, ( X , τ ) denotes a topological space. For a subset A of X, the closure of A in ( X , τ ) is denoted by cl ( A ) and the interior by int ( A ) . The complement of A is denoted by A c = X ∖ A . The power set of X is denoted by P ( X ) . For x ∈ X , we denote by τ ( x ) = { U ∈ τ : x ∈ U } the collection of all open neighborhoods of x.
Definition 1
([26]). A subset A of a topological space ( X , τ ) is called semi-open if A ⊆ cl ( int ( A ) ) . The complement of a semi-open set is called semi-closed. The collection of all semi-open sets is denoted by SO ( X , τ ) .
Definition 2
([27]). A subset A of a topological space ( X , τ ) is called pre-open if A ⊆ int ( cl ( A ) ) . The complement of a pre-open set is called pre-closed. The collection of all pre-open sets is denoted by PO ( X , τ ) .
Definition 3
([28]). A subset A of a topological space ( X , τ ) is called α -open if A ⊆ int ( cl ( int ( A ) ) ) . The collection of all α-open sets is denoted by α O ( X , τ ) .
Definition 4
([29]). A subset A of a topological space ( X , τ ) is called β -open (or semi-pre-open) if A ⊆ cl ( int ( cl ( A ) ) ) . The collection of all β-open sets is denoted by β O ( X , τ ) .
Definition 5
([30]). A function c : P ( X ) → P ( X ) is called a Čech closure operator if it satisfies the following conditions for all A , B ⊆ X :
(C1) 
c ( ⌀ ) = ⌀ ;
(C2) 
A ⊆ c ( A )  (extensivity);
(C3) 
A ⊆ B ⇒ c ( A ) ⊆ c ( B )  (monotonicity).
If c additionally satisfies
(C4) 
c ( A ∪ B ) = c ( A ) ∪ c ( B ) (finite additivity),
then c is called an additive Čech closure operator. If c further satisfies
(C5) 
c ( c ( A ) ) = c ( A )  (idempotency),
then c is a Kuratowski closure operator and generates a topology on X.

3. Aura Topological Spaces

In this section, we introduce the central concept of this paper and investigate the fundamental properties of the associated operators.
Definition 6.
Let ( X , τ ) be a topological space. A function a : X → τ is called a scope function (or aura function) on ( X , τ ) if it satisfies
x ∈ a ( x ) f o r e v e r y x ∈ X .
The triple ( X , τ , a ) is called an aura topological space (briefly, an a -space).
The scope function a selects, for each point x, a particular open neighborhood a ( x ) ∈ τ ( x ) . One may think of a ( x ) as the “scope” of x—the part of the space that x can directly interact with. Different choices of a on the same topological space ( X , τ ) yield different a -spaces with potentially different properties.
Example 1.
Let X = { a , b , c , d } and τ = { ⌀ , { a } , { b } , { a , b } , { a , b , c } , X } . Define a : X → τ by a ( a ) = { a } , a ( b ) = { a , b } , a ( c ) = { a , b , c } , a ( d ) = X . Then, ( X , τ , a ) is an a -space since x ∈ a ( x ) for each x ∈ X .
Example 2.
Let ( R , τ u ) be the real line with the usual topology. For a fixed ε > 0 , define a ε : R → τ u by a ε ( x ) = ( x − ε , x + ε ) for every x ∈ R . Then, ( R , τ u , a ε ) is an a -space. This can be interpreted as assigning each point a fixed “resolution window” of radius ε.
Example 3.
Let ( R , τ u ) be as above. Define a : R → τ u by
a ( x ) = x − 1 1 + x 2 , x + 1 1 + x 2
for every x ∈ R . Then, ( R , τ u , a ) is an a -space where the scope narrows as | x | → ∞ , modeling a variable-resolution observation.

3.1. The Aura-Closure Operator

Definition 7.
Let ( X , τ , a ) be an a -space. For A ⊆ X , the aura-closure of A is defined by
cl a ( A ) = { x ∈ X : a ( x ) ∩ A ≠ ⌀ } .
The aura-closure of A consists of all points whose aura intersects A; equivalently, x ∈ cl a ( A ) if and only if A meets a ( x ) . These points may be called the a -adherence points of A.
Theorem 1.
Let ( X , τ , a ) be an a -space. The operator cl a : P ( X ) → P ( X ) satisfies the following properties for all A , B ⊆ X :
(a)
cl a ( ⌀ ) = ⌀ .
(b)
A ⊆ cl a ( A ) .
(c)
A ⊆ B ⇒ cl a ( A ) ⊆ cl a ( B ) .
(d)
cl a ( A ∪ B ) = cl a ( A ) ∪ cl a ( B ) .
(e)
cl ( A ) ⊆ cl a ( A ) .
Hence, cl a is an additive Čech closure operator satisfying the first four Kuratowski axioms.
Proof. 
(a) Since a ( x ) ∩ ⌀ = ⌀ for every x ∈ X , we have cl a ( ⌀ ) = ⌀ .
(b) Let x ∈ A . By (1), x ∈ a ( x ) , so x ∈ a ( x ) ∩ A ≠ ⌀ . Thus x ∈ cl a ( A ) .
(c) Let A ⊆ B and x ∈ cl a ( A ) . Then a ( x ) ∩ A ≠ ⌀ , so there exists y ∈ a ( x ) ∩ A ⊆ a ( x ) ∩ B . Hence x ∈ cl a ( B ) .
(d) For any x ∈ X ,
x ∈ cl a ( A ∪ B ) ⟺ a ( x ) ∩ ( A ∪ B ) ≠ ⌀ ⟺ ( a ( x ) ∩ A ) ∪ ( a ( x ) ∩ B ) ≠ ⌀ ⟺ x ∈ cl a ( A ) or x ∈ cl a ( B ) ⟺ x ∈ cl a ( A ) ∪ cl a ( B ) .
(e) Let x ∈ cl ( A ) . Then, every open neighborhood of x intersects A. Since a ( x ) is an open neighborhood of x, we have a ( x ) ∩ A ≠ ⌀ , so x ∈ cl a ( A ) . □
Remark 1.
The operator cl a need not be idempotent, and this is its most fundamental distinction from classical closure operators. Precisely because cl a fails idempotency, it cannot be a Kuratowski closure operator in general, and the transfinite iteration introduced in Section 3.4 becomes necessary.
Theorem 2.
The operator cl a is not idempotent in general; that is, there exists an a -space ( X , τ , a ) and a subset A ⊆ X such that cl a ( cl a ( A ) ) ≠ cl a ( A ) .
Proof. 
Let X = { a , b , c } , τ = P ( X ) (discrete topology), and define a ( a ) = { a , b } , a ( b ) = { b , c } , a ( c ) = { c } . Let A = { c } . Then, cl a ( A ) = { b , c } , since a ( b ) ∩ { c } = { c } ≠ ⌀ and a ( c ) ∩ { c } = { c } ≠ ⌀ , but a ( a ) ∩ { c } = ⌀ . Now cl a ( cl a ( A ) ) = cl a ( { b , c } ) = X , since a ( a ) ∩ { b , c } = { b } ≠ ⌀ . Therefore, cl a ( A ) = { b , c } ≠ X = cl a ( cl a ( A ) ) . □
Theorem 3.
Let ( X , τ , a ) be an a -space and A ⊆ X . Then,
(a)
cl ( A ) ⊆ cl a ( A ) .
(b)
The inclusion can be strict.
(c)
cl a ( A ) ⊆ ⋃ x ∈ A a ( x ) need not hold in general.
Proof. 
Part (a) is Theorem 1(e). For part (b), consider X = { a , b , c } , τ = P ( X ) , a ( a ) = { a , b } , a ( b ) = { b } , a ( c ) = { c } , and A = { b } . Then, cl ( A ) = { b } (discrete topology) but cl a ( A ) = { a , b } , since a ( a ) ∩ { b } ≠ ⌀ . The inclusion is strict. For part (c), with the same space, ⋃ x ∈ A a ( x ) = a ( b ) = { b } , but cl a ( A ) = { a , b } ⊆ { b } . □

3.2. The Aura-Interior Operator

Definition 8.
Let ( X , τ , a ) be an a -space. For A ⊆ X , the aura-interior of A is defined by
int a ( A ) = { x ∈ A : a ( x ) ⊆ A } .
Theorem 4.
Let ( X , τ , a ) be an a -space. The operator int a : P ( X ) → P ( X ) satisfies the following for all A , B ⊆ X :
(a)
int a ( X ) = X .
(b)
int a ( ⌀ ) = ⌀ .
(c)
int a ( A ) ⊆ A .
(d)
A ⊆ B ⇒ int a ( A ) ⊆ int a ( B ) .
(e)
int a ( A ∩ B ) = int a ( A ) ∩ int a ( B ) .
(f)
int a ( A ) ⊆ int ( A ) .
(g)
int a ( A ) = A ∖ cl a ( A c ) .
Proof. 
(a) For every x ∈ X , a ( x ) ⊆ X , so x ∈ int a ( X ) .
(b) There is no x ∈ ⌀ , so int a ( ⌀ ) = ⌀ .
(c) By definition, int a ( A ) = { x ∈ A : a ( x ) ⊆ A } ⊆ A .
(d) Let x ∈ int a ( A ) . Then, x ∈ A ⊆ B and a ( x ) ⊆ A ⊆ B , so x ∈ int a ( B ) .
(e) Let x ∈ int a ( A ∩ B ) . Then x ∈ A ∩ B and a ( x ) ⊆ A ∩ B , so x ∈ int a ( A ) ∩ int a ( B ) . Conversely, if x ∈ int a ( A ) ∩ int a ( B ) , then x ∈ A ∩ B and a ( x ) ⊆ A ∩ B , giving x ∈ int a ( A ∩ B ) .
(f) Let x ∈ int a ( A ) . Then, x ∈ A and a ( x ) ⊆ A . Since a ( x ) is an open set containing x and contained in A, we have x ∈ int ( A ) .
(g) x ∈ int a ( A ) ⇔ x ∈ A and a ( x ) ⊆ A ⇔ x ∈ A and a ( x ) ∩ A c = ⌀ ⇔ x ∈ A and x ∉ cl a ( A c ) ⇔ x ∈ A ∖ cl a ( A c ) . □
Remark 2.
The inclusion int a ( A ) ⊆ int ( A ) in Theorem 4(f) can be strict. Note that Example 1 itself does not witness strictness for A = { a , b } : one has a ( a ) = { a } ⊆ { a , b } and a ( b ) = { a , b } ⊆ { a , b } , so int a ( { a , b } ) = { a , b } = int ( { a , b } ) . For strict inclusion, take X = { a , b } , τ = P ( X ) , a ( a ) = { a , b } , a ( b ) = { b } , and A = { a } . Then, int ( { a } ) = { a } but int a ( { a } ) = ⌀ since a ( a ) = { a , b } ⊈ { a } .

3.3. The Aura Topology

Definition 9.
Let ( X , τ , a ) be an a -space. A subset A of X is called a -open if for every x ∈ A , a ( x ) ⊆ A . Equivalently, A is a -open if and only if int a ( A ) = A . The collection of all a -open sets is denoted by τ a .
Theorem 5.
Let ( X , τ , a ) be an a -space. Then,
(a)
τ a is a topology on X.
(b)
τ a ⊆ τ .
Proof. 
(a) Topology axioms: ⌀ ∈ τ a vacuously; X ∈ τ a since a ( x ) ⊆ X for all x; finite intersections: if A , B ∈ τ a and x ∈ A ∩ B , then a ( x ) ⊆ A and a ( x ) ⊆ B , so a ( x ) ⊆ A ∩ B ; arbitrary unions: if x ∈ ⋃ i A i with A j ∈ τ a and x ∈ A j , then a ( x ) ⊆ A j ⊆ ⋃ i A i .
(b) Let A ∈ τ a . For every x ∈ A , a ( x ) ⊆ A and a ( x ) ∈ τ with x ∈ a ( x ) . Thus, A = ⋃ x ∈ A a ( x ) ∈ τ . □
Example 4.
In Example 1, the a -open sets are τ a = { ⌀ , { a } , { a , b } , { a , b , c } , X } . Note that { b } ∈ τ but { b } ∉ τ a , confirming τ a ⊊ τ in general.
Proposition 1.
Let ( X , τ , a ) be an a -space. Every a -open set is a union of members of B a = { a ( x ) : x ∈ X } ; that is, if A ∈ τ a , then A = ⋃ x ∈ A a ( x ) . In general, however, B a need not be a base for τ a .
Definition 10.
An a -space ( X , τ , a ) is called transitive if for every x ∈ X and every y ∈ a ( x ) , a ( y ) ⊆ a ( x ) .
Proposition 2.
If ( X , τ , a ) is a transitive a -space, then B a = { a ( x ) : x ∈ X } is a base for τ a , and the aura-closure cl a is idempotent.

3.4. Iterative Aura Closure

Since cl a is not idempotent in general, we define the iterative closure.
Definition 11.
Let ( X , τ , a ) be an a -space and A ⊆ X . Define
cl a 0 ( A ) = A ,
cl a n + 1 ( A ) = cl a cl a n ( A ) ( n ≥ 0 ) ,
cl a ∞ ( A ) = ⋃ n = 0 ∞ cl a n ( A ) .
Theorem 6.
Let ( X , τ , a ) be an a -space and A ⊆ X . Then,
(a)
A ⊆ cl a ( A ) ⊆ cl a 2 ( A ) ⊆ ⋯ ⊆ cl a ∞ ( A ) .
(b)
cl a ∞ is a Kuratowski closure operator.
(c)
The topology generated by cl a ∞ satisfies τ a ∞ = τ a ⊆ τ .
Proof. 
(a) By extensivity of cl a , cl a n ( A ) ⊆ cl a n + 1 ( A ) for every n ≥ 0 .
  (b) We verify the Kuratowski axioms for cl a ∞ :
  • cl a ∞ ( ⌀ ) = ⋃ n cl a n ( ⌀ ) = ⌀ .
  • A ⊆ cl a ∞ ( A ) : since A = cl a 0 ( A ) .
  • Additivity: cl a ∞ ( A ∪ B ) = ⋃ n cl a n ( A ∪ B ) = ⋃ n ( cl a n ( A ) ∪ cl a n ( B ) ) = cl a ∞ ( A ) ∪ cl a ∞ ( B ) .
  • Idempotency: Let x ∈ cl a ∞ ( cl a ∞ ( A ) ) . Then, x ∈ cl a m ( cl a ∞ ( A ) ) for some m. For m = 0 , x ∈ cl a ∞ ( A ) . For m = 1 , x ∈ cl a ( cl a ∞ ( A ) ) means a ( x ) ∩ cl a ∞ ( A ) ≠ ⌀ , so there exist y ∈ a ( x ) and k with y ∈ cl a k ( A ) . Then, x ∈ cl a ( cl a k ( A ) ) = cl a k + 1 ( A ) ⊆ cl a ∞ ( A ) . The general case follows by induction on m.
  (c) We show τ a ∞ = τ a . A set F ⊆ X is τ a ∞ -closed if and only if cl a ∞ ( F ) = F . Since F = cl a 0 ( F ) ⊆ cl a 1 ( F ) ⊆ ⋯ , the equality cl a ∞ ( F ) = ⋃ n cl a n ( F ) = F holds if and only if cl a 1 ( F ) = cl a ( F ) ⊆ F . Combined with F ⊆ cl a ( F ) (extensivity), this is equivalent to cl a ( F ) = F . Now, F is τ a -closed if and only if X ∖ F ∈ τ a ; that is, for every x ∈ X ∖ F , a ( x ) ⊆ X ∖ F , which means a ( x ) ∩ F = ⌀ for every x ∉ F , i.e., cl a ( F ) ⊆ F , equivalently cl a ( F ) = F . Therefore τ a ∞ -closed sets coincide with τ a -closed sets, so τ a ∞ = τ a . The inclusion τ a ⊆ τ follows from Theorem 5(b). □
Remark 3.
Theorem 6(c) reveals a notable rigidity of the aura framework: the Kuratowski closure cl a ∞ generates exactly the same topology as the non-idempotent Čech closure cl a . This means the transfinite iteration process does not produce a genuinely new topology; instead, the topology chain collapses to τ a ∞ = τ a ⊆ τ . The interesting topological data is therefore entirely captured by τ a and τ.
The iterative closure admits a pointwise companion, which will be used in Section 6. For x ∈ X , set a 0 ( x ) = { x } , a n + 1 ( x ) = ⋃ w ∈ a n ( x ) a ( w ) for n ≥ 0 , and a ∞ ( x ) = ⋃ n ≥ 0 a n ( x ) . Thus, y ∈ a ∞ ( x ) if and only if there are points x = z 0 , z 1 , … , z k = y with z i + 1 ∈ a ( z i ) for each i; that is, if and only if y is reachable from x along the scope function.
Lemma 1.
For every x ∈ X , the set a ∞ ( x ) is the smallest a -open set containing x.
Proof. 
If w ∈ a ∞ ( x ) , say w ∈ a n ( x ) , then a ( w ) ⊆ a n + 1 ( x ) ⊆ a ∞ ( x ) , so a ∞ ( x ) is a -open, and x ∈ a 0 ( x ) ⊆ a ∞ ( x ) . If U ∈ τ a with x ∈ U , then a 0 ( x ) ⊆ U ; and a n ( x ) ⊆ U implies a n + 1 ( x ) = ⋃ w ∈ a n ( x ) a ( w ) ⊆ U , since each w ∈ a n ( x ) then lies in U and U is a -open, so that a ( w ) ⊆ U . By induction, a ∞ ( x ) ⊆ U . □
Lemma 2.
For all x , y ∈ X , one has y ∈ a ∞ ( x ) if and only if x ∈ cl a ∞ ( { y } ) .
Proof. 
By Definition 7, x ∈ cl a ( A ) if and only if a ( x ) ∩ A ≠ ⌀ . Hence, x ∈ cl a m ( { y } ) if and only if there are x = w 0 , w 1 , … , w m = y with w i + 1 ∈ a ( w i ) , by induction on m, the statement being understood for all x at once with y fixed: the case m = 0 is the equality x = y , and x ∈ cl a m + 1 ( { y } ) means a ( x ) ∩ cl a m ( { y } ) ≠ ⌀ ; that is, some w 1 ∈ a ( x ) admits a chain of m edges from w 1 to y. Taking unions over m, the condition x ∈ cl a ∞ ( { y } ) says that y is reachable from x along a , which is the description of a ∞ ( x ) given above. □
Note 1.
If X is finite, then the chain cl a 0 ( A ) ⊆ cl a 1 ( A ) ⊆ ⋯ stabilizes in at most | X | steps, so cl a ∞ ( A ) = cl a | X | ( A ) .

3.5. Special Types of Aura Functions

Definition 12.
Let ( X , τ , a ) be an a -space. We say that a is:
(a)
trivial if a ( x ) = X for every x ∈ X ;
(b)
discrete if a ( x ) = { x } for every x ∈ X (possible only if τ is the discrete topology);
(c)
monotone (or transitive) if x ∈ a ( y ) implies a ( x ) ⊆ a ( y ) ;
(d)
symmetric if y ∈ a ( x ) implies x ∈ a ( y ) .
Proposition 3.
Let ( X , τ , a ) be an a -space.
(a)
If a is trivial, then cl a ( A ) = X for every nonempty A, and τ a = { ⌀ , X } .
(b)
If a is discrete, then cl a ( A ) = A for every A, and τ a = P ( X ) .
(c)
If a is symmetric, then x ∈ cl a ( { y } ) if and only if y ∈ cl a ( { x } ) .

4. Generalized Open Sets in Aura Spaces

In this section, we introduce five new classes of generalized open sets by combining the aura-closure operator cl a with the classical interior and closure operators. These generalize the classical notions of semi-open [26], pre-open [27], α -open [28], β -open [29], and b-open [31] sets to the aura setting.
Definition 13.
Let ( X , τ , a ) be an a -space. A subset A of X is called:
(a)
a -semi-open if A ⊆ cl a ( int ( A ) ) ;
(b)
a -pre-open if A ⊆ int ( cl a ( A ) ) ;
(c)
a - α -open if A ⊆ int ( cl a ( int ( A ) ) ) ;
(d)
a - β -open if A ⊆ cl a ( int ( cl a ( A ) ) ) ;
(e)
a -b-open if A ⊆ cl a ( int ( A ) ) ∪ int ( cl a ( A ) ) .
The collection of all a -semi-open (resp. a -pre-open, a -α-open, a -β-open, a -b-open) sets is denoted by a SO ( X ) (resp. a PO ( X ) , a α O ( X ) , a β O ( X ) , a b O ( X ) ).
Theorem 7
(Implication hierarchy). Let ( X , τ , a ) be an a -space. The following inclusions hold:
τ ⊆ a α O ( X ) ⇒ a SO ( X ) a PO ( X ) ⊆ a b O ( X ) ⊆ a β O ( X ) ,
where A → B means every A-type set is also a B-type set. Moreover, each implication is strict in general.
Proof. 
τ ⊆ a α O ( X ) : Let A ∈ τ . Then, int ( A ) = A , so cl a ( int ( A ) ) = cl a ( A ) ⊇ cl ( A ) ⊇ A . Hence, int ( cl a ( int ( A ) ) ) ⊇ A .
a α O ( X ) ⊆ a SO ( X ) : If A ⊆ int ( cl a ( int ( A ) ) ) , then A ⊆ int ( cl a ( int ( A ) ) ) ⊆ cl a ( int ( A ) ) .
a α O ( X ) ⊆ a PO ( X ) : Since int ( A ) ⊆ A gives cl a ( int ( A ) ) ⊆ cl a ( A ) , we get A ⊆ int ( cl a ( int ( A ) ) ) ⊆ int ( cl a ( A ) ) .
a SO ( X ) ⊆ a b O ( X ) : A ⊆ cl a ( int ( A ) ) ⊆ cl a ( int ( A ) ) ∪ int ( cl a ( A ) ) .
a PO ( X ) ⊆ a b O ( X ) : Similarly.
a b O ( X ) ⊆ a β O ( X ) : Note int ( A ) ⊆ int ( cl a ( A ) ) , so cl a ( int ( A ) ) ⊆ cl a ( int ( cl a ( A ) ) ) . Also, int ( cl a ( A ) ) ⊆ cl a ( int ( cl a ( A ) ) ) by extensivity. Hence, A ⊆ cl a ( int ( cl a ( A ) ) ) . □
Theorem 8.
Let ( X , τ , a ) be an a -space. Since cl ( A ) ⊆ cl a ( A ) for all A ⊆ X , we have:
(a)
SO ( X , τ ) ⊆ a SO ( X ) ;
(b)
PO ( X , τ ) ⊆ a PO ( X ) ;
(c)
α O ( X , τ ) ⊆ a α O ( X ) ;
(d)
β O ( X , τ ) ⊆ a β O ( X ) .
Each inclusion can be strict.
Proof. 
Since cl ( A ) ⊆ cl a ( A ) , we have cl a ( int ( A ) ) ⊇ cl ( int ( A ) ) . If A ∈ SO ( X , τ ) , then A ⊆ cl ( int ( A ) ) ⊆ cl a ( int ( A ) ) , so A ∈ a SO ( X ) . The other parts follow similarly. □
We now provide counterexamples demonstrating that each inclusion in the hierarchy is strict.
Example 5
(Classical semi-open ⊊ a -semi-open). Consider ( R , τ u , a 2 ) with a 2 ( x ) = ( x − 2 , x + 2 ) . Let A = { 0 } ∪ ( 1 , 2 ) . Then, int ( A ) = ( 1 , 2 ) and cl ( ( 1 , 2 ) ) = [ 1 , 2 ] . Since 0 ∉ [ 1 , 2 ] , the set A is not classically semi-open. On the other hand, cl a ( ( 1 , 2 ) ) = { x ∈ R : ( x − 2 , x + 2 ) ∩ ( 1 , 2 ) ≠ ⌀ } = ( − 1 , 4 ) . Since A ⊆ ( − 1 , 4 ) , the set A is a 2 -semi-open.
Example 6
( a -semi-open ⇏ a -pre-open). Let X = { a , b , c , d } , τ = { ⌀ , { a } , { c } , { a , c } , { a , b , c } , X } , and a ( a ) = { a } , a ( b ) = { a , b , c } , a ( c ) = { c } , a ( d ) = X . Let A = { a , b } . Then, int ( A ) = { a } and cl a ( { a } ) = { a , b , d } . Since A ⊆ { a , b , d } , the set A is a -semi-open. However, cl a ( A ) = { a , b , d } and int ( { a , b , d } ) = { a } . Since b ∈ A but b ∉ { a } , we have A ⊆ int ( cl a ( A ) ) , so A is not a -pre-open.
Example 7
( a -pre-open ⇏ a -semi-open). Let X = { a , b , c , d } , τ = { ⌀ , { a , b } , { c , d } , X } , and a ( a ) = { a , b } , a ( b ) = { a , b } , a ( c ) = { c , d } , a ( d ) = X . Let A = { a , c } . Since A contains no nonempty open set, int ( A ) = ⌀ , hence cl a ( int ( A ) ) = ⌀ and A is not a -semi-open. On the other hand, cl a ( A ) = X (every aura meets { a , c } ), so int ( cl a ( A ) ) = X ⊇ A , and A is a -pre-open.
Example 8
( a -semi-open ⇏ a - α -open). In Example 6, A = { a , b } is a -semi-open. However, int ( cl a ( int ( A ) ) ) = int ( cl a ( { a } ) ) = int ( { a , b , d } ) = { a } , and A = { a , b } ⊆ { a } , so A is not a -α-open.
Example 9
(Real-line illustrations). Consider ( R , τ u , a 2 ) with a 2 ( x ) = ( x − 2 , x + 2 ) .
(i)
A = { 0 } ∪ ( 1 , 2 ) is a 2 -semi-open but not classically semi-open (Example 5).
(ii)
B = { 0 } ∪ ( 3 , 4 ) : cl a ( B ) = ( − 2 , 2 ) ∪ ( 1 , 6 ) = ( − 2 , 6 ) and int ( cl a ( B ) ) = ( − 2 , 6 ) ⊇ B , so B is a 2 -pre-open. But cl a ( int ( B ) ) = cl a ( ( 3 , 4 ) ) = ( 1 , 6 ) and 0 < 1 , so B ⊆ ( 1 , 6 ) ; hence, B is not a 2 -semi-open.
(iii)
C = [ 0 , 1 ] : int ( C ) = ( 0 , 1 ) and cl a ( ( 0 , 1 ) ) = ( − 2 , 3 ) ⊇ C . Moreover, int ( cl a ( int ( C ) ) ) = ( − 2 , 3 ) ⊇ C , so C is a 2 -α-open.

5. Aura-Continuity, Decomposition, and Convergence

The classical decomposition of continuity via semi-continuity and pre-continuity has been a central theme since the works of Levine [26], Mashhour et al. [27,32], and Reilly–Vamanamurthy [33]. In this section, we develop the aura-versions of these continuity notions, establish analogous decomposition results, and introduce the notion of a -convergence of sequences.
Definition 14.
Let ( X , τ 1 , a 1 ) and ( Y , τ 2 , a 2 ) be a -spaces. A function f : X → Y is called:
(a)
a -continuous if f − 1 ( V ) ∈ τ a 1 for every V ∈ τ a 2 ;
(b)
a -semi-continuous if f − 1 ( V ) ∈ a 1 SO ( X ) for every V ∈ τ 2 ;
(c)
a -pre-continuous if f − 1 ( V ) ∈ a 1 PO ( X ) for every V ∈ τ 2 ;
(d)
a - α -continuous if f − 1 ( V ) ∈ a 1 α O ( X ) for every V ∈ τ 2 ;
(e)
a - β -continuous if f − 1 ( V ) ∈ a 1 β O ( X ) for every V ∈ τ 2 .
Theorem 9.
The following implications hold for any function f : ( X , τ 1 , a 1 ) → ( Y , τ 2 , a 2 ) :
continuous ⇒ a - α - continuous ⇒ a - semi - continuous a - pre - continuous ⇒ a - β - continuous .
Proof. 
These follow directly from Theorem 7. □
Theorem 10
(Composition). Let ( X , τ 1 , a 1 ) , ( Y , τ 2 , a 2 ) , and ( Z , τ 3 , a 3 ) be a -spaces.
(a)
If f : X → Y and g : Y → Z are both a -continuous, then g ∘ f : X → Z is a -continuous.
(b)
If f : X → Y is a -semi-continuous and g : Y → Z is continuous, then g ∘ f is a -semi-continuous.
Proof. 
(a) Let W ∈ τ a 3 . Since g is a -continuous, g − 1 ( W ) ∈ τ a 2 . Since f is a -continuous, f − 1 ( g − 1 ( W ) ) = ( g ∘ f ) − 1 ( W ) ∈ τ a 1 .
(b) Let W ∈ τ 3 . Since g is continuous, g − 1 ( W ) ∈ τ 2 . Since f is a -semi-continuous, ( g ∘ f ) − 1 ( W ) = f − 1 ( g − 1 ( W ) ) ∈ a 1 SO ( X ) . □
Theorem 11
(Decomposition of a - α -continuity). Let f : ( X , τ 1 , a 1 ) → ( Y , τ 2 , a 2 ) be a function.
(a)
If f is a -α-continuous, then f is both a -semi-continuous and a -pre-continuous.
(b)
The converse of (a) holds when a 1 is transitive.
Proof. 
Part (a) follows from a α O ( X ) ⊆ a SO ( X ) ∩ a PO ( X ) . For part (b), suppose a 1 is transitive (so cl a 1 is idempotent). Let V ∈ τ 2 and A = f − 1 ( V ) . From a 1 -semi-continuity, A ⊆ cl a 1 ( int ( A ) ) . From a 1 -pre-continuity, A ⊆ int ( cl a 1 ( A ) ) . By idempotency, cl a 1 ( A ) ⊆ cl a 1 ( cl a 1 ( int ( A ) ) ) = cl a 1 ( int ( A ) ) . Taking interiors, int ( cl a 1 ( A ) ) ⊆ int ( cl a 1 ( int ( A ) ) ) . Combined with A ⊆ int ( cl a 1 ( A ) ) , we get A ⊆ int ( cl a 1 ( int ( A ) ) ) , so A ∈ a 1 α O ( X ) . □
Theorem 12
(Characterization of a -semi-continuity). Let f : ( X , τ 1 , a 1 ) → ( Y , τ 2 ) be a function. The following are equivalent:
(a)
f is a 1 -semi-continuous.
(b)
For every closed set F in Y, f − 1 ( F ) is a 1 -semi-closed.
(c)
For every x ∈ X and every open set V in Y containing f ( x ) , there exists an a 1 -semi-open set U containing x such that f ( U ) ⊆ V .

Aura-Convergence of Sequences

Definition 15.
Let ( X , τ , a ) be an a -space. A sequence ( x n ) in X is said to a -converge to a point x ∈ X , written x n → a x , if for every U ∈ τ a with x ∈ U , there exists N ∈ N such that x n ∈ U for all n ≥ N .
Theorem 13.
Let ( X , τ , a ) be an a -space and ( x n ) a sequence in X.
(a)
If x n → x in ( X , τ ) , then x n → a x .
(b)
The converse of (a) need not hold.
(c)
In an a - T 2 space (equivalently, an a - T 1 space; see Theorem 17), a -limits are unique.
Proof. 
(a) Since τ a ⊆ τ , every a -open neighborhood of x is also a τ -open neighborhood. If x n → x in τ , then eventually x n is in every τ -neighborhood of x, and hence in every τ a -neighborhood.
(b) Let X = { a , b } , τ = P ( X ) (discrete), and a ( a ) = a ( b ) = X . Then, τ a = { ⌀ , X } . The constant sequence x n = a does not converge to b in τ , but τ a has only X as a neighborhood of b, so x n → a b . Hence, a -convergence need not imply τ -convergence, and limits need not be unique in non- T 0 spaces.
(c) Suppose x n → a x and x n → a y with x ≠ y . Since the space is a - T 2 , there exist disjoint a -open sets U ∋ x and V ∋ y . By a -convergence, there exists N 1 such that x n ∈ U for n ≥ N 1 , and N 2 such that x n ∈ V for n ≥ N 2 . For n ≥ max { N 1 , N 2 } , x n ∈ U ∩ V = ⌀ , a contradiction. □
Example 10.
In ( R , τ u , a ε ) with a ε ( x ) = ( x − ε , x + ε ) , any two reals are joined by a chain of steps shorter than ε, so a ε ∞ ( x ) = R for every x and, by Lemma 1, τ a = { ⌀ , R } ; consequently, every sequence a ε -converges to every real number. A fixed resolution ε makes convergence genuinely coarser without destroying it once reachability no longer connects the whole line. Fix ε > 0 , let B k = [ k ε , ( k + 1 ) ε ) for k ∈ Z , and let τ ε be the collection of all unions of blocks B k , a topology on R . Let b ( x ) = B k be the block containing x. Then, b ( x ) ∈ τ ε and x ∈ b ( x ) , so b is a scope function on ( R , τ ε ) , and b is transitive because y ∈ b ( x ) implies b ( y ) = b ( x ) . Consequently, each block is b -open, and since every b -open set is the union of the blocks b ( x ) over its points, τ b = τ ε . A sequence b -converges to x if and only if it lies in the block of x from some index on. Thus, x n = 1 / n lies in B 0 = [ 0 , ε ) from some index on, so x n → b 0 , and indeed x n → b z for every z ∈ B 0 ; limits are not unique, since the space is not b - T 0 . The sequence y n = ( − 1 ) n does not b -converge: the blocks are aligned at the boundary 0, so − 1 and 1 lie in different blocks for every ε > 0 , and no single block contains y n from some index on.

6. Aura-Separation Axioms

Definition 16.
An a -space ( X , τ , a ) is called:
(a)
a - T 0 if for every pair of distinct points x , y ∈ X , there exists an a -open set U ∈ τ a such that either x ∈ U , y ∉ U or y ∈ U , x ∉ U .
(b)
a - T 1 if for every pair of distinct points x , y ∈ X , there exist a -open sets U , V ∈ τ a such that x ∈ U , y ∉ U and y ∈ V , x ∉ V .
(c)
a - T 2 (or a -Hausdorff) if for every pair of distinct points x , y ∈ X , there exist disjoint a -open sets U , V ∈ τ a such that x ∈ U and y ∈ V .
Theorem 14.
For any a -space, a - T 2 ⇒ a - T 1 ⇒ a - T 0 . Moreover, T 2 for ( X , τ ) does not imply a - T 2 for ( X , τ , a ) since τ a ⊆ τ and a coarser topology may fail to separate points.
Example 11.
Let X = { a , b , c } , τ = P ( X ) (discrete, hence T 2 ). Define a ( a ) = a ( b ) = a ( c ) = X . Then, τ a = { ⌀ , X } , which cannot separate any two points. Hence, ( X , τ , a ) is not a - T 0 .
Theorem 15.
An a -space ( X , τ , a ) is a - T 1 if and only if for every x ∈ X , { x } is a -closed (i.e., X ∖ { x } ∈ τ a ).
Proof. 
( ⇒ ) : Let y ≠ x . By a - T 1 , there exists U y ∈ τ a with y ∈ U y and x ∉ U y . Then, X ∖ { x } = ⋃ y ≠ x U y ∈ τ a .
( ⇐ ) : Let x ≠ y . Then X ∖ { y } ∈ τ a contains x but not y, and X ∖ { x } ∈ τ a contains y but not x. □
Theorem 16.
Let ( X , τ , a ) be an a -space. The following are equivalent:
(a)
( X , τ , a ) is a - T 0 ;
(b)
for every pair of distinct points x , y ∈ X , at least one of x ∉ cl a ∞ ( { y } ) or y ∉ cl a ∞ ( { x } ) holds;
(c)
cl a ∞ ( { x } ) ≠ cl a ∞ ( { y } ) for every pair of distinct points x , y ∈ X .
Proof. 
( a ) ⇒ ( b ) : Let x ≠ y and let U ∈ τ a contain exactly one of them, say x ∈ U and y ∉ U . By Lemma 1, a ∞ ( x ) ⊆ U , so y ∉ a ∞ ( x ) , and Lemma 2 gives x ∉ cl a ∞ ( { y } ) .
( b ) ⇒ ( a ) : Let x ≠ y and suppose y ∉ cl a ∞ ( { x } ) ; by Lemma 2, this means x ∉ a ∞ ( y ) . By Lemma 1, the set a ∞ ( y ) is a -open, it contains y, and it does not contain x. The other case is symmetric.
( b ) ⇔ ( c ) : By Theorem 6(b),(c), cl a ∞ is a Kuratowski closure operator whose topology is τ a , so cl a ∞ ( { x } ) is the τ a -closure of { x } . If cl a ∞ ( { x } ) = cl a ∞ ( { y } ) with x ≠ y , then x ∈ cl a ∞ ( { x } ) = cl a ∞ ( { y } ) and likewise y ∈ cl a ∞ ( { x } ) , so (b) fails. Conversely, if x ∈ cl a ∞ ( { y } ) and y ∈ cl a ∞ ( { x } ) , then cl a ∞ ( { x } ) ⊆ cl a ∞ ( cl a ∞ ( { y } ) ) = cl a ∞ ( { y } ) and symmetrically, so the two closures coincide. □
Part (c) is the exact analogue of the classical characterization of the T 0 axiom – distinct points have distinct closures – now for the closure operator cl a ∞ . Moreover, since a ( x ) ⊆ a ∞ ( x ) for every x, condition (b) implies, by Lemma 2, that for distinct x , y at least one of y ∉ a ( x ) or x ∉ a ( y ) holds. Under the transitivity hypothesis of Definition 10, this pairwise condition characterizes a - T 0 :
Corollary 1.
Let ( X , τ , a ) be a transitive a -space. Then, ( X , τ , a ) is a - T 0 if and only if, for every pair of distinct points x , y ∈ X , at least one of y ∉ a ( x ) or x ∉ a ( y ) holds.
Proof. 
Transitivity gives a 2 ( x ) = ⋃ w ∈ a ( x ) a ( w ) ⊆ a ( x ) , while a ( x ) ⊆ a 2 ( x ) because w ∈ a ( w ) for w ∈ a ( x ) . Hence, a n ( x ) = a ( x ) for every n ≥ 1 , and a 0 ( x ) = { x } ⊆ a ( x ) , so a ∞ ( x ) = a ( x ) for every x. By Lemma 2, the condition of Theorem 16(b) becomes the condition of the statement. Equivalently, by Proposition 2, the operator cl a is idempotent in the transitive case, so cl a ∞ = cl a . □
The transitivity hypothesis in Corollary 1 cannot be omitted: on X = { 0 , 1 , 2 } with τ = P ( X ) and a ( 0 ) = { 0 , 1 } , a ( 1 ) = { 1 , 2 } , a ( 2 ) = { 2 , 0 } , the pairwise condition holds for every pair of distinct points, yet any nonempty a -open set containing one point contains all three, so τ a = { ⌀ , X } and the space is not a - T 0 .
Example 12
(Granular separation on R ). Let ( R , τ ε , b ) be the block space of Example 10. For distinct x , y ∈ R , the blocks b ( x ) and b ( y ) are either equal or disjoint. If they are disjoint, they are themselves disjoint b -open sets containing x and y, respectively; if they are equal, then every b -open set containing one of the two points contains the other, so x and y are not separated even in the sense of b - T 0 . Since two points of one block are at distance less than ε, every pair with | x − y | ≥ ε is separated – separation depends on the block partition determined by ε, which is the intended “granularity”. In ( R , τ u , a ε ) itself, no two points are separated by a -open sets, whatever their distance, since τ a = { ⌀ , R } by Example 10; there, granularity is carried by the scope sets alone: a ε ( x ) ∩ a ε ( y ) = ⌀ if and only if | x − y | ≥ 2 ε .
Theorem 17.
In an a -space ( X , τ , a ) , the axioms a - T 1 and a - T 2 are equivalent. More precisely, the following are equivalent:
(a)
( X , τ , a ) is a - T 2 .
(b)
( X , τ , a ) is a - T 1 .
(c)
a ( x ) = { x } for every x ∈ X .
(d)
τ a = P ( X ) (the discrete topology).
This equivalence contrasts sharply with classical topology, where T 1 ⇒ T 2 in general.
Proof. 
( a ) ⇒ ( b ) : Immediate from Definition 16.
( b ) ⇒ ( c ) : By Theorem 15, a - T 1 implies X ∖ { y } ∈ τ a for every y ∈ X . For any z ≠ y , since X ∖ { y } is a -open and z ∈ X ∖ { y } , we have a ( z ) ⊆ X ∖ { y } . In particular, y ∉ a ( z ) for all z ≠ y . Since z ∈ a ( z ) by (1), we conclude a ( z ) = { z } for every z ∈ X .
( c ) ⇒ ( d ) : If a ( x ) = { x } , then A ∈ τ a iff { x } ⊆ A for every x ∈ A , which is trivially true. Hence, τ a = P ( X ) .
( d ) ⇒ ( a ) : If τ a = P ( X ) , then for any distinct x , y , the sets { x } and { y } are disjoint a -open sets separating x and y. □
Remark 4.
The equivalence a - T 1 ⇔ a - T 2 reflects the special nature of the aura framework. In classical topology, the Sierpiński space is T 0 but not T 1 , and R / Q is T 1 but not T 2 . In the aura setting, however, any a - T 1 space forces every scope function to collapse to a singleton, immediately yielding the discrete a -topology and hence a - T 2 .
Definition 17.
An a -space ( X , τ , a ) is called a -regular if for every a -closed set F and every point x ∉ F , there exist disjoint a -open sets U , V such that x ∈ U and F ⊆ V .
Proposition 4.
If a is discrete (i.e., a ( x ) = { x } for all x), then ( X , τ , a ) is a - T 2 and a -regular.

7. Comparison with Existing Auxiliary Structures

In this section, we compare the aura framework systematically with the main auxiliary structures that have been used to enrich topological spaces.

7.1. Structural Comparison

Table 1 summarizes the key differences.
Table 1. Comparison of auxiliary structures in topology.
The most fundamental distinction is directional: ideals, grills, and primals all produce topologies that are finer than τ , while the aura topology τ a is coarser. This has profound consequences: in the aura setting, there are fewer open sets available for covers (making a -compactness easier to achieve) and fewer ways to separate points (making a -separation harder), which is the exact opposite of what happens with ideals.

7.2. Operator-Level Comparison

Theorem 18.
Let ( X , τ , I ) be an ideal topological space with local function A * = { x ∈ X : U ∩ A ∉ I for all U ∈ τ ( x ) } , and let ( X , τ , a ) be an a -space. Then,
(a)
The ideal closure cl * ( A ) = A ∪ A * satisfies cl * ( A ) ⊆ cl ( A ) ⊆ cl a ( A ) in general.
(b)
The reverse inclusion cl a ( A ) ⊆ cl * ( A ) does not hold universally.
Proof. 
(a) The inclusion cl * ( A ) ⊆ cl ( A ) is well-known: A * ⊆ cl ( A ) since x ∈ A * implies every open neighborhood of x meets A. The inclusion cl ( A ) ⊆ cl a ( A ) is Theorem 1(e).
(b) Take X = { a , b , c } , τ = P ( X ) , I = P ( X ) (improper ideal), a ( a ) = { a , b } , a ( b ) = { b } , a ( c ) = { c } , and A = { b } . Then, A * = ⌀ , so cl * ( A ) = { b } . But cl a ( A ) = { a , b } since a ( a ) ∩ { b } ≠ ⌀ . Hence, cl a ( A ) ⊆ cl * ( A ) . □

8. Conclusions

We have introduced a new auxiliary structure for topological spaces: the scope function a : X → τ with x ∈ a ( x ) , and the resulting aura topological space ( X , τ , a ) . This simple axiom—a point-to-open-set assignment—proved to be surprisingly productive.
On the operator side, the aura-closure cl a is an additive Čech closure operator whose failure of idempotency leads naturally to the transfinite iteration cl a ∞ . We proved that cl a ∞ generates exactly the same topology as cl a , yielding the clean equalities τ a ∞ = τ a ⊆ τ . This rigidity—the collapse of the topology chain to τ a —has no analogue in the ideal, grill, or primal frameworks.
On the open-set side, combining cl a with the standard interior produces five generalized open-set classes whose hierarchy we determined completely and separated non-coinciding classes by explicit examples. The corresponding continuity notions admit decomposition theorems extending the classical results of Levine and Mashhour. The notion of a -convergence of sequences was introduced, and its relation to classical convergence was established.
On the separation side, we proved that the axioms a - T 1 and a - T 2 are equivalent in any a -space—a sharp contrast with classical topology where these axioms are genuinely distinct.
Several directions remain for future work. In a companion paper [34], we investigate compactness and connectedness in aura spaces, including a Tychonoff-type theorem for transitive aura spaces and product/subspace constructions. Combining the aura function with an ideal opens the way to a hybrid local function and a topology interpolating between τ a and τ * . On the applied side, connections with rough set theory, digital topology, and information systems appear promising.

Funding

This research received no external funding.

Data Availability Statement

No data were used for the research described in the article. Data sharing is not applicable to this article.

Acknowledgments

The author of the article is grateful to Salah M. Elsayed (Department of Mathematics, Faculty of Science, Aswan University, Aswan, Egypt), whose careful reading of the original publication led to the present updates; the example and the observation on transitivity are his.

Conflicts of Interest

The author declares 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.S.; Hamlett, T.R. New topologies from old via ideals. Am. Math. Mon. 1990, 97, 295–310. [Google Scholar] [CrossRef] [Scilit]
  4. Acharjee, S.; Özkoç, M.; Issaka, F.Y. Primal topological spaces. Bol. Soc. Parana. Mat. 2025, 43, 1–9. [Google Scholar] [CrossRef] [Scilit]
  5. Alghamdi, O.; Al-Omari, A.; Alqahtani, M.H. Novel operators in the frame of primal topological spaces. AIMS Math. 2024, 9, 25792–25808. [Google Scholar] [CrossRef] [Scilit]
  6. Al-Omari, A.; Alqahtani, M.H. Primal structure with closure operators and their applications. Mathematics 2023, 11, 4946. [Google Scholar] [CrossRef] [Scilit]
  7. Al-Omari, A.; Alghamdi, O. Regularity and normality on primal spaces. AIMS Math. 2024, 9, 7662–7672. [Google Scholar] [CrossRef] [Scilit]
  8. Alghamdi, O. On the compactness via primal topological spaces. AIMS Math. 2024, 9, 32124–32137. [Google Scholar] [CrossRef] [Scilit]
  9. Cartan, H. Théorie des filtres. C. R. l’Acad. Sci. 1937, 205, 595–598. [Google Scholar]
  10. Choquet, G. Sur les notions de filtre et de grille. C. R. l’Acad. Sci. 1947, 224, 171–173. [Google Scholar]
  11. Roy, B.; Mukherjee, M.N. On a typical topology induced by a grill. Soochow J. Math. 2007, 33, 771–786. [Google Scholar]
  12. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
  13. Chang, C.L. Fuzzy topological spaces. J. Math. Anal. Appl. 1968, 24, 182–190. [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. Smarandache, F. A Unifying Field in Logics: Neutrosophic Logic; American Research Press: Rehoboth, DE, USA, 1998. [Google Scholar]
  17. Salama, A.A.; Alblowi, S.A. Neutrosophic set and neutrosophic topological spaces. IOSR J. Math. 2012, 3, 31–35. [Google Scholar] [CrossRef] [Scilit]
  18. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef] [Scilit]
  19. Al-shami, T.M. Compactness on soft topological ordered spaces and its application on the information system. J. Math. 2021, 2021, 6699092. [Google Scholar] [CrossRef] [Scilit]
  20. Al-shami, T.M.; Ameen, Z.A.; Abu-Gdairi, R.; Mhemdi, A. On primal soft topology. Mathematics 2023, 11, 2329. [Google Scholar] [CrossRef] [Scilit]
  21. Al-shami, T.M.; Arar, M.; Abu-Gdairi, R.; Ameen, Z.A. Further properties of soft somewhere dense continuous functions and soft Baire spaces. J. Math. Comput. Sci. 2024, 32, 54–63. [Google Scholar]
  22. Császár, Á. Generalized topology, generalized continuity. Acta Math. Hung. 2002, 96, 351–357. [Google Scholar] [CrossRef] [Scilit]
  23. Al-Saadi, H.; Al-Malki, H. Categories of open sets in generalized primal topological spaces. Mathematics 2024, 12, 207. [Google Scholar] [CrossRef] [Scilit]
  24. Kelly, J.C. Bitopological spaces. Proc. Lond. Math. Soc. 1963, 13, 71–89. [Google Scholar] [CrossRef] [Scilit]
  25. van Douwen, E.K.; Pfeffer, W.F. Some properties of the Sorgenfrey line and related spaces. Pac. J. Math. 1979, 81, 371–377. [Google Scholar] [CrossRef] [Scilit]
  26. Levine, N. Semi-open sets and semi-continuity in topological spaces. Am. Math. Mon. 1963, 70, 36–41. [Google Scholar] [CrossRef] [Scilit]
  27. Mashhour, A.S.; El-Monsef, M.E.A.; El-Deeb, S.N. On precontinuous and weak precontinuous mappings. Proc. Math. Phys. Soc. Egypt 1982, 53, 47–53. [Google Scholar]
  28. Njåstad, O. On some classes of nearly open sets. Pac. J. Math. 1965, 15, 961–970. [Google Scholar] [CrossRef] [Scilit]
  29. Abd El-Monsef, M.E.; El-Deeb, S.N.; Mahmoud, R.A. β-open sets and β-continuous mappings. Bull. Fac. Sci. Assiut Univ. 1983, 12, 77–90. [Google Scholar]
  30. Čech, E. Topological Spaces; Wiley: London, UK, 1966. [Google Scholar]
  31. Andrijević, D. On b-open sets. Mat. Vesn. 1996, 48, 59–64. [Google Scholar]
  32. Mashhour, A.S.; Hasanein, I.A.; El-Deeb, S.N. α-continuous and α-open mappings. Acta Math. Hung. 1983, 41, 213–218. [Google Scholar] [CrossRef] [Scilit]
  33. Reilly, I.L.; Vamanamurthy, M.K. On α-continuity in topological spaces. Acta Math. Hung. 1985, 45, 27–32. [Google Scholar] [CrossRef] [Scilit]
  34. Açıkgöz, A. Compactness and connectedness in aura topological spaces. arXiv 2026, arXiv:2602.07686. [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.