Constructing \(aD\), non-\(D\)-spaces (Q549144)

The notion of a \(D\)-space introduced by van Douwen in 1977 is as follows: An open neighbourhood assignment (ONA) on a space \((X,\tau)\) is a map \(U: X \to\tau\) such that \(x \in U(x)\) for every \(x \in X\). The space \(X\) is said to be an \(aD\)-space if for every neighbourhood assignment \(U\), one can find a closed discrete \(D \subset X\) such that \(X =\bigcup_{d\in D} U(d) = \bigcup U[D]\). Arhangelskii and Buzyakova introduced in 2002 the notion of \(aD\)-space thus: A space \((X,\tau)\) is said to be \(aD\) if and only if for each closed \(F \subset X\) and for each open cover \(\mathcal I\) of \(X\) there is a closed discrete \(A \subset F\) and \(\phi : A \to\mathcal I\) with \(a\in\phi(a)\) for all \(a\in A\) such that \(F\subset\bigcup\phi[A]\). In this paper, the author introduces a general method to construct 0-dimensional scattered \(T_2\) spaces which are not linearly \(D\) (\((X,\tau)\) is linearly \(D\) if for every ONA \(U : X \to\tau\), for which \(\{U(x) : x \in X\}\) is monotone, that is linearly ordered by inclusion, one can find a closed discrete set \(D\subset X\) such that \(X = \bigcup U[D]\)). Also the construction is used to show that there are \(aD\), non-\(D\) spaces, answering a question of Arhangelskii: this example is achieved by using Shelah's club guessing principles.