The present article deals with the initiation and study of a uniformity like notion, captioned μ-uniformity, in the context of a generalized topological space.
The existence of uniformity for a completely regular topological space is well-known, and the interrelation of this structure with a proximity is also well-studied. Using this idea, a structure on generalized topological space has been developed, to establish the same type of compatibility in the corresponding frameworks.
It is proved, among other things, that a μ-uniformity on a non-empty set X always induces a generalized topology on X, which is μ-completely regular too. In the last theorem of the paper, the authors develop a relation between μ-proximity and μ-uniformity by showing that every μ-uniformity generates a μ-proximity, both giving the same generalized topology on the underlying set.
It is an original work influenced by the previous works that have been done on generalized topological spaces. A kind of generalization has been done in this article, that has produced an intermediate structure to the already known generalized topological spaces.
1. Introduction and prerequisites
It was Császár [1] who first initiated the idea of generalized topological space. This opened up a new direction which was pursued by many mathematicians toward generalizations of many topological concepts to this new arena. A generalized topology (GT, for short) μ on a set X is a collection of subsets of X such that ∈ μ and arbitrary unions of members of μ belong to μ; and the ordered pair (X, μ) then stands for a generalized topological space (henceforth abbreviated as GTS). The sets in μ are called μ-open sets and their complements μ-closed sets. A GTS (X, μ) is called a strong GTS if X ∈ μ. For any subset A of a GTS (X, μ), the μ-interior iμ(A) and μ-closure cμ(A) of A are defined in the usual way as:
and and and .
As is expected, μ-interior and μ-closure operators on a GTS (X, μ) obey the following basic properties:
iμ(A) ⊆ A and A ⊆ cμ(A), for all A ⊆ X.
A ⊆ B ⊆ X ⇒ iμ(A) ⊆ iμ(B) and cμ(A) ⊆ cμ(B).
A(⊆ X) is μ-open (μ-closed) if and only if A = iμ(A) (resp. A = cμ(A)).
iμ(X \ A) = X \ cμ(A), for all A ⊆ X.
The notion of uniformity is well-known for a topological space. This article is intended to initiate the study of a uniformity-like structure, termed μ-uniformity, on a generalized topological space.
In what follows in Section 2, we define μ-uniformities on a nonempty set X axiomatically and show that such a μ-uniformity induces a generalized topology on X. Although a μ-uniformity is not necessarily a uniformity. In Section 3, we also prove that a μ-uniform space satisfies a sort of complete regularity condition. Finally in Section 4, we establish that for a μ-uniform space, there exists a μ-proximity relation [2] such that the same generalized topology originates from both the structures.
We now recall the definition of uniformity on a set and some well-known relevant results thereof; related details may be found in [3].
Let X be a non-empty set:
A non-void subset of X × X is called a binary relation on X.
The identity relation on X is called the diagonal in X × X and is denoted by Δ(X) or simply by Δ. Thus Δ = {(x, x) : x ∈ X}.
The inverse of a relation U, denoted by U−1, is defined by U−1 = {(y, x) : (x, y) ∈ U}.
A relation U is said to be symmetric if U = U−1.
The composition of two relations U and V, denoted by U◦V, is defined by and (z, y) ∈ V, for some .
Let X be a non-empty set. A non-void family of subsets of X × X, is said to be a uniformity on X if the following conditions hold:
Δ ⊆ U, for every .
.
and .
.
there exists such that V◦V ⊆ U.
The pair is called a uniform space.
Let U be a binary relation on X and A a non-void subset of X. Then we define, , for some . In particular, if A = {p}, for some p ∈ X, then U(p) = U({p}) = {x ∈ X : (p, x) ∈ U}.
Now we state some well-known results for a uniform space .
Let be a uniformity on a non-void set X. Let a family τ of subsets of X be defined as follows: A subset G of X belongs to τ if and only if to every element p ∈ G, there corresponds some such that Up(p) ⊆ G. Then τ is a topology on X.
[4] If is a uniform space the topology of the uniformity , or the uniform topology, is the family of all subsets G of X such that for each x in G there is U in such that U(x) ⊆ G.
A topological space (X, τ) is uniformizable if and only if it is completely regular.
2. μ-uniformity
Before going into the details we first state two definitions which will be required later on.
[5] Let X be a non-empty set and . Then β is called a base for a generalized topology μ on X if μ = {∪β′ : β′ ⊆ β}.
[6] Let (X, μ) and (Y, ξ) be two generalized topological spaces. A function f : (X, μ) → (Y, ξ) is said to be μ-continuous if for any G ∈ ξ, f−1(G) ∈ μ.
In [7] the concept of generalized quasi uniformity was introduced, termed as g-quasi uniformity. In the same manner, we introduce the definition of μ-uniformity as follows.
Let X be a non-empty set. A non-void family of subsets of X × X is called a μ-uniformity on X if
Δ ⊆ U for every ,
and ,
there exists a symmetric such that V◦V ⊆ U.
The pair is called a μ-uniform space.
Let be a μ-uniform space, then for any .
Let (x, y) ∈ U. Then as (y, y) ∈ U[from (i)], we have (x, y) ∈ U◦U, hence U ⊆ U◦U. □
Let be a μ-uniform space, then for any .
Proof. Let . Then by axiom (iii), there exists a symmetric such that V◦V ⊆ U. Again by Result 2.4, V ⊆ V◦V which implies V ⊆ U and so V−1 ⊆ U−1, i.e. V ⊆ U−1 [since V is symmetric]. So by axiom (ii), . □
Every uniform space is a μ-uniform space.
Proof. Axioms (i) and (ii) of Definition 2.3 are obvious from the definition of uniformity given in Definition 1.2. Now for axiom (iii) of Definition 2.3, consider , then by axiom (v) of Definition 1.2 there exists such that V◦V ⊆ U; we set W = V ∩ V−1. By axioms (ii) and (iv) of Definition 1.2, we see that , and it is also clear that W is symmetric and W◦W ⊆ U. Hence, is a μ-uniform space. □
The converse of the above stated result is false i.e. a μ-uniformity on a set X need not be a uniformity on X. In fact, consider X = {a, b, c} and A = {(a, a), (b, b), (c, c), (a, b), (b, a)}, B = {(a, a), (b, b), (c, c), (c, b), (b, c)}. We set or . It is clear that is a μ-uniformity on X. But , which does not satisfy (ii) of Definition 1.2, and hence it is not a uniformity.
[7] Let X be a nonempty set. A nonempty family of subsets of X × X is called a generalized quasi uniformity (or g-quasi uniformity) on X if the following hold:
.
and .
such that V◦V ⊆ U.
It is a straightforward to observe that every μ-uniform space is also a g-quasi uniform space as defined in [7]. But the converse is not true.
Consider the set X = {a, b, c} and the subset U of X × X given by U = {(a, a), (b, b), (c, c), (a, b)}. Set . It is clear that is a g-quasi uniformity on X. Now but there does not exist any symmetric A ⊆ X × X in such that A◦A ⊆ U. Hence is not a μ-uniform space.
So the family of all μ-uniform spaces is coarser than the family of all g-quasi uniform spaces but finer than the collection of all uniform spaces.
Let be a μ-uniformity on a non-empty set X. Let a family τμ of subsets of X be defined by:
A subset G ∈ τμ if and only if for every p ∈ G, there exists some such that Up(p) ⊆ G. Then τμ is a strong generalized topology on X.
Proof. Clearly ∈ τμ. For each p ∈ X, U(p) ⊆ X, for any so X ∈ τμ.
Let Gα ∈ τμ, where α ∈ Λ, an index set. Let G = ⋃α∈ΛGα and p ∈ G. Then p ∈ Gβ for some β ∈ Λ, so there exists such that Up(p) ⊆ Gβ ⊆ G. Hence, G ∈ τμ.
So, τμ is a strong generalized topology on X. □
The generalized topology τμ obtained in the previous theorem from the μ-uniformity on X is called the generalized topology on X induced by and will be denoted by .
Henceforth, the GTS will be called a μ-uniform space.
3. μ-uniformity and μ-complete regularity
[2] A GTS (X, μ) is said to be μ-completely regular if for any μ-closed set A in X and for x∉A, there exists a μ-continuous function such that f(x) = 0 and f(A) = {1}, where ν is the generalized topology on the set of reals generated by the base .
A μ-uniformizable GTS (X, μ) is μ-completely regular.
Proof. Given that the GTS (X, μ) is μ-uniformizable, i.e. there exists a μ-uniformity on X such that . Let F be μ-closed and p ∉ F. Thus X \ F = W(say) is μ-open and p ∈ W, so there exists such that U(p) ⊆ W.
Now we shall show by induction that for every , we can construct a symmetric member such that Un ⊆ U and Un◦Un ⊆ Un−1 ⊆ U, when n is positive with U = U0.
In fact, let U = U0; then there exists a symmetric such that U1◦U1 ⊆ U0, where U1 = U1◦Δ ⊆ U1◦U1 ⊆ U0. Let Un−1 have been constructed in this way, then there exists a symmetric such that Un◦Un ⊆ Un−1 and similarly Un = Un◦Δ ⊆ Un◦Un ⊆ Un−1 ⊆ U. So, we get a decreasing sequence {Un : n ≥ 0} with each member being a subset of U.
Next for every diadic rational [A diadic rational number r is of the form , where p is some positive integer] r ∈ (0, 1], we define , where with 0 ≤ n1 < n2 < … < nm; since every diadic rational number has unique expression, Vr is well-defined. We define V0 = Δ, though it may not be in and also note that V1 = U0. Then it can be shown that (Lemma 3.3 below)
…(⋆)
which holds for every non-negative n and all k = 0, 1, …, 2n − 1. Also for two diadic rational numbers r, s with 0 ≤ r ≤ s ≤ 1, there exists positive integer n such that r = i ⋅ 2−n and s = j ⋅ 2−n, where i, j are positive integers satisfying 0 ≤ i ≤ j ≤ 2n.
Hence, we have . Thus if 0 ≤ r ≤ s ≤ 1 and r, s are diadic rationals then Vr ⊆ Vs.
Next, we define a function g: X → [0, 1] by taking
Since V0 = Δ, V0(p) = {p}. For each x( ≠ p) ∈ X, x∉V0(p) ⇒ 0 ∈{r : x∉Vr(p)}⇒{r : x∉Vr(p)} ≠ . Also, r ≤ 1 ⇒{r : x∉Vr(p)} is bounded above and so its supremum exists.
Now for any point q ∈ F, i.e. q ∈ X \ W, we have q∉V1(p), as U(p) ⊆ W and V1 = U0 ⊆ U. Again, q∉V1(p) ⇒ 1 ∈{r : q∉Vr(p), r ≤ 1}⇒ g(q) = 1.
Finally, we shall show that g is μ-continuous in (X, μ). For this it is enough to show that g−1([0, t)) and g−1((t, 1]) are μ-open [since [0, t), (t, 1] are the basic μ-open sets of [0, 1] where t ∈ (0, 1), when it is considered as a subspace of the GTS defined previously]. Let x ∈ g−1([0, t)), then g(x) ∈ [0, t); let us take g(x) = s then s < t ≤ 1. We set r = t − s > 0, now there exists such that . We show that Un(x) ⊆ g−1([0, t)), consequently .
Now let k be the uniquely determined positive integer satisfying k − 1 ≤ s ⋅ 2n < k i.e. (k − 1)2−n ≤ s < k ⋅ 2−n, then g(x) = s < k ⋅ 2−n. Now, , which is a contradiction. So . Also for y ∈ Un(x) we get (x, y) ∈ Un. Hence, , by (a), and so , and hence g(y) ≤ (k + 1)2−n. Therefore, i.e. g(y) < t ⇒ y ∈ g−1([0, t)). Hence, Un(x) ⊆ g−1([0, t)), so .
Next, for g−1((t, 1]), let x ∈ g−1((t, 1]), then g(x) = s > t ≥ 0. Let r = s − t > 0 and so that . We shall show that Un(x) ⊆ g−1((t, 1]). Let k be the uniquely determined positive integer satisfying (k − 1)2−n ≤ t < k ⋅ 2−n. If possible, let y ∈ Un(x) and y∉g−1((t, 1]). Then g(y) ≤ t < k ⋅ 2−n and so (in fact otherwise, ). Therefore and since y ∈ Un(x), (x, y) ∈ Un and hence, as Un is symmetric, (y, x) ∈ Un. Thus [by (⋆)]. So, . Consequently, g(x) ≤ (k + 1)2−n. Now , a contradiction to the equality.
Hence Un(x) ⊆ g−1((t, 1]), so . Hence, g is μ-continuous and so (X, μ) is μ-completely regular. □
Following the same notations as in Theorem 3.2, the inclusion relation holds for every non-negative integer n and for k = 0, 1, 2, …, 2n − 1.
Proof. This relation holds for n = 0, since for n = 0, k = 0 and V0 = Δ so that V0◦U0 = U0 = V1. Let n > 0 and we assume that the inclusions hold for n − 1. We shall prove the inclusions for n. Since is always true, it remains only to prove , for k = 0, 1, 2, …, 2n − 1.
If k is an even integer, say k = 2m, we have k ⋅ 2−n = (2m) ⋅ 2−n = m ⋅ 2−(n−1), i.e. (k + 1) ⋅ 2−n = m ⋅ 2−(n−1) + 2−n = (2m + 1) ⋅ 2−n.
It then follows from the definition of the sets Vr, given in Theorem 3.2, that , thus the inclusion is proved in this case.
If k is an odd integer, say k = 2m + 1, then k ⋅ 2−n = (2m + 1) ⋅ 2−n = m ⋅ 2−(n−1) + 2−n and (k + 1) ⋅ 2−n = (2m + 2) ⋅ 2−n = (m + 1) ⋅ 2−(n−1). By our induction hypothesis, we get . …(*)
Since Un◦Un ⊆ Un−1, it implies that and by using (*) we get . Thus, the inclusion also holds for odd integers. □
It is still an open problem whether a μ-completely regular GT is μ-uniformizable.
4. μ-uniformity and μ-proximity
In a uniform space , there is a result that a uniformity always induces a proximity on X which generates the same topology as is induced by on X. In the following theorem, we also have a similar result for a GTS. First we state the definition of μ-proximity.
[2] A binary relation δμ on the power set of a set X is called a μ-proximity on X if δμ satisfies the following axioms:
AδμB iff
If AδμB, A ⊆ C and B ⊆ D, then CδμD
{x}δμ{x}, ∀x ∈ X
Aδ∕μB ⇒∃ E(⊆ X) such that Aδ∕μE and (X \ E)δ∕μB.
Now δμ generates a generalized topology on X which is given below:
[2] Let a subset A of a μ-proximity space (X, δμ) be defined to be δμ-closed iff ({x}δμA ⇒ x ∈ A). Then the collection of complements of all δμ-closed sets so defined, yields a generalized topology μ = τ(δμ) on X.
[2] Let (X, δμ) be a μ-proximity space and μ = τ(δμ). Then the μ-closure cμ(A) of a set A in (X, μ) is given by cμ(A) = {x : {x}δμA}.
Let be a μ-uniform space. Then for A, B ⊆ X, U(A) ∩ U(B) ≠ , for all if and only if U(A) ∩ B ≠ for all .
Proof. Let U(A) ∩ B ≠ . Since B ⊆ U(B) (as Δ ⊆ U), we get U(A) ∩ U(B) ≠ for all .Conversely, let U(A) ∩ U(B) ≠ for all and if possible let there exist such that V(A) ∩ B = . Now there exists a symmetric such that W◦W ⊆ V. By the given condition, W(A) ∩ W(B) ≠ and let p ∈ W(A) ∩ W(B), i.e. (a, p) ∈ W and (b, p) ∈ W for some a ∈ A, b ∈ B. Since W is symmetric, we get (a, b) ∈ W◦W ⊆ V which implies b ∈ V(a) ⊆ V(A). Thus V(A) ∩ B ≠ , a contradiction. □
For a μ-uniform space , the relation δμ defined on by
AδμB if and only if for every
is a μ-proximity structure on X such that .
To show that δμ is a μ-proximity on X we proceed in the following manner:
(1) For A, B ⊆ X, clearly AδμB iff BδμA.
(2) Let AδμB with A ⊆ C and B ⊆ D, so for any , U(A) ∩ U(B) ≠ . Now U(A) ⊆ U(C) and U(B) ⊆ U(D), therefore U(C) ∩ U(D) ≠ . Hence CδμD.
(3) For all x ∈ X, x ∈ U(x) ∩ U(x), for all which implies U(x) ∩ U(x) ≠ for all and so {x}δμ{x}.
(4) Let such that AμB. Then for some , U(A) ∩ U(B) = ; we set C = U(A) and D = U(B). It is clear that A ⊆ C. We show that Aμ(X \ C). In fact, Aδμ(X \ C) ⇒ for every , V(A) ∩ V(X \ U(A)) ≠ . Let W be a symmetric member of such that W◦W ⊆ U, then W(A) ∩ W(X \ U(A)) ≠ and so there exists p ∈ W(A) ∩ W(X \ U(A)). Therefore, there exists a ∈ A, b ∈ X \ U(A) such that (a, p) ∈ W and (b, p) ∈ W, now W being symmetric, (a, b) ∈ W◦W ⊆ U which implies b ∈ U(a) ⊆ U(A), a contradiction to the fact that b ∈ X \ U(A). Thus Aμ(X \ C). Similarly, B ⊆ D and Bμ(X \ D), also as C ∩ D = U(A) ∩ U(B) = , BμC. In fact, if BδμC then as C ⊆ (X \ D) that implies Bδμ(X \ D) [using (ii) in this proof shown above], a contradiction. Thus, we see that axiom (iv) of μ-proximity is satisfied.
Finally, we show that . Let A ⊆ X and x ∈ X. Then , for all , for all [by Lemma 4.4] [by Proposition 4.3]. Thus, . □
It is still an open problem whether a μ-proximity structure δμ on a set X induces a μ-uniformity on X such that .
The authors are thankful to the referee for certain comments towards the improvement of the paper.
