On ordering of surjective cardinals (2507.04028v1)
Abstract: Let $\mathrm{Card}$ denote the class of cardinals. For all cardinals $\mathfrak{a}$ and $\mathfrak{b}$, $\mathfrak{a}\leqslant\mathfrak{b}$ means that there is an injection from a set of cardinality $\mathfrak{a}$ into a set of cardinality $\mathfrak{b}$, and $\mathfrak{a}\leqslant\ast\mathfrak{b}$ means that there is a partial surjection from a set of cardinality $\mathfrak{b}$ onto a set of cardinality $\mathfrak{a}$. A doubly ordered set is a triple $\langle P,\preccurlyeq,\preccurlyeq\ast\rangle$ such that $\preccurlyeq$ is a partial ordering on $P$, $\preccurlyeq\ast$ is a preordering on $P$, and ${\preccurlyeq}\subseteq{\preccurlyeq\ast}$. In 1966, Jech proved that for every partially ordered set $\langle P,\preccurlyeq\rangle$, there exists a model of $\mathsf{ZF}$ in which $\langle P,\preccurlyeq\rangle$ can be embedded into $\langle\mathrm{Card},\leqslant\rangle$. We generalize this result by showing that for every doubly ordered set $\langle P,\preccurlyeq,\preccurlyeq\ast\rangle$, there exists a model of $\mathsf{ZF}$ in which $\langle P,\preccurlyeq,\preccurlyeq\ast\rangle$ can be embedded into $\langle\mathrm{Card},\leqslant,\leqslant\ast\rangle$.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.