Strong failures of higher analogs of Hindman's theorem
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: R→ Q, such that for every X⊂eq R with |X|=| R|, and every colour γ∈ Q, there are two distinct elements x0,x1 of X for which c(x0+x1)=γ. 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:G→ Q such that for every uncountable X⊂eq G, and every colour γ, for some large enough integer n, there are pairwise distinct elements x0,…,xn of X such that c(x0+·s+xn)=γ. In addition, it is consistent that the preceding statement remains valid even after enlarging the set of colours from Q to R. Theorem 3: Let assert that for every Abelian group G of cardinality , there exists a colouring c:G→ G such that for every positive integer n, every X0,…,Xn ∈[G], and every γ∈ G, there are x0∈ X0,…, xn∈ Xn such that c(x0+·s+xn)=γ. Then holds for unboundedly many uncountable cardinals , and it is consistent that holds for all regular uncountable cardinals .
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.