String Dimension: VC Dimension for Infinite Shattering

Abstract

In computer science, combinatorics, and model theory, the VC dimension is a central notion underlying far-reaching topics such as error rate for decision rules, combinatorial measurements of classes of finite structures, and neo-stability theory. In all cases, it measures the capacity for a collection of sets $\mathcal{F}\subseteq\mathscr{P}(X)$ to shatter subsets of $X$. The VC dimension of this class then takes values in $\mathbb{N}\cup\{\infty\}$. We extend this notion to an infinitary framework and use this to generate ideals on $2^κ$ of families of bounded shattering. We explore the cardinals characteristics of ideals generated by this generalised VC dimension, dubbed string dimension, and present various consistency results. We also introduce the finality of forcing iteration. A $κ$-final iteration is one for which any sequences of ground model elements of length less than $κ$ in the final model must have been introduced at an intermediate stage. This technique is often used for, say, controlling sets of real numbers when manipulating values of cardinal characteristics, and is often exhibited as a consequence of a chain condition. We demonstrate a precise characterisation of such notions of forcing as a generalisation of distributivity.