Graph Topologies and Uniform Convergence in Quasi-Uniform ...
Graph Topologies and Uniform Convergence in Quasi-Uniform ...
Graph Topologies and Uniform Convergence in Quasi-Uniform ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
136 j. rodríguez-lópez, s. romagueraNow, we present some examples where we can apply this result.Example 1. As we observed at the <strong>in</strong>troduction, if f : (X, T ) → (Y, T ′ )is a cont<strong>in</strong>uous function <strong>and</strong> U denotes the Perv<strong>in</strong> (resp. po<strong>in</strong>t f<strong>in</strong>ite, locallyf<strong>in</strong>ite, semi-cont<strong>in</strong>uous, f<strong>in</strong>e transitive, f<strong>in</strong>e) quasi-uniformity on X (see [8] forthe correspond<strong>in</strong>g def<strong>in</strong>itions) <strong>and</strong> V the correspond<strong>in</strong>g quasi-uniformity onY then f : (X, U) → (Y, V) is quasi-uniformly cont<strong>in</strong>uous (see [8, Proposition2.17]). Therefore, we deduce that T (H U −1 ×V) = T (V X ) on C(X, Y ).Now, we recall some def<strong>in</strong>itions about the theory of lattices. Our ma<strong>in</strong>reference is [9].A partially ordered set (or a poset) is a nonempty set L with a reflexive,transitive <strong>and</strong> antisymmetric relation ≤. A lattice is a poset where everynonempty f<strong>in</strong>ite subset has <strong>in</strong>fimum <strong>and</strong> supremum.Given a lattice L <strong>and</strong> O ⊆ L, we denote ↑ O = {l ∈ L : there exists o ∈O such that o ≤ l}.A lattice is said to be complete if every nonempty subset has <strong>in</strong>fimum <strong>and</strong>supremum.Let L be a complete lattice. We say that x is way below y, <strong>and</strong> we denoteit by x ≪ y, if for all directed subsets D of L the relation y ≤ sup D impliesthe existence of d ∈ D such that x ≤ d, where D is called directed set if givenp, q ∈ D we can f<strong>in</strong>d l ∈ D such that p ≤ l <strong>and</strong> q ≤ l.A cont<strong>in</strong>uous lattice is a complete lattice L such that it satisfies the axiomof approximation:x = sup{u ∈ L : u ≪ x}for all x ∈ L.Let L be a complete lattice. The Scott topology σ(L) is formed by allsubsets O of L which satisfy:i) O =↑ Oii) sup D ∈ O implies D ∩ O ≠ ∅ for all directed sets D ⊆ L.We recall that a semigroup is a pair (X, ·) such that · is an associative<strong>in</strong>ternal law or operation on X for which exists an identity element e.Def<strong>in</strong>ition 3. If (X, T ) is a topological space <strong>and</strong> (X, ·) is a semigroupsuch that the function ·x : X → X def<strong>in</strong>ed by ·x(y) = x · y for all y ∈ X iscont<strong>in</strong>uous for all x ∈ X we say that (X, ·, T ) is a semitopological semigroup.