Partition regularity

Updated on Sep 25, 2024

Edit

Comment

In combinatorics, a branch of mathematics, partition regularity is one notion of largeness for a collection of sets.

Given a set X , a collection of subsets S ⊂ P ( X ) is called partition regular if every set A in the collection has the property that, no matter how A is partitioned into finitely many subsets, at least one of the subsets will also belong to the collection. That is, for any A ∈ S , and any finite partition A = C 1 ∪ C 2 ∪ ⋯ ∪ C n , there exists an i ≤ n, such that C i belongs to S . Ramsey theory is sometimes characterized as the study of which collections S are partition regular.

Examples

the collection of all infinite subsets of an infinite set X is a prototypical example. In this case partition regularity asserts that every finite partition of an infinite set has an infinite cell (i.e. the infinite pigeonhole principle.)

sets with positive upper density in N : the upper density d ¯ ( A ) of A ⊂ N is defined as d ¯ ( A ) = lim sup n → ∞ | { 1 , 2 , … , n } ∩ A | n .

For any ultrafilter U on a set X , U is partition regular. If U ∋ A = ⋃ 1 n C i , then for exactly one i is C i ∈ U .

sets of recurrence: a set R of integers is called a set of recurrence if for any measure preserving transformation T of the probability space (Ω, β, μ) and A ∈ β of positive measure there is a nonzero n ∈ R so that μ ( A ∩ T n A ) > 0 .

Call a subset of natural numbers a.p.-rich if it contains arbitrarily long arithmetic progressions. Then the collection of a.p.-rich subsets is partition regular (Van der Waerden, 1927).

Let [ A ] n be the set of all n-subsets of A ⊂ N . Let S n = ⋃ A ⊂ N [ A ] n . For each n, S n is partition regular. (Ramsey, 1930).

For each infinite cardinal κ , the collection of stationary sets of κ is partition regular. More is true: if S is stationary and S = ⋃ α < λ S α for some λ < κ , then some S α is stationary.

the collection of Δ -sets: A ⊂ N is a Δ -set if A contains the set of differences { s m − s n : m , n ∈ N , n < m } for some sequence ⟨ s n ⟩ n = 1 ω .

the set of barriers on N : call a collection B of finite subsets of N a barrier if:

∀ X , Y ∈ B , X ⊄ Y and

for all infinite I ⊂ ∪ B , there is some X ∈ B such that the elements of X are the smallest elements of I; i.e. X ⊂ I and ∀ i ∈ I ∖ X , ∀ x ∈ X , x < i .

This generalizes Ramsey's theorem, as each [ A ] n is a barrier. (Nash-Williams, 1965)

finite products of infinite trees (Halpern–Läuchli, 1966)

piecewise syndetic sets (Brown, 1968)

Call a subset of natural numbers i.p.-rich if it contains arbitrarily large finite sets together with all their finite sums. Then the collection of i.p.-rich subsets is partition regular (Folkman–Rado–Sanders, 1968).

(m, p, c)-sets (Deuber, 1973)

IP sets (Hindman, 1974, see also Hindman, Strauss, 1998)

MT^k sets for each k, i.e. k-tuples of finite sums (Milliken–Taylor, 1975)

central sets; i.e. the members of any minimal idempotent in β N , the Stone–Čech compactification of the integers. (Furstenberg, 1981, see also Hindman, Strauss, 1998)

References

Partition regularity Wikipedia

(Text) CC BY-SA