Chapter-3

Pre-irresolute and Pre-continous

Functions, Pre- connected and
Pre-closed sets on Smooth
Fuzzy Semigroups
Chapter – 3

Pre-irresolute and Pre-continuous Functions,

Pre- connected and Pre-closed sets
on Smooth Fuzzy Semigroups

3.1 Introduction :

In 1971, Rosenfeld was introduced Fuzzy ideals and fuzzy subgroups,

notation was introduced Abou-Zaid S.1. In it has been established that
homomorphic image of a fuzzy left (right) Ideals. The level fuzzy subsets and
obtained some properties based on near-ring Homomorphism properties of
anti-homomorphic images A near-ring are discussed. Homomorphic Images
and pre images of anti fuzzy ideals are investigated. The present work on Anti-
Homomorphism in Fuzzy ideals of Near-ring and Ideal and Anti Ideals are
discussed. Established near-ring anti ideal to be characteristic. Our aim is
present work to investigate the purity of the ideals on smooth semigroups.
Smooth groups were due to Warrack B. D.125. We prove every ideal of a
semigroup S is globally idempotent iff it is complete. Clifford. A. H.14-17
observed some basic necessary conditions and Szasz G.117-119 indicated an
analogous notion of pure subgroup of an ablelian group. Further we proved A
is ℑ-pure iff A ∩ [ x ]S = [ x ] A, A ∩ S [ x ] = A[ x ]∀ x ∈ S and generalized the theorem
of Kuroki N.54-59 to obtain some important results which are useful in
poroscopy of a finger prints. The aim of this paper is to introduce some
concepts of preconnected spaces of the notion of preopen sets, to investigates
their characterizations and relationships to some well-known classes of
toplogical spaces. Several characterizations of reconnected fuzzy graphs and
precontinuity are obtained.

3.2 Semi-Preopen Functions and Preclosed Sets

We introduce the concepts of semi-precontinuous mappings, semi-

priopen mappings, semi-preclosed mappings, semi-preirresolute mappings, pre-
16
semi-preopen mapping and pre-semi-preclosed mappings and observe their
characterizations in algebraic structures using these investigation we also
introduce and study the concepts of approximately semi-preirrisolute
mappings, and approximately semi-preclosed mappings and the notions of
contra-semi-preirresolute mappings to study the characterizations.

Semi-Precontinuous Functions

In the present work we introduce new extension forms of continuity using

semi-preopen sets and obtain Theorems, Lemmas and their properties.

Definition 27: A function f : X → Y is called semi-precontinuous if the

inverse image of each open set in Y is a semi-preopen set in X. Every
continuous function is a semi-precontinuous function but not the converse;
which is verified by the following example.

We give some examples to verify that the every continuous function is a

semi-precontinuous function but not the converse.

Example 1: Let X = {a , b, c}, Subset m1={ φ , {a}, {b}, {a,b}, X},

Y={1,2,3,4}, m2={ φ , {1}, {1,2}, {1,2,3}, Y}. A function f : X → Y is defined
by f(a)=1, f(b)=3, f(c)=2.

Here SPO(m1)={ φ , {a}, {b}, {a,b}, {a,c}, {b,c},X}. Then f is semi-

precontinuous. But f is not continuous since f -1({1,2})={a,c}, which is not a
m1-open set.

Example 2 : If f : X→Y is open, a. c. s, and preirresolute map then

f -1(B)∈SPO(Y). This B is an arbitrary semi-preopen set in Y. then there exists a
pre-continuous such that V⊂R⊂clV. Now, by the a.c.s ness of f, we have
f-1(V) ⊂f(clV).

Theorem 16: Let f : X→Y be a single-valued function, where X and Y sets.

Then the following are equivalent:

17
 (i) The function f is semi-pre continuous

(ii) For each point p ∈ X and each open set V in Y with f (p)∈V, there
is a SPO set U in X such that p∈U, f(U) ⊆ V.

(iii) The inverse of each closed set is semi-pre closed.

(iv) For each x∈X, the inverse of every neighborhood of f(x) is a semi
pre neighborhood of x.

(v) For each x∈X and each neighborhood Nx of f(x). there is a semi-
pre neighborhood V of x such that f (V) ⊆ Nx.

(vi) For each subset A of X, f[(As)*]⊆cl[f(A)].

(vii) For each subset B of Y, ((f-1(B))s)*⊆f-1(cl(B)).

Proof : (i) ⇔ (ii). Let f (p)∈V and V⊂ Y an open set, then p∈f-1(V)
∈SPO(subset); since f is semi-pre continuous. Let U=f-1(V), then p∈U and
f(U)⊂V. Conversely, let V be open in Y and p∈f-1(V) then f(p)∈V there exists a
Up∈SPO(subset) such that p∈Up and f(Up)⊂V. Then p∈Up)⊂f-1(V) and
f-1(V)=∪Up, but by Note 1, f-1(V)∈SPO(subset), which implies that f is semi-
precontinuous.

(ii) ⇔ (iii). Assume f is semi-precontinuous. Let B be a closed subset of

Y. Then Y-B is open set in Y and f-1(Y-B)=X-f-1(B)∈SOP(subset), which implies
that f-1(B) is sp-closed. Conversely, assume (iii) Let G be an open set in Y then
Y - G is a closed set in Y. Then f-1(Y - G)= then f-1(G) is SPO in X which implies
that f is semi-recontinuous.

(iii) ⇔ (iv). Assume (iii) for x∈X, let V be the openset of f(x) then
f(x)∈W⊂V where W=Y-F and F is closed in Y. Consequently, f-1(W) is a semi-
preopen set in X. since f-1(W)= f-1(Y - F)=X - f-1(F), f-1(F) is sp-closed by
hypothesis, and x∈ f-1(W)⊂ f-1(V). Then by definition, f-1(V) is a semi subset of x.

18
 (iv) ⇔ (v). Let x∈X and Nx be a subset of f(x). Then V= f-1(Nx) is a sp-
nhd of x and f f (V), = f f-1(Nx))⊂Nx.

(v) ⇔ (ii). For x in X, let W be an open set containing f(x). Then W is a

subset V of x such that x∈V and f(V)⊂W.

(iii) ⇔ (vi). Suppose tha (iii) holds and let A be a subset of X. Since

A⊂ f-1(f(A)), we have A⊂ f-1[cl(f(A))]. Now, cl (f (A) is a closet set in Y and

hence is a sp-closed set containing A, consequently, (As)* ⊂ f-1{cl(f (A))}.
Then, f [(As)*⊂ f f-1{cl(f(A))}⊂cl[f(A)]. Conversely, suppose that (vi) holds for
any subset A of X. Let F be a closed subset of Y. Then, f [((f-1)(F))s)*]⊂ cl(f( f-
1
(F)))⊂clF=F which implies that ((f-1(F))s)*⊂f-1(F). Consequently, the inverse
of a closed set is semi-preclosed.

(vi)⇔(vii) obvious.

A subset A of X is called regular open if A=intclA and so a mapping f : X → Y is

called almost continuous (written as a.c.s) if the inverse image of each regular
open set is open.

Lemma 1: If f : X → Y is an open a.c.s, and preirresolute map then

f-1 (B) ⊂ SPO(X) for each B ∈ SPO(Y).

Proof : Suppose B is an arbitrary semi-preopen set in Y. Then there exists a

pre-open set V in Y such that V ⊂ B ⊂ cl(V). Now, by the a.c.sness of f, we
have f-1 (B) ⊂ f-1 (clV)= clf-1 (V))[5]. Since f is preirresolute and V is a preopen
set in Y, f-1 (V) ⊂ PO(X). Hence, f-1 (V) ⊂ f-1 (B) ⊂ (cl(f-1(V)) which implies
that f-1 (B) ∈ SPO(X).

Lemma 2: If f : X → Y is an open, a.c.s, and pre irresolute mapping then the

inverse image of each semi pre closed set Y is a semi-pre closed set in X.
The proof is similar to Lemma 1.

19
Theorem 17: Let f : X → Y be a mapping. Then the following are
equivalent:
(i) The mapping f is semi-precontinuous.
(ii) For each subset G of Y, f-1 (int G) ⊂ ((f-1 (G))s)*.

Proof : (i) ⇔ (ii). Let G be any subset of Y. Then int G is an open set in Y.
and f-1(int G) is a semi-preopen set in X, f is semi-precontinuous. As
f-1(int G) ⊂ f-1(G), then f-1(int G) ⊂ ((f-1(G))s)*.
Lemma 3: If U is open and A is semi-preopen then U ∩ A is a semi-preopen set.

Lemma 4: Let A be a semi-preopen set in a space X and suppose

A ⊂ B ⊂ clA, then B is a semi-preopen set.

Proof : Since A is a semi-preopen set in X, then there exists a preopen set U

in X such that U ⊂ B ⊂ clU, which implies that B is a semi-preopen set.

Theorem 18 : If A ⊂ Xo ⊂ X, and Xo ∈ SPO(X). Then A ∈ SPO(X) if and

only if A ∈ SPO(Xo).

Proof : Necessity : since A ∈ SPO(X), then there exists a preopen set U ⊂ X

such that U ⊂ A ⊂ clU. Let clx and clxo denote, respectively, the closure
operator in X and Xo. Now, U ⊂ X0 as X0 ⊂ X. Then, U = U ∩ X0 ⊂ A ∩ X0 ⊂
X0 ∩ clx U, or U ⊂ A ⊂ clxo U, since U = U ∩ X0 and U is preopen in X0. Now,
U ⊂ X0 as X0 ⊂ X. Then, U = U ∩ X0 ⊂ A ∩ X0 ⊂ X0 ∩ clx U, or U ⊂ A ⊂ clxo
U, since U = U ∩ X0 and preopen in X0 by Shabbir A., El-Deeb N. and
Hasenein I. A.26 then it follows that A ∈ SPO(X0 ). The converse is easy and
hence it is omitted.

Lemma 5: For every A ∈ SPO(X), clA = clA.

Lemma 6 : A is a semi-preopen set and A ≠ φ then int clA ≠ φ .

20
Proof : Let A be a semi-preopen set such that A ≠ φ . Then by Lemma 5,
clA = clint clA. If int clA= φ . then clA= φ implies A= φ , which is in
contradiction to the hypothesis. Hence, intclA ≠ φ .

Theorem 19: If f : X → Y a semi-pricontinuous map and Xo is an open set in

X, then the restriction f / Xo : Xo → Y is semi-precontinuous.

Definition 28: A cover u={Uα|α∈Δ} of subsets of X is called a Sp-cover if

Uα is semi-preopen for each α∈Δ.
Now we prove the following theorem.

Theorem 20: Let f : X → Y be a map and {Aα|α∈Δ} a sp – cover of X. If

the restriction, f / Aα: Aα → Y is semi-continuous for each α∈Δ, then f is semi-
precontinuous.

Proof : Suppose V is an arbitrary open set in Y. Then for each α∈Δ, we have
(f /Aα)-1 (V) = f -1
(V) ∩ Aα∈ SPO(Aα) since f /Aα is semi – precontinuous.
Hence by Theorem 3, f -1(V)∩ Aα)∈ SPO(X) for each α∈Δ. But we know that
arbitrary union of semi-preopen sets is a semi-preopen set, thus, we obtain that
-1 -1
∪α∈Δ [f (V)∩ Aα]= f (V)∈ SPO(X). This implies that f is a semi-
precontinuous map.

Lemma 7: Let {Xα|α∈Δ} be a family of algebra spaces and ΠAα a subset of

ΠXα , where ΠXα denotes the product space. Then,

i) int ΠAα = Πint Aα if Aα = Xα except for a finite number of α∈Δ and ΠAα ≠ Ø,

ii) clΠAα = ΠclAα.

Now, in view of Lemma 7, one can prove the following lemma.

Lemma 8: Let X1 and X2 be algebra spaces. If Ai is a semi-preopen set in Xi

for each i= 1, 2 then A1 × A2 is a semi-preopen set in the preproduct space X1 ×
X2. The following theorem proved by Park J. H. and Parth Y. B. [205] is the
generalization of Lemma 8.

21
Theorem 21: Let {Xα|α∈Δ} be a family of algebra, X=ΠXα, the product
space, and A=Πnj=1Aαj × Πα≠αj Xα a nonempty subset of X, where n is a positive
integer. Then, Aαj ∈SPO(Xαj) for each j(1≤ j ≤ n) if and only if A∈SPO(X).

Theorem 22: Let Xi and Yi be algebra and fi : Xi → Yi be a semi-

precontinuous mapping for i = 1, 2. Then a mapping f : X1 × X2→ Y1 × Y2
defined by putting f (( x1),(x2)) semi-precontinuous.

Proof: Let O1 × O2 ⊂ Y1 × Y2, where Oi is open in Yi for i = 1, 2. Then,

f -1 (O1 × O2)= f -1 (O1)× f -1 (O2). But f -1 (O1), f -1 (O2) are semi-preopen sets in
X1 and X2, respectively, then × f -1 (O2) is semi-preopen in X1 × X2) by Lemma
8. Now if O is any open set in (Y1 × Y2) then f -1 (O1)= ∪ f -1 (Oα), where Oα is
of the from Oα1× (Oα2). Then f -1(O) = ∪ f -1 (Oα), which is a semi-preopen set
since arbitrary union of semi-preopen sets is a semi-propen set. Hence by
arguing as above, f -1 (O1×O2) is a semi-preopen set in (X1×O2). Hence f is
semi-precontinuous.
Theorem 23: Let Let {Xα|α∈Δ} and Let {Yα|α∈Δ} be any two families of
algebra spaces with the same index set Δ. For each α∈Δ. Let fα : Xα → Yα be a
mapping, then fα : ΠXα → ΠYα defined by f((xα)) = ( fα (xα)) is semi-
precontinuous if and only if fα is semi-precontinuous for each α∈Δ.

3.3 Semi-preirresolute and Precontinuous Functions

Definition 29: A function f : (X,τ )→ (Y, σ) is called semi-preopen if the

image of each open set in X is a semi-preopen set in Y. We give an example to
show that every open map is semi-preopen but not the converse.

Example 3 : X={p,q,r},τ ={Ø,{p},{p,q},X},Y={a,b,c},σ ={Ø,{a},{a,b},Y}.

Then it is clear that τ and σ are algebra on X and Y, respectively. If f:(X,τ )→ (Y,
σ) is a map defined by f (p) = a, f (q) = c, and f (r )= b. It is clear that f is a
semi-preopen mapping but it is not open mapping since f : ({p,q})= {a,c}∈ σ.
We note that every preopen map is a semi-preopen map.

22
Lemma 9: The following are equivalent for a subset A of a space X:

(i) A ∈ SPO(X)

(ii) A ⊂ cl(int (cl(A)))

(iii) A ⊂ s int (scl(A))

Theorem 24: A mapping f : X → Y is semi-preopen if and only if for every

subset A ⊂ X, f (int A)⊂ s int(s cl(A)).

Proof: Let f be a semi-preopen map. We have, f (int A)⊂ f(A) for each , A⊂ X
and by hypothesis , f (int A) is a semi-preopen set in Y and by Lemma 9, , f (int
A)⊂ s int cl(f(A)). Conversely, let the given condition holds true and G any
open set in X. Then , f (G) = f (int G) ⊂ s int s cl f (G). Thus, f (G) is a semi-
preopen set in Y by Lemma 9 and hence f is a semi-preopen map.

Theorem 25: Let X , Y and Z be three algebra spaces and let f : X → Y and
g : Y → Z be two mappings with gο X → Z is a semi-preopen mapping. Then,

(i) If f is continuous and surjective, then g is semi-preopen.

(ii) If g is preopen, preirresolute, and injective, then f is semi-preopen.

Lemma 10: If f : X → Y is semi-preclosed, then for each subset V of Y and

-1
each open set U of X containing f (V), there exists w ∈ SPO(Y) such that
V⊂ W and f -1 (W) ⊂ U.

Proof :

(i) Let V be an arbitrary open set in Y. Since g ° f is semi-preopen and f is

surjective then g(V)= g ° f {f -1(V)} is a semi – preopen set in Z. This

shows that g is a semi-preopen map.

(ii) Since g is injective, we remark that f(A)=g-1[g(f(A))] for every subset

A of X. Let U be an arbitrary open set in X, then by hypothesis,

23
 g ° f(U) is a semi-preopen set in Z. Then by Note 1, we have

f(U)=g-1(g ° f(U))∈SPO(Y) which implies that f(U) is a semi-preopen

set in Y. Hence, f is a semi-preopen map.

Semi-Preclosed Functions

Definition 30: A function f : X → Y is called semi-preclosed if the image of

each closed set in X is a semi-preclosed set in Y. We give an example to show that
every closed map is semi-preclosed but not the converse.

Example 4: Let X={a,b,c},τ={Ø,{a},{a,b},{a,c},X},and σ= {Ø,{a},{a,b},X}.

Then f : (X,τ) → (X,σ) is the identity mapping. Here, clearly τ and σ are algebra
on X. And, the τ-closed sets are Ø,{b},{c},{b,c},X},σ-closed sets are
Ø,{c},{b,c}, X} and SPF(σ)=Ø,{b},{c},{b,c},X}. Clearly, f is a semi-preclosed
map but it is not closed since f({b})={b} which is not a σ-closed set.
We further state that every preclosed map (respectively, semi-closed map) is a
semi preclosed map. Hence we get the theorem.

Theorem 26: A map f : X → Y is semipreclosed if f is both a semi-closed

and a preclosed map.

Theorem 27: Let f : (X,τ)→(Y,σ) be a mapping from a space (X,τ) into a

space (Y,σ). Then f is semi-preclosed if and only if ((f (A))s)*⊂ f (( As )*), for
each set A of (X,τ).

Proof : Let f be a semi-preclosed map and A any subset of X. Then f

((As)*)∈SPF(Y). As f (A)⊂ f (( As )*), it follows that ((f (A))s)*⊂ f (( As )*).
Conversely, assume that F ∈ SPF(X). Then f (F)= f ((Fs)*)⊃(( f ( F))s)*), thus
we obtain that ( f ( F))*s = f ( F). Hence, f is a semi-preclosed map.

Definition 31: A mapping f : X → Y is said to be s-preclosed if

f (F) ∈ SPF(Y) for each semi-closed set F of X. Clearly, every s-preclosed map
is semi-preclosed. But semi-closed, preclosed, and s-preclosed maps are,

24
respectively independent of each other. Which we show with the below
example.

Example 5: Let X={p,q,r},τ={Ø,{r},{q,r}, X}, and σ= {Ø,{r},{p,r},{q,r}X}.

Let f : (x,τ )→ (X,σ). This shows that s-preclosed and preclosed maps are
independent of each other.

Lemma 11: If f : X → Y is semi-preclosed, then for each sub set V of Y and

each open set U of X containing f -1(V), there exists W ∈ SPO(Y) such that
V ⊂ W and f -1(W) ⊂ U.

Now we can prove it for s-preclosed maps in the following theorem

Theorem 28: If f : X → Y is s-precosed then for each sub set V of Y and each
semi-open set U of X containing f -1(V), there exists W ∈ SPO(Y) such that
V ⊂ W and f -1(W) ⊂ U.

Semi-Preirresolute Functions

Definition 32: A function f : X → Y is called semi-preirresolute if the

inverse image of each semi-reopen set in Y is a semi-preopen set in X. Note that
every semi-preirresolute map is semi-precontinuous but not the converse,
which is shown by the following example.

Example 6: Let X={a,b,c,d}and

τ = {Ø,{a},{b},{c},{a,b},{a,c},{b,c},{b,d}, {a,b,c},{a,b,d},{b,c,d}X};Y={m,n,l}
and σ= {Ø,{m}, Y}. Let f : X → Y be a mapping defined by f (a)=m,
f(b)=f(c)=l, and f(d)=n. Then, clearly f is semi-precontinuous but it is not a
semi-preirresolute map since f -1({m,n})={a,d} which is not a semi-preopen set
in (Y,σ).

We characterize the semi-preirresolute mappings in the following theorem.

Theorem 29: The following statements are equivalent for a function f:X→ Y :

25
 (i) f is semi-preirresolute.

(ii) For each point x of X and each semi-preneighborhood V of f(x),

there exists a semi-preneighborhood U of x such that f(U) ⊆V.

(iii) For each x∈ X and each V ∈ SPO(f(x)), there exists U ∈ SPO(x),

such that f(U) ⊆V.

Proof : (i)⇔(ii). Assume x∈ X and V is a semi-preopen set containing f(x).

Then by (ii), there exists a semi-preopen set G such that W= f -1(V) be a semi-
preopen set in X containing x and hence f(W) ⊂ f(f -1(V)) ⊂ V.

(ii)⇔(iii). Assume that V⊂Y is a semi-preopen set containing f(x). Then by (ii),
-1
there exist is a semi-preopen set G such that x∈ G ⊂ f (V).
-1 -1 -1
Therefore, x∈ f (V) ⊂ cl (f (V)). This shows that cl (f (V)) is a semi-
preneighborhood of x.

-1
(iii)⇔(i). Let V be a semi-preopen set in Y, then cl (f (V)) is semi-
preneighborhood of each x∈ f -1(V). Thus, for each x is a semi-preinterior point
-1 -1 -1 -1
of cl (f (V)) which implies that f (V)⊂int cl (f (V))⊂ cl intcl(f (V)).
Thereofre, f -1(V) is a semi-preopen set in X and hence f is a semipreirresolute
map and we state the following theorems.

Theorem 30: If f : X → Y is a preopen and preirresolute mapping, then f is a

semi-preirresolute. We note that every semi-preopen map is semi-preopen but
not the converse further we state the following theorem.

Theorem 31: If f : X → Y is semi-preirresolute and g : Y → Z is semi-

precontinuous, then g ° f is a semi-precontinuous map,

Theorem 32: If f : X → Y is continuous and open than f -1(clA)) for every

subset A of Y.

26
Theorem 33: Let f : X → Y be a continuous open and preirresolute
mapping, then f is a semi-preirresolute mapping.

Proof: Let A ∈ SPO(Y), then there exists a preopen set U ⊂ Y such that U ⊂ A
-1 -1
⊂ clU. Then by Theorem 17, f (cl U)= cl (f (U)). Also, we have
f -1(U)⊂f -1(A)⊂f -1(clU)= cl(f -1(U)).

Since f is a preirresolute map, then f -1(U) is a preopen set in X, and hence f -1(A)
is a semi – preopen set in X. Thus, f is a semi-preirresolute map.

Theorem 34: A mapping f : X → Y is semi-preirresolute if and only if for

every semi-preclosed set F of Y, f -1(F) is a semi – Preclosed set in X.

Semi-Prehomeomorphisms

Definition 33: A bijective mapping f : (X,τ)→ (Y,σ) from a space X into a

-1
space Y is called a semi-prehomeomorphism if both f and f are semi-
preirresolute functions.

Now we characterize the semi-prehomeomorphism in the following theorem.

Theorem 35: Let f : (X,τ)→ (Y,σ) be a bijective mapping from a space X

into a space Y. Then the following are equivalent:

(i) f is a semi-prehomeomorphism

(ii) f -1 is a semi-prehomeomorphism.

-1
Proof: (i)⇔(ii). Since f is a bijective map, both f and f are semi-
preirresolute functions.

Definition 34: A property which is preserved under

semi – prehomeomorphism is said to be a semi – prealgebraical property.
Clearly every homeomorphism is semi-prehomeomorphism.

27
Pre-Semipreopen Functions

We introduce the presemipreopen mappings analogous to pre-semiopen

mappings.

Definition 35: A function f : X → Y is called pre-semipreopen if the image

of each semi-preoen set in X is semi – preopen set in Y.

We note that every semi-preopen map is semi-preopen but not the converse.

Theorem 36: Let c and g : Y → Z be two maps such that g ° f is a pre-

semipreopen map. Then,

(i) If f is semi-preirresolute surjection, then g is a pre-semi-preopen map.

(ii) If g is a semi-preirresolute injection, then f is a pre-semi-preopen map

Proof : (i) let A be any semi-preopen set in Y, since f is a semi-preirresolute

map, f -1(A) is a semi-preopen set in X. As g ° f is a pre-semi-preopen map and f

is surjective, g ° f ( f -1(A))=g(A), which is a semi-preopen set in Z. This implies

that g is a pre-semi-preopen map.

(ii) As we claimed in (i), we can prove the second part easily.

Semi-Semi-Preclosed Functions

Definition 36: A function f : X → Y is called pre-semi-preclosed if the

image of each semi-preclosed set in X is a semi-preclosed set in Y.

We state that every pre-semi-preclosed map is semi-preclosed but not the

converse.

Theorem 37: Let f : X → Y and g : Y → Z be two maps such that g ° f is a

presemi-preclosed map. Then,

28
 (i) If f is a semi-preirresolute surjection, then g is a pre-semi-
preclosed map.

(ii) If g is a semi-preirresolute injection, then f is a pre-semi-

preclosed map.

Proof: We prove (ii) only. Suppose A is an arbitrary semi-preclosed set in X.

Since g ° f is a pre-semi-preclosed map, then g ° f (A) is a semi-preclosed set

in Z. Since g is a semi-preirresolute injective map, we have g -1 (g ° f(A))= f(A),

which is a semi-preclosed set in Y. This shows that f is pre-semi-preclosed.

Recall that a map f : X → Y is called M-preclosed if the image of each

preclosed set is a preclosed set.

3.4 Generalized Semi-Preclosed Sets and their Functions

Definition 37: A subset A of a space X is called a generalized closed set

(written as g-closed) set if clA ⊆ U whenever A ⊆ U and U is open.

Clearly, every closed set is a g-closed set. The complement of a g-closed set in
X is called generalized open, that is, g-open set, So, every open set is a g-open
set.

Definition 38: A subset A of a space X is called a semi-generalized closed

set (written as sg-clossed set) if sclA⊆U whenever A⊆U and U is semi-open.
Clearly, every semi-closed set is a sg-closed set. The complement of a sg-
closed set is called a semi-generalized open set, that is, a sg-open set. Every
semi-open set is a sg-open set.

Definition 39: A subset A of a space X is called a generalized semi-preclosed

(written as gsp – closed) set if (As)*⊆ U whenever A ⊆ U and U is open.

Clearly, every semi-preclosed set is a gsp-closed set. The complement of a gsp-

closed set is called generalized semi-preopen Dontchev J.23 (written as gsp-
open). Every semi-preopen set is a gsp-oen set. The family of all gsp-closed
29
(resp., gsp-open) sets of X is denoted by GSPF(X) (resp.,GSPO(X)), and further
we define the following new definition.

Definition 40: A function f : (X,τ) → (Y,σ) is called approximately semi-

preirresolute (written as ap-sp-irresolute) if (Fs)* ⊆ f -1
(U ), whenever U is a
semi-preopen subset of (Y,σ), F is a gsp-closed subset of (X,τ), and F ⊆ f -1(U ).
We show that every semi-preirresolute (sp-irresolute) map is ap-sp-irresolute
but not the converse, by the following theorem.

Theorem 38: A function f : (X,τ) → (Y,σ) is ap-sp-irresolute if f -1 (U ), is a

semi-preclosed in (X,τ ) for every U ∈ SO(Y,σ).

Proof: Let F⊆ f -1 (U ), where U ∈ SPO(Y,σ) and F is a gsp-closed subset of

(X,τ). Therefore, we have (Fs)*⊆(( f -1
(U ))s)*. This implies that f is an ap-sp-
irresolute.

Definition 41: A function f : (X,τ) → (Y,σ) is called contra-semi-

preirresolute (written as contra-sp-irresolute) if f -1(O) is semi-preclosed in
(X,τ) for each O ∈ SPO(Y,σ). Note that every semi-preirresolute (i.e., sp-
irresolute map is ap-sp-irresolute but not the converse).

Definition 42: A function f : (X,τ) → (Y,σ) is called contra –

prsemipreclosed (written as contra – presp-closed) if f(B) ∈ SPO(Y,σ), for each
semi-preclosed set B of (X,τ). Every pre-semi-preclosed map is an ap-sp-
closed map but not the converse which we shown by the following theorem.

Theorem 39: Let f : (X,τ) → (Y,σ) be a map. Then thefollowing are

equivalent:

(i) f is contra-sp-irresolute.

(ii) The inverse image of each semi-preclosed set in Y is a semi-

preopen set in X.

30
Definition 43: A subset of a space X is called semi-proclopen if it is both a
semi-preopen and a semi-preclosed set.

Definition 44: A function f : (X,τ) → (Y,σ) is called perfectly contra-semi-

preirresolute (written as perfectly contra-sp-irresolute) if the inverse of evey
semi-preopen set in Y is a semi-preclopen set in X.

3.5 Characterizations of Pre connected sets and Applications

Let A be a subset of X. We will denote the complement of A in X by X-A of

Ac and the closure and interior of A in X by cl ( A) and int(A) respectively.

Many algebraic properties like connectedness and covering have been studied
by Mrsevic M. et.al.,83. The idea of preopen sets and precontinuity in algebra
has been introduced by Moshhour et.al.82,.

Definition 45 : A subset A of a topological space ( X ,τ ) is said to be

preopen set if A ⊂ int(cl ( A)) or equivalently there exists U ∈ τ such that
A ⊂ U ⊂ cl ( A) . The complement of preopen set is called precloset set. The

preclosure of A ⊂ X is the intersection of all preclosed sets containing A and is

denoted by p.cl ( A ) .

Definition 46 : A space X is said to be connected if it is not the union of

two non-empty disjoint open sets. Otherwise X is said to have a disconnection;
1.e; X is disconnected, if there exist open sets A and B such that A ≠ φ , B ≠ φ ,
A ∩ B = φ and A ∪ B = X . Since A and B are also closed we may have a

disconnection by closed sets.

Algebraic structure Notation consisting of the two points {0,1} is denoted by 2.

The set X = {0,1} with the set {φ , X ,{0}} is called Sierpinski sets.

Definition 47 : A Algebraic structure Y is said to be preconnected if it is not

the union of two non-empty disjoint preopen sets.

31
A subset B ⊂ Y is said to be preconnected if it is preconnected as a subspace of
Y. If Y = A ∪ B for some non-empty disjoint preopen sets A, B, then we say Y
has predisconnection { A, B} .

Definition 48 : A function f : X → Y is said to be precontinuous if

f −1
(V ) ∈ P O ( X ) ,for every open set V of Y.

Theorem 40 : The following assertions are equivalent:

(1) Y is preconnected.
(2) The only subsets of Y both preopen and preclosed are φ and Y
(3) No precontinuous function f : Y → 2 is surjuective.

Proof : (1) ⇒ (2)

If G ⊂ Y is both preopen and preclosed, G ≠ φ ,Y; then Y = G ∪ (Y − G ) ⇒ Y is

not preconnected.

(2) ⇒ (3)

If f : Y → 2 were a precontinuous surjection, then f −1 ({0} ) ≠ φ , Y. But {0} is

both open and closed in 2. Hence, f −1 ({0} ) is preopen and preclosed in Y. This

contradicts (2).

(3) ⇒ (1)

If Y = A ∪ B , A and B are disjoint non-empty preopen sets, then A and B are

also preclosed.

⎧1 if x ∈ A
Let X A ( x ) = ⎨
⎩0 if x ∉ A

Then X A is a precontinuous surjection.

Example 7: The space 2 is not a reconnected space.

32
Theorem 41 : The precontinuous image of a preconnected space is
preconnected.

Proof : The map f : X → f (X ) is precontinuous. If f (X ) is not

preconnected, there would be a precontinuous surjection g : f ( X ) → 2 . But
then gof : X → 2 would also be a precontinuous surjection, contradicting the
preconnectedness of X.

Example 8: Let X = {a, b} , τ = {φ , X ,{a}} , τ − closed = { X ,φ ,{b}} and

Take A = {a}

⇒ cl ( A) = X
⇒ int(cl ( A)) = X
⇒ A ⊂ int(cl ( A))
⇒ Ais preopen
⇒ B = {b} = X − A is preclosed

Let B = {b}

⇒ cl ( B ) = {b}
⇒ int(cl ( B )) = φ
⇒ B ⊄ int(cl ( B ))
⇒ B is not preopen
⇒ A is not preclosed

⇒ The only subsets of X which are both preopn and preclosed (preclopen)
are φ and X.

⇒ X is reconnected.

So A is preopen but not preclosed and B is preclosed but not preopen.

Theorem 42 : Let Y be any space. The union of any family of preconnected

subsets having at least one point in common is also preconnected.

33
Proof: Let C = U Aα , z0 ∈ I Aα and f : C → 2 be precontinuous. Since each
α

Aα is preconnected, no f | Aα can be surjective. Since z 0 ∈ Aα ∀ z ∈ Aα and ∀ α .

We have f ( z ) = f ( z 0 )∀ z ∈ Aα and ∀ α . This implies that f cannot be surjective.

So C is preconnected.

Example 9 : Let X = {a, b} and τ be {φ , X , {a}} . Then cl ({a} ) = X . Then

hence int( cl ( a )) = X and. Hence {a} is preopen. Consequently, {b} = X − {a} is

preclosed.

Also, cl ( {b}) = {b} and so ( cl ({b}) ) = φ .

Thus {b} ⊄ int ( cl ({b} ) ) = φ .

Therefore {b} is not preopen. Consequently {a} is not reclosed.

In other words, the only subsets of X which are both preopen and preclosed are
φ and X. Hence X is preconnected by Theorem 2.1.

Theorem 43 : Let X = A ∪ B be a predisconnection of X. Let C be

apreconnected subset of X. Then C ⊂ A or C ⊂ B .

Proof: Assume that C ∩ A ≠ φ C ∩ B ≠ φ . Then C = ( C ∩ A) ∪ ( C ∩ B ) is a

predisconnection of C, a contradiction.

Hence, C ⊂ A and C ⊂ B .

Theorem 44 : Let A be a preconnected subspace of X. If B is a subspace of

X such that A ⊂ B p.cl ( A) , then B is preconnected.

In particular , preconnectedness of A ⇒ preconnectedness of p.cl ( A ) .

Proof: Let B = C ∪ D , a predisconnection by preclosed sets C and D . Then

C = B ∩ E and D = B ∩ F where E and F are preclosed in X.

34
Since A is preconnected, A ⊂ C or A ⊂ D .

Suppose that A ⊂ C = B ∩ E ⊂ E

Then p.cl ( E ) ⊂ p.cl ( E ) = E

⇒ p.cl ( E ) ⊂ E
⇒ B ⊂ E, because B ⊂ p.cl ( A)
⇒ B = B∩B ⊂ B∩E =C
⇒ C ∪ D ⊂ C, because B = C ∪ D

This is impossible, because C ≠ φ , D ≠ φ and C ∩ D = φ , Hence B is preconnected.

Theorem 45 : Let f : X → Y be continuous and open. Let V be preopen in Y.

Then f −1 (V ) is preopen in X.

Proof: Since V is preopen in Y, gthere exists open set W in Y such that

V ⊂ W ⊂ cl (V ) ⇒ f −1
(V ) ⊂ f −1
(W ) ⊂ f −1
( cl (V )) .

Since f is open, f −1 ( cl (V )) ⊂ cl ( f −1 (V )) . Again since f is continuous, f −1 (W ) is

open. Hence, f −1 (V ) ⊂ f −1 (W ) ⊂ cl ( f −1 (V )) where f −1 (W ) is open ⇒ f −1 (V ) is
preopen in X.

Theorem 46 : Let f : X → Y . If f is open continuous surjection and X is

reconnected, then Y is connected.

Proof: Assume that Y = A ∪ B , a disconnection by open sets. Then

A ∩ B = φ, A ≠ φ, B ≠ φ
⇒ X = f −1 ( A) ∪ f −1 ( B) with
f −1 ( A) ∩ f −1 ( B) = f −1 ( A ∩ B) f −1 (φ ) = φ

Since A and B are both open and closed, it follows that A and B are preopen.
Since f is continuous and open, we have by Theorem 2.6, f −1 ( A) and f −1 ( B )
are preopen in X.

Hence X would not be reconnected, which is a contradiction.

35