Abstract.

We present crossconvergence, which commonly generalize bornology, preuniform convergence, orderconvergence, b-uniform filtration and grill-determined prenearness. The corresponding construct CCONV forms a strong topological universe, respectively quasitopos, in which quotients are stable under arbitrary products. We also discuss its enlargement to semicrossconvergence and precrossconvergence, respectively.

keywords:
continuity structures; generalized continuity structures; convenient topology; bounded topology; quasitopos; strong topological universe.
MSC:
54A05; 54A20; 54B15; 54B30; 54E05; 54E15; 54E17.

1. Introduction

The new considered bounded, respectively bornological approach to convergence provides a high level framework that enables the analysis of convergence-like concepts from the perspective of boundedness rather that the traditional convergence of filters to points or the convergence of uniform filters, which determines uniformity in special cases. This shift in viewpoint has proven especially useful in the study of non-normable structures and generalizations of topological and uniform spaces. Over the years, several classical frameworks have been introduced in this context, including metric spaces, proximity spaces, uniform spaces, merotopic spaces, supertopological spaces and set-convergence spaces, see 2. Classical Concepts. Each of this models offers different perspective on the concept of point-convergence or uniform convergence in mathematical structures.
This striking similarities among them are leading to their embeddings into certain ones, called crossconvergence, semicrossconvergence or precrossconvergence, respectively. Here, it is important to note that CCONV, the category of crossconvergence spaces and corresponding maps is forming a strong topological universe [27] or quasitopos [25], respectively, in which quotients are stable under arbitrary products and containing some of the former mentioned important constructs as nicely embedded subcategories. Since CCONV is cartesian closed, thus in that it possesses a natural and well-behaved complete way of forming spaces of functions (which Standard Topology can not boast).
Moreover, CCONV is extensional, as it possesses a way of extending any space by a single point, which consistency. (Similarly, such consistency can fail to exist). Additionally, CCONV corrects particular troubles that occur in any of the mathematical frameworks. For example, it can correctly manage the "uniform components" of a space, which are problematic in uniform spaces (UNIF). Furthermore, subspaces of topological spaces behave better when they are formed in CCONV. But in TOP products of quotients need not be quotients. But in CCONV this statement holds (see 6. Convenient properties of former considered constructs). Uniform concepts, such as uniform continuity, uniform convergence, Cauchy sequences (Cfilter, see 7) and completeness are not available in TOP. Furthermore, the localization of the concept of precompactness (=total boundedness) leads to a cartesian closed category in which quotients are hereditary, compare with 6.
Other interesting reports [2], [3] and [7] consider closure operators in Categorical Topology and Categorical Algebra. So it is possible to give the characterization of both closed and strongly closed subobjects of an object in the category of semiuniform convergence spaces to show that they form appropriate closure operators which enjoy the basic properties like idempotency, (weak) hereditariness, and productivity in the category of semiuniform convergence spaces. In a category equipped with notion of subobject and closure one may pursue topological concepts in a context no longer confined to "TOP-like categories". Par example, universal compactification of topological positively convex sets and moduls can be described as well as Banach limits with respect to convex analysis [24], [29].
This framework now presents a contribution to the area of "Convenient Topology" and builds a base that is both useful and general, and possesses solid, reliable properties for use in higher structures. In addition, this paper serves also as a revised edition of the older published papers of b-convergence by the first author [14], [15].
In comparing this revised edition with some other published papers of b-convergence by the first outhor we point out that the new one establishes carefully a hierarchy of setting convergences by starting in general with precrossconvergence (in short pcc), as the first item, motivated by the fact that set-convergence in the sense of Wyler [32] can be considered as special case and thus, the corresponding category SETCONV can be nicely embedded into PCCONV, the topological construct whose objects are the precrossconvergence spaces and whose morphisms are the bounded equiform maps (in short beq-maps), see section 5. SCCONV, the full and isomorphism-closed subcategory of PCCONV contains in particular b-TOP, the category of b-topological spaces and bounded continuous maps (in short bc-maps) as nicely embedded subcategory and extends the results in [14], [15]. SCCONV is bireflective in PCCONV, see section 5. CCONV, the full and isomorphism closed subcategory of SCCONV is now focus of our considered view, bicoreflective embedded into SCCONV and containing PUCONV, the category of preuniform convergence spaces and uniformly continuous maps [27], b-UFIL, the category of b-uniform filter spaces and bounded uniformly continuous maps (in short buc-maps)[17], ORDC, the category of order convergence spaces and bounded continuous maps (in short bic-maps) [21], G-PNEAR, the category of grill-determined prenearness spaces and corresponding maps, see section 4. BOUND, the category of bounded spaces and bounded maps [32], respectively BORN, the full and isomorphism-closed subcategory of BOUND, whose objects are the bornological spaces [10], see section 4. And last but not least we consider ECCONV, the full and isomorphism-closed subcategory of CCONV, whose objects are the epicrossconvergence spaces, in which ULIM, the full and isomorphism-closed subcategory of PUCONV whose objects are the uniform limit spaces [27] is nicely embedded.
In section 2 we remined the reader at certain classical concepts with notation, convention and corresponding references. The here listed members of them are serving now in form of isomorphic components in its corresponding convergences like pcc, scc, cc or ecc, respectively.
In section 3 we consider categorical notions and statements, transferred into the concept of topological constructs (here especially for crossconvergences). In section 4 and 5 the basics of crossconvergences are introduced and important "embedding-theorems" are presented. The purpose of section 6 is to show that the topological construct CCONV fulfil all the properties for being a strong topological universe, meaning that it is quotent-stable, cartesian closed and extensional. And at the end, in section 7, we inform the reader about the possibility to enlarge uniform limit spaces to epicrossconvergence and studying generalized completeness by using so called Cauchy-filter which are convergent. In this context we renounce on the properties for being fixed and saturated, see section 4.
To simplify certain expressions, we provide now a notion table (NT) as follows:
For a pair (X,μ), where X is boundedness and μ:XP¯(FIL(X×X)) an operator (map) from X into P¯(FIL(X×X)), (X,μ) is called

  1. (i)

    saturated iff X is saturated;

  2. (ii)

    fixed iff B1,B2X\{} implying μ(B1)=μ(B);

  3. (iii)

    set-based iff BX implies B×Bμ(B), where B:={AX:AB};

  4. (iv)

    fil-determined iff xX and 𝒰μ({x}) implying the existence of an filter τμ({x}), x×μ({x}) and x×𝒰, where τμ({x}):={FIL(X):𝒱μ({x}),𝒱x×};

  5. (v)

    point-bounded iff xX and 𝒰μ({x}) implying {x}×{x}𝒰;

  6. (vi)

    grill-based iff BX and 𝒰μ(B) implying the existence of an 𝒢GRL(X)γμ,𝗌𝖾𝖼𝒢×𝔰𝔢𝔠𝒢𝒰 and 𝗌𝖾𝖼𝒢×𝔰𝔢𝔠𝒢μ(B), where γμ:={𝒜P¯X:𝒢GRL(X)BX,𝒜𝒢 and 𝗌𝖾𝖼𝒢×𝔰𝔢𝔠𝒢μ(B)}; here GRL(X):={𝒢P¯X:𝒢 is grill } with 𝒢 is called grill (X-grill) iff

    1. (g1)

      𝒢;

    2. (g2)

      B1B2𝒢 iff B1𝒢 or 2𝒢;

    And for 𝒜P¯X and P¯(X×X) we set, 𝔰𝔢𝔠𝒜:={BX:A𝒜AB}, and 𝔰𝔢𝔠X:={UX×X:RRU};

  7. (vii)

    limited iff BX\{} and 𝒰μ(B) implying the existence of FIL(X) s.t. B×𝒰 and qμB, where for BX\{}, qμB iff there exists 𝒱μ(B), 𝒱B× and qμ iff =P¯X.

2. Classical Concepts (Notation, Convention and References)

Definition 2.1.

A boundedness on a set X is a non-empty subset XP¯X, where P¯X denotes the powerset of X, which possesses the following properties:

  1. (b1)

    B1BX implies B1X;

  2. (b2)

    xX implies {x}X. Then the pair (X,X) is called a bounded space [5], [32].

Sometimes X is called B¯-set. [32]

Definition 2.2.

A bounded space (X,X) and X, respectively are called

  1. (i)

    bornological provided that X satisfies

    1. (b)

      B1, B2X implying B1B2X.

  2. (ii)

    saturated, provided that XX is holding and thus X=P¯X.

Remark 2.3.

Note, that 𝒟X:={}{{x}:xX} defines a boundedness on a set X and X:={BX:B is finite } is bornology on X. For bounded spaces (X,X), (Y,Y), a map f:XY is called bounded, provided it satisfies

  1. (bf)

    BX implies f[B]Y.

BOUND denotes the category, whose objects are the bounded spaces and whose morphisms are the bounded maps [32]. BORN denotes the full subcategory of BOUND, whose objects are bornological [10].

Definition 2.4.

For a set X, X×X denotes the crossproduct with itself and x:={AX:xA}. By x×x we denote the filter generated by {(x,x)}. And for filter 𝒰, 𝒱FIL(X×X); where FIL(X×X) denotes the set of all filters on X×X , we set 𝒰×𝒱:={RX×X:U𝒰V𝒱, U×VR}, representing the crossproduct of 𝒰,𝒱. Notice, that P¯(X×X) is allowed for being a filter on X×X.

Definition 2.5.

A preuniform convergence on a set X is a subset JXFIL(X×X), where FIL(X×X) denotes the set of all filters on (X×X), such that the following are satisfied:
    (PUC1) 𝒰1JX, whenever 𝒰JX and 𝒰𝒰1; (PUC2) The filter x×x belongs to JX for each xX.

Remark 2.6.

If (X,𝒰) is a uniform space and [𝒰]:={𝒱FIL(X×X):𝒱𝒰}, then (X,[𝒰]) is a preuniform convergence space. For preuniform convergence spaces (X,JX), (Y,JY), a map f:XY is called uniformly continuous provided that (f×f)(𝒰)JY for each 𝒰JX , where (f×f)(𝒰):={VY×Y:U𝒰 s.t. (f×f)[U]V} with (f×f)[U]:={(f×f)(x1,x2):(x1,x2)U}={f(x1),f(x2):(x1,x2)U}. PUCONV denotes the category whose objects are the preuniform convergence spaces and whose morphisms are the uniformly continuous maps. [27]

Definition 2.7.

For a set X, a pair (X,μ) consisting of a boundedness X and a non-empty set μFIL(X×X) is called a b-uniform filter structure (b-uniform filtration) on X, and the triple (X,X,μ) a b-uniform filter space provided that the following axioms are satisfied:

  1. (buf1)

    𝒰μ and 𝒰𝒰1FIL(X×X) implying 𝒰1μ;

  2. (buf2)

    BX\{} implies B×Bμ, where B:={AX:AB}.

Remark 2.8.

Given a pair of b-uniform filter spaces (X,X,μX), (Y,Y,μY),a map f:XY is called b-uniformly continuous, in short buc, if f satisfies the following conditions:

  1. (buc1)

    BX implies f[B]Y;

  2. (buc2)

    𝒰μX implies (f×f)(𝒰)μY.

b-UFIL denotes the topological construct of b-uniform filter spaces and b-uniformly continuous maps.[17]

Definition 2.9.

An orderconvergence is a pair (X,τ), where X is B-set in the sense of Wyler [32], hence a boundedness, and τ:XP¯(FIL(X)):={P¯X: is filter } is function from X into P¯(FIL(X)) such that the following properties are satisfied:

  1. (OC1)

    τ():={P¯X}, here the nullfilter P¯X is allowed to be an element of FIL(X).

  2. (OC2)

    BX, τ(B) and F1FIL(X) implying 1τ(B);

  3. (OC3)

    xX implies xτ({x});

  4. (OC4)

    BX\{} implies τ(B)={τ({x}):xB}.

Then the triple (X,X,τ), where (X,τ) represents an orderconvergence, is called orderconvergence space.

Remark 2.10.

For orderconvergence spaces (X,X,τX),(Y,Y,τY), a map f:XY is said to be b-continuous (in short bc-map), provided that f is bounded and continuous by

  1. (C)

    BX\{} and τX(B) implying f()τY(f[B]).

ORDC denotes the category whose objects are the orderconvergence spaces and whose morphisms are the b-continuous maps. In this context notice that point-convergence spaces can be considered as specific orderconvergence spaces. [21]

Definition 2.11.

A prenearness on a set X is a subset ξP¯(P¯(P¯X)) satisfying the following conditions:

  1. (PN1)

    𝒜1𝒜ξ implies 𝒜1ξ, where 𝒜1𝒜A1𝒜1A𝒜,A1A;

  2. (PN2)

    {}ξ and ξ;

  3. (PN3)

    𝒜P¯X with 𝒜 implying 𝒜ξ.

For a prenearness ξ on X, the pair (X,ξ) is called a prenearness space [9].
A prenearness ξ is said to be grill-determined provided it satisfies

  1. (g)

    𝒜ξ implies the existence of a grill 𝒢P¯X such that 𝒜𝒢,

where 𝒢P¯X is called a grill, iff

  1. (gri1)

    𝒢;

  2. (gri2)

    G1,G2𝒢G1𝒢 or G2𝒢.

Remark 2.12.

For prenearness spaces (X,ξ),(Y,η), a map f:XY is called near map, in short n-map, provided f𝒜η, whenever 𝒜ξ, where f𝒜:={f[A]:A𝒜}. By PNEAR we denote the category of prenearness spaces and n-maps and by G-PNEAR its full subcategory of grill-determined prenearness spaces. In that context we point out that the important construct CHY of Cauchy spaces and corresponding maps has a corresponding counterpart in G-PNEAR [4].

Definition 2.13.

A supertopology on a set X is a pair (X,θ), where X is B-set and θ:XFIL(X) function from X into FIL(X) s.t. the following properties are satisfied:
     (STOP1) θ()=P¯X; (STOP2) BX and Vθ(B) implying VB; (STOP3) BX and Uθ(B) implying the existence of Vθ(B) that always Uθ(D) for any DX with DV.

Remark 2.14.

For supertopological spaces (X,X,θ), (Y,Y,ϕ), a map f:XY is called b-continuous (in short bc-map) provided that for any BX\{} and Vϕ(f[B]), f1[V]θ(B). By STOP we denoting the corresponding construct. In this context notice that in the special case X=𝒟X, θ represents the Hausdorff-surrounding system for each xX. [5]

3. Categorical Background

By a construct we mean a category 𝒞 whose objects are structured sets, i.e. pairs (X,ξ), where X is a set and ξ a 𝒞-structure on X, whose morphisms f:(X,ξ)(Y,η) are suitable maps between X and Y and whose composition law is the usual composition of maps.

Definition 3.1.

A construct is called topological iff it satisfies the following conditions:

  1. (tc1)

    Existence of initial structures:
    For any set X, any family ((Xi,ξi))iI of 𝒞-objects indexed by a class I and any family (fi:XXi)iI of maps indexed by I there exists an unique 𝒞-structure ξ on X which is initial with respect to (X,fi,(Xi,ξi),I), i.e. such that for any ξ-object (Y,η), a map g:(Y,η)(X,ξ) is a 𝒞-morphism iff for every iI the composite map fig:(Y,η)(Xi,ξi) is a 𝒞-morphism;

  2. (tc2)

    For any set X, the class {(Y,η)|𝒞|:X=Y} of all 𝒞-objects with underlying set X is a set;

  3. (tc3)

    For any set X with cardiality at most one, there exists exactly one 𝒞-object with underlying set X (i.e. there exists exactly one 𝒞-structure on X).

Definition 3.2.

A category 𝒞 is called cartesian closed provided that the following conditions are satisfied:

  1. (cc1)

    For each pair (A,B) of 𝒞-objects there exists a product A×B in 𝒞;

  2. (cc2)

    For each 𝒞 -object A holds: For each 𝒞 object B, there exists some 𝒞-object BA (called power object) and some 𝒞-morphism eA,B:A×BAB (called evaluation morphism) such that for each 𝒞-object C and each 𝒞-morphism f:A×CB, there exists an unique 𝒞- morphism f¯:CBA such that the diagram

    eA,BB1A×f¯A×BAfA×C

    commutes.

Remark 3.3.

For a topological construct 𝒞 the following statements are equivalent:

  1. (i)

    𝒞 is cartesian closed;

  2. (ii)

    For any pair (A,B)|𝒞|×|𝒞|, the set [A,B]e can be endowed with the structure of a 𝒞-object denoted by A such that the following are satisfied:

    1. (α)

      The evaluation map eA,B:A×BAB defined by eA,B(a,g)=g(a) for each (a,g)A×BA is a 𝒞-morphism;

    2. (β)

      For each 𝒞-object C and each 𝒞 morphism f:A×CB the map f¯:CBA defined by f¯(c)(a):=f(a,c) for each cC and each aA is a 𝒞-morphism. [A,B]𝒞 denotes the set of all 𝒞-morphism between A and B.

Note 3.4.

Let 𝒜 be a subcategory of a category 𝒞 and Fe:𝒜𝒞 be the inclusion functor. Then we will use the theorem that 𝒜 is reflective in 𝒞 iff one of the two equivalent conditions is satisfied:

  1. (i)

    Fe has a left adjoint R;

  2. (ii)

    Each object X|𝒞| has a universal map with respect to Fe, i.e. for each X|𝒞| there exists an 𝒜-object X𝒜 and a 𝒞-morphism rX:XX𝒜 such that for each 𝒜-object Y and each 𝒞-morphism f:XY there exists an unique 𝒜-morphism f¯:X𝒜Y such that the diagram

    fYrXXf¯X𝒜

    commutes. (The functor R is called a reflector).
    And it is called bireflective in 𝒞 iff for each X|𝒞| the 𝒞-morphism rX:XX𝒜 is a bimorphism. Then rX is said to be the bireflection of X with respect to 𝒜.

Note 3.5.

Analogously, we will use the theorem that 𝒜 is coreflective in 𝒞 iff one of the two equivalent conditions is satisfied:

  1. (i)

    Fe has a right adjoint Rc;

  2. (ii)

    Each object X|𝒞| has a couniversal map with respect to Fe, i.e. for each X|𝒞| there exists an 𝒜-object X𝒜 and a 𝒞-morphism cX:X𝒜X such that for each 𝒜-object Y and each 𝒞-morphism f:YX there exists an unique 𝒜-morphism f¯:YX𝒜 such that the diagram

    cXXf¯X𝒜fY

    commutes. (The functor Rc is called a coreflector).
    And it is called bicoreflective in 𝒞 iff for each X|𝒞| the 𝒞-morphism rX:X𝒜X is a bimorphism. Then cX is said to be the bicoreflection of X with respect to 𝒜.

4. Topological constructs

Definition 4.1.

A crossconvergence (in short cc) is a pair (X,μ), where X is a B-set in the sense of Wyler, and thus it is a non-empty subset of P¯X, the power set of a set X, stable under subsets and containing all singletons, and μ:XP¯(FIL(X×X)) is a function from X into P¯(FIL(X×X)), where FIL(X×X) denotes the set of all filters on X×X, including the nullfilter, such that the following properties are satisfied:

  1. (CC1)

    μ():={P¯(X×X)};

  2. (CC2)

    BX, 𝒰μ(B) and 𝒰𝒰1FIL(X×X) implying 𝒰1μ(B);

  3. (CC3)

    xX implies x×xμ({x});

  4. (CC4)

    B1BX implying μ(B1)μ(B);

  5. (CC5)

    BX\{} implies μ(B){μ({x}):xB}.

Then we call the triple (X,X,μ), where (X,μ) represents a cc, crossconvergence space (in short cc- space).
For cc-spaces (X,X,μX), (Y,Y,μY) a map f:XY is said to be b-equiform (in short beq-map)provided that f is bounded, i.e. BX implies f[B]Y and equiform, i.e. BX\ and 𝒰μX(B) implying (f×f)(𝒰)μY(f[B]). CCONV denotes the construct of cc-spaces and beq-maps.

Remark 4.2.

Notice, that the underlying space (X,X) of an cc-space is bounded. Furthermore, for a boundedness X, the triple (X,X,μbX) constitutes an cc-space, where μbX():={P¯(X×X)} and for BX\{} we put: μbX(B):={𝒰FIL(X×X):xB, 𝔰𝔢𝔠X𝒰x×x}.
In this context we note, that (X,μbX) constitutes an cc, which in addition is point-bounded, see (NT).

Definition 4.3.

By PB-CCONV we denote the full subcategory of CCONV, whose objects are the point-bounded cc-spaces.

Theorem 4.4.

The constructs PB-CCONV and BOUND are isomorphic.

Proof 4.5.

At the first, compare with 3. Categorical Background. We construct a functor F:BOUNDPB-CCONV by setting for any bounded space (X,X), F((X,X)):=(X,X,μbX), as defined in 4.2. And for any bounded map f:(X,X)(Y,Y) between pairs of bounded spaces we put F(f):=f. Then for any bounded space (Z,z) and any bounded map g:(Y,Y)(Z,Z) we have F(gf)=gf=F(g)F(g) since F(f):(X,X,μbX)(Y,Y,μbY) is beq-map and the composition of beq-maps is beq-map again. For BX\{} let 𝒰μbX(B), hence there exists xB, 𝔰𝔢𝔠X𝒰x×x. f(x)f[B] follows and 𝔰𝔢𝔠Y(f×f)(𝒰)f(y)×f(y) is true, because of {x}×{x}𝒰 implies {f(y)}×{f(y)}(f×f)(𝒰), and thus (f×f)(𝒰)μbY(f[B]). Conversely, for any point-bounded crossconvergence space (X,X,η) we set G((X,X,η)):=(X,X) and for any beq-map f:(X,X,η)(Y,Y,μ), G(f):=f as the "forgetfull functor". It remains to prove that FG=1PB-CCONV and GF=1BOUND, where 1PB-CONV denotes the identity functor on PB-CCONV, and 1BOUND the identity functor on BOUND. For a bounded space (X,X) we have (GF)((X,X))=G(F((X,X)))=G((X,X,μXb))=(X,X)=1BOUND((X,X)). And conversely for an point-bounded crossconvergence space (X,X,η) we have (FG)((X,X,η))=F(G((X,X,η)))=F((X,X))=(X,X,μbX), so it remains to verify η=μbX. For BX\{} let 𝒰μbX(B), hence 𝔰𝔢𝔠X𝒰x×x follows for some xB. But x×xη({x})η(B) implies 𝒰η(B). Conversely, 𝒰η(B) implies 𝒰η({x}) for some xB. By the hypothesis we get {x}×{x}𝒰 which implying 𝒰μbX(B).

Remark 4.6.

Now, we still adding the fact, that the fundamental construct BORN of bornological spaces and bounded maps has an counterpart in CCONV, too [10].

Example 4.7.

For a preuniform convergence space (X,J) let X be a B¯-set. Then we consider the pair (X,μJ), where μJ:XP¯(FIL(X×X)) is defined by setting μJ():={P¯(X×X)) and for BX\{}, μJ(B):=J. Hence (X,μJ) constitutes an cc, which in addition is fixed. If X is saturated, then (X,μJ) constitutes a fixed and saturated cc, see (NT).

Theorem 4.8.

The full subcategory FSAT-CCONV, of CCONVwhose objects are the fixed, saturated cc-spaces is isomorphic to the construct PUCONV.

Proof 4.9.

We construct a functor F:PUCONVFSAT-CCONV by setting for any preuniform convergence space (X,JX), F((X,J)):=(X,P¯X,μJX), compare with 4.6. And for any uniformly continuous map f between pairs of preuniform convergence spaces (X,JX), (Y,JY) we put F(f):=f. Then for any preuniform convergence space (Z,JZ) and any uniformly continuous map g:(Y,JY)(Z,JZ), we have F(gf)=gf=F(g)F(f), since F(f):(X,P¯X,μJX)(Y,P¯Y,μJY) is beq-map. Also note that for maps f, g, the equation (gf)×(gf)=(g×g)(f×f) is valid. For BP¯X\{} let 𝒰μJX(B), our goal is (f×f)(𝒰)μJY(f[B]). By the hypothesis, 𝒰JX implies (f×f)(𝒰)JY=μJY(f[B]), which shows the claim. Conversely, we define a functor G:FSAT-CCONVPUCONV by setting for any fixed and saturated cc-space (X,X,η), G((X,X,η)):=(X,η(X)). (X,η(X))PUCONV (note that XX is holding). And for any beq-map f:(X,X,η)(Y,Y,ξ) between pairs of fixed and saturated cc-spaces we put G(f):=f. Then for any fixed and saturated cc-space (Z,Z,μ) and any beq-map g:(Y,Y,ξ)(Z,Z,μ), we have G(gf)=gf=G(g)G(f), since G(f):(X,η(X))(Y,ξ(Y)) is uniformly continuous, and the composition of uniformly continuous maps is uniformly continuous again. So let 𝒰η(X), then (f×f)(𝒰)ξ(f[B]), since f is beq-map. YY is valid by the saturation, and ξ(f[B])=ξ(Y) follows, since (Y,ξ) is fixed. Consequently, (f×f)(𝒰)ξ(Y) is true. It remains to show that the following equations hold, i.e.

  1. (i)

    GF=1PUCONV and

  2. (ii)

    FG=1FSAT-CCONV.

to (i): For a preuniform convergence space (X,J) we consider (GF)((X,J))=G(F((X,J)))=G((X,P¯X,μJ))=(X,μJ(X))=(X,J)=1PUCONV(X,J). On the other hand for a fixed and saturated cc-space (X,X,η) we consider (FG)((X,X,η))=F(G(X,X,η)))=F(X,η(X))=(X,P¯X,μη(X))=(X,P¯X,η). Notice, that for any BX=P¯X, η(B)=η(X)=μη(X)(B).

Theorem 4.10.

By denoting SAT-CCONV the full and isomorphism-closed subcategory of CCONV whose objects are saturated, then we claim that FSAT-CCONV is bireflective in SAT-CCONV.

Proof 4.11.

At the first compare with 3. Categorical Background. For a saturated cc-space (X,X,μ) of SAT-CCONV we consider the triple (X,X,μfX), where μfX:BXP¯(FIL(X×X)) is defined by setting μfx():={P¯(X×X)} and μfX(B):=μ(X) for any BX\{}. Then 1X:(X,X,μ)(X,X,μfX) is the bireflection of (X,X,μ) with respect to FSAT-CCONV. Notice also, that P¯X equals X.
(X,P¯X,μfX) is a fixed and saturated cc-space such that 1X:(X,X,μ)(X,P¯X,μfX) is beq-map. Now, let (Y,Y,η) be a fixed, saturated cc-space and f:(X,X,μ)(Y,Y,η) be beq-map, we have to show that f:(X,P¯X,μfX)(Y,𝒫Y,η) is equiform. Compare with the following diagram:

f(Y,Y,η)1X(X,X,μ)f(X,X,μfX)

Let for BP¯X\{}𝒰μfX(B), hence 𝒰μ(X) implies (f×f)(𝒰)η(f[X]) by the hypothesis. Consequently, (f×f)(𝒰)η(Y) implies (f×f)(𝒰)η(f[B]), since (Y,Y,η) is fixed and saturated. Thus the claim results.

Theorem 4.12.

The construct SAT-CCONV is a bireflective in CCONV.

Proof 4.13.

At the first compare with 3. Categorical Background. For an object (X,X,μ) in CCONV we are setting μsat():={P¯(X×X)}, μsat(B)=μ(B) for any BX\{}, and for each BP¯X\X, μsat(B)={𝒰FIL(X×X):xB,𝒰μ({x})}. Then 1X:(X,X,μ)(X,P¯X,μsat) is the bireflection of (X,X,μ) with respect to SAT-CCONV. (X,P¯X,μsat) is a saturated cc-space such that 1X:(X,X,μ)(X,P¯X,μsat) is beq-map. Now, let (Y,Y,η) be a saturated cc-space and f:(X,X,μ)(Y,Y,η) be beq-map, we have to show that f:(X,P¯X,μsat)(Y,Y,η) is equiform. Compare with the following diagram:

f(Y,Y,η)1X(X,X,μ)f(X,P¯X,μsat)

For BX\{} and 𝒰μsat(B) we have 𝒰μ(B) implying that (f×f)(𝒰)μ(f[B]) is holding by the hypothesis. In the case that BP¯X\X and 𝒰μsat(B) are valid, we can find an element xB such that 𝒰μ({x})=μsat({x}). And by the hypothesis (f×f)(𝒰)η({f(x)}) follows, which implies that (f×f)(𝒰)η(f[B]) is true.

Corollary 4.14.

FSAT-CCONV is a full and isomorphism closed subconstruct, which is bireflective in CCONV and thus, PUCONV can be essentially considerd as a bireflective full embedded subcategory of CCONV.

Example 4.15.

For a b-uniform filter spaces (X,X,π) we consider the pair (X,μπ), where μπ:XP¯(FIL(X×X)) is defined by setting μπ():={P¯(X×X)} and for BX\{}, μπ(B):=π, then (X,μπ) constitutes an cc, which in addition is set-based, compare with (NT).

Remark 4.16.

In that context we point out, that any discrete crossconvergence (𝒟X,μ) is set-based, with 𝒟X:={{{x}:xX}.

Theorem 4.17.

The full subcategory FSET-CCONV of CCONV, whose objects are the fixed, set-based cc-spaces is isomorphic to the construct b-UFIL.

Proof 4.18.

We compare also with 2., respectively 3. and construct a functor F:b-UFILFSET-CCONV by setting for any b-uniform filter space (X,X,π), F((X,X,π)):=(X,X,μπ), compare with 4.12. By the definition (X,μπ) is fixed, too. And for any b-uniformly continuous map f between pairs of b-uniform filter spaces (X,X,π), (Y,Y,ψ) we put F(f):=f. Then for any b-uniform filter space (Z,Z,) and any buc-map g:(Y,Y,ψ)(Z,Z,) we have F(gf)=gf=F(g)F(f), since F(f):(X,X,μπ)(Y,Y,μψ) is beq-map. For BX\{} let 𝒰μπ(B), our goal is (f×f)(𝒰)μψ(f[B]). By the hypothesis, 𝒰π implies (f×f)(𝒰)ψ=μψ(f[B]), which shows the claim. Conversly, we define a functor G:FSET-CCONVb-UFIL by setting for any fixed and set based cc-space (X,X,η), G((X,X,η)):=(X,X,ση), where ση:={𝒰:FIL(X×X):BX\{}, 𝒰η(B){P¯(X×X)}. (X,ση) constitutes a b-uniform filtration on X. And for any beq-map f:(X,X,η)(Y,Y,ξ) between fixed and set-based cc-spaces we put G(f):=f. Then for any fixed and set-based cc-space (Z,Z,μ) and any beq-map g:(Y,Y,ξ)(Z,Z,μ) we have G(gf)=gf=G(g)G(f), since G(f):(X,X,ση)(Y,Y,σξ) is uniformly continuous. So let 𝒰ση and without restriction 𝒰η(B) for some BX\{}. Then (f×f)(𝒰)ξ(f[B]), since f is beq-map. Consequently, (f×f)(𝒰)σξ follows, since f is especially bounded. It remains to show that the following equations hold, i.e.

  1. (i)

    GF=1b-UFIL and

  2. (ii)

    FG=1FSET-CCONV

to (i): For a b-uniform filter space (X,X,π) we consider (GF)((X,X,π))=G(F(X,X,π))=G((X,X,μπ))=(X,X,σμπ)=(X,X,π)=1b-UFIL(X,X,π), because of 𝒰σμπ implies 𝒰=P¯(X×X) or 𝒰μπ(B) for some BX\{}. But in both cases 𝒰π is true. Conversely, 𝒰π implies 𝒰μπ({x}) for some xX, and thus 𝒰σμπ.
to (ii): For a fixed and set-based cc-space (X,X,η) we consider (FG)((X,X,η))=F(G(X,X,η))=F(X,X,ση)=(X,X,μση)=(X,X,η)=1FSET-CCONV(X,X,η) because of 𝒰μση(B) for BX\{} implying 𝒰ση. Without restriction let 𝒰η(B1) for some B1X\{}. Consequently, 𝒰η(B) is true by the hypothesis. Conversely, let 𝒰η(B) for some BX\{} hence 𝒰ση=μση(B) follows which concludes the proof.

Example 4.19.

For an orderconvergence space (X,X,τ) we consider the pair (X,μτ), where μτ:XP¯(FIL(X×X)) is defined by setting μτ():={P¯(X×X)} and for BX\{}, μτ(B):={𝒰FIL(X×X):xBτ({x}), x×𝒰}. Hence (X,μτ) constitutes a crossconvergence on X, which in addition is fil-determined, compare also with (NT).

Theorem 4.20.

The full subcategory FIL-CCONV of CCONV, whose objects are fil-determined is isomorphic to the construct ORDC.

Proof 4.21.

At the first compare with 2., 3. and (NT). We construct a functor F:ORDCFIL-CCONV by setting for any orderconvergence space (X,X,τ), F((X,X,τ)):=(X,X,μτ), compare with 4.15. And for any bc-map f:(X,X,τX)(Y,Y,τY) between pairs of orderconvergence spaces we put F(f):=f. Then for any orderconvergence space (Z,Z,τZ) and any bc-map g:(Y,Y,τY)(Z,Z,τZ) we have F(gf)=gf=F(g)F(f), since F(f):(X,X,μτX)(Y,Y,μτX) is beq-map. For BX\{} let 𝒰μτX(B). There exists xB and τX({x}), x×𝒰. By the hypothesis f()τY({f(x)})) and f(x)f[B] with f(x)×f()=(f×f)(x×)(f×f)(𝒰) implying (f×f)(𝒰)μτY(f[B]), which shows the claim. Conversely, we define a functor G:FIL-CCONVORDC by setting for any fil-determined crossconvergence space (X,X,η), G(((X,X,η))=(X,X,ψη) where (X,ψη) is defined by setting ψη():={P¯X}, and for BX\{} we put: ψη(B):={FIL(X):xB𝒰η({x}),𝒰x×}. Consequently, (X,X,ψη) constitutes an orderconvergence space, compare with (NT). And for any beq-map f:X,X,η)(Y,Y,ξ) between pairs of fil-determined crossconvergence spaces we put G(f):=f. Then for any fil-determined cc-space (Z,Z,μ) and any beq-map g:(Y,Y,ξ)(Z,Z,μ) we have G(gf)=gf=G(f)G(f), since G(f):(X,X,ψη)(Y,Y,ψξ) is bc-map, and the composition of bc-maps is bounded continuous again. So let for BX\{}, 𝒰ψη(B). Hence there exists an element xB and 𝒰η({x}) such that 𝒰x×. By the hypothesis (f×f)(𝒰)ξ({f(x)}). But then, f(x)f[B] and f×f)(𝒰)(f×f)(x×)=f(x)×f() implying f()ψξ(f[B]). Now, it remains to show that the following equations hold, i.e.

  1. (i)

    GF=1ORDC;

  2. (ii)

    FG=1FIL-CCONV.

to (i): For an orderconvergence space (X,X,τ) we consider (GF)((X,X,τ))=G(F((X,X,τ)))=G((X,X,μτ))=(X,X,ψμτ)=(X,X,τ)=1ORDC((X,X,τ)), because of : ψμτ(B) for BX\{} implies the existence of xB and 𝒰μτ({x}) such that 𝒰x×. Choose 𝒳τ({x}) with x×𝒳𝒰. Consequently, x×𝒳x× implies τ(B). Conversely, let τ(B), hence τ({x}) for some xB implies x×μτ({x}), and thus ψμτ(B), which closing this end.
to (ii): For a fil-determined cc-space (X,X,η) we consider (FG)(((X,X,η)))=F(G((X,X,η)))=F((X,X,ψη))=(X,X,μψη)=(X,X,η)=1FIL-CCONV(X,X,η), because of: For 𝒰μψη(B), BX\{} we can find xB and ψη({x}) such that x×𝒰. Choose 𝒱η({x}) with 𝒱x×. But then 𝒰η(B) follows. Conversely 𝒰η(B) implies the existence of an element xB with 𝒰η({x}). By the hypothesis we can find a filter ψη({x}) with x×η({x}) and x×𝒰. Consequently 𝒰μψη(B) is true.

Remark 4.22.

As an fundamental application we state, that the well-known point-convergence spaces, such as Kent convergence spaces, limit spaces, pretopological as well as topological convergence spaces [23] have a corresponding counterpart in CCONV, too.

Theorem 4.23.

The construct FIL-CCONV is a full and isomorphism-closed subcategory, which is bicoreflective in CCONV.

Proof 4.24.

At the first compare with 3. and (NT). For an cc-space (X,X,η) we consider the triple (X,X,ηfil), where ηfil():={P¯(X×X)} and for BX\{}, ηfil(B):={𝒰FIL(X×X):xBτη({x}),x×𝒰}. Then 1X:(X,X,ηfil)(X,X,η) is the bicoreflection of (X,X,η) with respect to FIL-CCONV.
(X,X,ηfil) is an fil-determined cc-space such that 1X:(X,X,ηfil)(X,X,η) is beq-map. Now, let (Y,Y,μ) be an fil-determined cc-space and f:(Y,Y,μ)(X,X,η) be beq-map, we have to show that f:(Y,Y,μ)(X,X,ηfil) is equiform, in square see:

1X(X,X,ηfil)f(X,X,η)f(Y,Y,μ)

So let for DY\{}, 𝒱μ(D), hence 𝒱μ({y}) for some yD. By the hypothesis we can find a filter ψμ({y}) with y×μ({y}) and y×𝒱. We have f(y)f[D] and f()ψη({f(y)}) with f(y)×f()(f×f)(𝒱), and thus the claim results. Notice especially, that any beq-map between cc-spaces is bc-map between the underlying order convergence spaces.

Example 4.25.

For a grill-determined prenearness space (X,ξ) let BX be B¯-set. Then we consider the pair (X,μξ), where μξ():={P¯(X×X)} and for BX\{} we put, μξ(B):={𝒰FIL(X×X):𝒢GRL(X)ξ,𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢𝒰}, where for 𝒢P¯X, 𝔰𝔢𝔠𝒢:={AX:F𝒢AF}}. Then (X,μξ) constitutes an crossconvergence which in addition is grill-based, compare with 4. and (NT).

In obtaining an useful correspondence between PNEAR and CCONV we will now modify the definition of maps between the objects of their prevailing constructs.

Definition 4.26.

By G-PNEAR we denote the construct, whose objects are the grill-determined prenearness spaces and whose morphisms are the sected n-maps. Here a function f:(X,ξ)(Y,η) between prenearness spaces (X,ξ), (Y,η) is said to be sected n-map (in short sn-map) provided that for Aξ, 𝔰𝔢𝔠(f𝔰𝔢𝔠𝒜)η.

Note 4.27.

Especially, we point out that any sn-map between prenearness spaces always is a n-map. In this context we further note that the pair (X,μξ) in 4.19 is fixed by the definition, and we denote by GFSAT-CCONV the full subcategory of CCONV, whose objects are the grill-based, fixed and saturated cc-spaces.

Theorem 4.28.

The category G-PNEAR is isomorphic to the construct GFSAT-CCONV.

Proof 4.29.

We construct a functor F:G-PNEARGFSAT-CCONV by setting for any grill-determined prenearness space (X,ξ), F((X,ξ)):=(X,P¯X,μξ), compare with 4.19. And for any sn-map f:(X,ξ)(Y,η) between pairs of grill-determined prenearness spaces we put F(f):=f. Then for any grill-determined prenearness space (Z,γ) and any sn-map g:(Y,η)(Z,γ) we have F(gf)=gg=F(g)F(f), since F(f):=(X,P¯X,μξ)(Y,P¯Y,μη) is beq-map. For BX\{} let 𝒰μξ(B). Hence we can find 𝒢GRL(X)ξ such that 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢𝒰. By the hypothesis 𝔰𝔢𝔠(f𝔰𝔢𝔠𝒢)η follows. Choose GR(Y)η with 𝔰𝔢𝔠(f𝗌𝖾𝖼𝒢), since η is grill-determined. But 𝔰𝔢𝔠𝒢f𝔰𝔢𝔠𝒢 implies 𝔰𝔢𝔠×𝔰𝔢𝔠f(𝔰𝔢𝔠𝒢)×f(𝔰𝔢𝔠𝒢)=(f×f)(𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢)(f×f)(𝒰), thus (f×f)(𝒰)μη(f[B]). Conversely, we define a functor G:GFSAT-CCONVG-PNEAR by setting for any grill-based, fixed and saturated cc-space (X,X,μ), G(X,X,μ):=(X,γμ), where γμ:={𝒜P¯X:𝒢GRL(X)BX,𝒜𝒢 and 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢μ(B)}. And for any beq-map f:(X,X,μ)(Y,Y,η) between pairs of grill-based, fixed and saturated cc-spaces we put G(f):=f. Then for any grill-based, fixed and saturated cc-space (Z,Y,ψ) and any beq-map g:(Y,Y,η)(Z,Z,ψ) we have G(gf)=gf=G(g)G(f), since G(f):=(X,γμ)(Y,γη) is sn-map. 𝒜γμ implies the existence of 𝒢GRL(X) and BX with 𝒜𝒢 and 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢μ(B). Consequently (f×f)(𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢)η(f[B]), f[B]Y and f𝒜f(𝒢)GRL(Y) are valid. But f(𝔰𝔢𝔠𝒢)𝔰𝔢𝔠f(𝒢)η(f[B])implies f𝒜γη. (Note also that the composition of sn-maps is a sected n-map again). Now, it remains to show that the following equations hold, i.e.

  1. (i)

    GF=1P-NEAR;

  2. (ii)

    FG=1GFSAT-CCONV.

to (i): For a grill-determined prenearness space (X,ξ) we have (GF)((X,ξ))=G(F((X,ξ))=G((X,P¯X,μξ)) =(X,γμξ)=(X,ξ)=1G-PNEAR(X,ξ) by proving the equation ξ=γμξ.
𝒜γμξ implies the existence of 𝒢GRL(X) and BX, 𝒜𝒢 and 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢μξ(B). Then we can find a grill GRL(X)ξ with 𝔰𝔢𝔠×𝔰𝔢𝔠𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢. But 𝒢 implies 𝒜ξ. Conversely, let 𝒜ξ. Since ξ is grill- determined we can choose a grill 𝒢GRL(X)ξ such that 𝒜𝒢. Since XX and 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢μξ(X). we are getting 𝒜γμξ. For a grill-based, fixed and saturated cc-space (X,X,ξ) we have (FG)((X,X,η))=F(G((X,X,η))=F((X,γη))=(X,X,μγη)=(X,X,η)=1GFSAT-CCONV(X,X,η) by proving the equation μγη=η.
For BX\{} and 𝒰μγη(B) we can find a 𝒢GRL(X)γη with 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢𝒰. Moreover we can choose GRL(X) and a bounded set DX, 𝒢 and 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢η(D). But 𝔰𝔢𝔠𝔰𝔢𝔠𝒢) implies 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢η(D), and the claim results. Conversely, for BX\{} let 𝒰η(B). Then we can find 𝒢GRL(X)γη with 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢𝒰 and 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢η(B) by the hypothesis, and the claim results.

Note 4.30.

On the other hand, in generalizing beq-maps between cc-spaces (X,X,μX), (Y,Y,μY), we call a bounded map f:XY grillequiform (in short geq-map), provided that for 𝒢GRL(X), BX\{} and 𝔰𝔢𝔠𝒢×𝔰𝔢𝔠𝒢μX(B), 𝔰𝔢𝔠f(𝒢)×𝔰𝔢𝔠f(𝒢)μY(f[B]).
In this context we note, that any beq-map between cc-spaces is grillequiform, since for any 𝒢GRL(X), f(𝔰𝔢𝔠𝒢) is subset of 𝔰𝔢𝔠f(𝒢). In addition we mention that for pairs of grill-determined prenearness spacess (X,ξX), (Y,ξY) and a map f:XY, f:(X,ξX)(Y,ξY) is near map if and only if f:(X,P¯X,μξX)(Y,P¯Y,μξY) is grillequiform.

Definition 4.31.

CCONV denotes the category, whose objects are the cc-spaces and whose morphisms are the geq-maps.

Remark 4.32.

CCONV is obviously a subcategory of CCONV, and the following theorem is valid:

Theorem 4.33.

The category GFSAT-CCONV is isomorphic to G-PNEAR.

Proof 4.34.

By applying the former results.

Example 4.35.

At the end of this section we are looking at two extraordinary crossconvergences on a set X presented by (𝒟X,μd), where 𝒟X:={{{x}:xX} and μd is defined by setting μd():={P¯(X×X)}, and for xX, μd({x}):={𝒰FIL(X×X):{x}×{x}𝒰}. And the second one by (P¯X,μP), where μP is defined by setting μP():={P¯(X×X)} and for BP¯X\{}, μP(B):=FIL(X×X).

TOPePRETOPeLIMeKENT-CONVePOINT-CONVeORDCFIL-CCONVeUNIF -UNIF U-CCONVe-FIL D-CCONVePUCONV FSAT-CCONVeSAT-CCONVeBORNeBOUNDPB-CCONVeb-UFILFSET-CCONVeG-PNEARGFSAT-CCONVeCCONVeCCONVeG-PNEARGFSAT-CCONVe

Legend
e
agree with embedding
agree with isomorphism

Figure 1. Diagram of some important categories

5. Semicrossconvergence and Precrossconvergence

If we omit the axiom (cc5) in the definition 4.1., then we get the notion of a so-called semicrossconvergence (in short scc), and the corresponding space is called semicrossconvergence space, (in short scc-space). By considering b-topologies respectively b-topological spaces (X,X,t), [19], which are a natural generalization of Kuratowski closure spaces and playing an important rule if one is considering enlarged topological extensions, [19], we look at the following assignments, see 5.1. Here, a b-topology is a pair (X,t), where X is bornology and t:XP¯X a map, satisfying the following conditions:

  1. (bt1)

    t()=;

  2. (bt2)

    BX implies t(B)X;

  3. (bt3)

    B1BX implying t(B1)t(B);

  4. (bt4)

    BX implies Bt(B);

  5. (bt5)

    BX implies t(t(B))t(B);

  6. (bt6)

    B1,B2X implying t(B1B2)t(B1)t(B2).

In that context we note, that for pairs (X,X,tX), (Y,Y,tY) of b-topological spaces, a bounded map f:(X,X,tX)(Y,Y,tY) is said to be continuous provided that BX\{} implies f[tX(B)]tYf[B]), and by b-TOP we denoting the corresponding category.

Example 5.1.

For any b-topological space (X,X,t) we put:
μt():={P¯(X×X)}, and for BX\{}, μt(B):={𝒰FIL(X×X):UFIL(X), ×𝒰 and t(B)}, where UFIL(X):={P¯2X: is ultrafilter }. (X,μt) constitutes an semicrossconvergence.

Remark 5.2.

For an semicrossconvergence (X,η) we set: clη():= and for BX\{}, clη(B):={xX:UFIL(X), ×η(B) and x}. Then clη:XP¯X satisfies (bt1), (bt3), (bt4), (bt5)and (bt6), respectively.

Definition 5.3.

An semicrossconvergence (X,η) is said to be bornotopic by satisfying the following conditions:

  1. (bt0)

    X is bornology;

  2. (bt1)

    BX implies clη(B)X, (covered);

  3. (bt2)

    BX\{} and 𝒰η(B) implying the existence of UFIL(X), ×𝒰 and clη(B), (crossfiltered);

  4. (bt3)

    BX,UFIL(X) and clη(B) implying ×η(B), (dense);

  5. (bt4)

    BX implies η(clη(B))=η(B), (closed);

  6. (bt5)

    B1,B2X\{} implying η(B1B2)=η(B1)η(B2),(additive).

Remark 5.4.

Now by stating (X,ηt) is bornotopic, then any bornotopic semicrossconvergence (X,η) leads to the following equations,i.e. (i) clμt=t and (ii) μclη=η. Thus, we obtain a bijection between the corresponding constructs. And furthermore, for pairs (X,X,tX), (Y,Y,tY) of b-topological spaces, a bounded map f:(X,X)(Y,Y) is continuous from (X,X,tX)(Y,Y,tY) iff f:(X,X,μtX)(Y,Y,μtY) is equiform.
BT-SCCONV denotes the full subcategory of SCCONV, the category of scc-spaces and beq-maps, whose objects are the bornotopic semicrossconvergence spaces, then we pose the following theorem:

Theorem 5.5.

The categories b-TOP and BT-SCCONV are isomorphic.

Proof 5.6.

We define a functor F:b-TOPBT-SCCONV by setting for any b-topological space (X,X,t), F(X,X,t):=(X,X,μt) and conversely a functor G:BT-SCCONVb-TOP by setting for any bornotopic scc-space (X,X,η):=(X,X,clη). By 5.4., GF=1b-TOP and FG=1BT-SCCONV.For the prevailing morphisms f between the corresponding spaces, we set F(f):=f and G(f):=f. Then the following equations are valid: F(gf)=F(g)F(f) and G(gf)=G(g)G(f) compare with 5.4.

Note 5.7.

Here, we remind again, that saturated bornotopic semicrosssconvergences and saturated b-topologies are essentially the same species, and thus, they can both be considered as Kuratowski closure operators and vice versa.

Note 5.8.

If we further omit in definition 4.1. the axiom (cc4), we get the notion of a so-called precrossconvergence (in short pcc), and the corresponding space is called precrossconvergence space (in short pcc-space). By considering set-convergence spaces (X,X,q) in the sense of Wyler, [32], which present a general theory of convergences, we look at the following assignment:
For any set-convergence space (X,X,q), where X is B-set and qFIL(X)×X, a relation between filters and bounded sets on X, such that the following is valid:

  1. (sc1)

    BX implies (B,B)qBqB;

  2. (sc2)

    FIL(X) and q implying =P¯X;

  3. (sc3)

    BX, qB and 1FIL(X) implying 1qB,

We put: μq():={P¯(X×X)} and for BX\{}, μq(B):={𝒰FIL(X×X):FIL(X), qB and B×𝒰}. Then, (X,X,μq) constitutes an pcc-space, which in addition is set-based and limited, (NT).

Remark 5.9.

Note, that for a limited set-based pcc (X,η), (X,X,pη) is forming the so-called underlying set-convergence. Furthermore, we are getting the equations pμq=q and μpη=η. And for pairs (X,X,qX), (Y,Y,qY) of set-convergence spaces and a bounded map f:(X,X)(Y,Y), f:(X,X,qX)(Y,Y,qY) is continuous, which means f()qYf[B] whenever qXB, iff f:(X,X,μqX)(Y,Y,μqY) is equiform. LSET-PCCONV denotes the full subcategory of PCCONV, the category of pcc-spaces and beq-maps, whose objects are limited and set-based, then we claim the following theorem:

Theorem 5.10.

The category SETCONV of set-convergence spaces and continuous maps is isomorphic to LSET-PCCONV.

Proof 5.11.

We define a functor F:SETCONVLSET-PCCONV by setting for any set-convergence space (X,X,q), F(X,X,q):=(X,X,μq) and for any bounded continuous map between pairs of set-convergence spaces F(f):=f. Conversely, we set for any limited and set-based cc-space (X,X,η), G((X,X,η)):=(X,X,pη). Hence GF=1SETCONV, FG=1LSET-PCCONV and F(gf)=F(g)F(f), G(gf)=G(g)G(f) are true by applying 5.8.

Remark 5.12.

In that context we point out, that any discrete pcc (𝒟X,η) is especially set-based, where 𝒟X:={}{{x}:xX}.

Note 5.13.

Now, let SET-PCCONV be denoting the full subcategory of PCCONV, whose objects are the set-based precrossconvergence spaces, then we note the following corollary:

Corollary 5.14.

LSET-PCCONV is bicoreflective in SET-PCCONV.

Proof 5.15.

For an set-based pcc-space (X,X,η) we consider the triple (X,X,ηlim), where ηlim():={P¯(X×X)}, and for BX\{}, ηlim(B):={𝒰FIL(X):FIL(X),B×𝒰 and pηB}. Then (X,ηlim) is limited and set-based such that 1X:(X,X,ηlim)(X,X,η) is the bicorefletion of (X,X,η) with respect to SET-PCCONV.
Now, let (Y,Y,μ) be a limited and set-based pcc-space and f:(Y,Y,μ)(X,X,η) be beq-map, we have to show that f:(Y,Y,μ)(X,X,ηlim) is equiform. So let for DY\{}, 𝒱μ(D), hence we can find a filter FIL(X) such that B×𝒰 and pμB. Hence f()pηf[B] with f[B]×f()(f×f)(𝒰). Notice, that any beq-map between pcc-spaces is continuous between the underlying set-convergence spaces, and the claim results, compare with the diagram:

f(Y,Y,μ)1X(X,X,η)f(X,X,ηlim)

Remark 5.16.

Thus, set-convergence spaces are now considered as special cases of set-based precrossconvergence spaces, and furthermore, pseudostop spaces have also an counterpart in SET-PCCONV, which offers now a new platform for studying, par example pseudotopological spaces from a more general point of view, [32].
At last, we mention that supertopological spaces and its corresponding maps, [5] are integrated as well.

Note 5.17.

SCCONV is a full and and isomorphism-closed subcategory, which is bireflective in PCCONV.

Proof 5.18.

For an pcc-space (X,X,μ) we set: μsc():={P¯(X×X)} and for BX\{}, μsc(B):={𝒰FIL(X×X):B1X\{}, B1B and 𝒰μ(B1)}. Then (X,X,μsc) is scc-space, and 1X:(X,X,μ) (X,X,μsc) the bireflection of (X,X,μ) with respect to SCCONV.
Now let (Y,Y,η) be scc-space and f:(X,X,μ)(Y,Y,η) be beq-map, we have to show that f:(X,X,μsc)(Y,Y,η) is equiform. So let for BX\{}, 𝒰μsc(B), hence we can find a bounded set B1X\{}, B1B and 𝒰μ(B1). By the hypothesis, (f×f)(𝒰)η(f[B1]), implies (f×f)(𝒰)η(f[B]), and the claim results, compare with the diagram:

f(Y,Y,η)1X(X,X,μ)f(X,X,μsc)

Note 5.19.

CCONV is a full and isomorphism-closed subcategory, which is bicoreflective in SCCONV.

Proof 5.20.

For any scc-space (X,X,μ) we set: μcc():={P¯(X×X)} and for BX\{}, μcc(B):={𝒰FIL(X×X):xB, 𝒰μ({x})}. Then (X,X,μcc) is cc-space, and 1X:(X,X,μcc) (X,X,μ) the bicoreflection of (X,X,μ) with respect to CCONV. Now let (Y,Y,η) be scc-space and f:(Y,Y,η)(X,X,μ) be beq-map, we have to show that f:(Y,Y,η)(X,X,μcc) is equiform. So let for DY\{}, 𝒰η(D). By the hypothesis we can find yD with 𝒰η({y}). Hence (f×f)(𝒰)μ({y}) follows, since f is beq-map. But f(y)f[D] implies the claim, compare with the diagram.

f(Y,Y,η)1X(X,X,μ)f(X,X,μcc)

Example 5.21.

In addition, for some examples let 𝒮P¯X and 𝒮 be the bornology generated by 𝒮, then (X,𝒮,μbX) forms a point-bounded crossconvergence on X. And for a symmetric topological space (X,t), where tdenotes the corresponding closure operator, we consider (X,ξt), where ξt:={𝒜P¯X:{t(A):A𝒜}} and then looking at (P¯X,μξt), see 4.19. Consequently, 𝒜ξt implies the existence of xX such that x{t(A):A𝒜} and 𝒢:={DX:xt(D)}GRL(X) with 𝒜𝒢ξt. Thus (P¯X,μξt) is object of GFSAT-CCONV.
Let a supertopological space be given in the sense of Doitchinov [5], see also 2.13. Then a corresponding precrossconvergence (X,μθ) will be presented at next, compare also with (NT) and remark 5.8.
Here at first we consider a so-called neighborhood space (X,X,θ), where θ:XFIL(X) satisfies the following conditions:

  1. (n1)

    θ()=P¯X;

  2. (n2)

    BX and Vθ(B) implying VB;

  3. (n3)

    B1BX implying θ(B)θ(B1).

Then we consider (X,μθ), where μθ:XP¯FIL(X×X) is defined for BX by setting: μθ(B):={𝒰FIL(X×X):tθ(B),B×𝒰}, where tθ(B):={FIL(X):θ(B)}. On the other hand let (X,X,η) be pcc-space, then for BX we look at Θη(B):={FIL(X):τη(B)}, where τη(B):={FIL(X):𝒱η(B)𝒱B×}. Notice, that (X,μθ) is especially limited and set-based, but furthermore it satisfies the condition for being surrounded.
Here, a corresponding pcc-space (X,X,η) is said to be surrounded iff for BX, {𝒰FIL(X×X):𝒰μ(B)}μ(B). Thus, neighborhood spaces and corresponding surrounded, limited and set set-based pcc-spaces are essentially the same, up to isomorphism. Then, in consequence such a space is said to be supertopic, provided that its underlying neighborhood space is a supertopological one. Hence STOP and ST-PRECCONV, the full subcategory of PRECCONV, whose objects are the supertopic pcc-spaces , are isomorphic.

6. Convenient properties of the former considered constructs

At the first, will show that PCCONV satisfies the conditions for being a topological construct. (see 3. Categorical Background).

Theorem 6.1.

PCCONV is a topological construct.

Proof 6.2.

For a one point set X:={x} we put: X:={,{x}}, μX():={P¯(X×X)} and μX({x}):={{(x×x)}}. Then, (X,μX) is the only one precrossconvergence on X. Moreover, for any set X the class of all precrossconvergences on X forms a set. And at last, for a set X and a class I let (Xi,μi)iI be a family of pcc-spaces and (fi:XXi)iI a family of functions. We set inX:={BX:iI, fi[B]Xi}, μin():={P¯(X×X)} and for any BinX\{}, μin(B):={𝒰FIL(X×X):iI, (fi×fi)(𝒰)μi(fi[B])} . Then (inX,μin) is the coarsest precrossconvergence on X such that for any iI, fi:(inX,μin)(Xi,Xi,μi) is beq-map. Thus (inX,μin) constitutes the initial precrossconvergence on X with respect to the given data.

Corollary 6.3.

The constructs SCCONV and CCONV are both topological categories.

Proof 6.4.

This is valid by using only categorical arguments with respect to the results in 5.14. and 5.15., respectively.

Note 6.5.

In CCONV the initial crossconvergence (inX,μin) with respect to the given data is defined by setting: inX:={BX:iI,fi[B]Xi}, μin():={P¯(X×X)} and for any BinX\{}, μin(B):={𝒰FIL(X×X):iIxiBi, (fi×fi)(𝒰)μi({fi(xi)})}. Furthermore, in CCONV the final crossconvergence (finX,μfin) with respect to the given data is defined by setting: finX:={BX:iIBiXi,Bfi[Bi]}𝒟X, μfin():={P¯(X×X)} and for BfinX\{}, μfin(B):={𝒰FIL(X×X):iIBiXi\{}𝒰iμi(Bi), fi[Bi]B and (fi×fi)(𝒰i)𝒰}{𝒰FIL(X×X):xB, {x}×{x}𝒰}.

At the next, we consider the latter property, but more precisely described in some application. So let f:(X,X,μ)(Y,Y,η) be a quotient map in CCONV, i.e. f:XY is surjective and (Y,η) the final crossconvergence on Y with respect to (f,X,μ), compare with 6.3., then we state:

Note 6.6.

In CCONV products of quotient maps are quotient maps.

Proof 6.7.

Let (fi:(Xi,Xi,μi)(Yi,Yi,ηi)iI be a non-empty family of quotient maps in CCONV and let

f#(Y,Y,η)pi(X,X,μ)qi(Yi,Yi,ηi)fi(Xi,Xi,μi)

be the corresponding product diagram in CCONV, where (X,X,μ):=ΠiI(Xi,Xi,μi), (Y,Y,η):=ΠiI(Yi,Yi,ηi), pi, qi are denoting the corresponding projections for any iI and f# the existing product map. Since all fi are surjective, f# is surjective. By 5.3., Yi={DiYi:BiXi,Difi[Bi]} for all iI, ηi():={P¯(Yi×Yi)} and for DiYi\{}, ηi(Di)={𝒱iFIL(Yi×Yi):BiXi\{}, 𝒰iμi(Bi),(fi×fi)(𝒰i)𝒱i and 𝒟ifi[Bi]} for all iI, because fi is quotient map for all iI. Now, we show that Y equals with f#Y:={DY:BX,Df#[B]} and η equals with ηf# where ηf#():={P¯(Y×Y)} and for Df#Y\{}, ηf#(D)={𝒲FIL(Y×Y):HX\{},μ(H),(f#×f#)()𝒲 and Df#[B]} Thus, the product map f# is quotient map in CCONV.
At the first let DY, hence qi[D]Yi for each iI, since Y is the product boundedness for each iI. But then we can find BiXi with qi[D]fi[Bi] for each iI by the hypothesis.Thus B:=iIBiX, since X is the product boundedness on X. Consequently, f#[B]D, since yD implies yi(y)=yiqi[D]fi[Bi]. Hence qi(y)=fi(xi) for xiBi, for every iI, and then x=(xi)iIB with f#(x)=y follows by using the commutativity of the product diagram. At the second let Df#Y. Then we can find BX with f#[B]D. Consequently, qi[D]qi[f#[B]]Yi for each iI, and qi[D]Yi follows, showing that DY is valid. Now, we prove that η equals with ηf#, where ηf#()={P¯(Y×Y)} and ηf#(D):={𝒲FIL(Y×Y):HX\{}μ(H),(f#×f#)()𝒲 and f#[H]D} for any DY\}. So let for DY\{} at first 𝒲ηf#(D). Then we can find HX\{} and μ(H) with (f#×f#)()𝒲 and f#[H]D. Consequently, (qi×qi)((f#×f#)())=(fi×fi)((pi×pi)())ηi(fi[pi[H]]) for each iI. Otherwise, we have fi[pi[H]]=qi[f#[H]] for any iI, hence ηi(fi[pi[H]])=ηi(qi[f#[H]])ηi(qi[D]) follows with (qi×qi)((f#×f#))()(qi×qi)(𝒲), which implying (qi×qi)(𝒲)ηi(qi[D]) for each iI. Thus 𝒲η(D), see 5.4.
Conversely, let for DY\{}, 𝒲η(D), then (qi×qi)(𝒲)ηi(qi[D]) for each iI. Thus, for each iI there is some BiXi\{} and some iμi(Bi), with (fi×fi)(i)(qi×qi)(𝒲) and fi[Bi]qi[D]. If j:iI(Xi×Xi)iIXi×iIXi denotes the canonical isomorphism. (i.e. (j((xi,zi)):=((xi),(zi)) and iIi the product filter on iI(Xi×Xi), then j(iIi) is a filter on iIXi×iIXi with (pi×pi)(j(iIi))=i for each iI. Thus j(iIi)μ(iIBi). If t:iI(Yi×Yi)iIYi×iIYi denotes the canonical isomorphism, then t1(f#×f#)(j(iIi))iI(fi×fi)(i)iI(qi×qi)(𝒲)t1(𝒲). Thus, (f#×f#)(j(iIi)) and f#[iIBi]D shows the claim.

Remark 6.8.

As pointed out by Preuss, [27], the theory of connection and disconnection profits from the better behavior of quotients in topological constructs which are strong in the sense that quotients are stable under arbitrary products. In TOP we have, that finite products of quotient maps must not be quotient maps again. Furthermore, extensionality, i.e. the existence of one-point extensions, which will be studied at the next, implies that quotients are hereditary. And the theory of connection and disconnection profits from this fact, i.e. the statement, that the quotient space of a uniform space X, obtained by the decomposition of X into its uniform components is uniformly disconnected, is true whenever quotients are formed in CCONV, where they are hereditary, but it is false, when quotients are formed in UNIF.

Theorem 6.9.

The strong topological construct CCONV is extensional.

Proof 6.10.

Let (X,X,μ) be a crossconvergence space. We put X:=X{} with X. Let us denote by i:XX the inclusion map. Then we define a crossconvergence (X,μ) on X as follows:
X:=X{{}}, μ():={P¯(X×X)}, for BX with B: μ(B):=FIL(X×X) and for BX\{,{}}: μ(B):={𝒰FIL(X×X):{(,)}𝒰 or {(,)}𝒰 with (i×i)1(𝒰)μ(B)}. Note, that for RX×X, R:=R(X×{})({}×X), and for 𝒰μ(B), BX\{}, the filter 𝒰:={R:R𝒰}μ(B), respectively that μ:XFIL(X×X) is defined for all BX, since especially BX\{} iff BX\{,{}}. X is boundedness on X Then (X,X,μ) is the one-point extension of (X,X,μ), which especially means that (X,μ) is initial with respect to (X,i,(X,X,μ) or in other words (X,X,μ) is subspace of (X,X,μ), see also 4.2.
to (cc1): evident by the definition;
to (cc2): Let BX with B, 𝒰μ(B) and 𝒰𝒰1FIL(X×X), then evidently 𝒰μ(B) by the definition;
Now, let BX\{,{}} and for 𝒰μ(B){(×)}𝒰, then for 𝒰1FIL(X×X) with 𝒰𝒰1 the claim immediately follows. At last let {(,)}𝒰1 for 𝒰𝒰1FIL(X×X) with 𝒰μ(B), {(,)}𝒰 implies that the trace of 𝒰 exists with (i×i)1(𝒰)μ(B). By the hypothesis the trace of 𝒰1 also exists with (i×i)1(𝒰)(i×i)1(𝒰1). Thus (i×i)1(𝒰)1μ(B), which implies the claim.
to (cc3): Let xX, then in the case of xX, we have x×xμ({x}), since x×xμ({x}) is valid. Otherwise X= implies ×FIL(X×X)=μ({}) by the definition.
to (cc4): Now let for B1BX, B1, then μ(B1)=μ(B) follows. In the case B and B1 we have B1X\{}, and 𝒰μ(B1) implies immediately 𝒰μ(B).
to (cc5): At last let BX\{}. For B we have μ({})=FIL(X×X)=μ(B). On the other hand B implies BX\{,{}}. Then BX\{} implies μ(B)μ({x}) for some xB. 𝒰μ(B) and {(,)}𝒰, implying 𝒰μ({x}), since x. {,)}𝒰 implies the existence of the trace of 𝒰 with (i×i)1(𝒰)μ(B). Hence we can find zB with (i×i)1(𝒰)μ({z}). But z implies 𝒰μ({z}). Evidently, i:(X,X)(X,X) is bounded, and furthermore for 𝒰μ(B), BX\{}, (i×i)(𝒰)μ(i[B])=μ(B) is valid, since R(i×i)(𝒰) implies R(i×i)[R] for some R𝒰. Hence (i×i)1[R](i×i)1[(i×i)[R]]=R. Thus the trace of (i×i)(𝒰) exists and coincides with 𝒰. Consequently, i is beq-map. Now, let (𝒜X,η) be crossconvergence on X such that i:(X,𝒜X,η)(X,X,μ) is beq-map. We show that (𝒜X,η)(X,μ), which means that 𝒜XX, and for any A𝒜X\{}, 𝒰η(A) implying 𝒰μ(A). Thus, 1X:(X,𝒜X,η)(X,X,μ) is beq-map. Now, A𝒜X implies i(A)=AX, hence AX follows , since A={} contradicts.
Let for A𝒜X\{}, 𝒰η(A). Consequently, (i×i)(𝒰)μ(i[A])=μ(A) follows by the hypothesis. And since AX\{,{}} we have {(,)}(i×i)(𝒰) or {(,)}(i×i)(𝒰) with (i×i)1((i×i)(𝒰))μ(A). But {(,)}(i×i)(𝒰) contradicts by the definition of X. In the other case, the trace of (i×i)(𝒰) exists, s.t. 𝒰μ(A) follows, since i is injective, and the claim results.
Now, let (Y,Y,μY) be a crossconvergence space and f:(AY,jY,μjY)(X,X,μ) be a beq-map from a subspace (AY,jY,μjY) of (Y,Y,μY), where j:AYY denotes the corresponding inclusion. We have to show that f:(Y,Y,μY)(X,X,μ) is beq-map too, where f:YX is defined by setting:

f(y):={f(y)ifyAYifyAY

The following diagram illustrates the above situation.

j(Y,Y,μY)f(AY,jY,μjY)f(X,X,μ)i(X,X,μ)

At the first we show that f(Y,Y)(X,X) is bounded. So let DY. If f[D]={}, then there is nothing to show. In the case of f[D], DAYjY implying f[DAY]X by the hypothesis. We show that f[D]f[DAY] is valid. zf[D] implies z=f(y) for some yD. If assuming yY\AY, f(y)= follows which contradicts. But yAY shows the claim.
Now, let 𝒰μY(D), DY\{}, our goal is (f×f)(𝒰)μ(f[D]). Choose yD s.t. 𝒰μY({y}). Then we discuss the alternation yY\AY respectively yAY.
yY\AY implies f(y)= and thus μ({})=μ({f(y)}) with (f×f)(𝒰)FIL(X×X)=μ({f(y)})μ(f[D]).
yAY implies f(y)=f(y). And (j×j)1(𝒰) exists iff (Y×Y)\(AY×AY)𝒰. Choose R𝒰 with R(Y×Y)\(AY×AY). Then there exists (y1,y2)R with (y1,y2)AY×AY, hence the claim results. In this case, (j×j)1(𝒰)μjY({y}), since (j×j)1(𝒰)𝒰. But f is equiform, hence (f×f)((j×j)1(𝒰))μ({f(y)}). Thus ((f×f)((j×j)1(𝒰))μ({f(y)}) ( see the begin of the proof 4.7.). But ((f×f)((j×j)1(𝒰)))(f×f)(𝒰) implies (f×f)(𝒰)μ({f(y)}), and the claim follows. (Note, that for R𝒰((f×f)[R(AY×AY)])=(f×f)[R(AY×AY)]({}×X)(X×{})(f×f)[R(AY×AY)](f×f)[R(Y×Y\AY×AY)]=(f×f)[R]).
If (j×j)1(𝒰) does not exists, ((Y×Y)\(AY×AY)𝒰. Then (f×f)[(Y×Y)\(AY×AY)]=(f×f)[((Y\AY)×(Y\AY))((AY×(Y\AY))((Y\AY)×AY)]=(f[Y\AY]×f[Y\AY])(f[AY]×f[Y\AY])(f[Y\AY]×f[AY])=({}×{})(f[AY]×{})({}×f[AY]){(,)}, i.e. {(,)}(f×f)(𝒰). Thus (f×f)(𝒰)μ({f(y)}), and the claim follows.

Remark 6.11.

TOP is not extensional, since in TOP quotients are not hereditary. Furthermore, as Preuss, [27] has shown, UNIF, the category of uniform spaces and uniformly continuous maps and ULIM, the category of uniform limit spaces and uniformly continuous maps are not extensional. On the other hand SUCONV, the category of semiuniform convergence spaces and related maps, [26] respectively GCONV, the category of generalized point-convergence spaces and continuous maps are both extensional. And, at this end, we still note that b-UFIL, the category of b-uniform filter spaces and bounded uniformly continuous maps, [17] and ORDC, the category of orderconvergence spaces and bounded continuous maps, [21] possesses also the above mentioned property.
Hence,
CCONV takes one’s place into the concept of convenient topological constructs, because as the next, in addition, we show that CCONV has natural function space structures, with is leading to the property of being cartesian closed. And, in this context, CCONV fulfils the following laws:

  1. (1)

    First exponential law, XY×Z is isomorphic to (XY)Z;

  2. (2)

    Second exponential law, (iIXi)Y is isomorphic to iI(XiY);

  3. (3)

    Third exponential law, XiIYi is isomorphic to iI(XYi);

  4. (4)

    Distributive law, (see also [27]), X×iIYi is isomorphic to iI(X×Y).

Proposition 6.12.

For two crossconvergence spaces (X,X,μX), (Y,Y,μY) we consider the set YX:={f|f:XY is beq-map} and define a crossconvergence (YX,μYX) on YX by setting YX:{BYX:BX, B(B)Y, where B(B):={f(x):fB, xB}, μYX()={(P¯YX×P¯YX)} and for BYX\} we put: μYX(B):={𝒰FIL(YX×YX):fBBX\{}𝒰FIL(X×X)(𝒰μX(B) implies 𝒰(𝒰)μY(f[B]))}, where 𝒰(𝒰) denotes the filter generated by the set R(R) with R(R):={(f(x),g(z)):(f,g)R,(x,z)R}. (YX,μYX) is called the bounded equiform function crossconvergence on YX (in short beq-function crossconvergence), such that the evaluation map e:(X×YX,X×YX,μX×YX)(Y,Y,μY) is beq- map, where e(x,f):=f(x) for any xX and fYX.

Proof 6.13.

Obviously, (YX,μYX) is crossconvergence on YX, since especially for fYX, and 𝒰μ(B),BX\{}, f×f(𝒰)=f×f(𝒰)μY(f[B]). And furthermore for BYX\{} and 𝒰μYX(B) we can find fB with the corresponding defined property. But 𝒰μ(B) implies 𝒰μ({x}) for some XB and thus 𝒰(𝒰)μY({f(x)}) implying 𝒰μYX({f}). The converse is evident. The evaluation map e:X×YXY, e(x,f):=f(x), e:(X×YX,X×YX,μX×YX)(Y,Y,μY) is beq-map, where (X×YX,μX×YX) denotes the initial crossconvergence on X×YX with respect to ((X×YX),(p×pY),(X,μX),(Y,μY)) and pX:X×YXX, pYX:X×YXYX as the corresponding projections, see 4.2.
At the first, e is bounded because of BX×YX implies pX[B]X and pYX[B]YX. By the definition of YX, we are getting pYX[B](pX[B])Y. The inclusion e[B]pYX[B](pX[B]) is holding, since ye[B] implies y=f(x) for some (x,f)B. Hence pX(x,f)=x and pYX(x,f)=f follow, showing that y=f(x)pYX[B](pX[B]) is valid. Now, let BX×YX\{} with 𝒰μX×YX(B). We have to verify that (e×e)(𝒰)μY(e[B]) is valid. Since (X×YX,μX×YX) is the initial crossconvergence on X×YX we are getting 𝒰μX×YX({x,f}) for some (x,f)B, (pX,×pX)(𝒰)μX(pX[{x,f)}] and (pYX×pYX)(𝒰)μYX(pYX[{x,f}]). Thus pX[{(x,f)}]=x and pYX[{(x,f)}]=f implying (pX×pX)(𝒰)μX({x}) and (pYX×pYX)(𝒰)μYX({f}). By the definition of μYX we obtain (pYX×pYX)(𝒰)((pX×pX)(𝒰))μY({f(x)})=μY({e(x,f)})μY(e[B]). It remains to show that (pYX)×pYX)(𝒰)((pX×pX)(𝒰))(e×e)(𝒰).
V(pYX×pYX)(𝒰)((pX×pX)(𝒰)) implies VR(R) for some R(pYX×pYX)(𝒰) and some R(pX×pX)(𝒰).
Hence R(pYX×pYX)[U1] for some U1𝒰1 and R(pX×pX)[U2] for some U2𝒰2. Thus R(pY×pY)[U1U2] and R(pX×pX)[U1U2]. Note also that U1U2𝒰 is holding. Now let z(e×e)[U1U2], thus z=(e×e)(x,f) for some (xf)U1U2. Consequently, pX(x,f)=x and pYX(x,f)=f implying (f,f)(pYX×pYX)[U1U2] and (x,x)(pX×pX)[U1U2] resulting into zR(R), and the claim follows.

Proposition 6.14.

Let (X,X,μX), (Y,Y,μY) and (Z,Z,μZ) be crossconvergence spaces and f:(X×Z,X×Z,μX×Z)(Y,Y,μY) any beq-map. Then the associated function f^:(Z,Z,μZ)(YX,YX,μYX) defined by f^(z)(x):=f(x,z) for each zX and xX is also beq-map.

Proof 6.15.

At the first, we prove that f^:(Z,Z)(YX,YX) is bounded. In doing so, let DZ, we must show f^[D]YX. So let BX, then we claim f^[D](B)Y. Since pZ1[D]pX1[B]X×Z, here pX:X×ZX, pZ:X×ZZ denotes the corresponding projection, we are getting f[pZ1[D]pX1[B]]Y by the hypothesis. It remains to verify that the inclusion f^[D](B)f[pZ1[D]pX1[B]] is holding. yf^[D](B) implies y=f^(z)(x) for some zD and some xB. Hence y=f(x,z) follows. But (x,z)pz1[D]pX[B] implying yf[pz1[D]pX1[B]], and the claim holds. Further let for DZ\{} and for 𝒰FIL(Z×Z), 𝒰μZ(D). Our goal is to verify that (f^×f^)(𝒰)μYX(f^[D]) is valid. Choose zD such that 𝒰μZ({z}), then f^(z)YX and f^(z)f^[D] follows. Now, let BX\{} and 𝒱FIL(X×X) such that 𝒱μX(B) is holding, hence 𝒱μX({x}) for some xB. So, it remains to prove that (f^×f^)(𝒰)(𝒱)μY(f^(z)(x)})=μY({f(x,z)}) is valid. We have {(x,z)}X×Z, and by setting :={R(X×Z)×(X×Z):U𝒰, V𝒱, R(pz×pz)1[U](pX×pX)1[V]}, μX×Z({x,z}) follows, since (pz×pz)(𝒰)𝒰 and (pX×pX)(𝒱)𝒱 are implying (pz×pz)(𝒰)μZ({z}) and (pX×pX)(𝒱)μX({x}). Then by the hypothesis we obtain (f×f)()μY({f(x,z)}). Furthermore we have (f^×f^)(𝒰)(𝒱)(f×f)(), because of D(f×f)() implies 𝒟(f×f)[R] for some R. Then we can find some U𝒰 and some V𝒱 such that (f×f)[R](f×f)[(pZ×pZ)1[U](pX×pX)1[V]](f^×f^)[U](V), since y(f^×f^)[U](V) implies y=(f^(z1)(x1),f^(z2)(x2)) for some (f^(z1),f^(z2))(f^×f^)[U] with (z1,z2)U and(x1,x2)V, hence f^(z1)(x1)=f(x1,z1) and f^(z2)(x2)=f(x2,z2) implying (x1,z1)(pZ×pZ)1[U](pX×pX)1[V] and (x2,z2)(pz×pz)1[U](pX×pX)1[V]. Consequently y=(f^(z1)(x1),f^(z2)(x2))=(f(x1,z1),f(x2,z2))=((f×f)(x1,z1),(f×f)(x2,z2)) results.

Theorem 6.16.

The strong topological construct CCONV is cartesian closed.

Proof 6.17.

By applying 6.2., 6.4. and 6.9., respectively.

Remark 6.18.

Preuss, [27] pointed out that TOP and UNIF are not cartesian closed. On the other hand SUCONV and GCONV possess that nice property. Furthermore, CHY, the category of Cauchy spaces ( and Cauchy continuous maps) is also cartesian closed

Corollary 6.19.

CCONV is a quasitopos respectively a topological universe in which quotients are productive, and thus it constitutes a strong topological universe, see above.

Remark 6.20.

TOP, UNIF, CHY are not strong topological universes, but SUCONV, GCONV, BOUND, ORDC, b-UFIL and CCONV possess these properties. Thus, CCONV also delivers a contribution to Convenient Topology in which convergence structures are available but now are more enlarged to a concept called Bounded Topology in which in addition bounded structures such as bornology, b-uniform filtration, b-topology, supertopology, set-convergence or precrossconvergence are involved by studying PRE-CCONV invariants, i.e. properties of precrossconvergences, which are preserved by isomorphisms in PRE-CCONV. This includes also the study of full and isomorphism- closed subcategories of PRE-CCONV as already formerly described

7. Discussion and proposals

The reader will observe that in the equivalent concept FSAT-CCONV of PUCONV we can renunciate on the properties of being fixed and saturated. It remains now to be a concept of spaces (X,X,μ) which will be now enriched by the following additional postulates, i.e.

  1. (f)

    (X,μ) is filtered, meaning that BX and 𝒰1,𝒰2μ(B) implying 𝒰1𝒰2μ(B);

  2. (s)

    (X,μ) is symmetric, i.e. BX and 𝒰μ(B) implying 𝒰1μ(B);

  3. (c)

    (X,μ) is connected by BX and 𝒰1, 𝒰2μ(B) implying 𝒰1𝒰2μ(B), where 𝒰1𝒰2 is filter generated by {R1R2:R1𝒰1,R2𝒰2}.

Let us call a crossconvergence (X,μ) and the corresponding space (X,X,μ) epicrossconvergence, respectively epicrossconvergence space, provided (X,μ) satisfies the conditions (f), (s) and (c), respectively. By denoting EPICCONV the full subcategory of CCONV, it is now possible to analyses the fundamental full subcategory ULIM of PUCONV, whose objects are the uniform limit spaces, by using the more general concept of epicrossconvergence spaces. Here, a preuniform convergence structure J on X is called uniform limit structure and the space (X,J) uniform limit space provided it satisfies the following conditions: 𝒰1,𝒰2μ implying 𝒰1𝒰2J and 𝒰1𝒰2J if it exists, and 𝒰J implies 𝒰1J.
By using 4.7. the categories ULIM and FSAT-EPICCONV are isomorphic. Consequently, the concept of epicrossconvergence is a more general one and contains UNIF, too.
Moreover, for an epicrossconvergence (X,μ) we can naturally consider so-called μ-Cauchy filter (in short μ-Cfilter), where a filter FIL(X) is said to be μ-Cfilter provided that ×μ({x}) for some xX. Furthermore, we say a filter FIL(X) is μ-convergent provided the existence of an element xX such that x×μ({x}). Then completeness can be introduced by combining these two conditions, i.e. , an epicrossconvergence (X,μ) and the corresponding space (X,X,μ) are called complete, provided that any μ-Cfilter is μ-convergent. The following statement justifies this definition: An uniform limit space is complete if and only if its corresponding epicrossconvergence space is complete. Now, it seems to be of interest to develop a "completion-theory" for epicrossconvergence spaces.

Acknowledgements.
The authors are grateful to the reviewers and editor for their helpful comments.
Funding.
This research has not received external funding
Author contributions.
Methodology, investigation, writing original draft preparation, supervision, project administration, D. L.; conceptualization, validation, resources, writing review and editing, visualization, D. L. and Z. V.; software, Z. V.

References

  • [1] B. Averbukh, On topologies on the underlying set of a topological monoid induced by its unitary extensions, Topol. Algebra Appl. 10, no. 1 (2022), 25–35.
  • [2] M. Baran, S. Kula, T. M. Baran, and M. Quasim, Closure operators in semiuniform convergence spaces, Filomat 30, no. 1 (2016), 131–140.
  • [3] M. Baran, S. Kula and A. Erclyes, T0 and T1 semiuniform convergence spaces, Filomat 27, no. 4 (2013), 537–546.
  • [4] H. L. Bentley, H. Herrlich and E. Lowen-Colebunders, The category of Cauchy spaces is cartesian closed, Topology Appl. 27 (1987), 105–112.
  • [5] D. Doitchinov, Supertopological spaces and special classes of extensions of topological spaces, In: Faddeev, L. D., Mal’cev, A. A. (eds) Topology. Lecture Notes in Mathematics, vol 1060, Springer, Berlin, Heidelberg (1984), 17–25.
  • [6] V. A. Efremovic, The geometry of proximity, Mat. Sbornik 32 (73), (1952), 189–200.
  • [7] A. Eriyes, T. Baran, and M. Quasim, Closure operators in constant filter convergence spaces, Konuralp Journal Math. 8, no. 1 (2020), 185–191.
  • [8] B. G. C. Herrejón and F. Mynard, On connected subsets of a convergence space, Int. J. Topol. 2, no. 3 (2025), 13.
  • [9] H. Herrlich, Topology structures, Math. Centre Tracts 52 (1974), 59–122.
  • [10] H. Hogbe-Nlend, Theorié des Bornologies et applications, Lecture Notes in Math. n. 213, Springer Berlin (1971).
  • [11] V. M. Ivanova and A. A. Ivanov, Contiguity spaces and bicompact extensions, DOKL. Akad. Nauk SSSR 127 (1959), 20–22.
  • [12] G. Jäger, Non-symmetric convergence and regularity, Appl. Gen. Topol. 26, no. 1 (2025), 447–467.
  • [13] H. J. Kowalski, Topologische Räume, Basel-Stuttgart, Birkhaüser (1961).
  • [14] D. Leseberg, A new concept of convergence space, Math. Pann. 19, no. 2 (2008), 291–303.
  • [15] D. Leseberg, On topological induced b-convergences, Topol. Proc. 37 (2011), 293–313.
  • [16] D. Leseberg, Improved nearness research. Adv. Pure Math. 4, no. 11 (2014), 610–626.
  • [17] D. Leseberg and Z. Vaziry, The quasitopos of b-uniform filter spaces, Math. Appl. 7 (2018), 155–171.
  • [18] D. Leseberg and Z. Vaziry, Bounded Topology, LAP, Acad. Pub. (2019).
  • [19] D. Leseberg and Z. Vaziry, Pseudonearness as an important part of bounded topology, ICRAPAM (2021), 258–270.
  • [20] D. Leseberg and Z. Vaziry, The Cauchy completion of symmetric b-uniform filter space, Math. Appl. 10 (2021), 125–142.
  • [21] D. Leseberg and Z. Vaziry, Orderconvergence, a quasitopos for bounded topology BT, Researchgate (2025), 10.13140/RG.2.2.29777.85605.
  • [22] M. W. Lodato, On topological induced generalized proximity relations. I. Proc. Amer. Math. Soc. 15, no. 3 (1964), 417–422.
  • [23] F. Mynard and S. Dolecki, Convergence Foundation of Topology, World Scientific Pub (2016).
  • [24] D. Pallaschke and D. Pumplün, Banach limits revised, Adv. Pure Math. 6, no. 13 (2016), 1022–1036.
  • [25] M. J. Penon, Quasitopos, C. R. Acad. Sci. Paris, Sér A. 276 (1973), 237–240.
  • [26] G. Preuss, Semiuniform convergence spaces, Math. Jap. 41(1995), 465-491.
  • [27] G. Preuss, Foundation of Topology. An approach to Convenient Topology, Dordrecht, Kluwer Acad. Pub. (2002).
  • [28] G. Preuss, Prefilter spaces and a precompletion of preuniform convergence spaces related to some well-known completions, Topology Appl. 156, no 12 (2009), 2005–2012.
  • [29] D. Pumplün, A universal compactification of topological positively convex sets and moduls, Journal of Convex Analysis 41 (2011), 255–267.
  • [30] Y. M. Smirnov, On completeness of proximity spaces, Dokl. Acad. Nauk SSSR 88 (1953), 761–764.
  • [31] A. Weil, Sur les espaces à structures uniformes et sur la toplogie générale, Act. Sci. Ind. 551 (1937).
  • [32] O. Wyler, On convergence of filters and ultrafilters to subsets, Lect. Notes Comp. Sci. 393 (1988), 340–350.