On the existence of permutations of infinite sets without fixed points in set theory without choice (Q2416465): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:05, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the existence of permutations of infinite sets without fixed points in set theory without choice |
scientific article |
Statements
On the existence of permutations of infinite sets without fixed points in set theory without choice (English)
0 references
23 May 2019
0 references
The author investigates the following two assertions: (EPWFP) For every infinite set $X$, there exists a permutation of $X$ without fixed points and (ISAE) For every infinite set $X$, there exists a permutation $f$ of $X$ without fixed points such that $f^2=id_X$. Both are theorems of ZFC. The goal is to determine their deductive strength in set theory without the axiom of choice (ZF). \par He establishes that ISAE and EPWFP are not provable in ZF and are strictly weaker than AC in ZF. This is achieved by showing that $\forall$ \textit{infinite} $\mathfrak{m}$ ($\mathfrak{m}=2\mathfrak{m}$) implies ISAE, which (clearly) implies EPWFP, which in turn implies There are no strictly amorphous sets. \par This is part of the paper's program to determine which weak forms of choice imply EPWFP and which weak forms of choice are implied by EPWFP and in addition which forms of choice do not imply EPWFP and which forms of choice are not implied by by EPWFP. A full listing of all the results in this vein is not possible in a brief review. However, they lead the author to conclude that ``EPWFP and ISAE are strong axioms''. \par The author shows that EPWFP is false in the basic Fraenkel model, the Mostowski linearly ordered model and in the basic Cohen model. This last result shows that BPI + The union of countably many countable sets is countable does not imply EPWFP in ZF. \par Another main result of this paper is that EPWFP is strictly weaker than ISAE in ZFA. However, the existence of a model of ZF in which EPWFP is true while ISAE is false is number one in the list of ten open problems with which the paper ends. \par The relative strength of ISAE is investigated in detail and the author settles several open problems that appeared in [\textit{H. Herrlich} and the author, Commentat. Math. Univ. Carol. 47, No. 4, 707--717 (2006; Zbl 1150.03017)] and in [\textit{N. Sonpanow} and \textit{P. Vejjajiva}, Bull. Aust. Math. Soc. 95, No. 2, 177--182 (2017; Zbl 1423.03181)].
0 references
axiom of choice
0 references
ZFC
0 references
ZF
0 references
ZFA
0 references
permutations
0 references
weak axioms of choice
0 references