Preprint
Article

This version is not peer-reviewed.

Foundations of Single-Valued (T, I, N, F)-Neutrosophic Topological Spaces

Submitted:

25 September 2026

Posted:

28 September 2026

You are already at the latest version

Abstract
We develop foundational elements of a topology whose open sets are single-valued (T,I,N,F)-neutrosophic sets. The four coordinates represent truth, pure indeterminacy, neutrality, and falsehood, and the abbreviation TINF is used only for notational convenience. After fixing the order and complement needed to define inclusion, union, intersection, and duality, we introduce single-valued (T,I,N,F)-neutrosophic topological spaces and study closed sets, interior, closure, boundary, subspaces, products, and continuous maps. Classical topologies are represented naturally through crisp (T,I,N,F) characteristic sets, yielding an ordinary crisp core for every TINF topology. We also compare the resulting topological structure with related four-component theories: a coordinate permutation identifies it with quadripartitioned neutrosophic topology, while another identifies the underlying min--max open-set structure with the Turiyam value structure, although the published Fuzzy Neutrosophic Turiyam complement is not preserved. The main topological construction is the space of TINF points. We define the ordinary topology induced on this point space and prove that TINF continuity is equivalent to ordinary continuity of the induced point map. We then establish exact support-based correspondences for the separation axioms \(T_0\), \(T_1\), and \(T_2\), and investigate connectedness and compactness. Although \(V_{A\wedge B}=V_A\cap V_B\), the inclusion \(\bigcup_\lambda V_{A_\lambda}\subseteq V_{\bigvee_\lambda A_\lambda}\) may be strict; this leads to strengthened notions of TINF connectedness and compactness that correspond exactly to ordinary connectedness and compactness of the induced point space.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Fuzzy topology originates from the replacement of ordinary characteristic functions by membership functions with values in the unit interval. Zadeh’s fuzzy sets [20] and Chang’s fuzzy topological spaces [2] initiated this program, while Goguen’s L-fuzzy sets made explicit that the value domain may be a general ordered structure rather than only [ 0 , 1 ] [7]. From a topological point of view, the relevant question is how generalized open sets should be ordered, intersected, and united so that the standard notions of interior, closure, subspace, product, and continuity remain available.
Atanassov’s intuitionistic fuzzy sets separate membership from non-membership [1], and Coker developed the corresponding intuitionistic fuzzy topology [4]. The relation between such two-coordinate systems and more general L-fuzzy structures was subsequently emphasized in the literature [8,19]. Neutrosophic theory enlarges the value domain further by treating truth, indeterminacy, and falsehood as separate components. Topological developments include the work of Lupiáñez on neutrosophic and interval neutrosophic topologies [10,11,12], the three-component neutrosophic topological framework of Salama and Alblowi [14], and later work on refined neutrosophic topologies [13,16,18].
Smarandache introduced the specific quadruple ( T , I , N , F ) in 2017 [17]. In that source the established terminology is ( T , I , N , F ) neutrosophic set; when all four components are numerical values in [ 0 , 1 ] , we shall speak more precisely of a single-valued ( T , I , N , F ) -neutrosophic set. For brevity only, after this first formal declaration we use the abbreviation TINF. Every element is then assigned a degree of truth T, pure indeterminacy I, neutrality N, and falsehood F, without a normalization constraint on their sum. The present paper takes this four-valued object as the membership scale of a topology. The semantic distinction between pure indeterminacy and neutrality is retained in the notation, but the aim here is not to develop an epistemic or applicative interpretation of the four coordinates. Instead, we ask what the corresponding topological spaces, maps, point constructions, and basic topological properties should be.
A topological study must also be positioned carefully with respect to other four-component extensions. Quadripartitioned neutrosophic sets use quadruples ( T , C , G , F ) and already support a corresponding topology [3,5]. Turiyam sets use a fourth value in addition to truth, indeterminacy, and falsity [15], and recent Fuzzy Neutrosophic Turiyam work explicitly introduces open and closed sets, interior, and closure [6]. Consequently, the mathematical contribution of a TINF topology cannot be the mere presence of four coordinates. What is needed first is a topological development that makes explicit which definitions are genuinely part of the TINF setting and which are transported from closely related four-component frameworks.
The present paper provides such a foundation. We define topological spaces whose open sets are single-valued ( T , I , N , F ) -neutrosophic sets and develop the basic theory of open and closed TINF sets, interior, closure, boundary, subspaces, products, and continuous maps. The order and complement on the degree set are fixed only insofar as they are needed to define these operators and their dualities. Classical topological spaces are represented by crisp TINF characteristic sets, giving each TINF topology an ordinary crisp core. We also record the precise relation with quadripartitioned neutrosophic topology and with Turiyam min–max open-set operations, in order to delimit rather than inflate the novelty of the construction.
The main topological development is the systematic construction of the TINF point space and its induced ordinary topology, motivated by the neutrosophic singleton approach of Jafari, Nordo, and Thakur [9]. This construction yields an exact characterization of continuity and homeomorphisms, an exact support-Hausdorff correspondence, and corrected forms of connectedness and compactness. The corrections are necessary because unions of point-basic open sets do not always coincide with the point set associated with a join of TINF-valued open sets.

2. Single-Valued ( T , I , N , F ) -Neutrosophic Sets and Topological Operations

2.1. Single-Valued ( T , I , N , F ) -Neutrosophic Sets

Let X be a nonempty set.
Definition 1.
A single-valued ( T , I , N , F ) -neutrosophic set (briefly, a TINF set) on X is a map
A : X ⟶ [ 0 , 1 ] 4 , A ( x ) = T A ( x ) , I A ( x ) , N A ( x ) , F A ( x ) .
No restriction such as T A ( x ) + I A ( x ) + N A ( x ) + F A ( x ) = 1 is imposed. This agrees with the single-valued specialization of the ( T , I , N , F ) framework [17].
For the present topological purpose, intersections and unions of TINF sets are required to behave as genuine set operations. We therefore use the coordinatewise min–max operations described below; no alternative t-norm or t-conorm operations are considered here.

2.2. Order, Complement, and Topological Set Operations

Definition 2.
The single-valued ( T , I , N , F ) -neutrosophic topological value scale, abbreviated TINF value scale, is
L TINF : = [ 0 , 1 ] × [ 0 , 1 ] op × [ 0 , 1 ] × [ 0 , 1 ] op .
Here [ 0 , 1 ] op denotes the unit interval endowed with the reverse of its usual order. Thus the truth and neutrality coordinates are increasing, whereas the pure indeterminacy and falsehood coordinates are decreasing. For
p = ( t , i , n , f ) , q = ( t ′ , i ′ , n ′ , f ′ ) ,
define
p ≤ TINF q ⇔ t ≤ t ′ , i ≥ i ′ , n ≤ n ′ , f ≥ f ′ .
Its bottom and top elements are
0 = ( 0 , 1 , 0 , 1 ) , 1 = ( 1 , 0 , 1 , 0 ) .
For a family q λ = ( t λ , i λ , n λ , f λ ) , its TINF union and intersection are defined by
⋁ λ q λ = sup λ t λ , inf λ i λ , sup λ n λ , inf λ f λ ,
⋀ λ q λ = inf λ t λ , sup λ i λ , inf λ n λ , sup λ f λ .
The union and intersection of an empty family are understood to be 0 and 1 , respectively.
Definition 3.
Define
c : L TINF ⟶ L TINF , c ( t , i , n , f ) = ( f , n , i , t ) .
For a TINF set A, define its complement pointwise by
A c ( x ) = c ( A ( x ) ) .
The complement is involutive, since c ( c ( q ) ) = q for every q ∈ L TINF .
All TINF set operations on L TINF X are taken pointwise. In particular, for TINF sets A , B on X, we write A ≤ B when A ( x ) ≤ TINF B ( x ) for every x ∈ X . Their TINF intersection and union are
A ∧ B = min ( T A , T B ) , max ( I A , I B ) , min ( N A , N B ) , max ( F A , F B ) ,
and
A ∨ B = max ( T A , T B ) , min ( I A , I B ) , max ( N A , N B ) , min ( F A , F B ) .
We write 0 X and 1 X for the constant bottom and top TINF sets.
The preceding definitions imply that arbitrary TINF unions and intersections exist, finite intersections distribute over arbitrary unions, and complement interchanges unions and intersections. These are the only properties of the value scale used in the topological arguments below.

3. Single-valued ( T , I , N , F ) -neutrosophic topological spaces

Definition 4.
A single-valued ( T , I , N , F ) -neutrosophic topology (briefly, a TINF topology) on a nonempty set X is a family τ ⊆ L TINF X such that
(T1)
0 X , 1 X ∈ τ ;
(T2)
U , V ∈ τ implies U ∧ V ∈ τ ;
(T3)
if { U λ } λ ∈ Λ ⊆ τ , then ⋁ λ ∈ Λ U λ ∈ τ .
The pair ( X , τ ) is a single-valued ( T , I , N , F ) -neutrosophic topological space (briefly, a TINF topological space), and members of τ are ( T , I , N , F ) -neutrosophic open sets (briefly,TINF open sets).
This follows the Chang–Goguen tradition of topologies with generalized-valued open sets [2,7].
Example 1.
For every nonempty set X,
τ ind = { 0 X , 1 X }
is the indiscrete TINF topology and
τ dis = L TINF X
is the discrete TINF topology.

3.1. Generated Topologies and Bases

The construction of subspaces and products will use generated topologies and bases in the same way as ordinary topology.
Proposition 1.
Let { τ α } α ∈ A be a nonempty family of TINF topologies on the same set X. Then ⋂ α ∈ A τ α is a TINF topology on X.
Proof. 
Every τ α contains 0 X and 1 X , so both constant TINF sets belong to the intersection. If U and V belong to every τ α , then so does U ∧ V . Likewise, if every member of a family { U λ } belongs to every τ α , then ⋁ λ U λ belongs to every τ α . Hence the intersection satisfies the three axioms of a TINF topology. □
Definition 5.
Let S ⊆ L TINF X . The TINF topology generated by S , denoted by τ ( S ) , is the intersection of all TINF topologies on X that contain S . This family is nonempty because the discrete TINF topology L TINF X contains S .
If τ is a TINF topology on X, a family B ⊆ τ is a TINF base for τ if every U ∈ τ is the union of the base elements contained in U, that is,
U = ⋁ { B ∈ B : B ≤ U } .
Proposition 2.
Suppose B ⊆ L TINF X contains 1 X and is closed under finite intersections. Then
τ ( B ) = ⋁ E : E ⊆ B ,
where the union of the empty family is 0 X . In particular, B is a TINF base for τ ( B ) .
Proof. 
Let τ B denote the family on the right. It contains 0 X as the empty union and 1 X because 1 X ∈ B . Arbitrary unions of members of τ B are again unions of members of B . If U = ⋁ i ∈ I B i and V = ⋁ j ∈ J C j , distributivity gives
U ∧ V = ⋁ ( i , j ) ∈ I × J ( B i ∧ C j ) .
Every B i ∧ C j belongs to B , so U ∧ V ∈ τ B . Consequently, τ B is a TINF topology containing B .
Any TINF topology containing B must contain every union of members of B . Hence τ B is the smallest such topology and equals τ ( B ) . The displayed description also proves the asserted base property. □

3.2. Closed Sets, Interior, Closure, and Boundary

Definition 6.
A TINF set C on ( X , τ ) is closed if C c ∈ τ . For A ∈ L TINF X , its interior and closure are, respectively,
Int τ ( A ) = ⋁ { U ∈ τ : U ≤ A }
and
Cl τ ( A ) = ⋀ { C ∈ L TINF X : A ≤ C , C c ∈ τ } .
The TINF boundary of A is
Bd τ ( A ) : = Cl τ ( A ) ∧ Cl τ ( A c ) .
When the topology is clear, the subscript τ is omitted. If several spaces occur, we write Int X , Cl X , and Bd X for the operators determined by the topology on X.
Proposition 3.
The TINF closed sets contain 0 X and 1 X , are closed under arbitrary intersections, and are closed under finite unions.
Proof. 
The complements of 0 X and 1 X are 1 X and 0 X , respectively, and both are open. If every C λ is closed, then De Morgan’s rule gives ( ⋀ λ C λ ) c = ⋁ λ C λ c , which is open; hence ⋀ λ C λ is closed. For two closed TINF sets C and D, ( C ∨ D ) c = C c ∧ D c is open, so C ∨ D is closed. □
Theorem 1.
For all TINF sets A , B on X:
(i)
Int ( A ) ≤ A ≤ Cl ( A ) ;
(ii)
A ≤ B implies Int ( A ) ≤ Int ( B ) and Cl ( A ) ≤ Cl ( B ) ;
(iii)
Int ( Int ( A ) ) = Int ( A ) and Cl ( Cl ( A ) ) = Cl ( A ) ;
(iv)
Int ( A ∧ B ) = Int ( A ) ∧ Int ( B ) ;
(v)
Cl ( A ∨ B ) = Cl ( A ) ∨ Cl ( B ) ;
(vi)
Cl ( A ) = ( Int ( A c ) ) c , Int ( A ) = ( Cl ( A c ) ) c ;
(vii)
Bd ( A ) is closed and Bd ( A ) ≤ Cl ( A ) ;
(viii)
Bd ( A c ) = Bd ( A ) .
Proof. 
By definition, Int ( A ) is a union of open TINF sets lying below A; it is therefore open and satisfies Int ( A ) ≤ A . Similarly, Cl ( A ) is the intersection of all closed TINF sets lying above A, so it is closed and A ≤ Cl ( A ) . This proves (i).
If A ≤ B , every open TINF set below A also lies below B. Taking their unions yields Int ( A ) ≤ Int ( B ) . Every closed TINF set above B is also above A; taking the corresponding intersections yields Cl ( A ) ≤ Cl ( B ) . Thus (ii) holds.
Since Int ( A ) is open, it is one of the open TINF sets entering the definition of Int ( Int ( A ) ) . Consequently, Int ( A ) ≤ Int ( Int ( A ) ) . The reverse inequality follows from (i), applied to Int ( A ) . Hence Int ( Int ( A ) ) = Int ( A ) . The same argument with closed TINF sets gives Cl ( Cl ( A ) ) = Cl ( A ) , proving (iii).
For (iv), Int ( A ) ∧ Int ( B ) is open and lies below A ∧ B , whence
Int ( A ) ∧ Int ( B ) ≤ Int ( A ∧ B ) .
Conversely, Int ( A ∧ B ) lies below both A and B. Since it is open, it lies below both Int ( A ) and Int ( B ) , and therefore below their intersection. This proves (iv).
For (v), the closed TINF set Cl ( A ) ∨ Cl ( B ) contains A ∨ B , so Cl ( A ∨ B ) ≤ Cl ( A ) ∨ Cl ( B ) . Conversely, monotonicity gives Cl ( A ) ≤ Cl ( A ∨ B ) and Cl ( B ) ≤ Cl ( A ∨ B ) ; hence their union also lies below Cl ( A ∨ B ) .
To prove the first identity in (vi), note that ( Int ( A c ) ) c is closed and contains A, so
Cl ( A ) ≤ ( Int ( A c ) ) c .
On the other hand, Cl ( A ) c is open and lies below A c , which gives Cl ( A ) c ≤ Int ( A c ) . Taking complements reverses the inequality and proves the reverse inclusion. Replacing A by A c gives the second identity.
Both Cl ( A ) and Cl ( A c ) are closed. Their intersection is therefore closed, and the definition of boundary gives Bd ( A ) ≤ Cl ( A ) . This proves (vii).
Finally, the definition of boundary and involutivity of complement give
Bd ( A c ) = Cl ( A c ) ∧ Cl ( A ) = Bd ( A ) .
□
Theorem 2
(Boundary duality). For every TINF set A on ( X , τ ) ,
Bd τ ( A ) = Cl τ ( A ) ∧ ( Int τ ( A ) ) c .
Thus the TINF boundary satisfies the usual closure–interior formula even though the value scale L TINF is not Boolean.
Proof. 
Applying Theorem 1(vi) to A c and using involutivity gives
Cl τ ( A c ) = Int τ ( ( A c ) c ) c = ( Int τ ( A ) ) c .
Substitution in the definition of Bd τ ( A ) proves the asserted identity.
For an explicit coordinate verification, fix x ∈ X and write
Cl τ ( A ) ( x ) = ( c T , c I , c N , c F ) , Int τ ( A ) ( x ) = ( u T , u I , u N , u F ) .
The preceding duality and the definition of complement yield
Cl τ ( A c ) ( x ) = ( u F , u N , u I , u T ) .
Since meet in L TINF is coordinatewise minimum in the truth and neutrality coordinates and coordinatewise maximum in the pure-indeterminacy and falsehood coordinates, both sides of the claimed identity have value
min { c T , u F } , max { c I , u N } , min { c N , u I } , max { c F , u T }
at x. Because x was arbitrary, the two TINF sets are equal. The argument uses the De Morgan duality and involutivity of the TINF complement, but no Boolean identity such as A ∨ A c = 1 X . □
Corollary 1.
A TINF set A is open if and only if Int ( A ) = A , and it is closed if and only if Cl ( A ) = A .

3.3. Subspaces

Definition 7.
Let ( X , τ ) be a TINF topological space and let ⌀ ≠ Y ⊆ X . For every TINF set A : X → L TINF , we write A | Y : Y → L TINF for the restriction of A to Y, defined by ( A | Y ) ( y ) = A ( y ) for every y ∈ Y . The subspace TINF topology on Y is
τ | Y : = { U | Y : U ∈ τ } .
The pair ( Y , τ | Y ) is called the TINF subspace of ( X , τ ) determined by Y.
Proposition 4.
τ | Y is a TINF topology on Y.
Proof. 
The restrictions of 0 X and 1 X are 0 Y and 1 Y . If U | Y , V | Y ∈ τ | Y , then
U | Y ∧ V | Y = ( U ∧ V ) | Y ∈ τ | Y .
For a family { U λ | Y } of members of τ | Y ,
⋁ λ U λ | Y = ⋁ λ U λ | Y ∈ τ | Y .
Thus τ | Y satisfies all three TINF topology axioms. □
For a TINF set A on Y, define its bottom extension A 0 , X to X by
A 0 , X ( x ) = A ( x ) , x ∈ Y , 0 , x ∈ X ∖ Y .
Proposition 5
(Closure in a subspace). For every TINF set A on Y,
Cl Y ( A ) = Cl X ( A 0 , X ) | Y .
Proof. 
A TINF set C is closed in Y exactly when C = D | Y for some TINF closed set D on X. Indeed, if C is closed in Y, then C c = U | Y for some U ∈ τ , and hence C = U c | Y ; the converse follows by taking complements and restricting.
For a TINF closed set D on X, the inequality A ≤ D | Y is equivalent to A 0 , X ≤ D : on Y the two inequalities are the same, and outside Y the latter holds because A 0 , X has the bottom value. Therefore the closed TINF sets used to compute Cl Y ( A ) are precisely the restrictions of those used to compute Cl X ( A 0 , X ) . Since restriction preserves arbitrary intersections, their intersections satisfy the displayed identity. □

4. Continuous Maps and Products

4.1. Inverse Images and Continuity

Let f : X → Y be a map. For a TINF set B on Y, its inverse image under f is the TINF set on X defined by
f ← ( B ) : = B ∘ f .
Lemma 1.
For every family { B λ } of TINF sets on Y and all TINF sets B , C on Y,
f ← ⋁ λ B λ = ⋁ λ f ← ( B λ ) , f ← ⋀ λ B λ = ⋀ λ f ← ( B λ ) , f ← ( B c ) = f ← ( B ) c , f ← ( 0 Y ) = 0 X , f ← ( 1 Y ) = 1 X .
Proof. 
Fix x ∈ X . Evaluating the first identity at x gives
f ← ⋁ λ B λ ( x ) = ⋁ λ B λ ( f ( x ) ) = ⋁ λ B λ ( f ( x ) ) = ⋁ λ f ← ( B λ ) ( x ) .
The same calculation with intersections proves the second identity. Since complement and the two constant TINF sets are also defined pointwise, the remaining identities follow by evaluating both sides at an arbitrary x ∈ X . □
Definition 8.
A map f : ( X , τ X ) → ( Y , τ Y ) is TINF continuous if f ← ( U ) ∈ τ X for every U ∈ τ Y .
Theorem 3
(Equivalent continuity criteria). For a map f : ( X , τ X ) → ( Y , τ Y ) , the following are equivalent:
(i)
f is TINF continuous;
(ii)
the inverse image of every TINF closed set is TINF closed;
(iii)
for every B ∈ L TINF Y , f ← ( Int Y ( B ) ) ≤ Int X ( f ← ( B ) ) ;
(iv)
for every B ∈ L TINF Y , Cl X ( f ← ( B ) ) ≤ f ← ( Cl Y ( B ) ) .
Proof. 
Assume (i), and let C be TINF closed in Y. Since C c is open, f ← ( C c ) is open in X. By Lemma 1, this TINF set is the complement of f ← ( C ) , so f ← ( C ) is closed. This proves (ii). Conversely, if inverse images preserve closed TINF sets and U is open in Y, then U c is closed. Hence f ← ( U c ) is closed, and its complement f ← ( U ) is open. Thus (ii) implies (i).
Assume (i). The TINF set f ← ( Int Y ( B ) ) is open and lies below f ← ( B ) . By the defining maximality of the interior, it lies below Int X ( f ← ( B ) ) , proving (iii). Conversely, suppose (iii) holds and let B be open in Y. Then B = Int Y ( B ) , and therefore
f ← ( B ) ≤ Int X ( f ← ( B ) ) ≤ f ← ( B ) .
Equality follows, so f ← ( B ) is open. Hence (iii) implies (i).
Assume (ii). The TINF set f ← ( Cl Y ( B ) ) is closed and contains f ← ( B ) . By the defining minimality of closure, Cl X ( f ← ( B ) ) ≤ f ← ( Cl Y ( B ) ) , which is (iv). Finally, suppose (iv) holds and let B be closed in Y. Since Cl Y ( B ) = B , we obtain
Cl X ( f ← ( B ) ) ≤ f ← ( B ) ≤ Cl X ( f ← ( B ) ) .
Thus f ← ( B ) equals its closure and is closed. This proves (ii), and completes the cycle of equivalences. □

4.2. Products

Let ( X , τ X ) and ( Y , τ Y ) be TINF spaces, and let p X : X × Y → X and p Y : X × Y → Y be the coordinate projections.
Definition 9.
For U ∈ τ X and V ∈ τ Y , the TINF set
p X ← ( U ) ∧ p Y ← ( V )
is called an open TINF rectangle. The product TINF topology is
τ X ⊗ τ Y : = τ ( B ) ,
where
B = p X ← ( U ) ∧ p Y ← ( V ) : U ∈ τ X , V ∈ τ Y .
The family B contains 1 X × Y and is closed under finite intersections, since
p X ← ( U 1 ) ∧ p Y ← ( V 1 ) ∧ p X ← ( U 2 ) ∧ p Y ← ( V 2 ) = p X ← ( U 1 ∧ U 2 ) ∧ p Y ← ( V 1 ∧ V 2 ) .
By Proposition 2, the open TINF rectangles form a TINF base for τ X ⊗ τ Y .
Theorem 4
(Product continuity criterion). The projections p X and p Y are TINF continuous. A map
h : ( Z , τ Z ) ⟶ ( X × Y , τ X ⊗ τ Y )
is TINF continuous if and only if p X ∘ h and p Y ∘ h are TINF continuous.
Proof. 
For U ∈ τ X ,
p X ← ( U ) = p X ← ( U ) ∧ p Y ← ( 1 Y )
is an open TINF rectangle; hence p X is continuous. The same argument proves continuity of p Y .
If h is continuous, then for every U ∈ τ X ,
( p X ∘ h ) ← ( U ) = h ← ( p X ← ( U ) )
is open in Z. Thus p X ∘ h is continuous, and the proof for p Y ∘ h is the same.
Conversely, suppose both coordinate maps are continuous. For every open TINF rectangle,
h ← p X ← ( U ) ∧ p Y ← ( V ) = ( p X ∘ h ) ← ( U ) ∧ ( p Y ∘ h ) ← ( V ) .
The right-hand side is open in Z. Every member of the product topology is a union of open TINF rectangles, and inverse images preserve arbitrary unions by Lemma 1. Therefore the inverse image under h of every product-open TINF set is open, and h is continuous. □

5. Classical Topologies and the Crisp Core

Definition 10.
For S ⊆ X , define the crisp TINF characteristic set
χ S TINF ( x ) = 1 , x ∈ S , 0 , x ∉ S .
Proposition 6.
For any family { S λ } of ordinary subsets of X,
χ ⋃ λ S λ TINF = ⋁ λ χ S λ TINF , χ ⋂ λ S λ TINF = ⋀ λ χ S λ TINF ,
and
( χ S TINF ) c = χ X ∖ S TINF .
Consequently, every ordinary topology T on X determines a TINF topology
T TINF = { χ U TINF : U ∈ T } ,
and every TINF topology τ determines an ordinary topology
C ( τ ) : = { U ⊆ X : χ U TINF ∈ τ } ,
called the crisp core of τ.
A TINF topology of the form T TINF for an ordinary topology T is called a crisp TINF topology.
Proof. 
At a point x ∈ X , the value of χ ⋃ λ S λ TINF is 1 exactly when x belongs to at least one S λ ; this is exactly the pointwise union of the χ S λ TINF . The intersection identity is proved in the same way. Moreover, complement exchanges the two values 0 and 1 , so ( χ S TINF ) c = χ X ∖ S TINF .
It follows that T TINF contains the two constant TINF sets and is closed under arbitrary TINF unions and finite TINF intersections. Hence it is a TINF topology. In the opposite direction, ⌀ , X ∈ C ( τ ) because their TINF characteristic sets are 0 X and 1 X . The two displayed identities show that C ( τ ) is closed under ordinary arbitrary unions and finite intersections. Therefore C ( τ ) is an ordinary topology on X. □
Proposition 7.
If
f : ( X , τ X ) ⟶ ( Y , τ Y )
is TINF continuous, then
f : ( X , C ( τ X ) ) ⟶ ( Y , C ( τ Y ) )
is continuous in the ordinary sense.
Proof. 
Let U be open in C ( τ Y ) . By definition, χ U TINF ∈ τ Y . TINF continuity of f gives
f ← ( χ U TINF ) = χ f − 1 ( U ) TINF ∈ τ X .
The equality follows by evaluating both sides at an arbitrary x ∈ X . Hence f − 1 ( U ) ∈ C ( τ X ) , which proves ordinary continuity of f between the crisp cores. □

6. Single-valued ( T , I , N , F ) -neutrosophic points and the induced point topology

Neutrosophic singleton spaces provide a useful bridge between generalized-valued topology and ordinary topology [9]. The TINF setting allows a parallel construction, but arbitrary unions require special care.
Definition 11.
Let x ∈ X and q ∈ L TINF ∖ { 0 } . The single-valued ( T , I , N , F ) -neutrosophic point (briefly, TINF point) x q is the TINF set
x q ( y ) = q , y = x , 0 , y ≠ x .
The point x is the support of x q . Let
P TINF ( X ) = { x q : x ∈ X , q ∈ L TINF ∖ { 0 } } .
We write
x q ⊑ A
if q ≤ A ( x ) , and define
V A : = { x q ∈ P TINF ( X ) : x q ⊑ A } .
Lemma 2
(Point-set representation). For TINF sets A , B on X and an arbitrary family { A λ } :
(i)
A ≤ B if and only if V A ⊆ V B ;
(ii)
V A ∧ B = V A ∩ V B ;
(iii)
⋃ λ V A λ ⊆ V ⋁ λ A λ , and the inclusion may be strict;
(iv)
V A = ⌀ if and only if A = 0 X ;
(v)
if V A = ⋃ λ V A λ , then A = ⋁ λ A λ .
Proof. 
For (i), suppose A ≤ B . If x q ∈ V A , then q ≤ A ( x ) ≤ B ( x ) , and hence x q ∈ V B . Thus V A ⊆ V B . Conversely, assume V A ⊆ V B and fix x ∈ X . If A ( x ) ≠ 0 , the TINF point x A ( x ) belongs to V A and therefore to V B , which means A ( x ) ≤ B ( x ) . If A ( x ) = 0 , the same inequality holds because 0 is the bottom degree. Hence A ≤ B .
For (ii), a TINF point x q belongs to V A ∧ B exactly when
q ≤ A ( x ) ∧ B ( x ) ⇔ q ≤ A ( x ) and q ≤ B ( x ) .
This is equivalent to x q ∈ V A ∩ V B .
For (iii), A λ ≤ ⋁ μ A μ for every λ . Part (i) then gives V A λ ⊆ V ⋁ μ A μ , and taking the ordinary union over λ proves the stated inclusion. The strictness assertion is established in Example 2 below.
For (iv), A = 0 X clearly gives V A = ⌀ . Conversely, if A ≠ 0 X , there is x ∈ X for which A ( x ) ≠ 0 ; then x A ( x ) ∈ V A , so V A is nonempty.
For (v), the equality of point sets gives V A λ ⊆ V A for every λ . Part (i) yields A λ ≤ A , and therefore ⋁ λ A λ ≤ A . For the reverse inequality, fix x ∈ X with A ( x ) ≠ 0 . The point x A ( x ) lies in V A and hence in some V A λ . Consequently,
A ( x ) ≤ A λ ( x ) ≤ ⋁ μ A μ ( x ) .
If A ( x ) = 0 , the same inequality follows from the fact that 0 is the bottom degree. Thus A ≤ ⋁ λ A λ , proving equality. □
Example 2
(A strict union inclusion). Let X = { x } and
A ( x ) = ( 0.7 , 0.1 , 0.1 , 0.1 ) , B ( x ) = ( 0.1 , 0.1 , 0.7 , 0.1 ) .
Then
A ( x ) ∨ B ( x ) = ( 0.7 , 0.1 , 0.7 , 0.1 ) .
The point x A ( x ) ∨ B ( x ) lies in V A ∨ B , but in neither V A nor V B . Therefore
V A ∪ V B ⊊ V A ∨ B .
Theorem 5
(Induced point topology). For a TINF space ( X , τ ) , the family
B τ : = { V U : U ∈ τ }
is a basis for an ordinary topology σ τ on P TINF ( X ) .
Proof. 
Since V 1 X = P TINF ( X ) , the family covers the point space. Moreover,
V U ∩ V V = V U ∧ V
by Lemma 2, and U ∧ V ∈ τ . Thus the intersection of any two members of B τ is again a member of B τ . The two standard basis conditions are satisfied, so B τ determines an ordinary topology on P TINF ( X ) . □
Every ordinary map f : X → Y induces
f ^ : P TINF ( X ) ⟶ P TINF ( Y ) , f ^ ( x q ) = f ( x ) q .
Lemma 3.
For every TINF set B on Y,
f ^ − 1 ( V B ) = V f ← ( B ) .
Proof. 
For x q ∈ P TINF ( X ) ,
f ^ ( x q ) ∈ V B ⇔ q ≤ B ( f ( x ) ) ⇔ q ≤ ( f ← ( B ) ) ( x ) ⇔ x q ∈ V f ← ( B ) .
□
Theorem 6
(Continuity represented on TINF points). A map
f : ( X , τ X ) ⟶ ( Y , τ Y )
is TINF continuous if and only if
f ^ : ( P TINF ( X ) , σ τ X ) ⟶ ( P TINF ( Y ) , σ τ Y )
is continuous in the ordinary sense.
Proof. 
Suppose first that f is TINF continuous. If V U is basic open in the target point space, then Lemma 3 gives f ^ − 1 ( V U ) = V f ← ( U ) . Since f ← ( U ) ∈ τ X , this is a basic open set in the source point space. Hence f ^ is ordinarily continuous.
Conversely, suppose f ^ is continuous and let U ∈ τ Y . Then
V f ← ( U ) = f ^ − 1 ( V U )
is open in σ τ X , hence
V f ← ( U ) = ⋃ λ V A λ
for some A λ ∈ τ X . By Lemma 2(v),
f ← ( U ) = ⋁ λ A λ ∈ τ X .
Thus f is TINF continuous. □
Definition 12.
A bijection
f : ( X , τ X ) → ( Y , τ Y )
is a TINF homeomorphism if both f and f − 1 are TINF continuous.
Theorem 7
(Homeomorphisms represented on point spaces). A bijection
f : ( X , τ X ) ⟶ ( Y , τ Y )
is a TINF homeomorphism if and only if the induced map
f ^ : ( P TINF ( X ) , σ τ X ) ⟶ ( P TINF ( Y ) , σ τ Y )
is an ordinary homeomorphism.
Proof. 
If f is a TINF homeomorphism, Theorem 6 shows that both f ^ and f − 1 ^ are ordinarily continuous. Directly from their definitions,
f − 1 ^ = ( f ^ ) − 1 .
Therefore f ^ is an ordinary homeomorphism. Conversely, if f ^ is a homeomorphism, its continuity gives TINF continuity of f by Theorem 6. Continuity of ( f ^ ) − 1 = f − 1 ^ gives TINF continuity of f − 1 by the same theorem. Hence f is a TINF homeomorphism. □

7. Separation, Connectedness, and Compactness

The three-component singleton construction of Jafari, Nordo, and Thakur motivates the following questions [9]. In the TINF setting, however, Lemma 2(iii) shows that TINF unions and unions of point-basic opens need not coincide. This distinction changes the correct formulation of connectedness and compactness.
Separation in the induced point space has two components: separation of distinct supports and separation of distinct degrees over one support. To isolate the first component, put
M X : = { x 1 : x ∈ X } ⊆ P TINF ( X ) .
We call M X the maximal-point copy of X in P TINF ( X ) . The qualifications “support-pseudo” below refer to separation on this copy, except in the Hausdorff case, where an equivalent stronger formulation is available for all degrees on distinct supports.

7.1. TINF- T 0 and support-pseudo- T 0 separation

Definition 13.
A TINF space ( X , τ ) is TINF- T 0 if, for every pair of distinct points x , y ∈ X , there exists U ∈ τ such that either U ( x ) = 1 and U ( y ) ≠ 1 , or U ( y ) = 1 and U ( x ) ≠ 1 .
Definition 14.
The induced point space ( P TINF ( X ) , σ τ ) is support-pseudo- T 0 if, for every pair of distinct supports x , y ∈ X , there exists O ∈ σ τ such that either x 1 ∈ O and y 1 ∉ O , or y 1 ∈ O and x 1 ∉ O . Equivalently, the subspace M X is an ordinary T 0 space.
Theorem 8
( T 0 equivalence). A TINF space ( X , τ ) is TINF- T 0 if and only if ( P TINF ( X ) , σ τ ) is support-pseudo- T 0 .
Proof. 
Suppose first that ( X , τ ) is TINF- T 0 , and let x , y ∈ X be distinct. After interchanging x and y if necessary, choose U ∈ τ such that U ( x ) = 1 and U ( y ) ≠ 1 . By the definition of point-belonging, x 1 ∈ V U . On the other hand, y 1 ∈ V U would mean 1 ≤ U ( y ) and hence U ( y ) = 1 , contrary to the choice of U. Thus the ordinary open set V U contains x 1 and does not contain y 1 . Hence the induced point space is support-pseudo- T 0 .
Conversely, suppose that ( P TINF ( X ) , σ τ ) is support-pseudo- T 0 , and take distinct x , y ∈ X . There is an ordinary open set O that contains one of the maximal points x 1 , y 1 and not the other. Assume, without loss of generality, that x 1 ∈ O and y 1 ∉ O . Since B τ is a basis for σ τ , there exists U ∈ τ such that
x 1 ∈ V U ⊆ O .
The first inclusion gives 1 ≤ U ( x ) , so U ( x ) = 1 . Since y 1 ∉ O , it does not belong to V U ; therefore U ( y ) ≠ 1 . This is precisely the TINF- T 0 condition. □
The use of maximal representatives in Definition 14 is essential. From U ( y ) ≠ 1 one obtains y 1 ∉ V U , but an arbitrary point y r may still belong to V U when r ≤ U ( y ) . Requiring the ordinary T 0 condition for every pair x q , y r with x ≠ y would therefore be strictly stronger and would not be equivalent to Definition 13.

7.2. TINF- T 1 and support-pseudo- T 1 separation

Definition 15.
A TINF space ( X , τ ) is TINF- T 1 if, for every pair of distinct points x , y ∈ X , there exist U , V ∈ τ such that U ( x ) = 1 , U ( y ) ≠ 1 , V ( y ) = 1 , and V ( x ) ≠ 1 .
Definition 16.
The induced point space ( P TINF ( X ) , σ τ ) is support-pseudo- T 1 if, for every pair of distinct supports x , y ∈ X , there exist ordinary open sets O 1 , O 2 ∈ σ τ such that x 1 ∈ O 1 , y 1 ∉ O 1 , y 1 ∈ O 2 , and x 1 ∉ O 2 . Equivalently, the subspace M X is an ordinary T 1 space.
Theorem 9
( T 1 equivalence). A TINF space ( X , τ ) is TINF- T 1 if and only if ( P TINF ( X ) , σ τ ) is support-pseudo- T 1 .
Proof. 
Assume that ( X , τ ) is TINF- T 1 , and let x , y ∈ X be distinct. Choose U , V ∈ τ as in Definition 15. Since U ( x ) = 1 and V ( y ) = 1 , we have x 1 ∈ V U and y 1 ∈ V V . The inequalities U ( y ) ≠ 1 and V ( x ) ≠ 1 give, respectively, y 1 ∉ V U and x 1 ∉ V V . Thus V U and V V provide the two ordinary open sets required for support-pseudo- T 1 separation.
Conversely, assume that the induced point space is support-pseudo- T 1 , and fix distinct x , y ∈ X . Choose O 1 , O 2 ∈ σ τ such that x 1 ∈ O 1 , y 1 ∉ O 1 , y 1 ∈ O 2 , and x 1 ∉ O 2 . By the basis property, there are U , V ∈ τ such that
x 1 ∈ V U ⊆ O 1 , y 1 ∈ V V ⊆ O 2 .
The two memberships imply U ( x ) = 1 and V ( y ) = 1 . Moreover, y 1 ∉ O 1 implies y 1 ∉ V U , so U ( y ) ≠ 1 ; similarly, x 1 ∉ O 2 implies V ( x ) ≠ 1 . Hence ( X , τ ) is TINF- T 1 . □

7.3. TINF-Hausdorffness ( T 2 )

Definition 17
(TINF Hausdorff and support-pseudo-Hausdorff). A TINF space ( X , τ ) is TINF Hausdorff, or TINF- T 2 , if for every pair of distinct points x , y ∈ X there exist U , V ∈ τ such that
U ( x ) = 1 , V ( y ) = 1 , U ∧ V = 0 X .
The induced point space ( P TINF ( X ) , σ τ ) is support-pseudo-Hausdorff if any two TINF points x q , y r with distinct supports x ≠ y have disjoint ordinary open neighborhoods. In particular, the subspace M X is an ordinary Hausdorff space.
Theorem 10
( T 2 equivalence). A TINF space ( X , τ ) is TINF Hausdorff if and only if ( P TINF ( X ) , σ τ ) is support-pseudo-Hausdorff.
Proof. 
Assume that ( X , τ ) is TINF Hausdorff, and take x q , y r ∈ P TINF ( X ) with x ≠ y . Choose U , V ∈ τ as in Definition 17. Since q , r ≤ 1 ,
x q ∈ V U , y r ∈ V V .
By Lemma 2(ii),
V U ∩ V V = V U ∧ V = V 0 X = ⌀ .
Thus V U and V V are disjoint ordinary open neighborhoods of x q and y r .
Conversely, let x , y ∈ X be distinct. Support-pseudo-Hausdorffness applied to x 1 and y 1 gives disjoint ordinary open neighborhoods O x and O y . Since B τ is a basis, choose U , V ∈ τ such that
x 1 ∈ V U ⊆ O x , y 1 ∈ V V ⊆ O y .
Then U ( x ) = 1 and V ( y ) = 1 . Furthermore,
V U ∧ V = V U ∩ V V = ⌀ .
By Lemma 2(iv), U ∧ V = 0 X . Hence ( X , τ ) is TINF Hausdorff. □
Proposition 8
(Co-supported points and the fiber order). Fix x ∈ X and distinct degrees q , r ∈ L TINF ∖ { 0 } .
(i)
If q ≤ r , then every σ τ -open set containing x r also contains x q .
(ii)
The points x q and x r are T 0 -separated in ( P TINF ( X ) , σ τ ) if and only if there exists U ∈ τ such that either q ≤ U ( x ) and r ≰ U ( x ) , or r ≤ U ( x ) and q ≰ U ( x ) .
(iii)
If q ≰ r and the TINF point x r , regarded as a TINF set on X, belongs to τ, then V x r contains x r and does not contain x q . Similarly, if r ≰ q and x q ∈ τ , then V x q contains x q and does not contain x r . In particular, for the discrete TINF topology, any two distinct co-supported points are T 0 -separated.
(iv)
If q < r , no ordinary open set can contain x r while excluding x q . Consequently, for every nonempty X and every TINF topology τ on X, the full induced point space ( P TINF ( X ) , σ τ ) is neither ordinary T 1 nor ordinary Hausdorff.
Proof. 
For (i), let O ∈ σ τ contain x r . By the basis property, there is U ∈ τ such that x r ∈ V U ⊆ O . Thus r ≤ U ( x ) . If q ≤ r , transitivity gives q ≤ U ( x ) , and hence x q ∈ V U ⊆ O .
For (ii), suppose first that an ordinary open set O contains x q and not x r . Choose U ∈ τ with x q ∈ V U ⊆ O . Then q ≤ U ( x ) , whereas x r ∉ V U gives r ≰ U ( x ) . The case in which O contains x r and not x q is symmetric. Conversely, either pair of inequalities makes the corresponding basic open set V U contain exactly one of x q , x r .
For (iii), recall that the TINF point x r has value r at x and 0 elsewhere. If x r ∈ τ , then V x r is a basic open set. Since r ≤ x r ( x ) = r , it contains x r ; since q ≰ r , it does not contain x q . The other assertion is obtained by interchanging q and r. If τ = L TINF X , both TINF points are open TINF sets, and antisymmetry ensures that at least one of q ≰ r and r ≰ q holds whenever q ≠ r .
For (iv), the first assertion is exactly part (i) for q < r . To prove the consequence, choose any x ∈ X and, for example, degrees
q = 1 2 , 1 , 0 , 1 , r = 1 .
They satisfy 0 < q < r . Every open neighborhood of x r contains x q , so the two points do not satisfy the ordinary T 1 axiom. Hence the full point space is not T 1 ; since every Hausdorff space is T 1 , it is not Hausdorff either. □
Proposition 8 explains the role of the support-pseudo conditions. The obstruction to ordinary T 1 and Hausdorff separation is intrinsic to the degree order inside each fiber { x q : q ≠ 0 } . The support-pseudo axioms remove only this unavoidable co-supported obstruction and measure instead how the topology separates distinct carrier points. For T 0 and T 1 , maximal representatives are necessary for exact equivalence; for T 2 , disjointness at the maximal representatives automatically separates all lower degrees on the two supports.
Corollary 2
(Separation hierarchy). Every TINF Hausdorff space is TINF- T 1 , and every TINF- T 1 space is TINF- T 0 . Correspondingly, support-pseudo-Hausdorffness implies support-pseudo- T 1 , which implies support-pseudo- T 0 .
Proof. 
Let ( X , τ ) be TINF Hausdorff and let x ≠ y . Choose U , V ∈ τ such that U ( x ) = 1 , V ( y ) = 1 , and U ∧ V = 0 X . If U ( y ) = 1 , then ( U ∧ V ) ( y ) = 1 , a contradiction; hence U ( y ) ≠ 1 . Similarly, V ( x ) ≠ 1 , so the space is TINF- T 1 . The implication from TINF- T 1 to TINF- T 0 follows immediately by retaining either one of the two separating open TINF sets. The support-pseudo implications follow from Theorems 8–10. □
Both implications in Corollary 2 are strict. Indeed, by Proposition 6, an ordinary topology T gives the crisp TINF topology T TINF , and the three TINF separation axioms reduce respectively to the ordinary T 0 , T 1 , and Hausdorff axioms of T . The Sierpiński topology is T 0 but not T 1 , while the cofinite topology on an infinite set is T 1 but not Hausdorff.

7.4. Connectedness

Definition 18.
A pair U , V ∈ τ is a TINF separation if U ≠ 0 X , V ≠ 0 X , U ∧ V = 0 X , and U ∨ V = 1 X . A TINF space is TINF connected if it admits no TINF separation.
A pair U , V ∈ τ is a strong TINF separation if U ≠ 0 X , V ≠ 0 X , U ∧ V = 0 X , and, for every x ∈ X , either U ( x ) = 1 or V ( x ) = 1 . A TINF space is strongly TINF connected if it has no strong TINF separation.
The pointwise condition in a strong TINF separation implies U ∨ V = 1 X , so every strong TINF separation is a TINF separation. It is also equivalent to
V U ∪ V V = P TINF ( X ) .
Indeed, the forward implication follows because every degree lies below 1 . Conversely, if the two point sets cover P TINF ( X ) , then the top-valued point x 1 belongs to one of them for each x ∈ X , forcing U ( x ) = 1 or V ( x ) = 1 .
Theorem 11
(Connectedness representation). ( X , τ ) is strongly TINF connected if and only if ( P TINF ( X ) , σ τ ) is connected.
Proof. 
If U , V form a strong TINF separation, then V U and V V are nonempty disjoint open sets whose union is P TINF ( X ) . They therefore form an ordinary separation of the induced point space.
Conversely, suppose
P TINF ( X ) = O ∪ W , O ∩ W = ⌀ ,
with O , W nonempty open. Write
O = ⋃ a ∈ A V U a , W = ⋃ b ∈ B V V b ,
where U a , V b ∈ τ , and put
U = ⋁ a ∈ A U a , V = ⋁ b ∈ B V b .
Because O and W are nonempty, at least one U a and at least one V b are nonbottom; hence U ≠ 0 X and V ≠ 0 X . Since V U a ∩ V V b = ⌀ , Lemma 2(ii),(iv) gives U a ∧ V b = 0 X for every a , b . Applying twice the finite-meet distributivity over arbitrary unions recorded in Section 2.2, we obtain
U ∧ V = ⋁ a , b ( U a ∧ V b ) = 0 X .
For every x ∈ X , the top-valued point x 1 lies in O or W . In the first case it lies in some V U a , forcing U a ( x ) = 1 and hence U ( x ) = 1 . In the second case it lies in some V V b , forcing V b ( x ) = 1 and hence V ( x ) = 1 . Thus U , V form a strong TINF separation. □
Corollary 3.
If ( X , τ ) is TINF connected, then its induced point space is connected.
Proof. 
Every strong TINF separation is, in particular, a TINF separation. □
The converse need not hold.
Example 3
(A standard separation invisible in the point space). Let X = { x } and define
A ( x ) = ( 1 , 1 , 0 , 0 ) , B ( x ) = ( 0 , 0 , 1 , 1 ) .
Then
A ∧ B = 0 X , A ∨ B = 1 X ,
so
τ = { 0 X , A , B , 1 X }
is not TINF connected. However,
V A ∪ V B ⊊ P TINF ( X ) ,
because x 1 belongs to neither V A nor V B . In fact, the only basic open containing x 1 is P TINF ( X ) itself, so the induced point space is connected.

7.5. Compactness

Definition 19.
A family { U i } i ∈ I ⊆ τ is a TINF open cover if ⋁ i ∈ I U i = 1 X . A subfamily indexed by J ⊆ I is a subcover if ⋁ j ∈ J U j = 1 X . The space is TINF compact if every TINF open cover has a finite subcover.
The family { U i } i ∈ I is a strong TINF open cover if, for every x ∈ X , there exists i ∈ I such that U i ( x ) = 1 . A strong subcover is a subfamily having the same pointwise property. A TINF space is strongly TINF compact if every strong TINF open cover has a finite strong subcover.
Equivalently, { U i } is a strong TINF open cover if and only if { V U i } is an ordinary open cover of P TINF ( X ) .
Theorem 12
(Compactness representation). ( X , τ ) is strongly TINF compact if and only if ( P TINF ( X ) , σ τ ) is compact.
Proof. 
Assume ( X , τ ) is strongly TINF compact and let U be an ordinary open cover of P TINF ( X ) . For each TINF point x q , choose a member O x q ∈ U that contains it. Since B τ is a basis, choose U x q ∈ τ such that
x q ∈ V U x q ⊆ O x q .
The family { V U x q : x q ∈ P TINF ( X ) } covers the point space. Indeed, for each x ∈ X , the maximal point x 1 belongs to some V U y r ; hence 1 ≤ U y r ( x ) , which forces U y r ( x ) = 1 . Thus { U x q : x q ∈ P TINF ( X ) } is a strong TINF open cover and has a finite strong subcover. The finitely many corresponding sets O x q then cover P TINF ( X ) , proving that the point space is compact.
Conversely, if the point space is compact and { U i } is a strong TINF open cover, then { V U i } is an ordinary open cover and therefore admits a finite subcover. The corresponding finitely many U i form a strong TINF subcover. □
Remark 1.
The TINF open-cover condition
⋁ i U i = 1 X
does not imply that { V U i } covers P TINF ( X ) . The pair A , B in Example 3 already shows this: A ∨ B = 1 X while V A ∪ V B ≠ P TINF ( X ) . Thus the two cover conditions are different in general and should not be conflated. Every strong TINF open cover is a TINF open cover. However, TINF compactness yields only a finite subfamily whose join is 1 X , and that subfamily need not retain the pointwise top-value condition required of a strong subcover. Thus the inclusion of cover classes, by itself, gives no implication between the two compactness notions. The two notions coincide on crisp TINF topologies, because a crisp family has pointwise union 1 at x exactly when at least one member has value 1 at x.

9. Structural Perspective

The preceding construction separates three topological layers. First, a TINF topology assigns generalized open sets to a carrier and supports the usual operators of general topology: interior, closure, boundary, subspaces, products, and continuous maps. Second, the crisp core extracts an ordinary topology on the carrier. Third, the TINF point construction produces a generally much larger ordinary topological space whose points remember both support and degree. The exact continuity and homeomorphism theorems show that this induced point topology is not merely auxiliary: it captures continuity and homeomorphism in ordinary topological terms.
The comparison with quadripartitioned neutrosophic topology shows that many basic open-set and closed-set constructions are representation invariant under a change of coordinates. The Turiyam comparison identifies a complementary limitation: open-set operations may coincide even when complement and closed-set structures differ. The separation hierarchy adds a specifically point-topological distinction. Separation of carrier points is represented by support-pseudo axioms, whereas comparable degrees over one support form nested neighborhood systems and prevent the full point space from being T 1 .

10. Conclusions

We have developed a focused topological foundation for single-valued ( T , I , N , F ) -neutrosophic topological spaces. The underlying value scale is
L TINF = [ 0 , 1 ] × [ 0 , 1 ] op × [ 0 , 1 ] × [ 0 , 1 ] op ,
with bottom ( 0 , 1 , 0 , 1 ) , top ( 1 , 0 , 1 , 0 ) , and complement ( t , i , n , f ) c = ( f , n , i , t ) . On this scale, the coordinatewise min–max operations give the TINF unions, intersections, and complements used throughout the paper.
Within this framework we established the standard theory of open and closed sets, interior, closure, boundary, subspaces, products, and continuous maps, and we identified the ordinary crisp core. The comparison with quadripartitioned neutrosophic topology shows that the corresponding TINF topological operators are transported by a coordinate permutation, while the comparison with Turiyam sets shows that the min–max open-set operations are likewise transported after a different permutation. The latter correspondence does not preserve the Fuzzy Neutrosophic Turiyam complement, so the associated closed-set structures remain distinct.
The induced TINF point topology provides the main topological refinement developed here. TINF continuity and homeomorphism are exactly represented by ordinary continuity and homeomorphism of the induced point maps. The TINF separation hierarchy from T 0 to Hausdorffness is represented by the corresponding support-pseudo axioms, while the ordered degree fibers explain why the full point space is never ordinary T 1 . The strict inclusion
⋃ λ V A λ ⊆ V ⋁ λ A λ
explains why connectedness and compactness cannot be transferred naively from earlier singleton constructions; the strengthened notions introduced here restore exact correspondences with ordinary connectedness and compactness.

References

  1. Atanassov, K. T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20(1), 87–96. [Google Scholar] [CrossRef]
  2. Chang, C. L. Fuzzy topological spaces. J. Math. Anal. Appl. 1968, 24, 182–190. [Google Scholar] [CrossRef]
  3. Chatterjee, R.; Majumdar, P.; Samanta, S. K. On some similarity measures and entropy on quadripartitioned single valued neutrosophic sets. J. Intell. Fuzzy Syst. 2016, 30, 2475–2485. [Google Scholar] [CrossRef]
  4. Coker, D. An introduction to intuitionistic fuzzy topological spaces. Fuzzy Sets Syst. 1997, 88, 81–89. [Google Scholar] [CrossRef]
  5. Das, S.; Das, R.; Granados, C. Topology on quadripartitioned neutrosophic sets. Neutrosophic Sets Syst. 2021, 45, 54–61. Available online: https://digitalrepository.unm.edu/nss_journal/vol45/iss1/5/. [CrossRef]
  6. Eswaran, P.; Palanivelu, B.; Smarandache, F. Fuzzy Neutrosophic Turiyam Sets: diagrammatic and operational analysis with real world applications. Neutrosophic Sets Syst. 2026, 99, 1–12. [Google Scholar] [CrossRef]
  7. Goguen, J. A. L-fuzzy sets. J. Math. Anal. Appl. 1967, 18, 145–174. [Google Scholar] [CrossRef]
  8. Hatzimichailidis, A. G.; Papadopoulos, B. K. L-fuzzy sets and intuitionistic fuzzy sets. In Computational Intelligence Based on Lattice Theory, Studies in Computational Intelligence; Kaburlasos, V. G., Ritter, G. X., Eds.; Springer: Berlin, 2007; Vol. 67, pp. 325–339. [Google Scholar] [CrossRef]
  9. Jafari, S.; Nordo, G.; Thakur, S. S. More on neutrosophic topology. Neutrosophic Sets Syst. 2024, 73, 584–591. Available online: https://fs.unm.edu/NSS/47MoreonNeutrosophicTopology.pdf. [CrossRef]
  10. Lupiáñez, F. G. On neutrosophic topology. Kybernetes 2008, 37(6), 797–800. [Google Scholar] [CrossRef]
  11. Lupiáñez, F. G. Interval neutrosophic sets and topology. Kybernetes 2009, 38(3/4), 621–624. [Google Scholar] [CrossRef]
  12. Lupiáñez, F. G. On various neutrosophic topologies. Kybernetes 2009, 38(6), 1005–1009. [Google Scholar] [CrossRef]
  13. Saber, W.; Nadhim, N. A.; Al-Jumaili, A. M. F. n-refined neutrosophic fuzzy of some topological concepts. Int. J. Neutrosophic Sci. 2023, 21(1), 80–87. [Google Scholar] [CrossRef]
  14. Salama, A. A.; Alblowi, S. A. Neutrosophic set and neutrosophic topological spaces. IOSR J. Math. 2012, 3(4), 31–35. [Google Scholar] [CrossRef]
  15. Singh, P. K. Turiyam set: a fourth dimension data representation. J. Appl. Math. Phys. 2021, 9(7), 1821–1828. [Google Scholar] [CrossRef]
  16. Smarandache, F. n-valued refined neutrosophic logic and its applications to physics. Prog. Phys. 2013, 4, 143–146. Available online: https://fs.unm.edu/n-ValuedNeutrosophicLogic-PiP.pdf. [CrossRef]
  17. Smarandache, F. (T,I,N,F) neutrosophic set and logic (Truth, Indeterminacy, Neutrality, Falsehood). Crit. Rev. 2017, XIV, 20–28. Available online: https://fs.unm.edu/CR/TINF-NeutrosophicSetLogic.pdf.
  18. Smarandache, F. New types of topologies and neutrosophic topologies (improved version). Neutrosophic Sets Syst. 2023, 57, 234–244. [Google Scholar] [CrossRef]
  19. Wang, G.-J.; He, Y. Intuitionistic fuzzy sets and L-fuzzy sets. Fuzzy Sets Syst. 2000, 110(2), 271–274. [Google Scholar] [CrossRef]
  20. Zadeh, L. A. Fuzzy sets. Inf. Control 1965, 8(3), 338–353. [Google Scholar] [CrossRef]
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.