The finitary partitions with n non-singleton blocks of a set
Abstract
A partition is finitary if all its blocks are finite. For a cardinal a and a natural number n, let fin(a) and Bn(a) be the cardinalities of the set of finite subsets and the set of finitary partitions with exactly n non-singleton blocks of a set which is of cardinality a, respectively. In this paper, we prove in ZF (without the axiom of choice) that for all infinite cardinals a and all non-zero natural numbers n, \[ (2Bn(a))0=2Bn(a) \] and \[ 2fin(a)n=2B2n-1(a). \] It is also proved consistent with ZF that there exists an infinite cardinal a such that \[ 2B1(a)<2B2(a)<2B3(a)<·s<2fin(fin(a)). \]
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.