On base dimension-like functions of the type ind (Q386875)

Base dimension-like functions b\(^V\)-Ind, b-Ind, b\(^{\diamond}\)-Ind were introduced in the book \textit{S. D. Iliadis} [Universal Spaces and Mappings, Noth-Holland Mathematics Studies, vol. 198, Elsevier (2005; Zbl 1072.54001)] as follows. Let \(X\) be a topological space, \(B\) a base for \(X\), \(B^V\) the family of finite unions of \(B\) and \(B^\diamond\) the smallest family of subsets of \(X\) which contains \(B\) and which is closed under finite unions and finite intersections. A pair \((K,V)\) of subsets of \(X\) is called \(B^V\)-proper (resp. \(B\)-proper or \(B^\diamond\)-proper) if \(K\) is the closure of an element of \(B^V\) (resp. \(B\) or \(B^\diamond\)), \(V \in B^V\) (resp. \(B\) or \(B^\diamond\)) and \(K \subseteq V.\) Thus b\(^V\)-Ind is a function defined on the class of all pairs \((B, X)\) and having as a range the union \(\mathcal O \cup \{-1, \infty\}\), where \(\mathcal O\) is the class of all ordinals. Moreover, (i) b\(^V\)-Ind\((B, X) = -1\) iff \(X = \emptyset\), and (ii) b\(^V\)-Ind\((B, X) \leq \alpha,\) where \(\alpha \in \mathcal O\), iff for every \(B^V\)-proper pair \((K,V)\) of subsets of \(X\) there exists an open subset \(W\) of \(X\) such that \(K \subseteq W \subseteq V\) and b\(^V\)-Ind\((\)\{Bd\(_X(W) \cap U : U \in B\}, \)Bd\(_X (W)) < \alpha\). Similarly, the functions b-Ind or b\(^{\diamond}\)-Ind are defined. In the present paper the authors discuss the relationship between the functions b\(^V\)-Ind, b-Ind, b\(^{\diamond}\)-Ind and the classical large inductive dimension Ind. In particular, (a) for a space \(X\) and a base \(B\) on \(X\) we have b-Ind\((B, X) \leq \)b\(^V\)-Ind\((B, X) \leq \)b\(^\diamond\)-Ind\((B, X) = \)b-Ind\((B^\diamond, X) \leq \) Ind\(X\), and (b) there exist pairs \((B_1, X_1)\) and \((B_2, X_2)\) such that b-Ind\((B_1, X_1) < \)b\(^V\)-Ind\((B_1, X_1)\) and b\(^\diamond\)-Ind\((B_2, X_2) < \)Ind\(X_2\). Then they prove for the functions several subspace theorems, sum theorems and pose questions.