The Setting
For a set and , is the set of -element subsets of . Let be a set, a set of colors, and for each let be a coloring of by . If is finite and each with takes a single value on , these values form a sequence of colors indexed by the arities , and sets of different sizes may give different sequences. The question is whether, for large compared with , one sequence of colors serves every size at once: for each , a -element set on which takes the value on all of , for every .
Patterns and Their Prefixes
A coloring of by is constant with value on a subset of when for every .✦
A pattern is a sequence of colors in , and its prefix of length is . A subset of realizes the prefix of length of a pattern when is constant with value on for every .✦ For a cardinal , the prefix of length of a pattern is unbounded below when, for every cardinal , some subset of of cardinality at least realizes it.✦
The Claim
Theorem 1. Let be a strong limit cardinal and an infinite cardinal with and . Let be a set with , a set of at most colors, and , for each , a coloring of by .
(a) There is a pattern such that every has a -element subset of with (1)✦
(b) If the prefix of length of a pattern is unbounded below , there is a color such that the prefix of length of the pattern (2)✦ is unbounded below .
In the paper, the result reads: if and with , there are colors such that for every some has for all and .
What Is Checked
The claims (1) and (2) are stated over a strong limit cardinal , an infinite cardinal below and below its cofinality, a set of cardinality at least , colorings of by a set of at most colors, and two notions on the prefixes of patterns: realized by a subset of , and unbounded below .