Strong colorings over partitions

Abstract

A strong coloring on a cardinal is a function f:[]2 such that for every A⊂eq of full size , every color γ< is attained by f[A]2. The symbol []2 asserts the existence of a strong coloring on . We introduce the symbol p[]2 which asserts the existence of a coloring f:[]2 which is strong over a partition p:[]2θ. A coloring f is strong over p if for every A∈ [] there is i<θ so that every color γ< is attained by f ([A]2 p-1(i)). We prove that whenever []2 holds, also p[]2 holds for an arbitrary finite partition p. Similarly, arbitrary finite p-s can be added to stronger symbols which hold in any model of ZFC. If θ=, then p[]2 and stronger symbols, like Pr1(,,,) or Pr0(,,,0), hold also for an arbitrary partition p to θ parts.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…