Professional Documents
Culture Documents
IN TOPOLOGICAL SPACES
A project report submitted to the
BHARATHIDASAN UNIVERSITY, TIRUCHIRAPPALLI - 24
In partial fulfillment of the requirements for the award of the degree of
MASTER OF SCIENCE
Submitted by
Ms. S.R. NIVYA
Register No: P 21194374
PG DEPARTMENT OF MATHEMATICS
APRIL–2023
CERTIFICATE
CERTIFICATE
Date:
ACKNOWLEDGEMENT
ACKNOWLEDGEMENT
I offer my thanks to Almighty God for giving me the strength and wisdom of wish
the project work successfully.
I sincerely thank Dr. I. Sarumathi M.Com., M.Phil., MBM, MBA., Ph.D., NET.,
Principal, Annai Women’s College, Karur for her concern regarding not only the
guidance but also the encouragement to carry out the project successfully.
I profusely thank Mrs. D. Deivanai M.Sc., M.Phil., M.A., B.Ed., H.D.C.A., Head of
the Department of Mathematics for her untiring consistent advice and providing us with a
supportive environment.
[S.R. NIVYA]
CONTENT
CONTENT
INTRODUCTION
1
I PRELIMINARIES
2
CONCLUSION
49
BIBLIOGRAPHY
50
INTRODUCTION
INTRODUCTION
1
CHAPTER -I
CHAPTER − I
PRELIMINARIES
Definition: 1.1
A set X for which a topology τ has been specified is called a topological space.
A topological space is an ordered pair (X,τ) consisting of a set X and a τ on X.
Definition: 1.2
Example: 1.1
In the real line R,(a, b),(a, ∞),(b, ∞) are open in standard topology.
Definition: 1.3
Example: 1.2
2
Definition: 1.4
Example: 1.3
Consider the real line R. If A = (0, 1], then the point 0 is a limit point of A
1
and so is the point . In fact, every point of the interval [0, 1] is a limit point of A,
2
Definition: 1.5
Example: 1.4
Definition: 1.6
Example: 1.5
3
1 1
and its closure in Y is the set [0, ] ∩ Y = (0, ].
2 2
Definition: 1.7
Definition: 1.8
Definition: 1.9
Example: 1.6
Definition: 1.10
A function f : X → Y is said to be continuous at a point x ∈ X if for every
neighbourhood V of f(x) , there exists a neighbourhood U of x such that f(U) ⊂ V.
Equivalently, a function f : X → Y is said to be continuous if every open set V of
Y, the set f−1(V) is open set of X .
Definition: 1.11
4
Definition: 1.12
Example: 1.7
Definition: 1.13
A space X has a countable basis at each of its points is said to satisfy first
countability axiom or to be first countable.
Definition: 1.14
Definition: 1.15
Example: 1.8
Each interval and each ray in the real line is both connected and locally
connected. The subspace [−1, 0) ∪ (0, 1] of R is not connected, but it is locally
connected.
5
The rationals Q are neither connected nor locally connected.
Definition: 1.16
Definition: 1.17
Definition: 1.18
Let X be a topological space. Suppose that one point sets are closed in X.
Then X is said to be regular if for each pair of a point x and a closed set B disjoint
from x, there exists disjoint open sets containing x and B, respectively.
Definition: 1.19
Definition: 1.20
6
CHAPTER – II
CHAPTER − II
Definition: 2.1
Definition: 2.2
Let X and Y be the topological spaces and let F denote the set of all functions
on X to Y. Let C denote the subset of F containing all the continuous functions. For
f ∈ F, the graph of f denoted by G(f ) is the set {(x, f (x))|x ∈ X} ⊂ X × Y.
Let X × Y be a product topology. A Function f ∈ F is said to be almost
continuous if and only if for each open set U in X × Y containing the graph of f, there
exists a g ∈ C such that G(g) ⊂ U.
Theorem: 2.1
Proof:
7
The following Examples are gives a function which is almost continuous but these are
not continuous.
Example: 2.1
Let R represent the reals with standard topology. Let f : R→ R be defined by,
x if x is rational;
f(x)= {
-x if x is irrational;
Proof:
For example,
f(x) = 0 or 1 according to whether x is rational or irrational is not cotinuous
anywhere but is almost continuous.
Example: 2.2
Definition: 2.3
8
Lemma: 2.1
Proof:
Theorem: 2.2
Proof:
Let X be T1 space and first countable. Also let Y be first countable. Let
f : X → Y be almost continuous at x0 ∈ X.
Let {Un} and {Vn} be countable descending bases at the point x0 and f (x0),
respectively.
By using previous Lemma, for the two open sets U1 and V1, there is a point
x1 ∈ U1∖{x0} such that f (x1) ∈ V1.
Now considering the open sets U2 and V2, U2∖{x1} is an open set containing
x0 in the T1 space X.
Again by lemma, there exists a point x2 ∈ U2∖{x0, x1}such that f (x2) ∈ V2.
9
Proceeding like this, we have for the open sets Uk and Vk, Uk∖{x1,x2, · · ·,xk−1}
is open set containing x0 and hence there exists a point xk ∈ Uk∖{x1,x2, · · ·, xk−1} such
that f(xk) ∈ Vk.
Since x0 is a limit point of X, so every neighbourhood of x0 contains infinitely
many points of X.
Now we have constructed a sequence {xn} of distinct points of X converging
to x0 such that f(xn) ∈ Vn for each positive integer n.
That is {f (xn)} converges to f (x0).
Hence proved.
Corollary: 2.1
Theorem: 2.3
Proof:
Example: 2.3
10
1 if x is rational;
f(x)= {
-1 if x is irrational;
Let M be the set consisting of all non-negative rationals together with all negative
irrationals. Then f | M is not almost continuous at x = 0.
Thus it describes a function which is connected and almost continuous but not
continuous.
Theorem: 2.4
Proof:
Example :2.4
Definition: 2.4
11
each open set V ⊂ Y containing f (x0), there exist an open set V1 containing f(x0)
where V1 ⊂ V such that X∖Cl(f −1(V1)) consists of finitely many components.
Definition: 2.5
Our next theorem gives condition when a connected function is also almost
continuous.
Theorem:2.5
Proof:
12
Definition: 2.6
Let X, Y be the topological spaces and let f : X → Y be any function. The set
G(f) is a closed subset of X × Y if and only if for every x0 ∈ X and y ∈ Y but
y ≠ f (x0), then there exist open sets U and V containing x0 and y respectively, such
that f(U) ∩ V = ∅.
Let X, Y are arbitrary spaces and M ⊂ Y is compact. If any function
f : X → Y having closed graph, then f −1(M) is a closed subset of X.
If any function f : X → Y , where Y is compact, having closed graphs, then f
is continuous.
Theorem: 2.6
Proof:
13
Theorem: 2.7
Proof:
Theorem: 2.8
Proof:
Let x0 ∈ X and y ≠ f (x0) ∈ Y. Since Y is T2, so that there exists disjoint open
sets U and V containing y and f (x0) respectively.
Since Y is locally connected, then there exists a connected neighbourhood
W ⊂ V containing f (x0). So that U and W are disjoint.
That is, U ∩ W = ∅ ⇒ f −1(U) ∩ f −1(W) = ∅. Since f −1
preserves connected
sets. If any x ∈ f −1(U) is a limit point of the connected set f −1(W), then {x} ∪ f −1(W)
is a connected set.
But f ({x} ∪ f −1(W)) = {f (x)} ∪ W. Since U contains f (x) and U and W are
disjoint neighbourhoods.
Therefore f ({x} ∪ f −1(W)) is not connected, which is a contradiction to f
preserves connected set.
14
Since f−1(U) ∩ f−1(W) = ∅ ⇒ Cl(f −1(U)) ∩ Cl(f −1(W)) = ∅.
Since f is almost continuous, there is an open set T ⊂ Cl(f−1(W)) containing x0.
This implies T ⊂ f −1(W) ⇒ f (T) ⊂ W ⇒ f (T) ∩ U = ∅.
Therefore G(f) is closed.
Hence proved.
Theorem: 2.9
Proof:
Corollary: 2.2
Theorem: 2.10
Proof:
15
−1
Assume that f has the property Cl(f (C)) ⊂ f −1(Cl(C)) for every connected
subset C ⊂ Y. We claim that f is continuous.
Let x0 ∈ X and V be a neighbourhood of f (x0). Since Y is regular, there exist
a closed set W.
Also Y is locally connected, there exist a connected neighbourhood W ⊂ V
containing f (x0) such that Cl(W) ⊂ V.
Then f −1(Cl(W)) ⊂ f −1(V). By our assumption, f has the property that
Cl(f −1(W)) ⊂ f −1(Cl(W)) , where W is connected.
Therefore Cl(f −1(W)) ⊂ f −1(Cl(W)) ⊂ f −1(V) ⇒ Cl(f −1(W)) ⊂ f −1(V). Since
f is almost continuous, then Cl(f −1(W)) is a neighbourhood of x0.That is f −1(V) is a
neighbourhood of x0.
Therefore f is continuous at x0.
Hence proved.
Theorem: 2.11
Proof:
16
Hence f is continuous.
Hence proved.
Definition: 2.7
The following theorem states conditions under which a function that is both
semi connected and almost continuous is continuous.
Theorem: 2.12
Proof:
Theorem: 2.13
Proof:
17
Assume that f −1 preserves connected sets. We claim that f is continuous.
Let x0 ∈ R and C be any open set containing f (x0). Since Y is locally
connected, there is a connected neighbourhood C be assumed.
Since f −1 preserves connected sets. Therefore f −1(C) is connected subset
of R.Therefore f −1(C) is must be an interval in R and f −1(C) is containing x0.
Since f is almost continuous, there exist a neighbourhood Cl(f −1(C)) of x0
containing x0.
Therefore x0 is an interior point of f −1(C). Therefore f −1(C) is a
neighbourhood of x0.
Hence f is continuous at x0.
Hence proved.
Theorem: 2.14
Proof:
18
CHAPTER – III
CHAPTER-III
Definition: 3.1
Definition: 3.2
Example: 3.1
Let R be the set of real numbers and let τ consist of ∅, R and the complements
of all countable subsets of R.
Let X = {a, b} and let τ ∗ = {X, ∅, {a}}
x if x is rational;
f(x)= {
-x if x is irrational;
19
Theorem: 3.1
Proof:
(b) ⇒ (c). Let {xλ}λ∈D be a net converging to x and let U be any regularly open
set containing f(x). Since f is almost continuous, there is an open set M containing x
such that f (M) ⊂ U.
Now, since M is open set containing x and the net {xλ}λ∈D converges to x ,
therefore there is a λ0 ∈ D such that λ ≥ λ0 ⇒ x − λ ∈ M .The set D is directed by
‘≥’.Thus, for all λ ≥ λ0, f (xλ) ∈ f(M) ⊂ U.
Hence the net is eventually in U.
(c) ⇒ (a). Suppose that f is not almost continuous at x. Then there is an open
set V containing f(x) such that for every open set U containing x,
f (U) ∩ (Y−Int(Cl(V))) ≠ ∅ .
This implies that U ∩ f −1(Y−Int(Cl(V))) ≠ ∅ for every open set U containing
x. The family ‘u’ of all open sets ‘U’ containing x is directed by set inclusion. For
each U ∈ u choose a point xU belonging to U ∩ f −1(Y − Int(Cl(V))).
Then {xU}U∈u is a net in X which converges to x and is such that no
f (xU) is in Int(Cl(V)).
Thus {f(xU)}U∈u is not eventually in the regularly open set Int(Cl(V)), which is
a contradiction.
20
Definition: 3.3
Example: 3.2
Let (R, τ) be the space of previous example and let ‘u’ denote the usual
topology for R. Let i be the identity mapping of (R,u) onto (R, τ). Then i is almost
continuous but not continuous at any point.
Theorem: 3.2
Proof:
21
(b) ⇒ (c). Let A be any regularly closed of Y. Then Y − A is regularly open
and therefore f −1(Y − A) is open, that is, X − f −1(A) is open.
Hence f −1(A) is closed.
(f) ⇒ (g). Let N be any regularly open set containing f (x). Then, Y − N being
−1 −1
closed, Cl(X − f (Cl(Int(Y−N)))) ⊂ f (Y−N). Since Y−N is regularly closed,
therefore Cl(f −1(Y−N)) ⊂ X − f −1(N) .
Since the net {xλ}λ∈D converges to x , therefore there exists λ0 ∈ D such that
for all λ ≥ λ0 ( D is directed by’≥’) xλ ∈ f −1(N). This means that f(xλ) ∈ N for all
λ ≥ λ0. That is, the net {f (xλ)}λ∈D is eventually in N.
Definition: 3.4
22
It is easy to see that the neighbourhoods in the definition can be replaced by
open neighbourhoods. Obviously, every almost continuous mapping is weakly
continuous. But a weakly continuous mapping may fail to be almost continuous.
Theorem: 3.3
a if x is rational;
f(x)= {
b if x is irrational;
Proof:
Theorem: 3.4
Proof:
23
Corollary: 3.1
Definition: 3.5
A space is said to be semi regular if for each point x of the space and each
open set U containing x, there is an open set V such that x ∈ V ⊂ Int(Cl(V)) ⊂ U.
Theorem: 3.5
Proof:
Let x ∈ X and let A be an open set containing f(x). Since Y is semi regular,
there is an open subset M of Y such that, f(x) ∈ M ⊂ Int(Cl(M)) ⊂ A.
Now, since f is almost continuous, therefore there is an open subset U of X
containing x such that f (x) ∈ f (U) ⊂ Int(Cl(M)).
Thus U is an open set containing x such that f(U) ⊂ A. Thus f is continuous at
x. Since x is arbitrary, it follows that f is continuous.
Hence proved.
Theorem: 3.6
Proof:
24
−1
Since f is continuous, therefore f (g−1(A)) is an open subset of X. That is,
(g∘f)−1(A) is an open of X.
Hence g∘f is almost continuous.
Hence proved.
Theorem: 3.7
Proof:
Theorem: 3.8
Proof:
Let U be any regularly open set containing f(x), since f | N is almost continuous
at x. Therefore, there is an open set V1 such that x ∈ N ∩ V1 and f(N ∩ V1) ⊂ U. The
result now follows from the fact that N ∩ V1 is a neighbourhood of x.
Hence proved.
Corollary: 3.2
Let f map X into Y and let {Gλ : λ ∈ A} be an open cover of X. If for each
λ ∈ A, f |Gλ is almost continuous at each point of Gλ, then f is almost continuous.
25
Theorem: 3.9
Proof:
Theorem: 3.10
Proof:
f (V1 ∩ V2) = f (X1 ∩ V1 ∩ V2) ∪ f (X2 ∩ V1 ∩ V2) ⊂ f (X1 ∩ V1) ∪ f (X2 ∩ V2) ⊂ U.
Thus, V1 ∩ V2(=V) is and open set containing x such that f (V) ⊂ U and hence
f is almost continuous at x.
Hence proved.
26
Theorem: 3.11
Proof:
Let (xα) ∈ 𝜋α∈I Xα and let O* be a regularly open subset 𝜋Xα* of containing
f((xα)).
Then there is a member 𝜋α∈I O*α of the defining base of the product topology
on 𝜋α∈I Xα* such that f((xα)) ∈ 𝜋α∈I O*α and O*α = Xα* for all α ∈ I except for a finite
number of indices αi , i = 1,2,…,n(say) and O*α is and open subset of Xα*,, i = 1,2,…,n.
Now, since O* is regularly open, therefore Int(cl( 𝜋α∈I O*α)) ⊂ O*.
Thus, each αi , f αi (xαi) ∈ O*αi ⊂ Int(cl(O*αi)) and f αi being almost continuous, there is
an open subset Uαi of Xαi* such that xαi ∈ Uαi and
fαi(xαi) ∈ fαi(Uαi) ⊂ Int(cl(O*αi)).
Thus, 𝜋α∈I Uα where Uα = Xα when α ≠ αi, i = 1,2,…,n, is an open set containing
xα such that f(𝜋α∈I Uα) ⊂ O*.
Hence f is almost continuous.
Hence Proved.
Theorem: 3.12
Proof:
Let Pα denote the projection of X into Xα. Then Pα∘h = fα for each α.
Now Pα is open and continuous for each α and h is almost continuous.
Therefore, Pα∘h is almost continuous. That is, fα is continuous for each α.
Hence Proved.
27
Definition: 3.6
Theorem: 3.13
The set of all points of X at which is not almost continuous is identical with
the union of the boundaries of the inverse images of regularly open subsets of Y.
Proof:
Definition: 3.7
A space is called a Urysohn space if for every pair of distinct points x and y,
there exist open sets U and V such that x ∈ U, y ∈ V and Cl(U) ∩ Cl(V) = ∅.
Theorem: 3.14
Proof:
Let A be an open subset of X. Then X−A, being a closed subset of the compact
space X, is compact.
28
Since every weakly continuous image of a compact space is almost compact,
therefore f (X−A), is almost compact.
Since f is one-to-one, therefore, f(X−A) = Y−f(A), whence Y−f (A) is almost
compact. Since Y is a Urysohn space, therefore Y− f(A) is closed and hence f(A) is
open.
Hence Proved.
Corollary: 3.3
Proof:
Definition: 3.8
A space X is said to be almost regular if for each regularly closed set A and
each point x ∉ A, there are disjoint open sets U and V such that x ∈ U, A ⊂ V.
Theorem: 3.15
Proof:
29
Since X is regular, there exist disjoint open sets G and H such that
f −1(A) ⊂ G, f −1(y) ⊂ H.
Now, let P = {z : f −1(z) ⊂ G} and Q = {z : f −1(z) ⊂ H}. Then y ∈ P, A ⊂ Q,
P ∩ Q = ∅. Also since f is closed, therefore P and Q are open.
Hence Y is almost regular.
Hence Proved.
Theorem: 3.16
Proof:
Let A and B be two disjoint regularly closed subsets of Y. Then f −1(A) and
f −1(B) are disjoint, closed subsets of the normal space X and therefore there exist open
sets G and H such that G ∩ H = ∅, f −1(A) ⊂ G, f −1(B) ⊂ H.
Let P = {y : f −1(y) ⊂ G} and Q = {y : f −1(y) ⊂ H}. Then, since f is closed,
therefore P and Q are open sets. Also, A ⊂ P, B ⊂ Q and P ∩ Q = ∅.
Hence the result.
30
CHAPTER – IV
CHAPTER − IV
In this paper, Husain introduced the concept of almost continuous mappings and
investigated some of their properties. On the other hand, Singal and Singal have also
introduced the concept, similarly called almost continuous mappings, which is in fact
different from that in the sense of Husain.
In this paper, we use the abbreviations “a.c.H.” means almost continuous in the
sense of Husain and “a.c.S.” means almost continuous in the sense of Singal and Singal.
Definition: 4.1
Definition: 4.2
Definition: 4.3
Theorem: 4.1
31
Proof:
Conversely,
Theorem: 4.2
Proof:
32
U × V ⊂ W. Now note that g−1(U × V) = U ∩ f −1(V). Since f is a.c.H., there exists an
open set S containing x such that S ⊂ U and f −1(V) is dense in S.
Then g−1(U × V) = U ∩ f −1(V) ⊃ S ∩ f −1(V) so that
Cl(g−1(U × V)) ⊃ Cl(S ∩ f −1(V)) ⊃ S. We get S ⊂ Cl(f −1(V)) and since S is open. Then
Cl(g−1(W)) ⊃ Cl(g−1(U × V)) ⊃ S. Therefore Cl(g−1(W)) is a neighbourhood of x.
Hence g is a.c.H. at the point x.
Conversely,
Assume that g be a.c.H. Let x ∈ X and for any open set V ⊂ Y containing f (x).
Then X × Y is an open set in X × Y containing (x, f (x)).
Since g is a.c.H., Cl(g−1(X × Y )) = Cl(X ∩ f −1(V)) = Cl(f −1(V)) contains a
neighbourhood of x.
Hence f is a.c.H. at the point x.
Hence proved.
Definition: 4.4
Theorem: 4.3
Proof:
33
Consequently,
Example: 4.1
Let I be the closed unit interval with the standard subspace topology from the
reals. Let Q represent the rationals belonging to I. Let f : I → Q be defined by,
x if x ∈ Q ;
f(x)= {
0 if x ∈ I-Q ;
Definition: 4.5
Theorem: 4.4
34
That is f −1(A) and f −1(B) give a separation of X and which is a contradiction to
that X is connected.
Therefore f(X) = Y must be connected.
Hence proved.
Example: 4.2
Example: 4.3
Let X = Y = {0, 1} where X has the indiscrete topology and Y has the discrete
topology. Then the identity function i : X → Y is a.c.H., X is connected, but i(X) = Y
is not connected.
Lemma: 4.1
Proof:
Suppose there exists a point x ∈ Cl(f −1(V) − f −1(Cl(V)). Then f (x) ∉ C1(V).
Hence there exists an open set W containing f (x) such that W ∩ V = ∅. Since V is
open, we have V ∩ Cl(W ) = ∅ .
Since f is open function, there exists an open set U ⊂ X containing x such that
f (U) ⊂ C1(W). Then we have f(U) ⊂ V = ∅.
On the other hand, since x ∈ Cl(f −1(V)) ,we have U ∩ f −1(V ) ≠ ∅ and hence
f(U) ∩ V ≠ ∅, we have a contradiction.
Hence Cl(f −1(V)) ⊂ f −1(Cl(V)) .
35
Theorem: 4.5
Proof:
Corollary: 4.1
Example: 4.4
An a.c.S. open function need not be continuous. Let X = {a, b, c} with topology
{∅, X, {b, c}} and let Y be the Sierpinski space. Then f : X → Y is given by
f (a) = f(b) = 0 and f (c) = 1 is a.c.S. but not continuous.
Theorem: 4.6
Proof:
Let x ∈ X be such that x ∉ f −1(V) but x ∈ Cl(f −1(V)). Suppose f(x) ∉ Cl(V).
Then there exists an open set W such that f(x) ∈ W and W ∩ V = ∅.
Then Cl(W) ∩ V = ∅ and Int(Cl(W)) ∩ V = ∅. Since f is a.c.S., there exists a
open set U ⊂ X such that x ∈ U and f (U) ⊂ Int(Cl(W)).
Therefore f (U) ∩ V = ∅.
36
However, since x ∈ Cl(f −1(V)), U ∩ f −1(V) ≠ ∅ so that f (U) ∩ V ≠ ∅, which
is a contradiction.
Hence f (x) ∈ Cl(V).
Theorem: 4.7
Proof:
Corollary: 4.12
Proof:
Theorem: 4.8
37
Proof:
Assume that an open a.c.H. function f : X → Y is a.c.S. We claim that for every
open V ⊂ Y, Cl(f −1(V)) = f −1(Cl(V)).
Since f : X → Y be an open a.c.S. function. Let V ⊂ Y be open.
f (Cl(f −1(V))) ⊂ Cl(V). Since Cl(f −1(V)) ⊂ f −1(f (Cl(f −1(V))))for any function, we have
Cl(f −1(V)) ⊂ f −1(f (Cl(f −f −1(Cl(V)) .
For every subset V ⊂ Y , f −1(Cl(V)) ⊂ Cl(f −1(V)). Hence we get
Cl(f −1(V)) = f −1(Cl(V)). Since f is a.c.H., there exists an open set U ⊂ X such that
x ∈ U ⊂ Cl(f −1(V)) .
Then f (U) ⊂ f (f −1(Cl(V))) ⊂ Cl(V). Therefore f is weakly continuous and since
f is open.
Hence f is a.c.S.
Hence proved.
38
CHAPTER – V
CHAPTER − V
Definition: 5.1
Definition: 5.2
Corollary: 5.1
Definition:5.3
39
Definition: 5.4
Definition: 5.5
Corollary: 5.2
Corollary: 5.3
Definition: 5.6
1. X is extremally disconnected.
2. R𝑂(X) = RC(X).
3. Every semi-open subset of X is 𝛼-open.
Corollary: 5.4
Definition: 5.7
1. f is almost 𝛼- continuous
2. For each x ∈ X and each V ∈ 𝜎 containing f(x), there exists U ∈ τ𝛼
containing x such that f(U)⊆ int(cl(V)).
Corollary: 5.5
40
Definition: 5.8
Definition: 5.9
Lemma: 5.1
Proof:
Example: 5.1
41
Theorem: 5.1
Proof:
Let for each x ∈ X and each open set H in Y containing f(x), there exists a
semi-open set U in X containing x such that f(clU) ⊆ intclH.
Theorem: 5.2
1. F is almost Sg-continuous.
2. For each x ∈ X and each regular open set V of Y containing f(x),
there exists an Sg-open set U in X containing x such that f(U) ⊆ V.
3. For each x ∈ X and each 𝛿-open set V of Y containing f(x), there
exists an Sg-open set U in X containing x such that
f(U) ⊆ V.
Proof:
(1)→(2) Let x ∈ X and V be any regular open subset of Y such that f(x) ∈ V.
Since every regular open set is open and since f is almost Sg-continuous, then there
exists an Sg -open set G such that x ∈ G and (G) ⊆ intclV, but since intclV =V, so
f(G) ⊆ V.
(2) → (3) Let x ∈ X and V be any 𝛿-open set of Y such that f(x) ∈ V. Then,
42
there exists an open set H containing f(x) such that H ⊆ intclV ⊆ V. Since intclH is a
regular open subset of Y containing f(x). So by (2), there exists an Sg-open set U in X
containing x such that f(U) ⊆ intclH. Thus, f(U) ⊆ V.
(3) → (1) Let x ∈ X and V be any open set of Y such that f(x) ∈ V. Then intclH
is a 𝛿 -open set, therefore, by (3) there exists an Sg-open set U in X containing x such
that (U) ⊆ intclG.
Corollary: 5.6
Corollary: 5.7
Corollary: 5.8
Theorem: 5.3
Proof:
Let f : X → Y be almost Sg-continuous and let V be any open subset of Y.
Let x ∈ f −1(V). Then f(x) ∈ V. Since f is almost Sg-continuous, there exists an
Sg-open set U in X containing x such that f(U) ⊆ intclV.
This implies that x ∈ U ⊆ f −1(intclV). Therefore, x ∈ Sg int(f −1(int(clV)).
Further, f −1(V) ⊆ Sgint(f −1(int(clV)).
43
Conversely,
Theorem: 5.4
Proof:
Theorem: 5.5
Proof:
Let Y be hyperconnected space and H be any open subset of Y containing
f(x). Then intclH= Y. This implies that intclH = Y and for every Sg -open set G
in X containing x, f(x) ⊆ Y=intclH.
44
Thus, f is almost Sg - continuous.
Hence proved.
Theorem: 5.6
Proof:
Theorem: 5.7
Proof:
(1) ⟶ (2) Let A be any subset of X. Then clδ f(A)) is 𝛿-closed in Y. Since f
is almost Sg - continuous, then by Corollary 5.7, f−1(clδ f (A)) is Sg - closed in X.
So Sg clf−1(clδ f(A)) = f−1(clδ f(A)). Now, since f (A) ⊆ clδ f (A), this implies
that A ⊆ f−1(clδ f(A)). Thus Sg cl(A)⊆ Sg cl(f−1(clδ f(A)), so we have
Sg cl(A) ⊆ f−1(clδ f(A)).
Hence f(Sg cl(A)) ⊆ (clδ f(A)).
45
(2) ⟶ (3) Let B be any subset of Y. Then f−1(B) ⊆ X. Therefore, by (2)
we have f(Sg cl(f−1(B))) ⊆ clδ f(f−1(B))) ⊆ clδ B.
Then f−1(f(Sg cl(f −1(B)))) ⊆ f−1(clδ B).
Hence Sg cl(f−1(B)) ⊆ f−1(clδ B).
(4) ⟶ (5) Let B be any semi-open subset of Y. Then, clB is regular closed in
Y. Therefore, Y\clB is regular open in Y. Thus, Y\clB is 𝛿 -open in Y, then by (4)
we have f−1(Y\clB) ⊆ Sg int(f−1(Y\clB)).
So f−1(Y\clB) is an Sg -open set, this implies that X\ f−1(clB) is an Sg -open set
in X, that is f−1(clB) is Sg -closed. But f−1(B) ⊆ f−1(clB).
Hence Sg clf−1(B) ⊆ f−1(clB)
(5) ⟶ (1) Let B be any regular open subset of Y. Then Y\B is a regular closed
set in Y. This implies that cl(Y\B) = clint(Y\B), then, Y\B is semi-open subset of Y.
Hence by (5) Sg cl f−1(Y\B) ⊆ f−1(cl(Y\B)) = f−1(Y\B), therefore f−1(Y\B) is
Sg -closed in X, that is X\f−1(𝐵) is Sg -closed. Then f−1(B) is an Sg -open set.
Thus, f is almost Sg - continuous.
Hence proved.
Theorem: 5.8
Proof:
46
This implies that intδ f(A)) ⊆ f(Sg int(A)).
Conversely,
Theorem: 5.9
1. f is almost Sg - continuous.
2. Sg clf−1(V) ⊆ f−1(clV), for each 𝛽-open set V of Y.
3. f−1 (int F) ⊆ (Sg int f−1(F)), for each 𝛽-closed set F of Y.
4. f−1 (int F) ⊆ (Sg int f−1(F)), for each semi-closed set F of Y.
5. Sg clf−1(V) ⊆ f−1(clV), for each semi-open set V of Y.
Proof:
(1) ⟶ (2) Let V be any 𝛽-open subset of Y. It follows from Corollary 5.4, that
clV is a regular closed set in Y. Since f is almost Sg -continuous, by Corollary 5.6,
f−1(clV) is Sg -closed set in X. Therefore, we obtain Sg clf −1(V) ⊆ f −1(clV).
(2) ⟶ (3) Let F be any 𝛽-closed set of Y. Then Y\F is a 𝛽-open set in Y
and by (2), we have Sg cl f −1(Y\F) ⊆ f −1(cl(Y\F)) and
Sg cl (X\f −1(F)) ⊆ (f −1(Y\int F)), then by Corollary 5.1,
X\Sg int (f −1(F)) ⊆ X\f −1(int F).
Therefore, f −1(int F) ⊆ Sg int(f −1(F)).
47
(3) ⟶ (4) Obvious since every semi-closed set is 𝛽-closed.
(4) ⟶ (5) Let V be any semi-open set in Y. Then Y\V is a semi-closed set
in Y and by (4), we have f −1(int Y\V) ⊆ (𝑆gint f −1(Y\V)) and
f −1(Y\clV) ⊆ Sg int(Y\ f −1(V)). Hence X\ f −1(clV) ⊆ X\Sg cl (f −1(V)).
Therefore, Sg cl(f −1(V)) ⊆ f −1(clV).
(5) ⟶ (1) Let F be any regular closed set in Y. Then F is a semi-open set of
Y. By (5), we have Sg cl(f −1 F) ⊆ f −1(clF) = f −1(F). This shows that f −1(F) is an
Sg -closed set in X. Therefore, by Corollary 5.6, f is almost Sg -continuous.
Hence proved.
48
CONCLUSION
CONCLUSION
49
BIBLIOGRAPHY
BIBLIOGRAPHY
1. James R. Munkres, Topology (2nd Edition) Pearson Education Pvt. Ltd., New
Delhi-2002 (Third Indian Reprint).
2. R. V. Fuller, Relations among continuous and various non-continuous
functions, Pacific J. Math. 25 (1968), 495-509.
3. T. Husain, Almost continuous mappings, Prace. Mat. 10 (1966), 1-7.
4. J. Stallings, Fixed point theorems for connectivity maps, Fund. Math. 47
(1959), 249-263.
5. Singal M.K. and Asha Rani Singal (1968), Almost Continuous Mappings,
Yokohama Math. J., 16, 63-73.
6. Abd-El-Monsef M. E., El-Deeb S. N. and Mahmoud R. A. (1983), β-open sets
and β-continuous mappings, Bull. Fac. Assint, Vol. 12, 77-90.
50