Pinning down versus density (Q501845)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pinning down versus density |
scientific article |
Statements
Pinning down versus density (English)
0 references
10 January 2017
0 references
\textit{T. Banakh} and \textit{A. Ravsky} [Topology Appl. 201, 181--205 (2016; Zbl 1338.54032)] introduced the foredensity of a topological space \((X,\tau)\) as the smallest cardinal \(\kappa\) such that for any neighbourhood assignment \(U:X\to\tau\) there is \(A\subset X\) of cardinality at most \(\kappa\) with \(A\cap U(x)\not=\varnothing\) for all \(x\). In the present paper this is renamed the pinning down number and denoted by pd\((X)\). It is shown that pd\((X)=\text{d}(X)\) for each (0-dimensional) Hausdorff space \(X\) if and only if \(2^\kappa<\kappa^{+\omega}\) for each cardinal \(\kappa\). It is shown that pd\((X)=\text{d}(X)\) for any locally compact Hausdorff space. Equiconsistency between Shelah's Strong Hypothesis and conditions involving pd\((X)<\text{d}(X)\) are also exhibited.
0 references
foredensity
0 references
pinning down number
0 references
neighbourhood assignment
0 references
density
0 references
dispersion character
0 references
Shelah's Strong Hypothesis
0 references