{"title":"CANTOR’S THEOREM MAY FAIL FOR FINITARY PARTITIONS","authors":"GUOZHEN SHEN","doi":"10.1017/jsl.2024.24","DOIUrl":null,"url":null,"abstract":"<p>A partition is finitary if all its members are finite. For a set <span>A</span>, <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline1.png\"><span data-mathjax-type=\"texmath\"><span>$\\mathscr {B}(A)$</span></span></img></span></span> denotes the set of all finitary partitions of <span>A</span>. It is shown consistent with <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline2.png\"><span data-mathjax-type=\"texmath\"><span>$\\mathsf {ZF}$</span></span></img></span></span> (without the axiom of choice) that there exist an infinite set <span>A</span> and a surjection from <span>A</span> onto <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline3.png\"><span data-mathjax-type=\"texmath\"><span>$\\mathscr {B}(A)$</span></span></img></span></span>. On the other hand, we prove in <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline4.png\"><span data-mathjax-type=\"texmath\"><span>$\\mathsf {ZF}$</span></span></img></span></span> some theorems concerning <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline5.png\"><span data-mathjax-type=\"texmath\"><span>$\\mathscr {B}(A)$</span></span></img></span></span> for infinite sets <span>A</span>, among which are the following: </p><ol><li><p><span>(1)</span> If there is a finitary partition of <span>A</span> without singleton blocks, then there are no surjections from <span>A</span> onto <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline6.png\"><span data-mathjax-type=\"texmath\"><span>$\\mathscr {B}(A)$</span></span></img></span></span> and no finite-to-one functions from <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline7.png\"><span data-mathjax-type=\"texmath\"><span>$\\mathscr {B}(A)$</span></span></img></span></span> to <span>A</span>.</p></li><li><p><span>(2)</span> For all <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline8.png\"><span data-mathjax-type=\"texmath\"><span>$n\\in \\omega $</span></span></img></span></span>, <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline9.png\"><span data-mathjax-type=\"texmath\"><span>$|A^n|<|\\mathscr {B}(A)|$</span></span></img></span></span>.</p></li><li><p><span>(3)</span> <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline10.png\"><span data-mathjax-type=\"texmath\"><span>$|\\mathscr {B}(A)|\\neq |\\mathrm {seq}(A)|$</span></span></img></span></span>, where <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240420072412745-0886:S0022481224000240:S0022481224000240_inline11.png\"/><span data-mathjax-type=\"texmath\"><span>$\\mathrm {seq}(A)$</span></span></span></span> is the set of all finite sequences of elements of <span>A</span>.</p></li></ol><p></p>","PeriodicalId":501300,"journal":{"name":"The Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Journal of Symbolic Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/jsl.2024.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A partition is finitary if all its members are finite. For a set A, $\mathscr {B}(A)$ denotes the set of all finitary partitions of A. It is shown consistent with $\mathsf {ZF}$ (without the axiom of choice) that there exist an infinite set A and a surjection from A onto $\mathscr {B}(A)$. On the other hand, we prove in $\mathsf {ZF}$ some theorems concerning $\mathscr {B}(A)$ for infinite sets A, among which are the following:
(1) If there is a finitary partition of A without singleton blocks, then there are no surjections from A onto $\mathscr {B}(A)$ and no finite-to-one functions from $\mathscr {B}(A)$ to A.
(2) For all $n\in \omega $, $|A^n|<|\mathscr {B}(A)|$.
(3)$|\mathscr {B}(A)|\neq |\mathrm {seq}(A)|$, where $\mathrm {seq}(A)$ is the set of all finite sequences of elements of A.