Strong failures of higher analogs of Hindman's theorem

DOI10.1090/TRAN/7131zbMATH Open1423.03161arXiv1608.01512OpenAlexW3106404031MaRDI QIDQ5367106FDOQ5367106

Authors: David J. Fernández-Bretón, Assaf Rinot 

Publication date: 12 October 2017

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:mathbbRightarrowmathbbQ$, such that for every $XsubseteqmathbbR$ with $|X|=|mathbbR|$, and every colour $gammainmathbbQ$, there are two distinct elements $x_0,x_1$ of $X$ for which $c(x_0+x_1)=gamma$. This forms a simultaneous generalization of a theorem of Hindman, Leader and Strauss and a theorem of Galvin and Shelah. Theorem 2: For every Abelian group $G$, there exists a colouring $c:GightarrowmathbbQ$ such that for every uncountable $XsubseteqG$, and every colour $gamma$, for some large enough integer $n$, there are pairwise distinct elements $x_0,ldots,x_n$ of $X$ such that $c(x_0+cdots+x_n)=gamma$. In addition, it is consistent that the preceding statement remains valid even after enlarging the set of colours from $mathbbQ$ to $mathbbR$. Theorem 3: Let $circledas{t}_{k}appa$ assert that for every Abelian group $G$ of cardinality $kappa$, there exists a colouring $c:GightarrowG$ such that for every positive integer $n$, every $X_0,ldots,X_{n}in[G{]}^{k}appa$, and every $gammainG$, there are $x_{0}in{X}_0,ldots,x_{n}in{X}_n$ such that $c(x_0+cdots+x_n)=gamma$. Then $circledas{t}_{k}appa$ holds for unboundedly many uncountable cardinals $kappa$, and it is consistent that $circledas{t}_{k}appa$ holds for all regular uncountable cardinals $kappa$.

Full work available at URL: https://arxiv.org/abs/1608.01512

Recommendations

• A note on Hindman-type theorems for uncountable cardinals
• Hindman-like theorems with uncountably many colours and finite monochromatic sets
• Hindman's theorem is only a countable phenomenon
• Pairwise sums in colourings of the reals
• A simple proof and some difficult examples for Hindman's theorem

zbMATH Keywords

Hindman's theoremcommutative cancellative semigroupsstrong coloringJónsson cardinal

Mathematics Subject Classification ID

Partition relations (03E02) Consistency and independence results (03E35) Commutative semigroups (20M14) Applications of set theory (03E75)

Cites Work

• Finite sums from sequences within cells of a partition of N
• Set Theory
• Title not available (Why is that?)
• The fine structure of the constructible hierarchy
• Chain conditions of products, and weakly compact cardinals
• On Strongly Summable Ultrafilters and Union Ultrafilters
• Title not available (Why is that?)
• Consistency of the Continuum Hypothesis. (AM-3)
• Algebra in the Stone-Čech compactification. Theory and applications
• Partitioning pairs of countable ordinals
• Partition Problems in Topology
• The higher infinite. Large cardinals in set theory from their beginnings.
• A topological reflection principle equivalent to Shelah’s strong hypothesis
• Combinatorial set theory: Partition relations for cardinals
• Was Sierpinski right? I
• A solution to the L space problem
• Some counterexamples in the partition calculus
• Title not available (Why is that?)
• Chain conditions and products
• Transforming rectangles into squares, with applications to strong colorings
• Title not available (Why is that?)
• Getting more colors. II
• Complicated colorings
• The generalized continuum hypothesis can fail everywhere
• Some strong axioms of infinity incompatible with the axiom of constructibility
• A certain 2-coloring of the reals
• Narrow Boolean algebras
• Square bracket partition relations in L
• Weak Partition Relations
• Pairwise sums in colourings of the reals

Cited In (17)

• Monochromatic sumset without large cardinals
• Algebra, selections, and additive Ramsey theory
• Hindman's theorem is only a countable phenomenon
• Is there a symmetric version of Hindman's theorem?
• A weak variant of Hindman's theorem stronger than Hilbert's theorem
• Knaster and friends. I: Closed colorings and precalibers
• A Ramsey statement for infinite groups
• Infinite monochromatic sumsets for colourings of the reals
• Hindman's theorem and choice
• Hindman's coloring theorem in arbitrary semigroups
• Transformations of the transfinite plane
• Sums of triples in Abelian groups
• The Adjacent Hindman’s Theorem for uncountable groups
• Borel combinatorics fail in HYP
• A note on Hindman-type theorems for uncountable cardinals
• Pairwise sums in colourings of the reals
• Hindman-like theorems with uncountably many colours and finite monochromatic sets

This page was built for publication: Strong failures of higher analogs of Hindman's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367106)