Calligraphy Concerning Casually Compiled Cardinal Characteristic Comparisons

The paper establishes several inequalities between cardinal characteristics of the continuum. In particular, it is shown that the partition splitting number is not larger than the uniformity of the meagre ideal; not all sets of reals having the cardinality of an the $\varepsilon$-almost bisecting number are of strong measure zero; no fewer sets of strong measure zero than indicated by the statistically reaping number suffice to cover the reals; the pair-splitting number is not smaller than the evasion number; and the subseries number is neither smaller than the pair-splitting number nor than the minimum of the unbounding number and the unbisecting number. Moreover, a diagram putting these results into context is provided and a brief historical account is given.

💡 Research Summary

The paper investigates several cardinal characteristics of the continuum and establishes a collection of ZFC inequalities that relate them in new ways. After a brief introductory section that explains the general landscape of cardinal invariants—unbounding number b, splitting numbers, the uniformities of the meager and null ideals, strong measure zero sets, evasion numbers, and more—the author presents six main results, each of which is a direct comparison of the size of two invariants.

1. Partition‑splitting number ≤ uniformity of the meager ideal
   The partition‑splitting number pr is defined as the smallest size of a family of partitions of ω such that every infinite set is split by some partition. The uniformity of the meager ideal, non(𝔐), is the smallest size of a non‑meager set. By constructing, for any family witnessing pr, a corresponding family of nowhere‑dense sets that cannot be covered by fewer than pr many meager sets, the author shows that pr ≤ non(𝔐). This inequality is proved entirely within ZFC by a combinatorial argument that exploits the fact that a partition can be turned into a family of dense open sets whose complements are meager.

2. ε‑almost‑bisecting number does not imply strong measure zero
   The ε‑almost‑bisecting number s_{1/2±ε} is the minimal cardinality of a family of subsets of ω each of which ε‑almost bisects every infinite set. Strong measure zero (SMZ) sets are those that can be covered by intervals of arbitrarily small prescribed lengths. The author builds a family of size s_{1/2±ε} whose union fails to be SMZ, thereby demonstrating that the property “has cardinality s_{1/2±ε}’’ is strictly weaker than “is SMZ.’’ The construction uses a diagonalisation against all possible sequences of interval lengths, showing that ε‑almost‑bisecting does not guarantee the uniform covering required for SMZ.

3. Statistically reaping number is a lower bound for the number of SMZ sets needed to cover ℝ
   The statistically reaping number r* is the smallest size of a family that statistically refines every infinite set. The paper proves that any family of SMZ sets covering the reals must have size at least r*. The argument rests on the observation that a statistically reaping family can be turned into a family of “large’’ subsets of ℝ that cannot be simultaneously covered by fewer SMZ sets, because SMZ sets are too thin to capture the statistical density required.

4. Pair‑splitting number ≥ evasion number
   The evasion number e is the smallest size of a family of functions that evades every predictor. The pair‑splitting number s_pair is the smallest size of a family of subsets of