Next Article in Journal
Null Darboux Curve Pairs in Minkowski 3-Space
Previous Article in Journal
The Key Success Factors for Attracting Foreign Investment in the Post-Epidemic Era
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Investigation of Proximal Spaces Using Relators

Department of Mathematical Analysis, Budapest University of Technology and Economics, H1111 Budapest, Hungary
Axioms 2021, 10(3), 143; https://doi.org/10.3390/axioms10030143
Submission received: 19 May 2021 / Revised: 22 June 2021 / Accepted: 25 June 2021 / Published: 30 June 2021

Abstract

:
In this paper, we define uniformities and proximities as relators and show the equivalences of these definitions with classical ones. For this, we summarize the essential properties of relators, using their theory from earlier works of Á. Száz. Moreover, we prove implications between important topological properties of relators and disprove others. Finally, we add an analogous definition for uniformly and proximally filtered properties.

1. Introduction

At the beginning of the 20. century some mathematicians tried to define abstract topological structures. The most relevant results are Poincaré 1895, Fréchet 1906, Hausdorff 1914, and Kuratowski 1922.
Uniform spaces in terms of relations were introduced by Weil in 1937 [1].
Proximities were first investigated by Riesz in 1909 [2], Effremovič and Smirnov in 1952 [3,4].
After the works of Davis, Pervin, and Nakano [5,6,7] in 1987, Száz [8] introduces the notion of relator and relator space in the following way.
Definition 1.
A nonvoid family R of relations on a nonvoid set X is called a relator on X, and the ordered pair ( X , R ) is called a relator space.
In the last decades, a few authors investigated the interpretation of well-known topological properties in terms of relators. In 2016, relators defined in terms of proximity spaces were introduced in [9].
For more details, see, for instance, ref. [10], but for the readers’ convenience, we summarize the necessary notions and notations.
Remark 1.
With the usual notations, R is a relator on X means that
X , R Exp ( X 2 ) ,
where Exp ( X ) is the power set of X, and X 2 = X × X .
If R is a relation on X, x X , and A X , then the sets
R ( x ) = { y X : ( x , y ) R } , and R [ A ] = x A R ( x )
are called the images of x and A under R, respectively.

2. Preliminary Concepts

Definition 2.
If R and S are relations on X, then the composition of R and S can be defined, such that ( R S ) ( x ) = R [ S ( x ) ] for all x X .
Moreover, let R 1 = { ( y , x ) : ( x , y ) R } , R 0 = Δ X = { ( x , x ) : x X } and R n = R R n 1 , for all n = 1 , 2 , . Finally, we say that R is
  • reflexive if R 0 R ,
  • symmetric if R 1 R ,
  • transitive if R 2 R .
Lemma 1.
If R is a relation on X, and A , B X , then
R [ A ] B R 1 [ X \ B ] X \ A .
Proof. 
R [ A ] B y A : x R ( y ) x B y A : x X \ B x R ( y ) ( x , y ) ( X \ B ) × A : ( x , y ) R ,
therefore
R [ A ] B ( ( X \ B ) × A ) R = .
Using this, with required objects, we have that
R 1 [ X \ B ] X \ A ( ( X \ ( X \ A ) ) × ( X \ B ) R 1 = .
Definition 3.
If R is a relator on X, then the relators
R * = { S X 2 : R R : R S } ,
and
R # = { S X 2 : A X : R R : R [ A ] S [ A ] } ,
are called the uniform and the proximal refinements of R , respectively. For more details, see [10].
Moreover, for all n = 1 , 0 , 1 , 2 , , we define
R n = R n : R R .
Remark 2.
* and # are really refinements as we defined in [10], that is they are self-increasing in the sense that
R S * R * S * and R S # R # S # ,
or equivalently they are expansive, increasing and idempotent, in the sense that
R R * , R S R * S * , R * * = R *
and
R R # , R S R # S # , R # # = R # ,
for all R and S relators on X.
Moreover, # is *-dominating, *-invariant, *-absorbing and *-compatible, that is
R * R # , R # = R # * , R # = R * # , R # * = R * # .
For all n = 1 , 0 , 1 , 2 , the mapping R R n of relators on X is increasing.
Finally, * and # are inversion-compatible, that is for all R relators on X
R * 1 = R 1 * and R # 1 = R 1 # .
And we have that for all relators on X
R 2 * = R * 2 * .
The following example shows, that the analog assertion is not true for #.
Example 1.
Let X = { 1 , 2 , 3 , 4 } , and
R = { Δ X { ( 1 , 2 ) , ( 4 , 2 ) , ( 2 , 1 ) , ( 2 , 4 ) } , Δ X { ( 1 , 3 ) , ( 4 , 3 ) , ( 3 , 1 ) , ( 3 , 4 ) } }
is an elementwise reflexive and symmetric relator on X. Now, R # 2 / R 2 # , since R = X 2 \ { ( 1 , 4 ) , ( 4 , 1 ) } R # 2 however R R 2 #
Note, that Axioms 10 00143 i001.
Riesz or Efremovič proximity and strong inclusion are interdefinable. We will use the inverse relation of strong inclusion. For details, see, for instance, refs. [10,11].
Definition 4.
If R is a relator on X, then for any A , B X we write:
B Int R ( A ) if R [ B ] A for some R R .
The relation Int R is called the proximal interiors induced by R on X.
Theorem 1.
Int : Exp ( Exp ( X 2 ) ) \ { } Exp ( Exp ( X ) 2 )
is a #–increasing set-valued function for relators on X in the sense that
S R # Int S Int R
for any two relators R and S on X.
Moreover, it follows that Int is increasing and if R is a relator on X, then R # is the largest relator on X such that
Int R = Int R # .

3. A New Form of Generalized Proximities

Definition 5.
Let R is a relator on X, and { * , # } is a refinement for relators on X. We define the followings.
  • R is □-reflexive, if R R 0 ;
  • R is □-symmetric, if R R 1 ;
  • R is □-transitive, if R R 2 ;
  • R is □-fine, if R = R .
For instance, we say that R is uniformly-symmetric or proximally-transitive instead of *-symmetric or #-transitive, respectively.
Following Weil, we say that the R relator on X, is a generalized uniformity/generalized proximity on X, and the ordered pair ( X , R ) is a generalized uniform space/generalized proximal space if it is
  • uniformly/proximally reflexive;
  • uniformly/proximally symmetric;
  • uniformly/proximally transitive;
  • uniformly/proximally fine.
Definition 6.
If the binary relation Int on the powerset Exp ( X ) of a non-empty set X satisfies the following axioms for arbitrary A , B , C , D X , then we say that it is a generalized set-proximity on X.
P1 
A Int ( B ) A B ;
P2 
A Int ( B ) X \ B Int ( X \ A ) ;
P3 
A Int ( B ) C X : A Int ( C ) and C Int ( B ) ;
P4 
A B and C D : B Int ( C ) A Int ( D ) ;
P5 
X Int ( X ) and Int ( ) .
Moreover, if it also satisfies
P6 
Int ( A ) Int ( B ) = Int ( A B ) ;
then we say that Int is a set-proximity on X.
P4 is missing from axioms of strong inclusions in [11]. The following example shows that all of the other axioms do not imply P4.
Example 2.
Assume that X has at least 3 elements, and let
Int = A X { ( , A ) , ( A , A ) , ( A , X ) } .
In contrast, an Int generated by an additive δ relation has P4 property. The δ relation is named additive, if A δ ( B C ) A δ B or A δ C . Moreover, a δ relation generates Int by rule A Int ( X \ B ) A δ B .
Proposition 1.
If R is a relator on X, and
ψ : Exp ( Exp ( X ) 2 ) ) Exp ( Exp ( X 2 ) ) , ψ ( Int ) = { A × B ( X \ A ) × X : ( B , A ) Int } ,
then
1.
ψ ( Int R ) # = R # ;
2.
Int R satisfies P4 and P5;
3.
If P4 and P5 hold for Int Exp ( X ) 2 , then Int = Int ψ ( Int ) ;
4.
R is proximally reflexive iff Int R is P1;
5.
R is proximally symmetric iff Int R is P2;
6.
if R is proximally transitive, then Int R is P3;
Proof.
1.
At first, let S ψ ( Int R ) and H X . If S [ H ] = X or H = , then for an arbitrary R R obviously R [ H ] S [ H ] .
If S [ H ] X and H , then there exists an A H such that A × S [ H ] ( X \ A × X ) = S , that is ( S [ H ] , A ) Int R . By using the definition of Int R , we have that, R [ H ] R [ A ] S [ H ] for some R R .
Now, we have ψ ( Int R ) R # , which implies
ψ ( Int R ) # R # .
For the converse inclusion let R R . For any A X , ( R [ A ] , A ) Int R and then S = A × R [ A ] ( X \ A ) × X ψ ( Int R ) . Since S [ A ] = R [ A ] we have R ψ ( Int R ) # , that is R ψ ( Int R ) # , which implies
R # ψ ( Int R ) # .
2.
R [ X ] X and R [ ] = for all R relations on X, therefore P5 is true for Int R .
Moreover, if R is a relator on X, A B , C D and B Int R ( C ) , then there exists an R R such that R [ A ] R [ B ] C D . In this case, A Int R ( D ) , that is P4 is also true for Int R .
3.
At first, note that if P5 holds, then Int , therefore ψ ( Int ) , that is ψ ( Int ) is a relator on X.
If A Int ( D ) , then R = A × D ( X \ A ) × X ψ ( Int ) . Now, R [ A ] D follows A Int ψ ( Int ) ( D ) . Note, that R [ A ] = D holds only if A or D = .
Conversely, if A Int ψ ( Int ) ( D ) , then there exists R ψ ( Int ) such that R [ A ] D . Such an R is equal to B × C ( X \ B ) × X for some ( C , B ) Int . In the case of D X and A , we have that C = R [ A ] D , and A B , and then P4 follows that A Int ( D ) .
In the case of D = X or A = , it is quite obvious that if P4 and P5 hold for Int Exp ( X ) 2 , then A Int ( X ) and Int ( D ) for all A , D X .
4.
We note that R is proximally reflexive iff R is a reflexive relation for all R R .
If A Int R ( B ) , then by using the reflexivity of R and the definition of Int R , we have that A R [ A ] B for some R R .
Conversely, for all R R and x X , R [ { x } ] R ( x ) implies { x } Int R ( R ( x ) ) . P1 follows x R ( x ) .
5.
A Int R ( B ) R R : R [ A ] B . If R is proximally symmetric, then there exists Q R such that Q 1 [ A ] R [ A ] . Lemma 1 follows X \ B Int R ( X \ A ) .
Conversely, if R R and A X , then A Int R ( R [ A ] ) , therefore since P2 X \ R [ A ] Int R ( X \ A ) and there exists S R such that S [ X \ R [ A ] ] X \ A . By using Lemma 1 there exists Q = S 1 R 1 such that Q [ A ] R [ A ] , proving that R R 1 # .
6.
A Int R ( B ) R R : R [ A ] B . If R is proximally transitive, then there exists S R such that S 2 [ A ] R [ A ] . With C = S [ A ] , we have that A Int R ( C ) . Moreover S [ C ] R [ A ] B , and it follows that C Int R ( B ) .
Some papers write { R S : R , S R } instead of our R 2 . With this definition, the converse implication of 6 follows, but because of the definition of uniformities, we need this one. Otherwise, in the proof of the following Theorem, we will see that with some other assumption, the converse implication of 6 is true with our notions.
Remark 3.
Note, that with the above notations
ψ Int R = R R # : B X : x X : R ( x ) { B , X } .
Theorem 2.
Let R be a relator on X.
1.
R Int R is a bijection of the set of all proximally fine relators on X onto the set of d and e relations on the powerset of X.
2.
R Int R is a bijection of the set of generalized proximities on X onto the set of generalized set-proximities on X.
Proof. 
Since Proposition 1, we need to prove only that if Int R is a generalized set-proximity, and R is proximally fine, then R is proximally transitive. For this, let R R be arbitrary. Then for any A X we have that A Int R ( R [ A ] ) , therefore since c there exists C X such that A Int R ( C ) and C Int R ( R [ A ] ) . That is, there exist P , Q R such that Q [ A ] C and P [ C ] R [ A ] . Now
S = A × [ ] 2 Q [ A ] ( Q [ A ] \ A ) × [ ] 2 P [ Q [ A ] ] ( X \ Q [ A ] ) × [ ] 2 X R
and S 2 [ A ] R [ A ] , that is R R 2 # .
Really, since P1 R is proximally reflexive, therefore we have that A Q [ A ] P [ Q [ A ] ] P [ C ] R [ A ] . Now, for an arbitrary B X , Q [ B ] S [ B ] , if B A and P [ B ] S [ B ] if B ¬ A , that is S R # = R because of R is proximally fine.
Moreover, it is easy to see that if A Q [ A ] , then
S 2 [ A ] = S [ S [ A ] ] = S [ Q [ A ] ] = S [ Q [ A ] \ A ] S [ A ] = P [ Q [ A ] ] Q [ A ] = P [ Q [ A ] ] R [ A ] ,
otherwise if A = Q [ A ] , then
S 2 [ A ] = S [ S [ A ] ] = S [ Q [ A ] ] = S [ A ] = Q [ A ] R [ A ] .

4. A New Form of Proximities

Definition 7.
Let A be a family of sets, or equivalently A Exp ( X ) for some set X. We call
Φ ( A ) = B : B A , a n d B i s f i n i t e
the filtered family of sets generated by A .
Moreover, we say that A is filtered if Φ ( A ) = A .
Finally, if R is a relation on Exp ( X ) for some set X, then we say that R is a filtered relation if
Dom I , Ran I : I R i s f i n i t e = R .
Remark 4.
Since Φ is a refinement for relators on X, we write R Φ instead of Φ ( R ) , if R is a relator on X. Note also that R is filtered iff R Φ R .
Moreover, note that Φ is an inversion compatible refinement for relators on X, that is, if R is a relator on X, then R 1 Φ = R Φ 1 .
Finally, if R is finite, then R Φ * = R * .
Lemma 2.
If R is a relator on X, then R * Φ = R Φ * , R 2 Φ R Φ 2 * .
Proof. 
It is easy to see, that
S R * finite : S = R Q R finite : Q R .
Moreover, if R R 2 Φ , then there exists an S R finite such that R = S 2 . S R Φ and S 2 S 2 implies that R R Φ 2 * . □
Proposition 2.
If R is a relator on X, then the following assertions are equivalent.
1.
R Φ R * ;
1.
there exists an S relator on X, such that S Φ S * = R * .
Proof. 
We need only to prove the (2)⇒(1) implication. For this, we note that if (2) is true then
R Φ R Φ * = R * Φ = S * Φ = S Φ * S * = R * .
In contrast to Example 1, the following lemma shows that if R is a filtered relator on X, then R # 2 # = R 2 # .
Lemma 3.
If R is a relator on X, then R # 2 # R Φ 2 # .
Proof. 
By definition of # if R R # 2 # , then for all A X , there exists an S R # such that S 2 [ A ] R [ A ] . For such an S R # , there exists P , Q R with Q [ A ] S [ A ] , and P [ S [ A ] ] S [ S [ A ] ] . Now, for T = P Q R Φ we have that
T 2 [ A ] = T [ T [ A ] ] P [ Q [ A ] ] P [ S [ A ] ] S 2 [ A ] R [ A ] .
We get that for all A X there exists a T R Φ such that T 2 [ A ] R [ A ] , that is R R Φ 2 # . □
Lemma 4.
If R is a filtered relation on X with P2 property, and I R is finite, then
Dom I , Ran I R .
Proof. 
Since P2 property of R we have that
J = { ( X \ A , X \ B ) : ( B , A ) I } R .
Of course, J is nonempty and finite, therefore ( Dom J , Ran J ) R . Moreover, it is also quite obvious, that
Dom J , Ran J = ( B , A ) I X \ A , ( B , A ) I X \ B = X \ Ran I , X \ Dom I .
Now, P2 property of R proves the Lemma. □
Proposition 3.
If R is a proximally symmetric relator on X, and
ψ : Exp ( Exp ( X ) 2 ) Exp ( Exp ( X 2 ) ) , ψ ( Int ) = { A × B ( X \ A ) × X : ( B , A ) Int } ,
then the following assertions are equivalent.
1.
Int R ( A ) Int R ( B ) Int R ( A B ) ;
P6
Int R ( A ) Int R ( B ) = Int R ( A B ) ;
2.
Int R is a filtered relation;
3.
ψ ( Int R ) Φ ψ ( Int R ) #
4.
there exists an S relator on X, such that S Φ S # = R # .
Proof. (1)⇒P6: Since Int R has the P4 property, hence Int R ( A B ) Int R ( A ) Int R ( B ) .
P6⇒(2): If P6 holds for Int R and ( B , A ) , ( D , C ) Int R , then by using again the P4 property of Int R we have that A C Int R ( B ) Int R ( D ) = Int R ( B D ) . Now, we can prove the implication by induction.
(2)⇒(3): Let A be an arbitrary nonempty and finite subset of ψ ( Int R ) , and let C X be arbitrary. We need to prove that there exists an R ψ ( Int R ) such that R [ C ] A [ C ] .
For this, let I Int R be nonempty and finite such that A = ψ ( I ) .
If there exists x C \ Ran I , then such an x we have that x A for all ( B , A ) I , and hence S ( x ) = X for all S ψ ( I ) , therefore R [ C ] X = ( ψ ( I ) ) ( x ) ( ψ ( I ) ) [ C ] for all R ψ ( Int R ) .
If C = , then R [ C ] = R [ ] = = ( ψ ( I ) ) [ ] = ( ψ ( I ) ) [ C ] for all R R .
Otherwise, if C Ran I , then with
E = J I : Ran J \ Ran I \ J C
we have that J is nonempty finite for all J E and E is nonempty and finite and
C J E Ran J \ Ran I \ J J E Ran J .
Since Int R is a filtered relation, and all J E is a nonempty and finite subset of Int R , it is clear that Dom J , Ran J Int R for all J E . By using Lemma 4 we have that
J E Ran J Int R J E Dom J .
Dom J = ( ψ ( I ) ) Ran J \ Ran I \ J C ( ψ ( I ) ) [ C ] for all J E . Therefore,
J E Dom J ( ψ ( I ) ) [ C ] .
P4 property of Int R follows that C Int R ( ( ψ ( I ) ) [ C ] )
Figure 1 shows the case, when
I = { ( B 1 , A 1 ) , ( B 2 , A 2 ) , ( B 3 , A 3 ) } ,
and
E = { ( B 1 , A 1 ) } , { ( B 2 , A 2 ) } , { ( B 1 , A 1 ) , ( B 2 , A 2 ) } , I .
The striped, dotted, and filled partitions are Ran J \ Ran I \ J for J E .
(3)⇒(4): It is quite obvious since assertion (1) of Proposition 1.
(4)⇒(1): If C Int R ( A ) Int R ( B ) , then C Int R ( A ) = Int R # ( A ) = Int S # ( A ) = Int S ( A ) and C Int R ( B ) = Int R # ( B ) = Int S # ( B ) = Int S ( B ) , therefore R [ C ] A and S [ C ] B for some R , S S . R S S Φ S # and ( R S ) [ C ] R [ C ] S [ C ] A B , that is C Int S # ( A B ) = Int R # ( A B ) = Int R ( A B ) . □
Int is the inverse of strong inclusion of Riesz and Efremovič proximities if it satisfies P1–P6.
Unfortunately, Int is a filtered relation on X, is neither sufficient nor necessary for P6 property of Int without P4 is assumed. For instance, if X is a nonvoid set, then Int = { ( , ) } is a filtered relation, but not P6. On the other hand, { , X } 2 \ Int is not a filtered relation, but P6.
Because of the above Proposition, we define the uniformly and proximally filtered properties of a relator by the following.
Definition 8.
If □ is a refinement for relators on X, then we say that the R relator on X is □-filtered if there exists an S relator on X such that S Φ S = R .
We use the uniformly filtered and proximally filtered notions instead of *-filtered and #-filtered.
Note, that by Proposition 2 we have that R is a uniformly filtered relator on X iff R Φ R * which can be found in definition of uniformities by Weil.
Example 3.
In general, R Φ R # is only a sufficient but not necessary condition of proximally filtered property of R . Namely, let R be the set of reals, and M = { B ε : ε > 0 } where B ε = { ( x , y ) R 2 : | x y | < ε } for all ε > 0 (see Figure 2a). Then M is elementwise reflexive, elementwise symmetric, (proximally) filtered, and M = M 2 .
Moreover, let R ( x ) = ] 1 3 x , 3 x [ , i f x > 0 , R , i f x = 0 , ] 3 x , 1 3 x [ , i f x < 0 be a relation on R . Now, R M # , therefore R 1 M # 1 = M 1 # = M # (see Figure 2b,c).
Really, if A R is bounded and 0 A , then R [ A ] B ε [ A ] , with ε = 1 3 max { | inf A | , | sup A | } . In all other cases B 1 [ A ] R [ A ] .
We have that R R 1 M # Φ , but R R 1 M # = M # # because if I = ] 0 , 1 [ , then ε 2 B ε [ I ] \ R R 1 [ I ] for all ε > 0 . Therefore M # Φ ¬ M # # , however M # is proximally filtered because M Φ = M M # = M # # .
Definition 9.
If the generalized uniformity/generalized proximity R on X is also
  • uniformly/proximally filtered,
then we say that R is a uniformity/proximity on X, and ( X , R ) is a uniform space/proximal space.
Propositions 1 and 3 give the following.
Theorem 3.
If R is a relator on X, then R Int R is a bijection of the set of proximities on X onto the set of set-proximities on X.
Proof. 
Since Proposition 3, the range of the restriction of the bijection in Theorem 2 (2) to the set of proximities on X is the set of set-proximities on X. □

Funding

The APC was funded by the journal Axioms.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Weil, A. Sur les Espaces a Structure Uniforme at sur la Topologie Générale; Actualités Sci. Ind. 551; Herman and Cie: Paris, France, 1937. [Google Scholar]
  2. Riesz, F. Stetigkeit und abstrakte Mengenlehre. Rom. Math. Kongr. 1909, 4, 18–24. [Google Scholar]
  3. Efremovič, V.A. The geometry of proximity. Mat. Sb. 1952, 73, 189–200. [Google Scholar]
  4. Smirnov, Y.M. On proximity spaces. Mat. Sb. 1952, 73, 543–574. [Google Scholar]
  5. Davis, A.S. Indexed systems of neighborhoods for general topological spaces. Amer. Math. Mon. 1961, 68, 886–893. [Google Scholar] [CrossRef]
  6. Nakano, H.; Nakano, K. Connector theory. Pac. J. Math. 1975, 56, 195–213. [Google Scholar] [CrossRef] [Green Version]
  7. Pervin, W.J. Quasi-uniformization of topological spaces. Math. Ann. 1962, 147, 316–317. [Google Scholar] [CrossRef]
  8. Száz, Á. Basic tools and mild continuities in relator spaces. Acta Math. Hungar. 1987, 50, 177–201. [Google Scholar] [CrossRef]
  9. Peters, J.F. Proximal relator spaces. Filomat 2016, 30, 469–472. [Google Scholar] [CrossRef] [Green Version]
  10. Pataki, G.; Száz, Á. A unified treatment of well-chainedness and connectedness properties. Acta Math. Acad. Paedagog. Nyházi. (N.S.) 2003, 19, 101–166. [Google Scholar]
  11. Di Concilio, A. Proximity: A powerful tool in extension theory, function spaces, hyperspaces, boolean algebras and point-free geometry. Beyond Topol. 2009, 486, 89–112. [Google Scholar]
Figure 1. A Venn diagram.
Figure 1. A Venn diagram.
Axioms 10 00143 g001
Figure 2. Relations on R .
Figure 2. Relations on R .
Axioms 10 00143 g002
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Pataki, G. Investigation of Proximal Spaces Using Relators. Axioms 2021, 10, 143. https://doi.org/10.3390/axioms10030143

AMA Style

Pataki G. Investigation of Proximal Spaces Using Relators. Axioms. 2021; 10(3):143. https://doi.org/10.3390/axioms10030143

Chicago/Turabian Style

Pataki, Gergely. 2021. "Investigation of Proximal Spaces Using Relators" Axioms 10, no. 3: 143. https://doi.org/10.3390/axioms10030143

APA Style

Pataki, G. (2021). Investigation of Proximal Spaces Using Relators. Axioms, 10(3), 143. https://doi.org/10.3390/axioms10030143

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop