A New Weak Choice Principle

Abstract

For every natural number n we introduce a new weak choice principle nRCfin: Given any infinite set x, there is an infinite subset y⊂eq x and a selection function f that chooses an n-element subset from every finite z⊂eq y containing at least n elements. By constructing new permutation models built on a set of atoms obtained as Fra\"iss\'e limits, we will study the relation of nRCfin to the weak choice principles RCm (that has already been studied by Montenegro, Halbeisen and Tachtsis): Given any infinite set x, there is an infinite subset y⊂eq x with a choice function f on the family of all m-element subsets of y. Moreover, we prove a stronger analogue of Montenegros results when we study the relation between nRCfin and kCfin- which is defined by: Given any infinite family F of finite sets of cardinality greater than k, there is an infinite subfamily A⊂eq F with a selection function f that chooses a k-element subset from each A∈A.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…