Partition genericity and pigeonhole basis theorems

Abstract

There exist two notions of typicality in computability theory, namely, genericity and randomness. In this article, we introduce a new notion of genericity, called partition genericity, which is at the intersection of these two notions of typicality, and show that many basis theorems apply to partition genericity. More precisely, we prove that every co-hyperimmune set and every Kurtz random is partition generic, and that every partition generic set admits weak infinite subsets. In particular, we answer a question of Kjos-Hanssen and Liu by showing that every Kurtz random admits an infinite subset which does not compute any set of positive Hausdorff dimension. Partition genericty is a partition regular notion, so these results imply many existing pigeonhole basis theorems.

arXiv comment23 pages

References in corpus (7)

• Kolmogorov complexity and the Recursion Theorem
• The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
• Infinite subsets of random sets of integers
• The Definability Strength of Combinatorial Principles
• The weakness of the pigeonhole principle under hyperarithmetical reductions
• A strong law of computationally weak subsets
• A variant of Mathias forcing that preserves ${\mathsf{ACA}}_0$