Table of Contents
Fetching ...

Adding the constant evasion and constant prediction numbers to Cichoń's maximum

Miguel A. Cardona, Miroslav Repický, Saharon Shelah

TL;DR

This work shows that the constant evasion number $\mathfrak{e}_2^{\mathrm{const}}$ and the constant prediction number $\mathfrak{v}_2^{\mathrm{const}}$ can be added to Cichoń's maximum with distinct values. It develops a robust forcing framework based on relational systems, Tukey connections, UF-limits, and simple matrix iterations, together with the new $\Pr^2_{\bar{n}^*}(\lambda)$ property to keep $\mathrm{add}(\mathcal{N})$ small in extensions. Through intricate FS and matrix-iteration constructions, the authors realize constellations that separate the right-hand side of Cichoń's diagram and then extend the maximum to incorporate $\mathfrak{e}^{\mathrm{const}}_2$ and $\mathfrak{v}^{\mathrm{const}}_2$, using elementary submodel arguments to control the forcing impact. The results provide both left- and right-hand side separations with these constants and raise several open questions about further refinements and consistency, highlighting the versatility of UF-limits and goodness notions in complex cardinal-characteristic forcing.

Abstract

Let $\mathfrak{e}^\mathsf{const}_2$ be the constant evasion number, that is, the size of the least family $F\subseteq{}^ω2$ of reals such that for each predictor $π\colon {}^{<ω}2\to 2$ there is $x\in F$ which is not constantly predicted by $π$; and let $\mathfrak{v}_2^\mathsf{const}$ be the constant prediction number, that is, the size of the least family $Π_2$ of functions $π\colon {}^{<ω}2\to 2$ such that for each $x\in{}^ω2$ there is $π\inΠ_2$ that predicts constantly $x$. In this work, we show that the constant evasion number $\mathfrak{e}_2^{\mathrm{cons}}$ and the constant prediction number $\mathfrak{v}_2^\mathsf{const}$ can be added to Cichoń's maximum with distinct values.

Adding the constant evasion and constant prediction numbers to Cichoń's maximum

TL;DR

This work shows that the constant evasion number and the constant prediction number can be added to Cichoń's maximum with distinct values. It develops a robust forcing framework based on relational systems, Tukey connections, UF-limits, and simple matrix iterations, together with the new property to keep small in extensions. Through intricate FS and matrix-iteration constructions, the authors realize constellations that separate the right-hand side of Cichoń's diagram and then extend the maximum to incorporate and , using elementary submodel arguments to control the forcing impact. The results provide both left- and right-hand side separations with these constants and raise several open questions about further refinements and consistency, highlighting the versatility of UF-limits and goodness notions in complex cardinal-characteristic forcing.

Abstract

Let be the constant evasion number, that is, the size of the least family of reals such that for each predictor there is which is not constantly predicted by ; and let be the constant prediction number, that is, the size of the least family of functions such that for each there is that predicts constantly . In this work, we show that the constant evasion number and the constant prediction number can be added to Cichoń's maximum with distinct values.

Paper Structure

This paper contains 12 sections, 36 theorems, 44 equations, 6 figures.

Key Result

Theorem 1

Let $\lambda = \lambda^{\aleph_0}$ be a cardinal and, for $1\leq i\leq 5$, let $\lambda^\mathfrak{b}_i$ and $\lambda^\mathfrak{d}_i$ be uncountable regular cardinals such that $\lambda^\mathfrak{b}_i\leq \lambda^\mathfrak{b}_j\leq \lambda^\mathfrak{d}_j\leq \lambda^\mathfrak{d}_i\leq\lambda$ for any

Figures (6)

  • Figure 1: Including $\mathfrak{e}^{\mathsf{const}}_2$ and $\mathfrak{v}^{\mathsf{const}}_2$ to Cichoń's diagram.
  • Figure 2: Constellation forced in \ref{['Thm:a0']}
  • Figure 3: Constellation forced in \ref{['Thm:a1']}
  • Figure 4: Constellation forced in \ref{['Thm:a2']}
  • Figure 5: A simple matrix iteration
  • ...and 1 more figures

Theorems & Definitions (64)

  • Conjecture 1.1: Kada, Kaunp
  • Theorem 1
  • Theorem 2
  • Theorem 3
  • Theorem 4: \ref{['Thm:addN']}
  • Definition 2.1
  • Definition 2.2
  • Example 2.3
  • Definition 2.5
  • Lemma 2.6: CM22
  • ...and 54 more