Hindman's theorem and choice (Q2681269)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hindman's theorem and choice
scientific article

    Statements

    Hindman's theorem and choice (English)
    0 references
    7 February 2023
    0 references
    Hindman's theorem states that for every finite colouring of the set of natural numbers there exists an infinite set \(X\) such that all finite sums of distinct elements of \(X\) have the same colour. This theorem is equivalent to the statement: For every finite colouring of \([\omega]^{<\omega}\) there exists an infinite family \(Y\subseteq[\omega]^{<\omega}\) of pairwise disjoint sets such that all unions of finitely many elements of \(Y\) have the same colour. \textit{D. Fernández-Bretón} [Hindman's theorem in the hierarchy of choice principles, \url{arXiv:2203.06156} (2021)] considered generalizations of this statement denoted by \(\boldsymbol{HT}\) and \(\boldsymbol{HT}_n(k)\): \((\boldsymbol{HT})\) For every infinite set \(X\) and for every colouring \(c:[X]^{<\omega}\to 2\) there exists an infinite family \(Y\subseteq[X]^{<\omega}\) of pairwise disjoint sets such that \(\text{FU}(Y)=\{\bigcup F:F\in[Y]^{<\omega}\setminus\{\emptyset\}\}\) is \(c\)-monochromatic. \((\boldsymbol{HT}_n(k))\) For every infinite set \(X\) and for every finite colouring \(c:[X]^{<\omega}\to k\) there exists an infinite set \(Y\subseteq[X]^{<\omega}\) such that the set \(\text{FS}_{\le n}(Y)=\{F_1\triangle\dots\triangle F_t:t\le n\) and \(F_1,\dots,F_n\in Y\}\) is \(c\)-monochromatic. \par In the paper under the review the author continues the research initiated by Fernández-Bretón. He compares the strength of the statements \(\boldsymbol{HT}_n(k)\) and \(\boldsymbol{HT}\) and he finds several characterizations of \(\boldsymbol{HT}\) where one of them states that \(\boldsymbol{HT}\) holds if and only if for every infinite set \(X\), \([X]^{<\omega}\) is Dedekind infinte. In certain permutation models the author decides which of the statements \(\boldsymbol{HT}\), \(\boldsymbol{HT}_2(k)\), \(\boldsymbol{HT}_3(k)\) hold. He shows that there is a model of \(\boldsymbol{ZF}\) in which \(\boldsymbol{HT}\) is true but the axiom of multiple choice for denumerable families of denumerable sets and the axiom of countable choice for non-empty finite sets are both false. This result resolves an open problem of \textit{P. Howard} and \textit{J. E. Rubin} [Consequences of the axiom of choice. Providence, RI: American Mathematical Society (1998; Zbl 0947.03001)].
    0 references
    axiom of choice
    0 references
    weak axioms of choice
    0 references
    Hindman's theorem
    0 references
    Ramsey's theorem
    0 references
    chain/anti-chain principle permutation models for ZFA\(+\neg\) AC
    0 references
    Pincus' transfer theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references