Comparison of countability conditions within three fundamental classifications of convergences (Q2182481)

The paper focuses on three types of classification for convergences introduced by S. Dolecki in the past according to: 1. The number of filters that determine convergence at each point, leading to so-called paving numbers \(\mathsf{p}\) and pseudopaving numbers \(\mathsf{pp}\), respectively such that pretopologies are exactly the convergences for which \(\mathsf{p}=\mathsf{pp}=1\). 2. The number of filters whose intersections converge, and the author focuses on countably deep convergences, and those countably deep for ultrafilters, that is, if \[ \lim\bigcap_{\mathcal{F}\in\mathbb{D}}\mathcal{F}=\bigcap_{\mathcal{F}\in\mathbb{D}}\lim \mathcal{F} \] holds for every countable set \(\mathbb D\) of ultrafilters. Here, a convergence on a set \(X\) is a relation between filters on \(X\) and points of \(X\) denoted by \(x \in\lim \mathcal{F}\) whenever \(x\) and \(\mathcal{F}\) are related, subject to the following two conditions, i.e. \(\text{(cv1) }x \in\lim\{A \subset X : x \in A\}\) for every point \(x \in X\); \(\text{(cv2) } \mathcal{F} \subset \mathcal{G}\) implies \(\lim \mathcal{F} \subset \lim \mathcal{G}\) for every pair of filters \(\mathcal{F}\) and \(\mathcal{G}\) on \(X\). 3. Classes of filters whose adherence determine convergence. It is remarkable to note that the formula \(\lim \mathcal{G} =\bigcap\{\mathrm{adh} \mathcal{D}: \mathcal{D} \in \mathbb{D}, \mathcal{D} \# \mathcal{G}\}\), where \(\mathcal{D}\# \mathcal{G}\) means that the intersection of all prevailing elements of \(\mathcal{G}\) respectively \(\mathcal{D}\) are not empty, \(\mathbb{D}\) denotes a class of filters and \(\mathrm{adh} \mathcal{D} = \bigcup \{\lim \mathcal{F}: \mathcal{D} \subset \mathcal{F}\}\) characterizes several important classes of convergences. Especially, the fundamental classes of pretopologies and pseudotopologies correspond to the classes of principal filters and of all filters, respectively. The intermediate classes of countably based filters and of filters closed under countable intersections define the classes of paratopologies and hypotopologies, respectively. The main goal of this treatise is to study those relationships which are raising up between these three branches of classification. Furthermore an important aspect is that many results and examples are obtained using usual topological characterizations of the non-topological notions at hand in spaces of ultrafilters with their usual topology. Then the author gives a sample of the results studying the three branches of classification as follows: Theorem: A convergence is a pretopology iff it is a countable deep paratopology. This applies to hypotopologies since every hypotopology is countably deep. On the other hand every countably pseudopaved pseudotopology is a paratopology. Close to the latter a diagram shows the main classes of convergences considered, with pretopologies as their intersection, and examples distinguishing these classes being named as follows: pseudotopologies, paratopologies, pretopologies, hypotopologies, countably deep convergences, countably deep for ultrafilters, countably deep pseudotopologies, pseudotopologies countably deep for ultrafilters. The part of paper entitled ``Preliminaries'' gives an overview about set-theoretic conventions and spaces of ultrafilters. Then convergences, filter compactness and cover compactness follow at once. The third part deals with the term ``countable depth'', so that especially paratopologies that are countably deep for ultrafilters are exactly pretopologies. On the other hand a pseudo-topology that is countably deep for ultrafilters must not necessarily be countably deep, which is shown by an example. In Section 4 the author studies representations of convergence notions in the Stone topology. In this context he characterizes various pointwise properties of pseudotopologies in terms of topological features with respect to the Stone topology, where several terms of compactness come into play. In Section 5 the author introduces and studies paving and pseudopaving numbers based on a certain cardinality of a pavement or pseudopavement, respectively. Since in a convergence the filter \(\{ A \subset X: x \in A\}\) always converges to \(x\), the paving and pseudopaving numbers are always at least 1, and pretopologies are exactly the 1-paved convergences, equivalently, the 1-pseudopaved convergences. The last part of this treatment deals with hypotopologies, and it is shown that every hypotopology is countably deep. But an example shows that a countably deep pseudotopology must not be a hypotopology.