String Dimension: VC Dimension for Infinite Shattering

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Ryan-Smith, Calliope
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911785691381760
author Ryan-Smith, Calliope
author_facet Ryan-Smith, Calliope
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2402_18250
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle String Dimension: VC Dimension for Infinite Shattering
Ryan-Smith, Calliope
Logic
03E17, 03E35 (Primary) 03C45, 03C48, 03C55, 05D05 (Secondary)
G.2.1
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.
title String Dimension: VC Dimension for Infinite Shattering
topic Logic
03E17, 03E35 (Primary) 03C45, 03C48, 03C55, 05D05 (Secondary)
G.2.1
url https://arxiv.org/abs/2402.18250