SlideShare a Scribd company logo
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 265
Paper Publications
Using ψ-Operator to Formulate a New
Definition of Local Function
1
Dr.Luay A.A.AL-Swidi, 2
Dr.Asaad M.A.AL-Hosainy, 3
Reyam Q.M.AL-Feehan
1
Professor,
2
Ass. Professor, 3
Msc. Student,
1, 2, 3
Department of Mathematics College of Education for Pure Science Babylon University
Abstract: In this paper, we use ψ-operator in order to get a new version of local function. The concepts of maps,
dense, resolvable and Housdorff have been investigated in this paper, as well as modified to be useful in general
‫صت‬ ‫ال‬‫خ‬ ‫:ان‬ ‫ُا‬ ‫تخدي‬ ‫س‬ ‫ا‬ ً ‫ف‬ ‫ْذا‬ ‫بحث‬ ‫ان‬ ‫ٍت‬ ‫ه‬ ً‫ع‬ ‫ان‬ ‫ساي‬ ‫اب‬ ٍ‫ي‬ ‫أجم‬ ‫صٕل‬ ‫ح‬ ‫ان‬ ‫هى‬ ‫ع‬ ّ‫سخ‬ َ ِ‫د‬ ٌ‫جد‬ ٍ‫ي‬ ‫ت‬ ‫دان‬ ‫ان‬ ‫ٍت‬ ‫ه‬ ‫ًح‬ ‫د.ان‬ ‫ٔق‬ ‫ى‬ ‫ت‬ ‫ٍق‬ ‫ق‬ ‫تح‬ ‫ان‬ ً ‫ف‬
‫ٍى‬ ْ‫فا‬ ‫ي‬ ‫دٔال‬ ‫,ان‬ ‫ت‬ ‫ثاف‬ ‫ك‬ ‫ًجًٕعاث,ان‬ ‫ان‬ ‫هت‬ ‫قاب‬ ‫ان‬ ‫هحم‬ ‫ن‬ ٔ ‫ضاء‬ ‫ف‬ ‫سدٔرف‬ ٔ‫ٓا‬‫ك,ان‬ ‫ذن‬ ‫ٔك‬ ‫هٓا‬ ٌ‫عد‬ ‫ت‬ ٌٕ‫ك‬ ‫ت‬ ‫ن‬ ‫ٍدة‬ ‫ف‬ ‫ي‬ ‫كم‬ ‫ش‬ ‫ب‬ ‫.عاو‬
Keywords: ψ-operator, dense, resolvable and Housdorff.
1. INTRODUCTION AND PRILMINARIES
As requirements for our work, we define here the following concepts sequentially: Ideal space, local function, Kuratowski
closure, dense, T*-dense, I-dense, codense, ψ-operator, resolvable, I-open, pre-I-open, scattered set and Housdorff space.
We start define the ideal space. Let (X, T) be a topological space with no separation properties assumed. The topic of
ideal topological space has been considered by (Kuratowski, 1966) and (Vaidyanathaswamy, 1960). An ideal I on a
topological space (X, T) is a nonempty collection of subsets of X which satisfies the following two condition:
(1) If A I and B A, then B I (heredity).
(2) If A I and B I, then A B I (finite additivity).
Moreover a σ-ideal on (X, T) is an ideal which settle (1), (2) and the following condition:
3.If {Ai : i = 1,2,3,….} I, then {Ai : i =1,2,3,….} I (countable additivity).
An ideal space is a topological space (X, T) with an ideal I on X and is denoted by (X, T, I).For a subset A X, A*( I)={x
X : U A I for every U T (x)} is called the local function of A with respect to I and T (Kuratowski, 1933).We simply write
A* instead of A*( I) in case there is no chance for disorder. It is familiar that Cl*(A) = A A* defines a Kuratowski closure
operator for a topology T *(I) which is finer than T. During this paper, for a subset A X, Cl (A) and In (A) indicate the
closure and the interior of A ,respectively. A subset A of an ideal space (X, T, I) is said to be dense (resp, T *-dense
(Dontcher, Gansster and Rose, 1999), I –dense (Dontcher, Gansster and Rose,1999) if Cl (A) = X (resp Cl*(A) = X, A*=
X).An ideal I on a space (X, T) is said to be codense (Devid, Sivaraj and Chelvam, 2005) if and only if T I = {Ф}.For an
ideal space (X, T, I) and for any A X, where I is codense. Then: dense, T*-dense and I-dense are comparable (Jankovic
and Hamlett, 1990). (Natkanies, 1986) used the idea of ideals to define another operator known as ψ-operator elucidates
as follow: For a subset A X, ψ (A) = X-(X-A)*.Equivalently ψ(A) = {M T: M-A I}.It is obvious that ψ(A) for any A is a
member of T. For an ideal space (X, T, I) and Y X then (Y, T y, I y) is an ideal space where T y = {U Y: U T} and I y =
{U Y: U I} = {U I: U Y}. In 1943, Hewitt put forward the opinion of a resolvable space as follows: A nonempty
topological space (X, T) is said to be resolvable (Hewitt, 1943) if X is the disjoint union of two dense subsets. Given a
space (X, T) and A X, A is called I -open (Jankovic and Hamlett, 1990 )(resp per- I –open(Donkhev,1996)if A In
(A*)(resp A In Cl*(A).A set A X is called scattered (Jankovic and Hamlett, 1990) if A contains no nonempty dense-in-
itself subset. A space (X, T, I) is called I -Housdorff (Dontcher,1995) if for each two distinct points x ≠ y, there exist I -
open sets U and V containing x and y respectively, such that U V=Ф. Throughout this paper we define a new local
function and generalizations .Many characterizations, proprieties and relation between them are obtained.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 266
Paper Publications
2. ()Ψ*-OPERATOR
In this section we put forward a new type of local function by using ψ-operator, in order to do this we have to have a deep
looking in (Jankovic and Hamlett, 1992) work of the local function in ideal space.
Definition 2.1
Let (X, T, I) be an ideal space. An operator (.)ψ*: P(x) → P(x), called ψ -local function of A with respect to I and T, is
define as follow: for any A X, Aψ* (I, T)={x X: ψ (U) A I, for every open subset U T(x) }, where T(x)={U T,x U}. When
there is no chance for confusion Aψ* (I, T) is briefly denoted by Aψ*.
Fact
Let (X, T, I) be an ideal space .Then A* Aψ*, for any A X.
Now we define a new closure operator in terms of ψ -local function.
Definition 2.2
Let (X, T, I) be an ideal space. For any A X, we define
(1) Cl ψ (A) = {x X: ψ (U) A ≠ Ф for every U X, x ψ (U)}. It is clear that Cl (A) Cl ψ (A).
(2) Cl ψ*(A) (I, T) = A Aψ*
When there is no chance for confusion Cl ψ*(A) (I, T) is briefly denoted by Cl ψ*(A).
Note
Let (X, T, I) be an ideal space. Then Cl ψ*(A) Cl ψ (A), for any A X.
We discuss the properties of ψ -local function in following theorem:
Theorem 2.3
Let (X, T) be a topological space, I and J be two ideals on X, and let A and B be two subsets of X. Then the following
properties hold:
1. If A B, then Aψ* Bψ*.
2. If I J, then Aψ* (J) Aψ* (I).
3. Aψ* =Cl (Aψ*) Cl ψ (A).
4. (Aψ*)ψ* Aψ*.
5. (A B)ψ* = Aψ* Bψ*
6. (A B)ψ* Aψ* Bψ*
7. For every I ϵ I, then (A I)ψ* = Aψ* = (A  I)ψ*.
8. If G T, then G Aψ* (G A)ψ*.
9. If U T, then U Cl ψ* (A) Cl ψ* (U A).
10. If A I, then Aψ* = Ф.
Proof.
Straight from Definition2.1 and Definition 2.2
3. Ψ - DENSE AND GENERALIZATIONS
Definition 3.1
Let (X, T, I) be an ideal space, A X is called:
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 267
Paper Publications
(1) ψ -dense, if Cl ψ (A) = X.
(2) ψ -T*-dense, if Cl ψ*(A) = X.
(3) ψ -I-dense, if Aψ* = X.
The following remark is immediate from above definitions:
Remark 3.2
(1) If A is ψ -I-dense, then A is ψ -T*-dense.
(2) If A is ψ -T*-dense, then A is ψ -dense.
In the following example we show that the convers of above remark does not hold:
Example 3.3
Let X = {a, b, c}, T = {Ф, X, {a}, {b}. {a, b}} and I = {Ф, {b}}. If A = {a, b}, then Aψ* = {a, c} but Cl ψ* = X.
The study of ideal got new dimension when Codense ideal [ 10 ] has been incorporated in ideal space. In the
following definition we introduce a new concept of condense by using ψ-operator.
Definition 3.4
Let (X, T, I) be an ideal space, an ideal I is called ψ -codense if, ψ (T) I = {Ф}.
Lemma 3.5
Let (X, T, I) be an ideal space and for every subset A X. If A Aψ*, then the following relations hold:
Aψ* = Cl (Aψ*) = Cl ψ (A) = Cl ψ*(A).
Proof.
Clear from Definition 2.2: (1), and Theorem 2.3: (3).
Theorem 3.6
Let (X, T, I) be an ideal space, and for every subset A X. If I is ψ -codense, then the following relations hold:
(1) Where A is ψ -dense, then it is ψ -T*-dense.
(2) Where A is ψ -T*-dense, then it is ψ -I-dense.
Proof.
This is an immediate consequence of Lemma 3.5.
The following theorem related to ψ -codense ideal:
Theorem 3.7
If X is finite, then X=X* if and only if, I is ψ -codense.
Proof.
Necessity. By Theorem 2.5: [1].we get that T I= {Ф}. Since ψ(T) I T I. It follow that ψ(T) I = {Ф}.So I is ψ -codense.
Sufficiency. Assume that I is ψ -codense. Since X-X* is open, let x X-X*. Then there exists Ux X-X*, and x X*.Then
there exists Vx T(x), such that Ux Vx I. Assume that Wx = Ux Vx I. But X-X* = Wx. Hence X-X* I and ψ(T) I ≠
{Ф}, a contradiction. Therefore, X = X*.
Corollary 3.8
Let X be any nonempty set .If (X, T, I) is an ideal space where I is σ-ideal, then the following statement are equivalent:
(1) X = X*;
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 268
Paper Publications
(2) T I = {Ф};
(3) ψ(T) I = {Ф}.
Proof.
Similar to the proof of Theorem 3.7
By Remark 3.2, and Theorem 3.6, the following relations hold:
ψ -dens ᵜ ψ -T*-dense ᵜ ψ -I-dense.
ᵜ: I is ψ -codense.
By Theorem 2.3 :( 2), we have the following remark:
Remark 3.9
(1)Let (X, T, I) and (X, T, J) be two ideal spaces, I J, if A is ψ -I-dense with respect to J ,then A is ψ -I-dense with respect
to I for any A X.
(2) Let (X, T, I) and (X, σ, I) be two ideal spaces, T σ, if A is ψ -I-dense with respect to σ ,then A is ψ -I-dense with
respect to T for any A X.
By Remark 3.2 and Remark 3.9: (1), (2) we get the following corollary:
Corollary 3.10
(1)Let (X, T, I) and (X, T, J) be two ideal spaces, I J, if A is ψ -T*-dense (ψ -dense) with respect to J, then A is ψ -T*-
dense (ψ -dense) with respect to I for any A X.
(2) Let (X, T, I) and (X, σ, I) be two ideal spaces, T σ, if A is ψ -T*-dense (ψ -dense) with respect to σ, then A is ψ -T*-
dense (ψ -dense) with respect to T for any A X.
Definition 3.11
A function f: (X, T, I) → (Y, σ) is called ψ -map if, f (Cl ψ (A)) Cl f (A), for any A X.
Note
Where f:(X,T,I)→(Y,σ,f(I)) is a bijection map ,then f(I) will be an ideal on Y.
Theorem 3.12
If f: (X, T, I) →(Y, σ) is bijection ψ - map .Then the image of any ψ -dense subset A of X is dense in Y.
Proof.
Assume that A is ψ -dense in X. Since f is ψ -map, then f (Cl ψ (A)) Cl (f (A)).Implies that f (X) Cl (f (A)) and since f is
surjection .Therefore, Y= Cl (f (A)). Hence f (A) is dense in Y.
Definition 3.13
A function f:(X,T,I)→(Y,σ,J) is called :
(1) ψ -(I,J) map ,if f (Cl ψ* (A)) Cl* f (A).
(2) ψ 0 - (I,J) map ,if f (Aψ*) (f(A))*.
(3) ψ 1- (I,J) map, if f (Aψ*) (f(A))ψ* .
(4) ψ 2- (I,J) map ,if f (Cl ψ* (A)) Cl ψ* f(A).
(5) ψ 3- (I,J) map, if f(Cl ψ(A)) Cl ψ f(A).
For any A X.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 269
Paper Publications
From the above definitions we get the following remark :
Remark 3.14
(1) ψ 0 - (I, J) map → ψ - (I, J) map.
(2) ψ 1 - (I, J) map → ψ 2 - (I, J) map → ψ 3 - (I, J) map.
Theorem 3.15
(1) If f: (X, T, I) →(Y, σ) is bijection ψ 0-(I, J) map .Then the image of any ψ -I-dense subset A of X is f(I)-dense in Y.
(2) If f: (X, T, I) → (Y, σ) is bijection ψ - (I, J) map. Then the image of any ψ -T*-dense subset A of X is T*-dense in Y.
Proof.
(1)Assume that A is ψ -I-dense in X. Since f is ψ 0-(I, J) map, then f (Aψ*) (f (A))*. Implies that f(X) (f (A))*, and
since f is surjection .Therefore, Y= (f (A))*.Hence f (A) is f (I)-dense in Y.
(2) Assume that A is ψ –T*-dense in X. Since f is ψ -(I, J) map, then f (Clψ*(A)) Cl* f (A)Implies that f(X) Cl* f (A),
and since f is surjection .Therefore, Y= Cl* f (A).Hence f (A) is T*-dense in Y.
Theorem 3.16
(1)If f: (X, T, I) → (Y, σ, J) is ψ 1 - (I, J) bijection map. Then the image of any ψ -I-dense subset of X is ψ -f (I)-dense in
Y.
(2) If f: (X, T, I) → (Y, σ, J) is bijection ψ 2-(I, J) map. Then the image of any ψ -T*-dense subset of X is ψ -T*-dense in
Y.
(3) If f: (X, T, I) → (Y, σ, J) is bijection ψ 3-(I, J) map. Then the image of any ψ -dense subset of X is ψ -dense in Y.
Proof.
(1) Assume that A is ψ-I-dense in X. Since f is ψ 1-(I, J) map then f (Aψ*) (f (A))ψ*,and since f is surjection .Therefore,
Y = (f (A))ψ*.Hence f (A) is ψ -f (I)-dense in Y.
(2) Assume that A is ψ –T*-dense in X. Since f is ψ 2-(I, J) map then f (Clψ*(A)) Cl ψ* f(A), and since f is surjection
.Therefore, Y=Cl ψ*f(A).Hence f (A) is ψ –T*-dense in Y.
(3) Assume that A is ψ-dense in X. Since f is ψ 3-(I, J) map then f(Cl ψ(A)) Cl ψ f(A) and since f is surjection .Therefore,
Y=Cl ψ f(A).Hence f(A) is ψ-dense in Y.
4. Ψ -RESOLVABILITY AND GENERALIZATIONS
In this section we define ψ- resolvable space and recall some of the generalizations of ψ-resolvable and their relationship
with Housdorff space.
Definition 4.1
A nonempty topological space (X, T) is called:
(1) ψ -resolvable, if X is the disjoint union of two ψ -dense subsets.
(2) ψ-T*-resolvable, if X is the disjoint union of T*-dense and ψ-dense subsets.
(3) ψ-I-resolvable, if X is the disjoint union of I-dense and ψ -dense subsets.
It is clear that: ψ -I-resolvable → ψ -T*-resolvable → ψ -resolvable.
Theorem 4.2
Let (X, T) be a nonempty topological space, where I is ψ-codense. Then if X is ψ -T*-resolvability, then X is ψ -I-
resolvability.
Question
We claim that ψ-resolvability does not imply ψ-T*-resolvability, but we could not find an example.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 270
Paper Publications
From Corollary 3.9 we get the following remark:
Remark 4.3
Let (X, T, I) , (X, T, J) be an ideal spaces, with I J, if X is ψ -resolvable with respect to J ,then X is ψ -resolvable with
respect to I.
Definition 4.4
A function f:(X,T,I)→(Y,σ,J) ,is said to be bi*-map if :
(1) f: (X,T,I)→(Y, σ) is ψ 3-(I,J) map;
(2) f: (X,T*)→(Y, σ*) is a continuous map.
Theorem 4.5
Let f :( X, T, I) → (Y, σ) be bijection bi*- map, and if X is ψ -T*-resolvable space .Then Y is ψ -T*-resolvable with
respect to the ideal f (I).
Proof.
Assume that X is ψ -T*-resolvable space, then there exists two disjoint ψ -dense and T*-dense subsets such that Cl ψ (A)
= Cl*(B) = X. It is clear by Corollary 3.16, and Definition 4.4 that Y is ψ -T*-resolvable.
Lemma 4.6
If U is an open set and D ψ* = X, then U (D ψ (U))ψ*.
Proof
Let x U, and suppose if possible that x (D ψ (U))ψ* Then (D ψ (U)) ψ (V) I, and since ψ (U) ψ (V) T. Therefore, x D
ψ* = X. This is a contradiction .That is U (D ψ (U))ψ*.
Theorem 4.7
(1) Let U T and Cl ψ*(D) = X, then U Cl ψ* (D ψ (U)).
(2) Let U T, and Cl ψ (D) = X. Then U Cl ψ (D ψ (U)).
Using Remark 3.2: (1), (2), and similar to the proof of Lemma 4.6.
Theorem 4.8
Let Y T, and Aψ* = X. Then A1ψ y* = Y, where A1 = A y.
Proof.
By lemma 4.6 Y (A Y)ψ x* = A1ψ x*.
Then Y = A1ψ x* y = A1ψ y*.
Using Remark 3. 2 :(1) ,(2), and Theorem 4.8we get the following theorem:
Theorem 4.9
(1) Let Y T, and Cl ψ*(A) = X. Then Cl ψ*y (A1) = Y, where A1 = A Y.
(2) Let Y T, and Cl ψ (A) = X. Then Cl ψ y (A1) = Y, where A1 = A Y.
Theorem 4.10
(1) Let (X, T, I) be ψ -I-resolvable space, if Y is open .Then (Y, Ty, I y) is ψ –I y- resolvable.
(2) Let (X, T, I) be ψ -T*-resolvable space, if Y is open .Then (Y, Ty, I y) is ψ -T*y- resolvable.
(3) Let (X, T, I) be ψ -resolvable space, if Y is open .Then (Y, Ty, I y) is ψ - resolvable.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 271
Paper Publications
Proof.
(1) Assume that (X, T, I) is ψ -I-resolvable space .Then there exists two disjoint ψ -dense, and I-dense subsets such that: A
B = X, and Cl ψ (A) = B* = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) = Ф. Put A1
= A Y and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By corollary 3.10: (2), we have Cl ψ y (A1) = Y, and by lemma we
have B*1y = Y. Hence (Y, Ty, I y) is ψ –I y-resolvable.
(2) Assume that (X, T, I) is ψ –T*-resolvable space .Then there exists two disjoint ψ -dense, and T*-dense subsets such
that: A B = X, and Clψ (A) = Cl*(B) = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) =
Ф. Put A1 = A Y and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By Theorem 2.3.20: (3), we have Clψ y (A1) = Y, Cl*1y
= Y. Hence (Y, Ty, I y) is ψ –T* y-resolvable.
(3) Assume that (X, T, I) is ψ -resolvable space .Then there exists two disjoint ψ –dense subsets such that: A B = X, and
Clψ (A) = Clψ (B) = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) = Ф. Put A1 = A Y
and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By Theorem 2.3.20: (3), we have Clψ y (A1) = Clψ y (A1) = Y. Hence (Y,
Ty, I y) is ψ – Ty - resolvable.
Definition 4.11
In ideal space (X, T, I) A subset A is called ψ -pre-open if A In Cl ψ (A).
Definition 4.12
(1) An ideal space (X, T, I) is called ψ -I -Housdorff, if for every distinct point x, y X, there exist two disassociate ψ -pre-
open, and I-open sets containing each respectively.
(2) An ideal space (X, T, I) is called ψ -T*-Housdorff, if for every distinct point x, y X, there exist two disjoint ψ -pre-
open, and pre-I-open sets containing each respectively.
(3) An ideal space (X, T, I) is called ψ -Housdorff, if for every distinct point x, y X, there exist two disjoint ψ -pre-open
sets containing each respectively.
Lemma 4.13
If ({x})ψ I. Then ({x})ψ* = Ф.
Proof.
Assume that ({x})ψ* ≠ Ф, then there exist y ({x})ψ* such that ψ (U) {x} I for every U T(x). Implies that ({x})ψ I. This
is a contradiction.
Theorem 4.14
(1) If an ideal space (X, T, I) is ψ -I-resolvable, and the scattered set of (X, T) are in I, then (X, T, I) is ψ -I-Housdorff.
(2) If an ideal space (X, T, I) is ψ -T*-resolvable, and the scattered set of (X, T*) are in I, then (X, T, I) is ψ -T*-
Housdorff.
(3) If an ideal space (X, T, I) is ψ -resolvable, and the scattered set of (X, T) are in I, then (X, T, I) is ψ -Housdorff.
Proof.
(1) Let A and B be disjoint ψ -dense, and I-dense subsets of X such that X = A B. Since Clψ (A) = X, B* = X. Therefore,
A In Clψ (A) and B In B*, then A and B are ψ -pre-open and I-open sets respectively. Let x, y be any two element of X
and both x and y are in A .Take V = A{y} and U = B {y}. It is easily observed (see [6], Theorem 2.3 (h)]) that V also I-
open set and y in V. Now to show that U = A {x} is ψ -pre-open. Clψ (A {x}) = Clψ (A) Clψ ({x} = X Clψ ({x}) = X
.Hence A {x} In Clψ (A {x}), so U is ψ -pre-open. Hence (X, T, I) is ψ -I-Housdorff.
(2) Let A and B be disjoint T*-dense, and ψ-dense subsets of X such that X = A B. Since Cl* (A) = X and Clψ (B) = X.
Therefore, A In Cl* (A) and B In Clψ (B), then A and B are pre- I-open and ψ -pre-open sets respectively. Let x, y be
any two element of X and both x and y are in A .Take V = A{y} and U = B {y}. To show that V also pre- I-open set
Cl*(A{y}) = Cl*(A)  Cl* ({y}) = X. Hence A{y} In Cl*(A{y}.Therefore, V is pre-I-open. Now to show that U = B
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 272
Paper Publications
{y} is ψ -pre-open. Clψ (B {y}) = Clψ (B) Clψ{y} = X Clψ ({y}) = X .Hence B {y} In Clψ (B {y}), so U is ψ -pre-
open. Hence (X, T, I) is ψ –T*-Housdorff.
(3) Let A and B be disjoint ψ -dense subsets of X such that X = A B. Since Clψ(A) = Clψ(B) = X. Therefore, A In Clψ(A)
and B In Clψ(B), then A and B are ψ-pre-open sets. Let x, y be any two element of X and both x and y are in A. Take U
= A{y} and V = B {y}. By Theorem 2.1.5: (8) we have V and U are ψ-pre-open sets. To show that U is ψ-pre-open, Clψ
(A{y}) = Clψ (A) Clψ({y}) = X Clψ({y}) = X, A{y} In Clψ(A). Now to show that V is ψ-pre-open. Clψ(B {y}) =
Clψ(B) Clψ({y}) = X, B {y} In Clψ(B). Hence U,V are ψ-pre-open. Therefore, (X, T, I) is ψ-Housdorff.
REFERENCES
[1] Dontchev, J., Ganster, M., Rose, D., Ideal resolvability.Topology and its Appl. 93(1999), 1-16.
[2] J Dontcher, On Housdorff spaces via topology ideals and I-irresolute functions Annals of the New York Academy
of Sciences, Papers on General Topology and Applications, Vol.767(1995), 28-38.
[3] J.Donkhev, On pre-I-open sets and a decomposition of I-continuity, Banyan Math. J., 2 (1996).
[4] J. Dontcher, M.Ganster, D.Rose, Ideal resolvability, Topology and its Applications, 19(1999), 1-6.
[5] E.Hewitt, A problem of set-theoretic topology, Duke Math.J,10 (1943),309-333.
[6] D.Jankovic and T.R.Hamlett, New topologies from old via ideals, Amer. Math. Monthly, 97(1990),295-310.
[7] D. Jankovic and T.R.Hamlett, Compatible Extensions of Ideals, Bollettino U.M.I,7(1992),453-465.
[8] K.Kuratowski,Topology,Vol 1,Academic Press, New York,1966. K. Kuratowski, Topology I, Warszawa, 1933.
[9] T.Natkaniec, On I-continuitty and I-semicontinuity points, Math Solvaca, 36:3 (1986), 297-312.
[10] V.R.Devid.Sivaraj, T.T. Chelvam, Codense and completely codense ideals, Acta Nath. Hungar. 108 (2005) 197-205.
[11] R.Vaidyanathaswamy, set topology, Ghelsea Publishing company (1960).

More Related Content

What's hot

plucker
pluckerplucker
plucker
CNP Slagle
 
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
BIOLOGICAL FORUM
 
Fixed point theorems in random fuzzy metric space through
Fixed point theorems in random fuzzy metric space throughFixed point theorems in random fuzzy metric space through
Fixed point theorems in random fuzzy metric space through
Alexander Decker
 
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
IOSR Journals
 
Homogeneous Components of a CDH Fuzzy Space
Homogeneous Components of a CDH Fuzzy SpaceHomogeneous Components of a CDH Fuzzy Space
Homogeneous Components of a CDH Fuzzy Space
IJECEIAES
 
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
IJERA Editor
 
A Fixed Point Theorem Using Common Property (E. A.) In PM Spaces
A Fixed Point Theorem Using Common Property (E. A.) In PM SpacesA Fixed Point Theorem Using Common Property (E. A.) In PM Spaces
A Fixed Point Theorem Using Common Property (E. A.) In PM Spaces
inventionjournals
 
Common fixed points of weakly reciprocally continuous maps using a gauge func...
Common fixed points of weakly reciprocally continuous maps using a gauge func...Common fixed points of weakly reciprocally continuous maps using a gauge func...
Common fixed points of weakly reciprocally continuous maps using a gauge func...
Alexander Decker
 
11.common fixed points of weakly reciprocally continuous maps using a gauge f...
11.common fixed points of weakly reciprocally continuous maps using a gauge f...11.common fixed points of weakly reciprocally continuous maps using a gauge f...
11.common fixed points of weakly reciprocally continuous maps using a gauge f...
Alexander Decker
 
K-algebras on quadripartitioned single valued neutrosophic sets
K-algebras on quadripartitioned single valued neutrosophic setsK-algebras on quadripartitioned single valued neutrosophic sets
K-algebras on quadripartitioned single valued neutrosophic sets
Journal of Fuzzy Extension and Applications
 
Contra qpi continuous functions in ideal bitopological spaces
Contra qpi  continuous functions in ideal bitopological spacesContra qpi  continuous functions in ideal bitopological spaces
Contra qpi continuous functions in ideal bitopological spaces
Alexander Decker
 
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...
inventy
 
Partitioning procedures for solving mixed-variables programming problems
Partitioning procedures for solving mixed-variables programming problemsPartitioning procedures for solving mixed-variables programming problems
Partitioning procedures for solving mixed-variables programming problems
SSA KPI
 
Common fixed point theorem for occasionally weakly compatible mapping in q fu...
Common fixed point theorem for occasionally weakly compatible mapping in q fu...Common fixed point theorem for occasionally weakly compatible mapping in q fu...
Common fixed point theorem for occasionally weakly compatible mapping in q fu...
Alexander Decker
 
Bd32360363
Bd32360363Bd32360363
Bd32360363
IJERA Editor
 
Common fixed point theorems with continuously subcompatible mappings in fuzz...
 Common fixed point theorems with continuously subcompatible mappings in fuzz... Common fixed point theorems with continuously subcompatible mappings in fuzz...
Common fixed point theorems with continuously subcompatible mappings in fuzz...
Alexander Decker
 
E42012426
E42012426E42012426
E42012426
IJERA Editor
 
Fuzzy Homogeneous Bitopological Spaces
Fuzzy  Homogeneous Bitopological Spaces Fuzzy  Homogeneous Bitopological Spaces
Fuzzy Homogeneous Bitopological Spaces
IJECEIAES
 
Common fixed theorems for weakly compatible mappings via an
Common fixed theorems for weakly compatible mappings via anCommon fixed theorems for weakly compatible mappings via an
Common fixed theorems for weakly compatible mappings via an
Alexander Decker
 
On common fixed point theorem in fuzzy metric space
On common fixed point theorem in fuzzy metric spaceOn common fixed point theorem in fuzzy metric space
On common fixed point theorem in fuzzy metric space
Alexander Decker
 

What's hot (20)

plucker
pluckerplucker
plucker
 
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastava
 
Fixed point theorems in random fuzzy metric space through
Fixed point theorems in random fuzzy metric space throughFixed point theorems in random fuzzy metric space through
Fixed point theorems in random fuzzy metric space through
 
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
On Fuzzy  - Semi Open Sets and Fuzzy  - Semi Closed Sets in Fuzzy Topologic...
 
Homogeneous Components of a CDH Fuzzy Space
Homogeneous Components of a CDH Fuzzy SpaceHomogeneous Components of a CDH Fuzzy Space
Homogeneous Components of a CDH Fuzzy Space
 
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)
 
A Fixed Point Theorem Using Common Property (E. A.) In PM Spaces
A Fixed Point Theorem Using Common Property (E. A.) In PM SpacesA Fixed Point Theorem Using Common Property (E. A.) In PM Spaces
A Fixed Point Theorem Using Common Property (E. A.) In PM Spaces
 
Common fixed points of weakly reciprocally continuous maps using a gauge func...
Common fixed points of weakly reciprocally continuous maps using a gauge func...Common fixed points of weakly reciprocally continuous maps using a gauge func...
Common fixed points of weakly reciprocally continuous maps using a gauge func...
 
11.common fixed points of weakly reciprocally continuous maps using a gauge f...
11.common fixed points of weakly reciprocally continuous maps using a gauge f...11.common fixed points of weakly reciprocally continuous maps using a gauge f...
11.common fixed points of weakly reciprocally continuous maps using a gauge f...
 
K-algebras on quadripartitioned single valued neutrosophic sets
K-algebras on quadripartitioned single valued neutrosophic setsK-algebras on quadripartitioned single valued neutrosophic sets
K-algebras on quadripartitioned single valued neutrosophic sets
 
Contra qpi continuous functions in ideal bitopological spaces
Contra qpi  continuous functions in ideal bitopological spacesContra qpi  continuous functions in ideal bitopological spaces
Contra qpi continuous functions in ideal bitopological spaces
 
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...
 
Partitioning procedures for solving mixed-variables programming problems
Partitioning procedures for solving mixed-variables programming problemsPartitioning procedures for solving mixed-variables programming problems
Partitioning procedures for solving mixed-variables programming problems
 
Common fixed point theorem for occasionally weakly compatible mapping in q fu...
Common fixed point theorem for occasionally weakly compatible mapping in q fu...Common fixed point theorem for occasionally weakly compatible mapping in q fu...
Common fixed point theorem for occasionally weakly compatible mapping in q fu...
 
Bd32360363
Bd32360363Bd32360363
Bd32360363
 
Common fixed point theorems with continuously subcompatible mappings in fuzz...
 Common fixed point theorems with continuously subcompatible mappings in fuzz... Common fixed point theorems with continuously subcompatible mappings in fuzz...
Common fixed point theorems with continuously subcompatible mappings in fuzz...
 
E42012426
E42012426E42012426
E42012426
 
Fuzzy Homogeneous Bitopological Spaces
Fuzzy  Homogeneous Bitopological Spaces Fuzzy  Homogeneous Bitopological Spaces
Fuzzy Homogeneous Bitopological Spaces
 
Common fixed theorems for weakly compatible mappings via an
Common fixed theorems for weakly compatible mappings via anCommon fixed theorems for weakly compatible mappings via an
Common fixed theorems for weakly compatible mappings via an
 
On common fixed point theorem in fuzzy metric space
On common fixed point theorem in fuzzy metric spaceOn common fixed point theorem in fuzzy metric space
On common fixed point theorem in fuzzy metric space
 

Viewers also liked

Study of Color Image Processing For Capturing and Comparing Images
Study of Color Image Processing For Capturing and Comparing ImagesStudy of Color Image Processing For Capturing and Comparing Images
Study of Color Image Processing For Capturing and Comparing Images
paperpublications3
 
Cloud Computing Security Issues and Challenges
Cloud Computing Security Issues and ChallengesCloud Computing Security Issues and Challenges
Cloud Computing Security Issues and Challenges
paperpublications3
 
Applying Agile Methodologies on Large Software Projects
Applying Agile Methodologies on Large Software ProjectsApplying Agile Methodologies on Large Software Projects
Applying Agile Methodologies on Large Software Projects
paperpublications3
 
Co-Clustering For Cross-Domain Text Classification
Co-Clustering For Cross-Domain Text ClassificationCo-Clustering For Cross-Domain Text Classification
Co-Clustering For Cross-Domain Text Classification
paperpublications3
 
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...
paperpublications3
 
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc NetworkDeterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
paperpublications3
 
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
paperpublications3
 
Big Data on Implementation of Many to Many Clustering
Big Data on Implementation of Many to Many ClusteringBig Data on Implementation of Many to Many Clustering
Big Data on Implementation of Many to Many Clustering
paperpublications3
 
On the Zeros of Polar Derivatives
On the Zeros of Polar DerivativesOn the Zeros of Polar Derivatives
On the Zeros of Polar Derivatives
paperpublications3
 
Study Kc - Spaces Via ω-Open Sets
Study Kc - Spaces Via ω-Open SetsStudy Kc - Spaces Via ω-Open Sets
Study Kc - Spaces Via ω-Open Sets
paperpublications3
 
Non Split Edge Domination in Fuzzy Graphs
Non Split Edge Domination in Fuzzy GraphsNon Split Edge Domination in Fuzzy Graphs
Non Split Edge Domination in Fuzzy Graphs
paperpublications3
 
Enhance The Technique For Searching Dimension Incomplete Databases
Enhance The Technique For Searching Dimension Incomplete DatabasesEnhance The Technique For Searching Dimension Incomplete Databases
Enhance The Technique For Searching Dimension Incomplete Databases
paperpublications3
 
Private Mobile Search Engine Using RSVM Training
Private Mobile Search Engine Using RSVM TrainingPrivate Mobile Search Engine Using RSVM Training
Private Mobile Search Engine Using RSVM Training
paperpublications3
 
Comparative Performance Analysis & Complexity of Different Sorting Algorithm
Comparative Performance Analysis & Complexity of Different Sorting AlgorithmComparative Performance Analysis & Complexity of Different Sorting Algorithm
Comparative Performance Analysis & Complexity of Different Sorting Algorithm
paperpublications3
 
Analysis of Classification Approaches
Analysis of Classification ApproachesAnalysis of Classification Approaches
Analysis of Classification Approaches
paperpublications3
 
Delay Constrained Energy Efficient Data Transmission over WSN
Delay Constrained Energy Efficient Data Transmission over WSNDelay Constrained Energy Efficient Data Transmission over WSN
Delay Constrained Energy Efficient Data Transmission over WSN
paperpublications3
 
An Algorithm Analysis on Data Mining
An Algorithm Analysis on Data MiningAn Algorithm Analysis on Data Mining
An Algorithm Analysis on Data Mining
paperpublications3
 
An Advanced IR System of Relational Keyword Search Technique
An Advanced IR System of Relational Keyword Search TechniqueAn Advanced IR System of Relational Keyword Search Technique
An Advanced IR System of Relational Keyword Search Technique
paperpublications3
 
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
paperpublications3
 
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETEntropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
paperpublications3
 

Viewers also liked (20)

Study of Color Image Processing For Capturing and Comparing Images
Study of Color Image Processing For Capturing and Comparing ImagesStudy of Color Image Processing For Capturing and Comparing Images
Study of Color Image Processing For Capturing and Comparing Images
 
Cloud Computing Security Issues and Challenges
Cloud Computing Security Issues and ChallengesCloud Computing Security Issues and Challenges
Cloud Computing Security Issues and Challenges
 
Applying Agile Methodologies on Large Software Projects
Applying Agile Methodologies on Large Software ProjectsApplying Agile Methodologies on Large Software Projects
Applying Agile Methodologies on Large Software Projects
 
Co-Clustering For Cross-Domain Text Classification
Co-Clustering For Cross-Domain Text ClassificationCo-Clustering For Cross-Domain Text Classification
Co-Clustering For Cross-Domain Text Classification
 
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...
 
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc NetworkDeterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
 
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
 
Big Data on Implementation of Many to Many Clustering
Big Data on Implementation of Many to Many ClusteringBig Data on Implementation of Many to Many Clustering
Big Data on Implementation of Many to Many Clustering
 
On the Zeros of Polar Derivatives
On the Zeros of Polar DerivativesOn the Zeros of Polar Derivatives
On the Zeros of Polar Derivatives
 
Study Kc - Spaces Via ω-Open Sets
Study Kc - Spaces Via ω-Open SetsStudy Kc - Spaces Via ω-Open Sets
Study Kc - Spaces Via ω-Open Sets
 
Non Split Edge Domination in Fuzzy Graphs
Non Split Edge Domination in Fuzzy GraphsNon Split Edge Domination in Fuzzy Graphs
Non Split Edge Domination in Fuzzy Graphs
 
Enhance The Technique For Searching Dimension Incomplete Databases
Enhance The Technique For Searching Dimension Incomplete DatabasesEnhance The Technique For Searching Dimension Incomplete Databases
Enhance The Technique For Searching Dimension Incomplete Databases
 
Private Mobile Search Engine Using RSVM Training
Private Mobile Search Engine Using RSVM TrainingPrivate Mobile Search Engine Using RSVM Training
Private Mobile Search Engine Using RSVM Training
 
Comparative Performance Analysis & Complexity of Different Sorting Algorithm
Comparative Performance Analysis & Complexity of Different Sorting AlgorithmComparative Performance Analysis & Complexity of Different Sorting Algorithm
Comparative Performance Analysis & Complexity of Different Sorting Algorithm
 
Analysis of Classification Approaches
Analysis of Classification ApproachesAnalysis of Classification Approaches
Analysis of Classification Approaches
 
Delay Constrained Energy Efficient Data Transmission over WSN
Delay Constrained Energy Efficient Data Transmission over WSNDelay Constrained Energy Efficient Data Transmission over WSN
Delay Constrained Energy Efficient Data Transmission over WSN
 
An Algorithm Analysis on Data Mining
An Algorithm Analysis on Data MiningAn Algorithm Analysis on Data Mining
An Algorithm Analysis on Data Mining
 
An Advanced IR System of Relational Keyword Search Technique
An Advanced IR System of Relational Keyword Search TechniqueAn Advanced IR System of Relational Keyword Search Technique
An Advanced IR System of Relational Keyword Search Technique
 
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
 
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETEntropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
 

Similar to Using ψ-Operator to Formulate a New Definition of Local Function

Fixed points of contractive and Geraghty contraction mappings under the influ...
Fixed points of contractive and Geraghty contraction mappings under the influ...Fixed points of contractive and Geraghty contraction mappings under the influ...
Fixed points of contractive and Geraghty contraction mappings under the influ...
IJERA Editor
 
Ab4101165167
Ab4101165167Ab4101165167
Ab4101165167
IJERA Editor
 
CONTINUITY ON N-ARY SPACES
CONTINUITY ON N-ARY SPACESCONTINUITY ON N-ARY SPACES
CONTINUITY ON N-ARY SPACES
IAEME Publication
 
Complete l fuzzy metric spaces and common fixed point theorems
Complete l fuzzy metric spaces and  common fixed point theoremsComplete l fuzzy metric spaces and  common fixed point theorems
Complete l fuzzy metric spaces and common fixed point theorems
Alexander Decker
 
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) PropertyFixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
inventionjournals
 
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
mathsjournal
 
Common Fixed Point Theorems For Occasionally Weakely Compatible Mappings
Common Fixed Point Theorems For Occasionally Weakely Compatible MappingsCommon Fixed Point Theorems For Occasionally Weakely Compatible Mappings
Common Fixed Point Theorems For Occasionally Weakely Compatible Mappings
iosrjce
 
PaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMFPaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMF
Mezban Habibi
 
PaperNo19-habibiIJMA13-16-2013-IJMA
PaperNo19-habibiIJMA13-16-2013-IJMAPaperNo19-habibiIJMA13-16-2013-IJMA
PaperNo19-habibiIJMA13-16-2013-IJMA
Mezban Habibi
 
PaperNo18-habibiIMF9-12-2013-IMF
PaperNo18-habibiIMF9-12-2013-IMFPaperNo18-habibiIMF9-12-2013-IMF
PaperNo18-habibiIMF9-12-2013-IMF
Mezban Habibi
 
somenath_fixedpoint_dasguptaIMF17-20-2013
somenath_fixedpoint_dasguptaIMF17-20-2013somenath_fixedpoint_dasguptaIMF17-20-2013
somenath_fixedpoint_dasguptaIMF17-20-2013
Somenath Bandyopadhyay
 
On Application of Unbounded Hilbert Linear Operators in Quantum Mechanics
On Application of Unbounded Hilbert Linear Operators in Quantum MechanicsOn Application of Unbounded Hilbert Linear Operators in Quantum Mechanics
On Application of Unbounded Hilbert Linear Operators in Quantum Mechanics
BRNSS Publication Hub
 
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
eSAT Journals
 
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
eSAT Publishing House
 
H03702061062
H03702061062H03702061062
H03702061062
theijes
 
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...Existence Theory for Second Order Nonlinear Functional Random Differential Eq...
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...
IOSR Journals
 
applied mathematics methods.pdf
applied mathematics methods.pdfapplied mathematics methods.pdf
applied mathematics methods.pdf
CyprianObota
 
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
mathsjournal
 
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
mathsjournal
 
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
mathsjournal
 

Similar to Using ψ-Operator to Formulate a New Definition of Local Function (20)

Fixed points of contractive and Geraghty contraction mappings under the influ...
Fixed points of contractive and Geraghty contraction mappings under the influ...Fixed points of contractive and Geraghty contraction mappings under the influ...
Fixed points of contractive and Geraghty contraction mappings under the influ...
 
Ab4101165167
Ab4101165167Ab4101165167
Ab4101165167
 
CONTINUITY ON N-ARY SPACES
CONTINUITY ON N-ARY SPACESCONTINUITY ON N-ARY SPACES
CONTINUITY ON N-ARY SPACES
 
Complete l fuzzy metric spaces and common fixed point theorems
Complete l fuzzy metric spaces and  common fixed point theoremsComplete l fuzzy metric spaces and  common fixed point theorems
Complete l fuzzy metric spaces and common fixed point theorems
 
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) PropertyFixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
 
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...
 
Common Fixed Point Theorems For Occasionally Weakely Compatible Mappings
Common Fixed Point Theorems For Occasionally Weakely Compatible MappingsCommon Fixed Point Theorems For Occasionally Weakely Compatible Mappings
Common Fixed Point Theorems For Occasionally Weakely Compatible Mappings
 
PaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMFPaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMF
 
PaperNo19-habibiIJMA13-16-2013-IJMA
PaperNo19-habibiIJMA13-16-2013-IJMAPaperNo19-habibiIJMA13-16-2013-IJMA
PaperNo19-habibiIJMA13-16-2013-IJMA
 
PaperNo18-habibiIMF9-12-2013-IMF
PaperNo18-habibiIMF9-12-2013-IMFPaperNo18-habibiIMF9-12-2013-IMF
PaperNo18-habibiIMF9-12-2013-IMF
 
somenath_fixedpoint_dasguptaIMF17-20-2013
somenath_fixedpoint_dasguptaIMF17-20-2013somenath_fixedpoint_dasguptaIMF17-20-2013
somenath_fixedpoint_dasguptaIMF17-20-2013
 
On Application of Unbounded Hilbert Linear Operators in Quantum Mechanics
On Application of Unbounded Hilbert Linear Operators in Quantum MechanicsOn Application of Unbounded Hilbert Linear Operators in Quantum Mechanics
On Application of Unbounded Hilbert Linear Operators in Quantum Mechanics
 
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
 
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...Semicompatibility and fixed point theorem in fuzzy metric space using implici...
Semicompatibility and fixed point theorem in fuzzy metric space using implici...
 
H03702061062
H03702061062H03702061062
H03702061062
 
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...Existence Theory for Second Order Nonlinear Functional Random Differential Eq...
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...
 
applied mathematics methods.pdf
applied mathematics methods.pdfapplied mathematics methods.pdf
applied mathematics methods.pdf
 
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
 
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
 
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...
 

Recently uploaded

Mariano G Tinti - Decoding SpaceX
Mariano G Tinti - Decoding SpaceXMariano G Tinti - Decoding SpaceX
Mariano G Tinti - Decoding SpaceX
Mariano Tinti
 
20240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 202420240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
Matthew Sinclair
 
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success StoryDriving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Safe Software
 
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 daysPushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
Adtran
 
RESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for studentsRESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for students
KAMESHS29
 
Removing Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software FuzzingRemoving Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software Fuzzing
Aftab Hussain
 
TrustArc Webinar - 2024 Global Privacy Survey
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc Webinar - 2024 Global Privacy Survey
TrustArc Webinar - 2024 Global Privacy Survey
TrustArc
 
Infrastructure Challenges in Scaling RAG with Custom AI models
Infrastructure Challenges in Scaling RAG with Custom AI modelsInfrastructure Challenges in Scaling RAG with Custom AI models
Infrastructure Challenges in Scaling RAG with Custom AI models
Zilliz
 
Artificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopmentArtificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopment
Octavian Nadolu
 
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUHCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
panagenda
 
Serial Arm Control in Real Time Presentation
Serial Arm Control in Real Time PresentationSerial Arm Control in Real Time Presentation
Serial Arm Control in Real Time Presentation
tolgahangng
 
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalizationFull-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
Zilliz
 
UiPath Test Automation using UiPath Test Suite series, part 6
UiPath Test Automation using UiPath Test Suite series, part 6UiPath Test Automation using UiPath Test Suite series, part 6
UiPath Test Automation using UiPath Test Suite series, part 6
DianaGray10
 
UiPath Test Automation using UiPath Test Suite series, part 5
UiPath Test Automation using UiPath Test Suite series, part 5UiPath Test Automation using UiPath Test Suite series, part 5
UiPath Test Automation using UiPath Test Suite series, part 5
DianaGray10
 
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfUnlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Malak Abu Hammad
 
Programming Foundation Models with DSPy - Meetup Slides
Programming Foundation Models with DSPy - Meetup SlidesProgramming Foundation Models with DSPy - Meetup Slides
Programming Foundation Models with DSPy - Meetup Slides
Zilliz
 
GenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizationsGenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizations
kumardaparthi1024
 
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
Neo4j
 
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
Neo4j
 
“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”
Claudio Di Ciccio
 

Recently uploaded (20)

Mariano G Tinti - Decoding SpaceX
Mariano G Tinti - Decoding SpaceXMariano G Tinti - Decoding SpaceX
Mariano G Tinti - Decoding SpaceX
 
20240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 202420240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
 
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success StoryDriving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success Story
 
Pushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 daysPushing the limits of ePRTC: 100ns holdover for 100 days
Pushing the limits of ePRTC: 100ns holdover for 100 days
 
RESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for studentsRESUME BUILDER APPLICATION Project for students
RESUME BUILDER APPLICATION Project for students
 
Removing Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software FuzzingRemoving Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software Fuzzing
 
TrustArc Webinar - 2024 Global Privacy Survey
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc Webinar - 2024 Global Privacy Survey
TrustArc Webinar - 2024 Global Privacy Survey
 
Infrastructure Challenges in Scaling RAG with Custom AI models
Infrastructure Challenges in Scaling RAG with Custom AI modelsInfrastructure Challenges in Scaling RAG with Custom AI models
Infrastructure Challenges in Scaling RAG with Custom AI models
 
Artificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopmentArtificial Intelligence for XMLDevelopment
Artificial Intelligence for XMLDevelopment
 
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUHCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
 
Serial Arm Control in Real Time Presentation
Serial Arm Control in Real Time PresentationSerial Arm Control in Real Time Presentation
Serial Arm Control in Real Time Presentation
 
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalizationFull-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
 
UiPath Test Automation using UiPath Test Suite series, part 6
UiPath Test Automation using UiPath Test Suite series, part 6UiPath Test Automation using UiPath Test Suite series, part 6
UiPath Test Automation using UiPath Test Suite series, part 6
 
UiPath Test Automation using UiPath Test Suite series, part 5
UiPath Test Automation using UiPath Test Suite series, part 5UiPath Test Automation using UiPath Test Suite series, part 5
UiPath Test Automation using UiPath Test Suite series, part 5
 
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfUnlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf
 
Programming Foundation Models with DSPy - Meetup Slides
Programming Foundation Models with DSPy - Meetup SlidesProgramming Foundation Models with DSPy - Meetup Slides
Programming Foundation Models with DSPy - Meetup Slides
 
GenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizationsGenAI Pilot Implementation in the organizations
GenAI Pilot Implementation in the organizations
 
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...
 
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
 
“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”
 

Using ψ-Operator to Formulate a New Definition of Local Function

  • 1. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 265 Paper Publications Using ψ-Operator to Formulate a New Definition of Local Function 1 Dr.Luay A.A.AL-Swidi, 2 Dr.Asaad M.A.AL-Hosainy, 3 Reyam Q.M.AL-Feehan 1 Professor, 2 Ass. Professor, 3 Msc. Student, 1, 2, 3 Department of Mathematics College of Education for Pure Science Babylon University Abstract: In this paper, we use ψ-operator in order to get a new version of local function. The concepts of maps, dense, resolvable and Housdorff have been investigated in this paper, as well as modified to be useful in general ‫صت‬ ‫ال‬‫خ‬ ‫:ان‬ ‫ُا‬ ‫تخدي‬ ‫س‬ ‫ا‬ ً ‫ف‬ ‫ْذا‬ ‫بحث‬ ‫ان‬ ‫ٍت‬ ‫ه‬ ً‫ع‬ ‫ان‬ ‫ساي‬ ‫اب‬ ٍ‫ي‬ ‫أجم‬ ‫صٕل‬ ‫ح‬ ‫ان‬ ‫هى‬ ‫ع‬ ّ‫سخ‬ َ ِ‫د‬ ٌ‫جد‬ ٍ‫ي‬ ‫ت‬ ‫دان‬ ‫ان‬ ‫ٍت‬ ‫ه‬ ‫ًح‬ ‫د.ان‬ ‫ٔق‬ ‫ى‬ ‫ت‬ ‫ٍق‬ ‫ق‬ ‫تح‬ ‫ان‬ ً ‫ف‬ ‫ٍى‬ ْ‫فا‬ ‫ي‬ ‫دٔال‬ ‫,ان‬ ‫ت‬ ‫ثاف‬ ‫ك‬ ‫ًجًٕعاث,ان‬ ‫ان‬ ‫هت‬ ‫قاب‬ ‫ان‬ ‫هحم‬ ‫ن‬ ٔ ‫ضاء‬ ‫ف‬ ‫سدٔرف‬ ٔ‫ٓا‬‫ك,ان‬ ‫ذن‬ ‫ٔك‬ ‫هٓا‬ ٌ‫عد‬ ‫ت‬ ٌٕ‫ك‬ ‫ت‬ ‫ن‬ ‫ٍدة‬ ‫ف‬ ‫ي‬ ‫كم‬ ‫ش‬ ‫ب‬ ‫.عاو‬ Keywords: ψ-operator, dense, resolvable and Housdorff. 1. INTRODUCTION AND PRILMINARIES As requirements for our work, we define here the following concepts sequentially: Ideal space, local function, Kuratowski closure, dense, T*-dense, I-dense, codense, ψ-operator, resolvable, I-open, pre-I-open, scattered set and Housdorff space. We start define the ideal space. Let (X, T) be a topological space with no separation properties assumed. The topic of ideal topological space has been considered by (Kuratowski, 1966) and (Vaidyanathaswamy, 1960). An ideal I on a topological space (X, T) is a nonempty collection of subsets of X which satisfies the following two condition: (1) If A I and B A, then B I (heredity). (2) If A I and B I, then A B I (finite additivity). Moreover a σ-ideal on (X, T) is an ideal which settle (1), (2) and the following condition: 3.If {Ai : i = 1,2,3,….} I, then {Ai : i =1,2,3,….} I (countable additivity). An ideal space is a topological space (X, T) with an ideal I on X and is denoted by (X, T, I).For a subset A X, A*( I)={x X : U A I for every U T (x)} is called the local function of A with respect to I and T (Kuratowski, 1933).We simply write A* instead of A*( I) in case there is no chance for disorder. It is familiar that Cl*(A) = A A* defines a Kuratowski closure operator for a topology T *(I) which is finer than T. During this paper, for a subset A X, Cl (A) and In (A) indicate the closure and the interior of A ,respectively. A subset A of an ideal space (X, T, I) is said to be dense (resp, T *-dense (Dontcher, Gansster and Rose, 1999), I –dense (Dontcher, Gansster and Rose,1999) if Cl (A) = X (resp Cl*(A) = X, A*= X).An ideal I on a space (X, T) is said to be codense (Devid, Sivaraj and Chelvam, 2005) if and only if T I = {Ф}.For an ideal space (X, T, I) and for any A X, where I is codense. Then: dense, T*-dense and I-dense are comparable (Jankovic and Hamlett, 1990). (Natkanies, 1986) used the idea of ideals to define another operator known as ψ-operator elucidates as follow: For a subset A X, ψ (A) = X-(X-A)*.Equivalently ψ(A) = {M T: M-A I}.It is obvious that ψ(A) for any A is a member of T. For an ideal space (X, T, I) and Y X then (Y, T y, I y) is an ideal space where T y = {U Y: U T} and I y = {U Y: U I} = {U I: U Y}. In 1943, Hewitt put forward the opinion of a resolvable space as follows: A nonempty topological space (X, T) is said to be resolvable (Hewitt, 1943) if X is the disjoint union of two dense subsets. Given a space (X, T) and A X, A is called I -open (Jankovic and Hamlett, 1990 )(resp per- I –open(Donkhev,1996)if A In (A*)(resp A In Cl*(A).A set A X is called scattered (Jankovic and Hamlett, 1990) if A contains no nonempty dense-in- itself subset. A space (X, T, I) is called I -Housdorff (Dontcher,1995) if for each two distinct points x ≠ y, there exist I - open sets U and V containing x and y respectively, such that U V=Ф. Throughout this paper we define a new local function and generalizations .Many characterizations, proprieties and relation between them are obtained.
  • 2. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 266 Paper Publications 2. ()Ψ*-OPERATOR In this section we put forward a new type of local function by using ψ-operator, in order to do this we have to have a deep looking in (Jankovic and Hamlett, 1992) work of the local function in ideal space. Definition 2.1 Let (X, T, I) be an ideal space. An operator (.)ψ*: P(x) → P(x), called ψ -local function of A with respect to I and T, is define as follow: for any A X, Aψ* (I, T)={x X: ψ (U) A I, for every open subset U T(x) }, where T(x)={U T,x U}. When there is no chance for confusion Aψ* (I, T) is briefly denoted by Aψ*. Fact Let (X, T, I) be an ideal space .Then A* Aψ*, for any A X. Now we define a new closure operator in terms of ψ -local function. Definition 2.2 Let (X, T, I) be an ideal space. For any A X, we define (1) Cl ψ (A) = {x X: ψ (U) A ≠ Ф for every U X, x ψ (U)}. It is clear that Cl (A) Cl ψ (A). (2) Cl ψ*(A) (I, T) = A Aψ* When there is no chance for confusion Cl ψ*(A) (I, T) is briefly denoted by Cl ψ*(A). Note Let (X, T, I) be an ideal space. Then Cl ψ*(A) Cl ψ (A), for any A X. We discuss the properties of ψ -local function in following theorem: Theorem 2.3 Let (X, T) be a topological space, I and J be two ideals on X, and let A and B be two subsets of X. Then the following properties hold: 1. If A B, then Aψ* Bψ*. 2. If I J, then Aψ* (J) Aψ* (I). 3. Aψ* =Cl (Aψ*) Cl ψ (A). 4. (Aψ*)ψ* Aψ*. 5. (A B)ψ* = Aψ* Bψ* 6. (A B)ψ* Aψ* Bψ* 7. For every I ϵ I, then (A I)ψ* = Aψ* = (A I)ψ*. 8. If G T, then G Aψ* (G A)ψ*. 9. If U T, then U Cl ψ* (A) Cl ψ* (U A). 10. If A I, then Aψ* = Ф. Proof. Straight from Definition2.1 and Definition 2.2 3. Ψ - DENSE AND GENERALIZATIONS Definition 3.1 Let (X, T, I) be an ideal space, A X is called:
  • 3. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 267 Paper Publications (1) ψ -dense, if Cl ψ (A) = X. (2) ψ -T*-dense, if Cl ψ*(A) = X. (3) ψ -I-dense, if Aψ* = X. The following remark is immediate from above definitions: Remark 3.2 (1) If A is ψ -I-dense, then A is ψ -T*-dense. (2) If A is ψ -T*-dense, then A is ψ -dense. In the following example we show that the convers of above remark does not hold: Example 3.3 Let X = {a, b, c}, T = {Ф, X, {a}, {b}. {a, b}} and I = {Ф, {b}}. If A = {a, b}, then Aψ* = {a, c} but Cl ψ* = X. The study of ideal got new dimension when Codense ideal [ 10 ] has been incorporated in ideal space. In the following definition we introduce a new concept of condense by using ψ-operator. Definition 3.4 Let (X, T, I) be an ideal space, an ideal I is called ψ -codense if, ψ (T) I = {Ф}. Lemma 3.5 Let (X, T, I) be an ideal space and for every subset A X. If A Aψ*, then the following relations hold: Aψ* = Cl (Aψ*) = Cl ψ (A) = Cl ψ*(A). Proof. Clear from Definition 2.2: (1), and Theorem 2.3: (3). Theorem 3.6 Let (X, T, I) be an ideal space, and for every subset A X. If I is ψ -codense, then the following relations hold: (1) Where A is ψ -dense, then it is ψ -T*-dense. (2) Where A is ψ -T*-dense, then it is ψ -I-dense. Proof. This is an immediate consequence of Lemma 3.5. The following theorem related to ψ -codense ideal: Theorem 3.7 If X is finite, then X=X* if and only if, I is ψ -codense. Proof. Necessity. By Theorem 2.5: [1].we get that T I= {Ф}. Since ψ(T) I T I. It follow that ψ(T) I = {Ф}.So I is ψ -codense. Sufficiency. Assume that I is ψ -codense. Since X-X* is open, let x X-X*. Then there exists Ux X-X*, and x X*.Then there exists Vx T(x), such that Ux Vx I. Assume that Wx = Ux Vx I. But X-X* = Wx. Hence X-X* I and ψ(T) I ≠ {Ф}, a contradiction. Therefore, X = X*. Corollary 3.8 Let X be any nonempty set .If (X, T, I) is an ideal space where I is σ-ideal, then the following statement are equivalent: (1) X = X*;
  • 4. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 268 Paper Publications (2) T I = {Ф}; (3) ψ(T) I = {Ф}. Proof. Similar to the proof of Theorem 3.7 By Remark 3.2, and Theorem 3.6, the following relations hold: ψ -dens ᵜ ψ -T*-dense ᵜ ψ -I-dense. ᵜ: I is ψ -codense. By Theorem 2.3 :( 2), we have the following remark: Remark 3.9 (1)Let (X, T, I) and (X, T, J) be two ideal spaces, I J, if A is ψ -I-dense with respect to J ,then A is ψ -I-dense with respect to I for any A X. (2) Let (X, T, I) and (X, σ, I) be two ideal spaces, T σ, if A is ψ -I-dense with respect to σ ,then A is ψ -I-dense with respect to T for any A X. By Remark 3.2 and Remark 3.9: (1), (2) we get the following corollary: Corollary 3.10 (1)Let (X, T, I) and (X, T, J) be two ideal spaces, I J, if A is ψ -T*-dense (ψ -dense) with respect to J, then A is ψ -T*- dense (ψ -dense) with respect to I for any A X. (2) Let (X, T, I) and (X, σ, I) be two ideal spaces, T σ, if A is ψ -T*-dense (ψ -dense) with respect to σ, then A is ψ -T*- dense (ψ -dense) with respect to T for any A X. Definition 3.11 A function f: (X, T, I) → (Y, σ) is called ψ -map if, f (Cl ψ (A)) Cl f (A), for any A X. Note Where f:(X,T,I)→(Y,σ,f(I)) is a bijection map ,then f(I) will be an ideal on Y. Theorem 3.12 If f: (X, T, I) →(Y, σ) is bijection ψ - map .Then the image of any ψ -dense subset A of X is dense in Y. Proof. Assume that A is ψ -dense in X. Since f is ψ -map, then f (Cl ψ (A)) Cl (f (A)).Implies that f (X) Cl (f (A)) and since f is surjection .Therefore, Y= Cl (f (A)). Hence f (A) is dense in Y. Definition 3.13 A function f:(X,T,I)→(Y,σ,J) is called : (1) ψ -(I,J) map ,if f (Cl ψ* (A)) Cl* f (A). (2) ψ 0 - (I,J) map ,if f (Aψ*) (f(A))*. (3) ψ 1- (I,J) map, if f (Aψ*) (f(A))ψ* . (4) ψ 2- (I,J) map ,if f (Cl ψ* (A)) Cl ψ* f(A). (5) ψ 3- (I,J) map, if f(Cl ψ(A)) Cl ψ f(A). For any A X.
  • 5. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 269 Paper Publications From the above definitions we get the following remark : Remark 3.14 (1) ψ 0 - (I, J) map → ψ - (I, J) map. (2) ψ 1 - (I, J) map → ψ 2 - (I, J) map → ψ 3 - (I, J) map. Theorem 3.15 (1) If f: (X, T, I) →(Y, σ) is bijection ψ 0-(I, J) map .Then the image of any ψ -I-dense subset A of X is f(I)-dense in Y. (2) If f: (X, T, I) → (Y, σ) is bijection ψ - (I, J) map. Then the image of any ψ -T*-dense subset A of X is T*-dense in Y. Proof. (1)Assume that A is ψ -I-dense in X. Since f is ψ 0-(I, J) map, then f (Aψ*) (f (A))*. Implies that f(X) (f (A))*, and since f is surjection .Therefore, Y= (f (A))*.Hence f (A) is f (I)-dense in Y. (2) Assume that A is ψ –T*-dense in X. Since f is ψ -(I, J) map, then f (Clψ*(A)) Cl* f (A)Implies that f(X) Cl* f (A), and since f is surjection .Therefore, Y= Cl* f (A).Hence f (A) is T*-dense in Y. Theorem 3.16 (1)If f: (X, T, I) → (Y, σ, J) is ψ 1 - (I, J) bijection map. Then the image of any ψ -I-dense subset of X is ψ -f (I)-dense in Y. (2) If f: (X, T, I) → (Y, σ, J) is bijection ψ 2-(I, J) map. Then the image of any ψ -T*-dense subset of X is ψ -T*-dense in Y. (3) If f: (X, T, I) → (Y, σ, J) is bijection ψ 3-(I, J) map. Then the image of any ψ -dense subset of X is ψ -dense in Y. Proof. (1) Assume that A is ψ-I-dense in X. Since f is ψ 1-(I, J) map then f (Aψ*) (f (A))ψ*,and since f is surjection .Therefore, Y = (f (A))ψ*.Hence f (A) is ψ -f (I)-dense in Y. (2) Assume that A is ψ –T*-dense in X. Since f is ψ 2-(I, J) map then f (Clψ*(A)) Cl ψ* f(A), and since f is surjection .Therefore, Y=Cl ψ*f(A).Hence f (A) is ψ –T*-dense in Y. (3) Assume that A is ψ-dense in X. Since f is ψ 3-(I, J) map then f(Cl ψ(A)) Cl ψ f(A) and since f is surjection .Therefore, Y=Cl ψ f(A).Hence f(A) is ψ-dense in Y. 4. Ψ -RESOLVABILITY AND GENERALIZATIONS In this section we define ψ- resolvable space and recall some of the generalizations of ψ-resolvable and their relationship with Housdorff space. Definition 4.1 A nonempty topological space (X, T) is called: (1) ψ -resolvable, if X is the disjoint union of two ψ -dense subsets. (2) ψ-T*-resolvable, if X is the disjoint union of T*-dense and ψ-dense subsets. (3) ψ-I-resolvable, if X is the disjoint union of I-dense and ψ -dense subsets. It is clear that: ψ -I-resolvable → ψ -T*-resolvable → ψ -resolvable. Theorem 4.2 Let (X, T) be a nonempty topological space, where I is ψ-codense. Then if X is ψ -T*-resolvability, then X is ψ -I- resolvability. Question We claim that ψ-resolvability does not imply ψ-T*-resolvability, but we could not find an example.
  • 6. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 270 Paper Publications From Corollary 3.9 we get the following remark: Remark 4.3 Let (X, T, I) , (X, T, J) be an ideal spaces, with I J, if X is ψ -resolvable with respect to J ,then X is ψ -resolvable with respect to I. Definition 4.4 A function f:(X,T,I)→(Y,σ,J) ,is said to be bi*-map if : (1) f: (X,T,I)→(Y, σ) is ψ 3-(I,J) map; (2) f: (X,T*)→(Y, σ*) is a continuous map. Theorem 4.5 Let f :( X, T, I) → (Y, σ) be bijection bi*- map, and if X is ψ -T*-resolvable space .Then Y is ψ -T*-resolvable with respect to the ideal f (I). Proof. Assume that X is ψ -T*-resolvable space, then there exists two disjoint ψ -dense and T*-dense subsets such that Cl ψ (A) = Cl*(B) = X. It is clear by Corollary 3.16, and Definition 4.4 that Y is ψ -T*-resolvable. Lemma 4.6 If U is an open set and D ψ* = X, then U (D ψ (U))ψ*. Proof Let x U, and suppose if possible that x (D ψ (U))ψ* Then (D ψ (U)) ψ (V) I, and since ψ (U) ψ (V) T. Therefore, x D ψ* = X. This is a contradiction .That is U (D ψ (U))ψ*. Theorem 4.7 (1) Let U T and Cl ψ*(D) = X, then U Cl ψ* (D ψ (U)). (2) Let U T, and Cl ψ (D) = X. Then U Cl ψ (D ψ (U)). Using Remark 3.2: (1), (2), and similar to the proof of Lemma 4.6. Theorem 4.8 Let Y T, and Aψ* = X. Then A1ψ y* = Y, where A1 = A y. Proof. By lemma 4.6 Y (A Y)ψ x* = A1ψ x*. Then Y = A1ψ x* y = A1ψ y*. Using Remark 3. 2 :(1) ,(2), and Theorem 4.8we get the following theorem: Theorem 4.9 (1) Let Y T, and Cl ψ*(A) = X. Then Cl ψ*y (A1) = Y, where A1 = A Y. (2) Let Y T, and Cl ψ (A) = X. Then Cl ψ y (A1) = Y, where A1 = A Y. Theorem 4.10 (1) Let (X, T, I) be ψ -I-resolvable space, if Y is open .Then (Y, Ty, I y) is ψ –I y- resolvable. (2) Let (X, T, I) be ψ -T*-resolvable space, if Y is open .Then (Y, Ty, I y) is ψ -T*y- resolvable. (3) Let (X, T, I) be ψ -resolvable space, if Y is open .Then (Y, Ty, I y) is ψ - resolvable.
  • 7. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 271 Paper Publications Proof. (1) Assume that (X, T, I) is ψ -I-resolvable space .Then there exists two disjoint ψ -dense, and I-dense subsets such that: A B = X, and Cl ψ (A) = B* = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) = Ф. Put A1 = A Y and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By corollary 3.10: (2), we have Cl ψ y (A1) = Y, and by lemma we have B*1y = Y. Hence (Y, Ty, I y) is ψ –I y-resolvable. (2) Assume that (X, T, I) is ψ –T*-resolvable space .Then there exists two disjoint ψ -dense, and T*-dense subsets such that: A B = X, and Clψ (A) = Cl*(B) = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) = Ф. Put A1 = A Y and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By Theorem 2.3.20: (3), we have Clψ y (A1) = Y, Cl*1y = Y. Hence (Y, Ty, I y) is ψ –T* y-resolvable. (3) Assume that (X, T, I) is ψ -resolvable space .Then there exists two disjoint ψ –dense subsets such that: A B = X, and Clψ (A) = Clψ (B) = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) = Ф. Put A1 = A Y and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By Theorem 2.3.20: (3), we have Clψ y (A1) = Clψ y (A1) = Y. Hence (Y, Ty, I y) is ψ – Ty - resolvable. Definition 4.11 In ideal space (X, T, I) A subset A is called ψ -pre-open if A In Cl ψ (A). Definition 4.12 (1) An ideal space (X, T, I) is called ψ -I -Housdorff, if for every distinct point x, y X, there exist two disassociate ψ -pre- open, and I-open sets containing each respectively. (2) An ideal space (X, T, I) is called ψ -T*-Housdorff, if for every distinct point x, y X, there exist two disjoint ψ -pre- open, and pre-I-open sets containing each respectively. (3) An ideal space (X, T, I) is called ψ -Housdorff, if for every distinct point x, y X, there exist two disjoint ψ -pre-open sets containing each respectively. Lemma 4.13 If ({x})ψ I. Then ({x})ψ* = Ф. Proof. Assume that ({x})ψ* ≠ Ф, then there exist y ({x})ψ* such that ψ (U) {x} I for every U T(x). Implies that ({x})ψ I. This is a contradiction. Theorem 4.14 (1) If an ideal space (X, T, I) is ψ -I-resolvable, and the scattered set of (X, T) are in I, then (X, T, I) is ψ -I-Housdorff. (2) If an ideal space (X, T, I) is ψ -T*-resolvable, and the scattered set of (X, T*) are in I, then (X, T, I) is ψ -T*- Housdorff. (3) If an ideal space (X, T, I) is ψ -resolvable, and the scattered set of (X, T) are in I, then (X, T, I) is ψ -Housdorff. Proof. (1) Let A and B be disjoint ψ -dense, and I-dense subsets of X such that X = A B. Since Clψ (A) = X, B* = X. Therefore, A In Clψ (A) and B In B*, then A and B are ψ -pre-open and I-open sets respectively. Let x, y be any two element of X and both x and y are in A .Take V = A{y} and U = B {y}. It is easily observed (see [6], Theorem 2.3 (h)]) that V also I- open set and y in V. Now to show that U = A {x} is ψ -pre-open. Clψ (A {x}) = Clψ (A) Clψ ({x} = X Clψ ({x}) = X .Hence A {x} In Clψ (A {x}), so U is ψ -pre-open. Hence (X, T, I) is ψ -I-Housdorff. (2) Let A and B be disjoint T*-dense, and ψ-dense subsets of X such that X = A B. Since Cl* (A) = X and Clψ (B) = X. Therefore, A In Cl* (A) and B In Clψ (B), then A and B are pre- I-open and ψ -pre-open sets respectively. Let x, y be any two element of X and both x and y are in A .Take V = A{y} and U = B {y}. To show that V also pre- I-open set Cl*(A{y}) = Cl*(A) Cl* ({y}) = X. Hence A{y} In Cl*(A{y}.Therefore, V is pre-I-open. Now to show that U = B
  • 8. ISSN 2350-1022 International Journal of Recent Research in Mathematics Computer Science and Information Technology Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org Page | 272 Paper Publications {y} is ψ -pre-open. Clψ (B {y}) = Clψ (B) Clψ{y} = X Clψ ({y}) = X .Hence B {y} In Clψ (B {y}), so U is ψ -pre- open. Hence (X, T, I) is ψ –T*-Housdorff. (3) Let A and B be disjoint ψ -dense subsets of X such that X = A B. Since Clψ(A) = Clψ(B) = X. Therefore, A In Clψ(A) and B In Clψ(B), then A and B are ψ-pre-open sets. Let x, y be any two element of X and both x and y are in A. Take U = A{y} and V = B {y}. By Theorem 2.1.5: (8) we have V and U are ψ-pre-open sets. To show that U is ψ-pre-open, Clψ (A{y}) = Clψ (A) Clψ({y}) = X Clψ({y}) = X, A{y} In Clψ(A). Now to show that V is ψ-pre-open. Clψ(B {y}) = Clψ(B) Clψ({y}) = X, B {y} In Clψ(B). Hence U,V are ψ-pre-open. Therefore, (X, T, I) is ψ-Housdorff. REFERENCES [1] Dontchev, J., Ganster, M., Rose, D., Ideal resolvability.Topology and its Appl. 93(1999), 1-16. [2] J Dontcher, On Housdorff spaces via topology ideals and I-irresolute functions Annals of the New York Academy of Sciences, Papers on General Topology and Applications, Vol.767(1995), 28-38. [3] J.Donkhev, On pre-I-open sets and a decomposition of I-continuity, Banyan Math. J., 2 (1996). [4] J. Dontcher, M.Ganster, D.Rose, Ideal resolvability, Topology and its Applications, 19(1999), 1-6. [5] E.Hewitt, A problem of set-theoretic topology, Duke Math.J,10 (1943),309-333. [6] D.Jankovic and T.R.Hamlett, New topologies from old via ideals, Amer. Math. Monthly, 97(1990),295-310. [7] D. Jankovic and T.R.Hamlett, Compatible Extensions of Ideals, Bollettino U.M.I,7(1992),453-465. [8] K.Kuratowski,Topology,Vol 1,Academic Press, New York,1966. K. Kuratowski, Topology I, Warszawa, 1933. [9] T.Natkaniec, On I-continuitty and I-semicontinuity points, Math Solvaca, 36:3 (1986), 297-312. [10] V.R.Devid.Sivaraj, T.T. Chelvam, Codense and completely codense ideals, Acta Nath. Hungar. 108 (2005) 197-205. [11] R.Vaidyanathaswamy, set topology, Ghelsea Publishing company (1960).