Pinning Down versus Density
Istv\'an Juh\'asz, Lajos Soukup, Zolt\'an Szentmikl\'ossy

TL;DR
This paper investigates the relationships between the pinning down number, density, and dispersion character of topological spaces, establishing equivalences under set-theoretic assumptions and proving bounds for various classes of spaces.
Contribution
It provides new characterizations of when the pinning down number equals the density, answers open questions, and explores the set-theoretic consistency of certain inequalities.
Findings
${d}(X)={pd}(X)$ for all Hausdorff spaces under certain set-theoretic conditions
Locally compact Hausdorff spaces satisfy ${d}(X)={pd}(X)$
Bounds on the size and dispersion character of spaces with ${pd}(X)<{d}(X)$
Abstract
The pinning down number of a topological space is the smallest cardinal such that for any neighborhood assignment there is a set with for all . Clearly, c. Here we prove that the following statements are equivalent: (1) for each cardinal ; (2) for each Hausdorff space ; (3) for each 0-dimensional Hausdorff space . This answers two questions of Banakh and Ravsky. The dispersion character of a space is the smallest cardinality of a non-empty open subset of . We also show that if then has an open subspace with and , moreover the following three statements are equiconsistent: (i) There is a singular cardinal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
