A syntopogenous space is a common generalization of topological spaces, proximity spaces, and uniform spaces. The category of syntopogenous spaces includes , , and as full subcategories whose intersection is fairly trivial.
nontriviality: if is inhabited, then .
binary additivity: if and only if either or .
nullary additivity: it is never true that or for any .
Note that the “if” direction of binary additivity is equivalent to isotony: if and , then implies .
The set of topogenous relations on , ordered by containment, is a complete lattice:
The opposite relation of a topogenous relation is again topogenous. A topogenous relation is called symmetric if it is equal to its opposite, i.e. if if and only if .
A topogenous relation is called perfect if implies there exists an with . It is called biperfect if both it and its opposite are perfect. Of course, a symmetric perfect topogenous relation is automatically biperfect.
A syntopogeny (or syntopogenous structure) on a set is a filter of topogenous relations such that
A basis for a syntopogeny on is a filterbase in the complete lattice of topogenous structures, such that the filter it generates is a syntopogeny. When is equipped with a syntopogeny, it is called a syntopogenous space.
A syntopogeny is called symmetric, perfect, or biperfect if it admits a basis consisting of symmetric, perfect, or biperfect topogenous relations, respectively. It is called simple if it admits a basis that is a singleton.
If is a topogenous relation on and is a function, then we have a topogenous relation on defined by iff . That is, , where is the left adjoint of .
Now if and are syntopogenous spaces, a function is called syntopogenous, or syntopologically continuous, if for any , we have . This defines the category .
If is a syntopogenous space, then the collection is a basis for a syntopogeny on , which is the initial structure induced on by . The operation of taking initial structures, as a map from syntopogenies on to syntopogenies on , preserves opposites, simplicity, meets, symmetry, and perfectness.
More generally, if is a family of syntopogenous spaces and are functions, then the meet of the initial structures induced by all the is the initial structure induced by them jointly. Thus, is a topological concrete category.
Conversely, given a simple perfect syntopogeny, with singleton basis , we define ; then this is a Kuratowski closure operator and hence defines a topology.
A simple symmetric syntopogeny is easily seen to be precisely a proximity. In this way we have an equivalence of categories between and the full subcategory of on the simple, symmetric, syntopogenous spaces.
More generally, an arbitrary simple syntopogeny can be identified with a “quasi-proximity”: a non-symmetric relation satisfying all the other axioms of a proximity (suitably rephrased for the non-symmetric case).
If is a biperfect syntopogenous relation, then we have if and only if there exist and with . Therefore, is completely determined by a binary relation on , which contains the diagonal . Conversely, any binary relation on containing the diagonal defines a biperfect syntopogenous relation.
It follows that biperfect syntopogenies are equivalent to quasi-uniformities, which are like uniformities but lack the symmetry axiom. We have an equivalence of categories between and the full subcategory of on the biperfect syntopogenous spaces, which easily restricts to an equivalence between and the category of symmetric, (bi)perfect topogenous spaces.
A syntopogeny which is both simple and biperfect is determined uniquely by a single relation on which must be both reflexive and transitive, i.e. a preorder. Thus, the intersection inside is equivalent to .
Of course, it follows that a simple, symmetric, (bi)perfect syntopogeny is determined uniquely by a relation on that is reflexive, transitive, and also symmetric – i.e. an equivalence relation. Thus, the intersections , , and inside are all equivalent to the category of setoids (sets equipped with an equivalence relation).
In the preorder of topogenous relations on any set , the following sub-preorders are coreflective:
It follows that in the preorder of syntopogenous structures on , the symmetric, perfect, and biperfect elements are also reflective; the coreflections are obtained by applying the above one to each topogenous relation in turn. Moreover, the simple syntopogenous structures on are also coreflective; the coreflection just takes the intersection of all relations belonging to the filter (this is a directed intersection, hence automatically again a topogenous relation).
Finally, for any function , the preimage function , mapping syntopogenous structures on to those on , preserves all of these coreflections. Therefore, the full subcategories of
syntopogenous spaces are all coreflective in , with coreflections written , , , and respectively.
In general, of course, coreflections into distinct subcategories do not commute or even preserve each other’s subcategories. However, by construction, we see that the coreflections , , and all preserve simplicity. Therefore, the full subcategories of
syntopogenous spaces are all coreflective in , with coreflections , , and respectively. Finally, it is evident by construction that preserves symmetry, so the full subcategories of
syntopogenous spaces are also both coreflective in , with coreflections and respectively.
It is straightforward to verify the following.
When applied to a (quasi-)proximity space or a (quasi-)uniform space, the coreflection into topological spaces computes the underlying topology of these structures, as usually defined.
When applied to a uniform space, the coreflection computes its underlying proximity, as usually defined. The same is true in the non-symmetric case for quasi-uniformities and quasi-proximities.
When applied to any syntopogenous space, the coreflection computes the specialization order of its underlying topology (i.e. its image under ). In particular, this is the case for topological spaces, proximity spaces, and uniform spaces.
Császár speaks of topogenous orders rather than our topogenous relations; there is a one-to-one correspondence between them, defined by if and only if it is not the case that . One could equivalently axiomatize the negation of itself, and so on. Of course, in constructive mathematics these will no longer be equivalent, and one must make a suitable choice.
Note that the containment relation on topogenous orders is reversed from topogenous relations, so that instead of filters we have ideals. Császár also defines a syntopogenous structure to be what we have called a basis for one. As usual, this is convenient for concreteness (especially in the simple case), but has the disadvantage that distinct structures can nevertheless be isomorphic via an identity function, i.e. the forgetful functor to is not amnestic. On this page, we have followed the traditional practice for other topological structures in choosing to make this functor amnestic.