A+ CATEGORY SCIENTIFIC UNIT

PDF files of articles are only available for institutions which have paid for the online version upon signing an Institutional User License.

Covering versus partitioning with Polish spaces

Volume 260 / 2023

Will Brian Fundamenta Mathematicae 260 (2023), 21-39 MSC: Primary 54E35; Secondary 03E05, 03E55. DOI: 10.4064/fm28-5-2022 Published online: 22 August 2022

Abstract

Given a completely metrizable space $X$, let $\mathfrak {par}(X)$ denote the smallest possible size of a partition of $X$ into Polish spaces, and $\mathfrak {cov}(X)$ the smallest possible size of a covering of $X$ with Polish spaces. Observe that $\mathfrak {cov}(X) \leq \mathfrak {par}(X)$ for every $X$, because every partition of $X$ is also a covering.

We prove it is consistent relative to a huge cardinal that the strict inequality $\mathfrak {cov}(X) \lt \mathfrak {par}(X)$ can hold for some completely metrizable space $X$. We also prove that using large cardinals is necessary for obtaining this strict inequality, because if $\mathfrak {cov}(X) \lt \mathfrak {par}(X)$ for any completely metrizable $X$, then $0^\dagger $ exists.

Authors

  • Will BrianDepartment of Mathematics and Statistics
    University of North Carolina at Charlotte
    9201 University City Blvd.
    Charlotte, NC 28223, USA
    wrbrian.wordpress.com
    e-mail

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image