No decreasing sequence of cardinals (Q283108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
For sets \(x\) and \(y\), \(x\prec y\) means there is a one-to-one function \(g: x\rightarrow y\), but no one-to-one function \(h: y\rightarrow x\). NDS is the following principle: there is no function \(f\) on \(\omega\) such that \(\forall n\in\omega\; f(n+1)\prec f(n)\). A venerable open question asks: Does NDS imply AC? The authors investigate the set theoretic strength of NDS in set theory without the Axiom of Choice (AC). Two variants of AC appear in this article: \(\mathrm{AC}^{\mathrm{LO}} \) and \(\mathrm{AC}^{\mathrm{WO}}\). The first is the restriction of AC to linearly ordered families of non-empty sets, and the second is the restriction of AC to well-ordered families of non-empty sets. In ZF, AC and \(\mathrm{AC}^{\mathrm{LO}}\) are equivalent, but they are not equivalent in ZFA (Zermelo-Fraenkel set theory with atoms) [\textit{P. E. Howard} and \textit{J. E. Rubin}, Fundam. Math. 97, 111--122 (1977; Zbl 0365.02051)]. Using FM models, one old and one new, the authors show that in ZFA, \(\mathrm{AC}^{\mathrm{LO}} \) does not imply NDS. Thus, it is also the case that \(\mathrm{AC}^{\mathrm{WO}}\) does not imply NDS in ZFA. With the aid of a known symmetric model of ZF, the authors also show that \(\text{AC}^{\text{WO}}\) does not imply NDS in ZF. This particular result leads to the conclusion that ``Every Dedekind finite set is finite'' (DF = F) does not imply NDS. (A theorem of Tarski shows that NDS implies DF = F.) Finally, using the Halpern/Howard permutation model, the authors establish that ``\(\forall m \text{ infinite }\, m+m=m\)'' does not imply NDS in ZFA.
Property / review text: For sets \(x\) and \(y\), \(x\prec y\) means there is a one-to-one function \(g: x\rightarrow y\), but no one-to-one function \(h: y\rightarrow x\). NDS is the following principle: there is no function \(f\) on \(\omega\) such that \(\forall n\in\omega\; f(n+1)\prec f(n)\). A venerable open question asks: Does NDS imply AC? The authors investigate the set theoretic strength of NDS in set theory without the Axiom of Choice (AC). Two variants of AC appear in this article: \(\mathrm{AC}^{\mathrm{LO}} \) and \(\mathrm{AC}^{\mathrm{WO}}\). The first is the restriction of AC to linearly ordered families of non-empty sets, and the second is the restriction of AC to well-ordered families of non-empty sets. In ZF, AC and \(\mathrm{AC}^{\mathrm{LO}}\) are equivalent, but they are not equivalent in ZFA (Zermelo-Fraenkel set theory with atoms) [\textit{P. E. Howard} and \textit{J. E. Rubin}, Fundam. Math. 97, 111--122 (1977; Zbl 0365.02051)]. Using FM models, one old and one new, the authors show that in ZFA, \(\mathrm{AC}^{\mathrm{LO}} \) does not imply NDS. Thus, it is also the case that \(\mathrm{AC}^{\mathrm{WO}}\) does not imply NDS in ZFA. With the aid of a known symmetric model of ZF, the authors also show that \(\text{AC}^{\text{WO}}\) does not imply NDS in ZF. This particular result leads to the conclusion that ``Every Dedekind finite set is finite'' (DF = F) does not imply NDS. (A theorem of Tarski shows that NDS implies DF = F.) Finally, using the Halpern/Howard permutation model, the authors establish that ``\(\forall m \text{ infinite }\, m+m=m\)'' does not imply NDS in ZFA. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: J. M. Plotkin / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03E25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03E35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6580188 / rank
 
Normal rank
Property / zbMATH Keywords
 
axiom of choice
Property / zbMATH Keywords: axiom of choice / rank
 
Normal rank
Property / zbMATH Keywords
 
weak axioms of choice
Property / zbMATH Keywords: weak axioms of choice / rank
 
Normal rank
Property / zbMATH Keywords
 
cardinals
Property / zbMATH Keywords: cardinals / rank
 
Normal rank
Property / zbMATH Keywords
 
decreasing sequence of cardinals
Property / zbMATH Keywords: decreasing sequence of cardinals / rank
 
Normal rank
Property / zbMATH Keywords
 
Dedekind-finite sets
Property / zbMATH Keywords: Dedekind-finite sets / rank
 
Normal rank
Property / zbMATH Keywords
 
Dedekind sets
Property / zbMATH Keywords: Dedekind sets / rank
 
Normal rank
Property / zbMATH Keywords
 
permutation models of ZFA
Property / zbMATH Keywords: permutation models of ZFA / rank
 
Normal rank
Property / zbMATH Keywords
 
symmetric models of ZF
Property / zbMATH Keywords: symmetric models of ZF / rank
 
Normal rank
Property / zbMATH Keywords
 
Jech-Sochor embedding theorems
Property / zbMATH Keywords: Jech-Sochor embedding theorems / rank
 
Normal rank

Revision as of 18:01, 27 June 2023

scientific article
Language Label Description Also known as
English
No decreasing sequence of cardinals
scientific article

    Statements

    No decreasing sequence of cardinals (English)
    0 references
    0 references
    0 references
    13 May 2016
    0 references
    For sets \(x\) and \(y\), \(x\prec y\) means there is a one-to-one function \(g: x\rightarrow y\), but no one-to-one function \(h: y\rightarrow x\). NDS is the following principle: there is no function \(f\) on \(\omega\) such that \(\forall n\in\omega\; f(n+1)\prec f(n)\). A venerable open question asks: Does NDS imply AC? The authors investigate the set theoretic strength of NDS in set theory without the Axiom of Choice (AC). Two variants of AC appear in this article: \(\mathrm{AC}^{\mathrm{LO}} \) and \(\mathrm{AC}^{\mathrm{WO}}\). The first is the restriction of AC to linearly ordered families of non-empty sets, and the second is the restriction of AC to well-ordered families of non-empty sets. In ZF, AC and \(\mathrm{AC}^{\mathrm{LO}}\) are equivalent, but they are not equivalent in ZFA (Zermelo-Fraenkel set theory with atoms) [\textit{P. E. Howard} and \textit{J. E. Rubin}, Fundam. Math. 97, 111--122 (1977; Zbl 0365.02051)]. Using FM models, one old and one new, the authors show that in ZFA, \(\mathrm{AC}^{\mathrm{LO}} \) does not imply NDS. Thus, it is also the case that \(\mathrm{AC}^{\mathrm{WO}}\) does not imply NDS in ZFA. With the aid of a known symmetric model of ZF, the authors also show that \(\text{AC}^{\text{WO}}\) does not imply NDS in ZF. This particular result leads to the conclusion that ``Every Dedekind finite set is finite'' (DF = F) does not imply NDS. (A theorem of Tarski shows that NDS implies DF = F.) Finally, using the Halpern/Howard permutation model, the authors establish that ``\(\forall m \text{ infinite }\, m+m=m\)'' does not imply NDS in ZFA.
    0 references
    0 references
    axiom of choice
    0 references
    weak axioms of choice
    0 references
    cardinals
    0 references
    decreasing sequence of cardinals
    0 references
    Dedekind-finite sets
    0 references
    Dedekind sets
    0 references
    permutation models of ZFA
    0 references
    symmetric models of ZF
    0 references
    Jech-Sochor embedding theorems
    0 references

    Identifiers