The finitary partitions with $n$ non-singleton blocks of a set
Yifan Hu, Guozhen Shen

TL;DR
This paper investigates the cardinalities of finitary partitions with a fixed number of non-singleton blocks, proving results in ZF set theory and exploring their consistency with the absence of the axiom of choice.
Contribution
It establishes cardinality equalities for finitary partitions in ZF and demonstrates the consistency of certain inequalities among these cardinalities.
Findings
Proves in ZF that (2^{B_n(a)})^{aleph_0} = 2^{B_n(a)} for infinite a and n.
Shows that 2^{fin(a)^n} = 2^{B_{2^n-1}(a)}.
Establishes the consistency of a strict increasing sequence of cardinalities involving B_n(a).
Abstract
A partition is finitary if all its blocks are finite. For a cardinal and a natural number , let and be the cardinalities of the set of finite subsets and the set of finitary partitions with exactly non-singleton blocks of a set which is of cardinality , respectively. In this paper, we prove in (without the axiom of choice) that for all infinite cardinals and all non-zero natural numbers , \[ (2^{\mathscr{B}_{n}(\mathfrak{a})})^{\aleph_0}=2^{\mathscr{B}_{n}(\mathfrak{a})} \] and \[ 2^{\mathrm{fin}(\mathfrak{a})^n}=2^{\mathscr{B}_{2^n-1}(\mathfrak{a})}. \] It is also proved consistent with that there exists an infinite cardinal such that \[…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFunctional Equations Stability Results · Advanced Mathematical Identities
