Chapter 1

Prerequisites

This chapter is intended to provide references to concepts and already known results

which are relevant to the following chapters.

1.1 Basic concepts in smooth topological spaces

Lemma 1.1.1 [63] Let λ, µ ∈ I X . Then

(i) λqµ iff ∃ xt ∈ λ ∋ xt qµ.

(ii) λqµ then λ ∧ µ ̸= 0.

(iii) λq̄µ iff λ ≤ 1 − µ.

(iv) λ ≤ µ iff xt ∈ λ implies xt ∈ µ iff xt qλ implies xt qµ implies xt q̄λ.

∨
(v) xt q̄ µi iff ∃ i0 ∈ Λ ∋ xt q̄µi0 .
i∈Λ

1
Definition 1.1.1 [19, 20] A function ρ : I X → I with

(i) ρ(0) = ρ(1) = 1 ,

∨ ∧
(ii) ρ( i∈Γ γi ) ≥ i∈Γ ρ(γi ) , for any {γi }i∈Γ ⊂ I X ,

(iii) ρ(γ1 ∧ γ2 ) ≥ ρ(γ1 ) ∧ ρ(γ2 ) , for any γ1 , γ2 ∈ I X ,

is called as fuzzy topology on X . The pair (X, ρ) is called a smooth topological

space or Š ostak’s fuzzy topological space (for short, sts or Šf ts ). For r ∈ I0 , we

call γ a r -fuzzy open (briefly, r - f o ) set of X if ρ(γ) ≥ r and γ a r -fuzzy closed

(briefly, r - f c ) set of X if ρ(γ c ) ≥ r.

Theorem 1.1.1 [20, 25] Let (X, τ ) be a sts . Then ∀ λ ∈ I X , r ∈ I0 we define

an operator Cτ , Iτ : I X × I0 → I X as
∧ ∨
Cτ (λ, r) = {µ ∈ I X : λ ≤ µ, τ (1 − µ) ≥ r} & Iτ (λ, r) = {µ ∈ I X : λ ≥

µ, τ (µ) ≥ r} .

Definition 1.1.2 [36] Let (X, τ ) be a sts . Then ∀ µ ∈ I X , xt ∈ Pt (X) &

r ∈ I0 ,

(i) µ is called r-open Qτ (resp. Rτ )-neighbourhood of xt is defined as

Qτ (xt , r) = {µ ∈ I X : xt qµ, τ (µ) ≥ r} (resp. Rτ (xt , r) = {µ ∈ I X :

xt qµ, µ = Iτ (Cτ (µ, r), r)} ).

2
 (ii) xt is called r- τ (resp. r- δ ) cluster point of µ if for every λ ∈ Qτ (xt , r),

(resp. λ ∈ Rτ (xt , r), ) we have µqλ.

(iii) An δ -closure operator is a mapping Dτ : I X × I → I X defined as follows:

∨
δCτ (λ, r) or Dτ (λ, r) = {xt ∈ Pt (X) : xt is r- δ -cluster point of λ} .
∧
Equivalently, δCτ (λ, r) = {µ ∈ I X : µ ≥ λ, µ is a r-frc set} and
∨
δIτ (λ, r) = {µ ∈ I X : µ ≤ λ, µ is a r-fro set}.

(iv) µ is called r-fuzzy δ -closed (for short, rf δc ) if µ = δCτ (µ, r) or Dτ (µ, r) .

(v) The complement of rf δc is r -fuzzy δ -open (for short, rf δo ).

Definition 1.1.3 Let (X, ρ) be a sts . For µ ∈ I X & r ∈ I0 , µ is called

(i) r -fuzzy regular open (for short, r - f ro ) (resp. r -fuzzy regular closed (for

short, r - f rc ))[55] if µ = Iρ (Cρ (µ, r), r) (resp. µ = Cρ (Iρ (µ, r), r) ).

(ii) r -fuzzy semiopen (resp. r -fuzzy semi-closed) (briefly, r - f so (resp. r - f sc ))

[43] set if µ ≤ Cρ (Iρ (µ, r), r) (resp. Iρ (Cρ (µ, r), r) ≤ µ).

(iii) r -fuzzy preopen (resp. r -fuzzy preclosed) (briefly, r - f po (resp. r - f pc ))

[39] set if µ ≤ Iρ (Cρ (µ, r), r) (resp. Cρ (Iρ (µ, r), r) ≤ µ).

(iv) r -fuzzy semi-preopen (resp. r -fuzzy semi-preclosed) (briefly, r - f spo (resp.

r - f spc )) [53] set if µ ≤ Cρ (Iρ (Cρ (µ, r), r), r) (resp. Iρ (Cρ (Iρ (µ, r), r), r) ≤

µ).

3
 (v) r -fuzzy strongly semi-open (resp. r -fuzzy strongly semi-closed) (briefly,

r - f sso (resp. r - f ssc )) [54] set if µ ≤ Iρ (Cρ (Iρ (µ, r), r), r) (resp.

Cρ (Iρ (Cρ (µ, . r), r), r) ≤ µ).

(vi) r -fuzzy γ -open (resp. r -fuzzy γ -closed) (briefly, r - f γo (resp. r - f γc ))

[54] set if µ ≤ Cρ (Iρ (µ, r), r) ∨ Iρ (Cρ (µ, . r), r) (resp. Cρ (Iρ (µ, r), r) ∧

Iρ (Cρ (µ, . r), r) ≤ µ).

(vii) the complement of r - f so (resp. r - f po , r - f spo , r - f sso , r - f γo and r -

f δc ) is r - f sc (resp. r - f pc , r - f spc , r - f ssc , r - f γc and r -fuzzy δ -open

(briefly, r - f δo )).

(viii) r -fuzzy δ -semiopen [62] (resp. r -fuzzy δ -semiclosed) (briefly, r - f δso (resp.

r - f δsc )) set if µ ≤ Cρ ( δ - Iρ (µ, r), r) (resp. Iρ (δ - Cρ (µ, r), r) ≤ µ).

(ix) r -fuzzy δ -preopen [62] (resp. r -fuzzy δ -preclosed) (briefly, r - f δpo (resp.

r - f δpc )) set if µ ≤ Iρ ( δ - Cρ (µ, r), r) (resp. Cρ (δ - Iρ (µ, r), r) ≤ µ).

(x) r -fuzzy α -open [54] (resp. r -fuzzy α -closed) (briefly, r - f αo (resp. r-

f αc )) set if µ ≤ Iρ (Cρ ( Iρ (µ, r), r), r) (resp. Cρ (Iρ ( Cρ (µ, r), r), r) ≤ µ).

(xi) r -fuzzy β -open [54] (resp. r -fuzzy β -closed) (briefly, r - f βo (resp. r - f βc ))

set if µ ≤ Cρ (Iρ (Cρ (µ, r), r), r) (resp. Iρ (Cρ (Iρ (µ, r), r), r) ≤ µ).

(xii) r -fuzzy e -open [62] (resp. r -fuzzy e -closed) (briefly, r - f eo (resp. r-

4
 f ec )) set if µ ≤ Cρ (δ - Iρ (µ, r), r) ∨ Iρ ( δ - Cρ (µ, r), r) (resp. Cρ (δ -

Iρ (µ, r), r) ∧ Iρ ( δ - Cρ (µ, r), r) ≤ µ).

(xiii) r -fuzzy e∗ -open [72] (resp. r -fuzzy e∗ -closed) (briefly, r - f e∗ o (resp. r -

f e∗ c )) set if µ ≤ Cρ (Iρ (δ - Cρ (µ, r), r), r) (resp. Iρ (Cρ (δ - Iρ (µ, r), r), r) ≤

µ).

Definition 1.1.4 Let (X, ρ) be a sts . γ, µ ∈ I X & r ∈ I0 ,

∨ ∨
(i) ssIρ (γ, r) = {µ ∈ I X : µ ≤ γ, µ is r -fsso} (resp. pIρ (γ, r) = {µ ∈ I X :
∨
µ ≤ γ, µ is r -fpo} & e∗ Iρ (γ, r) = {µ ∈ I X : µ ≤ γ, µ ) is a r - f e∗ o set

} is called the r -fuzzy strongly semi-interior [39] (resp. r -fuzzy pre-interior

[39] and r -fuzzy e∗ -interior [72]) (briefly, ssIρ (γ, r) (resp. pIρ (γ, r) &

e∗ Iρ (γ, r) ) of γ .

∧ ∧
(ii) ssCρ (γ, r) = {µ ∈ I X : µ ≥ γ, µ is r -fssc} (resp. pCρ (γ, r) = {µ ∈ I X :
∧
µ ≥ γ, µ is r -fpc} & e∗ Cρ (γ, r) = {µ ∈ I X : µ ≥ γ, µ is a r - f e∗ c set

}) is called the r -fuzzy strongly semi-closure [39] (resp. r -fuzzy pre-closure

[39] & r -fuzzy e∗ -closure [72]) (briefly, ssCρ (γ, r) (resp. pCρ (γ, r) &

e∗ Cρ (γ, r) )) of γ .

Theorem 1.1.2 [38, 39, 55] Let (X, τ ) be a sts . Then ∀ λ ∈ I X , r ∈ I0 ,

(i) Any union of r - f sso (resp. r - f po ) sets is r - f sso (resp. r - f po ).

5
 (ii) Any intersection of r - f ssc (resp. r - f pc ) sets is r - f ssc (resp. r - f pc ).

(iii) λ is r - f sso (resp. r - f po & r - f so ) iff λ = ssIτ (λ, r) (resp. pIτ (λ, r)

& sIτ (λ, r) ).

(iv) λ is r - f ssc (resp. r - f pc & r - f sc ) iff λ = ssCτ (λ, r) (resp. pCτ (λ, r)

& sCτ (λ, r) ).

(v) Iτ (λ, r) ≤ ssIτ (λ, r) ≤ λ ≤ ssCτ (λ, r) ≤ Cτ (λ, r).

(vi) 1 − ssIτ (λ, r) = SSCτ (1 − λ, r) & 1 − ssCτ (λ, r) = SSIτ (1 − λ, r).

(vii) Iτ (λ, r) ≤ pIτ (λ, r) ≤ λ ≤ pCτ (λ, r) ≤ Cτ (λ, r).

(viii) 1 − pIτ (λ, r) = pCτ (1 − λ, r) and 1 − pCτ (λ, r) = pIτ (1 − λ, r).

(ix) Iτ (λ, r) ≤ sIτ (λ, r) ≤ λ ≤ sCτ (λ, r) ≤ Cτ (λ, r).

(x) sCτ (sCτ (λ, r), r) = sCτ (λ, r).

(xi) Cτ (sCτ (λ, r), r) = sCτ (Cτ (λ, r), r) = Cτ (λ, r).

(xii) sIτ (1 − λ, r) = 1 − sCτ (λ, r).

Definition 1.1.5 Let (X, τ1 ) and (X, τ2 ) be sts’s and f : (X, τ1 ) → (Y, τ2 ) a

mapping, then f is called fuzzy

(i) continuous [53] (resp. contra continuous) (briefly, F Cts (resp. F cCts )) if

τ2 (µ) ≤ τ1 (f −1 (µ)) (resp. τ2 (µ) ≤ τ1 (1 − f −1 (µ)) ) ∀ µ ∈ I Y .

6
 (ii) semicontinuous [59] (resp. strongly semi-continuous [54], precontinuous

[43], semi-precontinuous [54] & γ -continuous [54]) (briefly, F sCts (resp.

F ssCts , F pCts , F spCts & F γCts )) if f −1 (µ) is r - f so (resp. r - f sso ,

r - f po , r - f spo & r - f γo ) ∀ µ ∈ I X , r ∈ I0 with τ2 (µ) ≥ r .

(iii) open (resp. closed ) [53] (briefly, F O (resp. F C )) if τ1 (λ) ≤ τ2 (f (λ)) (resp.

τ1 (1 − λ) ≤ τ2 (1 − f (λ))) for each λ ∈ I X .

(iv) semiopen [43] (resp. strongly semiopen [54], preopen [39], semi-preopen [54]

& - γ -open [54]) (briefly, F sO (resp. F SsO , F pO , F spO & F γO )) if

f (λ) is r - f so (resp. r - f sso , r - f po , r - f spo & r - f γo ) set of Y for each

λ ∈ I X , r ∈ I0 with τ1 (λ) ≥ r .

(v) semiclosed [43] (resp. strongly semi-closed [54], preclosed [39], semi-preclosed

[54] & - γ -closed [54]) (briefly, F sC (resp. F SsC , F pC , F spC & F γC ))

if f (λ) is r - f sc (resp. r - f ssc , r - f pc , r - f spc & r - f γc ) set of Y for

each λ ∈ I X , r ∈ I0 with τ1 (1 − λ) ≥ r .

(vi) irresolute [55] (briefly, FI) if f −1 (µ) is r - f so of X ∀ µ is r - f so set of Y,

r ∈ I0 .

(vii) contra pre-continuous [16] (briefly, F cpCts ) if f −1 (µ) is r -fpc set of X ∀

η(µ) ≥ r, r ∈ I0 .

7
(viii) contra open (resp. contra closed) (briefly, F cO (resp. F cC )) if ∀ λ ∈ I X

we have η(1 − f (λ)) ≥ τ (λ) (resp. η(f (λ)) ≥ τ (1 − λ) ).

(ix) irresolute preopen (or) M-preopen [60] (briefly, F IpO (or) F M pO ) if f (µ)

is r - f po set of X ∀ r - f po set µ ∈ I Y , r ∈ I0 .

(x) irresolute preclosed (or) M-preclosed [60] (briefly, F IpC (or) F M pC ) if f (µ)

is r - f pc set of Y ∀ r - f pc set µ ∈ I X , r ∈ I0 .

(xi) S -irresolute open ( resp. strongly semi-open) [1] (briefly, F SIO (resp.

F ssO )) if f (µ) is r - f sso set of Y ∀ r - f sso set µ ∈ I X (resp. τ (µ) ≥

r), r ∈ I0 .

(xii) S -irresolute closed (resp. strongly semi-closed) [1] (briefly, F SIC (resp.

F ssC )) if f (µ) is r - f ssc set of Y ∀ r - f ssc set µ ∈ I X (resp. τ (1 − µ) ≥

r), r ∈ I0 .

(xiii) S -irresolute continuous (resp. strongly semi-continuous) [1] (briefly, f SICts

(resp. f ssCts )) if f −1 (µ) is r - f sso set of X ∀ r - f sso set µ ∈

I Y (resp. η(µ) ≥ r), r ∈ I0 .

(xiv) contra S -irresolute continuous [73] (resp. contra semi- S -irresolute continuous

[22]) (briefly, F cSICts (resp. F csSICts )) if f −1 (µ) is r - f ssc (resp. r -

f sc ) set of X ∀ r - f sso set µ ∈ I Y , r ∈ I0 .

8
1.2 Smooth bitopological spaces

A system (X, τ1 , τ2 ) consisting of a set X with two smooth topologies τ1 and

τ2 on X is called a smooth bitopological space (for short, sbts ). Throughout in

chapter 3, the indices i, j take values in {1, 2} and i ̸= j. Let (X, τ ) be a smooth

topological space. Then

τr = {µ ∈ I X : τ (µ) ≥ r}

for each r ∈ I0 is Chang’s fuzzy topology [53] on X .

Let (X, τ ) be a Chang’s fuzzy topological space and r ∈ I0 . Then the map

τr : I X → I defined by





 1, if µ = 0, 1 ,


τ r (µ) = r, if λ ∈ τ − {0, 1},





0, otherwise,

becomes a smooth topology.

Remark 1.2.1 If (X, τ1 , τ2 ) is a sbts and r, s ∈ I0 , then (X, (τ1 )r , (τ2 )s )

is a Kandil’s fuzzy bitopological space. Also, if (X, τ1 , τ2 ) is a Kandil’s fuzzy

bitopological space and r, s ∈ I0 , then (X, (τ1 )r , (τ2 )s ) is a sbts .

Definition 1.2.1 [72] Let λ be a fuzzy set of a sbts (X, τ1 , τ2 ) and r, s ∈ I0 .

Then λ is called a

9
 (i) (τi , τj ) -fuzzy (r, s) - e -open (briefly, (τi , τj ) - f (r, s)eo )set if

λ ≤ (Cτj (δIτi (λ, r), s)) ∨ (Iτi (δCτj (λ, s), r)),

(ii) (τi , τj ) -fuzzy (r, s) - e -closed (briefly, (τi , τj ) - f (r, s)ec ) set if

(Cτi (δIτj (λ, s), r)) ∧ (Iτj (δCτi (λ, r), s)) ≤ λ.

(iii) (τi , τj ) -fuzzy (r, s) - δ -semiopen (briefly, (τi , τj ) - f (r, s)δso ) set if

λ ≤ Cτj (δIτi (λ, r), s)

(iv) (τi , τj ) -fuzzy (r, s) - δ -semiclosed (briefly, (τi , τj ) - f (r, s)δsc ) set if

λ ≥ Iτj (δCτi (λ, r), s)

(v) (τi , τj ) -fuzzy (r, s) - δ -preopen (briefly, (τi , τj ) - f (r, s)δpo ) set if

λ ≤ Iτi (δCτj (λ, s), r),

(vi) (τi , τj ) -fuzzy (r, s) - δ -preclosed (briefly, (τi , τj ) - f (r, s)δpc ) set if

λ ≥ Cτi (δIτj (λ, s), r),

λc is respective open or closed sets.

10
Definition 1.2.2 [42] Let f : (X, τ1 , τ2 ) → (Y, η1 , η2 ) be a mapping & r, s ∈ I0 .

Then f is called a fuzzy pairwise (r, s) -continuous ( (r, s) -open and (r, s) -closed,

respectively) (briefly, F P (r, s)Cts (resp. F P (r, s)O and F P (r, s)C ) mapping if

the induced mapping f : (X, τ1 ) → (Y, η1 ) is a fuzzy r -continuous ( r -open and

r -closed, respectively) (briefly, F rCts (resp. F rO and F rC ) mapping and the

induced mapping f : (X, τ2 ) → (Y, η2 ) is a fuzzy s -continuous ( s -open and

s -closed, respectively) (briefly, F sCts (resp. F sO and F sC ) mapping.

1.3 Basic concepts in fuzzy multifunctions

In chapters 4 and 5, L = [0, 1] and L0 = (0, 1]. LX denotes the family of all fuzzy

sets in X . This symbol ( for a multifunction.

For α ∈ L, α(x) = α for all x ∈ X. A L  fuzzy point (for short, Lf p ) xt for



t if y = x
t ∈ L0 is an element of L such that xt (y) =
X
LP t(X) denotes the


0 if y ̸= x.
family of all Lf p in X . A Lf p, xt ∈ λ iff t ≤ λ(x).

Definition 1.3.1 [4] Let F : X ( Y, then F is called a fuzzy multifunction (FM,

for short) if F (a) ∈ LY ∀ a ∈ X. F (a)(b) = GF (a, b) denotes the degree of

membership of b in F (a) for any (a, b) ∈ X × Y. The domain of F, denoted by

dom(F ) & the range of F, denoted by rng(F ), for any a ∈ X & b ∈ Y, are
∨ ∨
defined by : dom(F )(a) = b∈Y GF (a, b) & rng(F )(b) = a∈X GF (a, b) ; In [4],

11
Normalized if ∀ a ∈ X, ∃ b0 ∈ Y ∋ GF (a, b0 ) = 1 ; A crisp if GF (a, b) = 1 ∀

a ∈ X & b ∈ Y ; The image of λ ∈ LX is an L - f s F (λ) ∈ LY defined by

∨
F (λ)(b) = [GF (a, b) ∧ λ(a)]
a∈X

; The lower inverse of µ ∈ LY is an L - f s F l (µ) ∈ LX defined by

∨
F l (µ)(a) = [GF (a, b) ∧ µ(b)]
b∈Y

; The upper inverse of µ ∈ LY is an L - f s F u (µ) ∈ LX defined by

∧
F u (µ)(a) = [GcF (a, b) ∨ µ(b)]
b∈Y

; The composition of two FM H & F , H ◦ F is defined by

∨
((H ◦ F )(a))(c) = [GF (a, b) ∧ GH (y, c)]
b∈Y

were discussed.

Theorem 1.3.1 [4] Let F : X ( Y & H : Y ( Z be FM. Then

(i) F (µ) ≤ F (γ) if µ ≤ γ.

(ii) F l (µ) ≤ F l (γ) & F u (µ) ≤ F u (γ) if µ ≤ γ.

(iii) F l (µc ) = (F u (µ))c .

12
 (iv) F u (µc ) = (F l (µ))c .

(v) F (F u (µ)) ≤ µ if F is a crisp.

(vi) F u (F (λ)) ≥ λ if F is a crisp.

(vii) (H ◦ F ) = F (H).

(viii) (H ◦ F )u = F u (H u ).

(ix) (H ◦ F )l = F l (H l ).

∪ ∨
(x) ( Fi )(λ) = Fi (λ).
i∈Γ i∈Γ

∪ ∨
(xi) ( Fi )l (µ) = Fil (µ).
i∈Γ i∈Γ

∪ ∧
(xii) ( Fi )u (µ) = Fiu (µ).
i∈Γ i∈Γ

Definition 1.3.2 [4, 52] Let (X, τ ) & (Y, η) be two L -fts’s, a FM F : X ( Y

is said to be

(i) Fuzzy upper (or semi) (resp. α , e & β )-continuous (in short, F U Cts (or

F U sCts ) (resp. F U αCts , F U eCts & F U βCts )) at a Lf p xt ∈ dom(F )

if xt ∈ F u (µ) for each µ ∈ LY & η(µ) ≥ r, there exists λ ∈ LX , τ (λ) ≥ r

(resp. r -f α o, r -feo & r -f β o set) & xt ∈ λ such that λ∧dom(F ) ≤ F u (µ).

F is F U Cts (or F U sCts ) (resp. F U αCts , F U eCts & F U βCts ) if it

13
 is F U Cts (or F U sCts ) (resp. F U αCts , F U eCts & F U βCts ) at every

xt ∈ dom(F ).

(ii) Fuzzy lower (or semi) (resp. α , e & β )-continuous (in short, F LCts (or

F LsCts ) (resp. F LαCts , F LeCts & F LβCts )) at a Lf p xt ∈ dom(F )

if xt ∈ F l (µ) for each µ ∈ LY & η(µ) ≥ r, there exists λ ∈ LX , τ (λ) ≥ r

(resp. r -f α o, r -feo & r -f β o set) & xt ∈ λ such that λ ≤ F l (µ). F is

F LCts (or F LsCts ) (resp. F LαCts , F LeCts & F LβCts if it is F LCts

(or F LsCts ) (resp. F LαCts , F LeCts & F LβCts at every xt ∈ dom(F ).

(iii) Fuzzy [4] (resp. F α [30], F e [52] & F β [6])- Cts if it is F U Cts (resp.

F U αCts , F U eCts & F U βCts ) & F LCts (resp. F LαCts , F LeCts &

F LβCts ).

(iv) Fuzzy upper contra continuous (resp. Fuzzy upper almost contra continuous)

( F U cCts (resp. F U acCts ), in short) at any Lf p xt ∈ dom(F ) if xt ∈

F u (µ) for each µ ∈ LY & η(µc ) ≥ r (resp. µ is r - f rc ), there exists

λ ∈ LX , τ (λ) ≥ r & xt ∈ λ such that λ ∧ dom(F ) ≤ F u (µ).

(v) Fuzzy lower contra continuous (resp. Fuzzy lower almost contra continuous)

( F LcCts (resp. F LacCts ), in short) at any Lf p xt ∈ dom(F ) if xt ∈ F l (µ)

for each µ ∈ LY & η(µc ) ≥ r (resp. µ is r - f rc ), there exists λ ∈ LX ,

τ (λ) ≥ r & xt ∈ λ ∋ λ ≤ F l (µ).

14
 (vi) F U cCts (resp. F LcCts , F U acCts & F LacCts ) if it is F U cCts (resp.

F LcCts , F U acCts & F LacCts ) at every xt ∈ dom(F ) .

(vii) Fuzzy upper weakly contra continuous ( F U wcCts , in short) at an Lf p

xt ∈ dom(F ) if xt ∈ F u (µ) for each µ ∈ LY & µ is r - f c , there exist

λ ∈ LX , τ (λ) ≥ r & xt ∈ λ such that λ ∧ dom(F ) ≤ F u (Cη (µ, r)).

(viii) Fuzzy lower weakly contra continuous ( F LwcCts , in short) at an Lf p

xt ∈ dom(F ) if xt ∈ F l (µ) for each µ ∈ LY & µ is r - f c , there exist

λ ∈ LX , τ (λ) ≥ r & xt ∈ λ such that λ ≤ F l (Cη (µ, r)) .

(ix) F U wcCts (resp. F LwcCts ) if it is F U wcCts (resp. F LwcCts ) at every

xt ∈ dom(F ).

(x) Fuzzy upper e∗ (in short, F U e∗ I at any Lf p xt ∈ dom(F ) if xt ∈ F u (µ)

for each µ ∈ LY & r -f e∗ o set, there exists r -f e∗ o set λ ∈ LX & xt ∈ λ

such that λ ∧ dom(F ) ≤ F u (µ).

(xi) Fuzzy lower e∗ (in short, F Le∗ I at any Lf p xt ∈ dom(F ) if xt ∈ F l (µ) for

each µ ∈ LY & r -f e∗ o set, there exists r -f e∗ o set λ ∈ LX & xt ∈ λ such

that λ ≤ F l (µ).

(xii) F U e∗ I & F Le∗ I if it is F U e∗ I & F Le∗ I at every xt ∈ dom(F ) .

(xiii) the graph fuzzy multifunction [7, 46] Gf : X → X × Y of F is defined as

15
 Gf (x) = x1 × F (x), ∀ x ∈ X.

Theorem 1.3.2 [4] For a FM F : X ( Y & µ ∈ LY ,

(i) F is F LCts iff τ (F l (µ)) ≥ η(µ).

(ii) If F is normalized, then F is F U Cts iff τ (F u (µ)) ≥ η(µ).

(iii) F is F LCts iff τ (1 − F u (µ)) ≥ η(1 − µ).

(iv) If F is normalized, then F is F U Cts iff τ (1 − F l (µ)) ≥ η(1 − µ).

Remark 1.3.1 [7, 74] Let (X, τ ) & (Y, η) be an L -fts’s. An L - f s of the form

λ × µ with τ (λ) ≥ r and η(µ) ≥ r form a basis for the product Lf t τ × η on

X × Y, where for any (a, b) ∈ X × Y, (λ × µ)(a, b) = min{λ(a), µ(b)}.

All other notations are from L -fuzzy set theory.

1.4 Nano topological spaces

Lellis Thivagar [44] introduced the notion of Nano topology (briefly, NT ) by using

theory approximations and boundary region of a subset of an universe in terms of

an equivalence relation [48] on it and also defined Nano open (briefly, No ), Nano

closed (briefly, Nc ) sets , Nano-interior (briefly, Nint ) and Nano-closure (briefly,

Ncl ) in a nano topological spaces (briefly, Nts ).

16
Definition 1.4.1 [44, 56] Let (U, τR (X)) be a Nts & A ⊆ U . Then A is

said to be, Nano semiopen (resp. Nano preopen, Nano α -open & Nano β -

open), (briefly, NSo (resp. NPo ), Nαo & Nβo ) if A ⊆ Ncl(Nint(A)) (resp.

Nint(Ncl(A)) , Nint(Ncl(Nint(A))) & Ncl(Nint(Ncl(A))) ); the nano θ -interior

∪
(resp. nano θ -closure) [57] of A is defined and denoted by Nintθ (A) = {B :
∪
B is a No set and Ncl(B) ⊆ A} (resp. Nclθ (A) = {x ∈ U : Ncl(B) ∩ A ̸=

ϕ, B is a No set and x ∈ B} ).

Definition 1.4.2 [57] A subset A of X is said to be nano θ -open (resp. nano

θ -closed) (briefly, Nθo (resp. Nθc )) set if A = Nintθ (A) (resp. Ac is a nano

θ -open set).

Definition 1.4.3 Let A be a subset of a and x ∈ U then a set A is called Nano

neighborhood [57] (briefly, NN bd ) of x ∈ U in if there is a No set G ⊆ A with

x ∈ G.

The collection of all NN bd of x ∈ U is called NN bd system of x and is denoted

by NN bdS(x) .

Definition 1.4.4 A function f : (U, τR (X)) → (V, σR (Y )) (briefly, f ) is said to be

nano continuous [57] (briefly, NCts ), if for each Nc set A of V, the set f −1 (A) is

Nc set of U.

≥
Definition 1.4.5 [75] The inclusion dominance relation RA is defined as set of all

17
y ∈ U such that y is atleast as good as x with respect to the class of attributes

A.

In chapter 6, (U, τR (X)) is a Nts with respect to X where X ⊆ U, R is an

equivalence relation on U. Then U/R denotes the family of equivalence classes of

U by R , f , g etc. denote the functions between nano topological spaces. All other

undefined notions from [41, 44, 48, 75].

18