English

The finitary partitions with $n$ non-singleton blocks of a set

Logic 2024-11-12 v2

Abstract

A partition is finitary if all its blocks are finite. For a cardinal a\mathfrak{a} and a natural number nn, let fin(a)\mathrm{fin}(\mathfrak{a}) and Bn(a)\mathscr{B}_{n}(\mathfrak{a}) be the cardinalities of the set of finite subsets and the set of finitary partitions with exactly nn non-singleton blocks of a set which is of cardinality a\mathfrak{a}, respectively. In this paper, we prove in ZF\mathsf{ZF} (without the axiom of choice) that for all infinite cardinals a\mathfrak{a} and all non-zero natural numbers nn, (2Bn(a))0=2Bn(a) (2^{\mathscr{B}_{n}(\mathfrak{a})})^{\aleph_0}=2^{\mathscr{B}_{n}(\mathfrak{a})} and 2fin(a)n=2B2n1(a). 2^{\mathrm{fin}(\mathfrak{a})^n}=2^{\mathscr{B}_{2^n-1}(\mathfrak{a})}. It is also proved consistent with ZF\mathsf{ZF} that there exists an infinite cardinal a\mathfrak{a} such that 2B1(a)<2B2(a)<2B3(a)<<2fin(fin(a)). 2^{\mathscr{B}_{1}(\mathfrak{a})}<2^{\mathscr{B}_{2}(\mathfrak{a})}<2^{\mathscr{B}_{3}(\mathfrak{a})}<\cdots<2^{\mathrm{fin}(\mathrm{fin}(\mathfrak{a}))}.

Keywords

Cite

@article{arxiv.2411.05388,
  title  = {The finitary partitions with $n$ non-singleton blocks of a set},
  author = {Yifan Hu and Guozhen Shen},
  journal= {arXiv preprint arXiv:2411.05388},
  year   = {2024}
}

Comments

8 pages