Table of Contents
Fetching ...

Ramsey's coheirs

Eugenio Colla, Domenico Zambella

TL;DR

This paper develops a model-theoretic framework based on coheirs to provide succinct proofs of key Ramsey-type results, replacing the Stone-Čech semigroup with a saturated monster model of a semigroup $G$. By constructing coheir sequences that are $M$-indiscernible, the authors derive Ramsey's theorem and extend it to Hindman and Hales-Jewett-type results, including Carlson’s and Gowers’s partition theorems as consequences of an idempotent-orbit structure in semigroups. The approach yields algebraic and combinatorial versions of the theorems, emphasizes stationarity and independence notions, and demonstrates how model-theoretic methods can illuminate classical combinatorial phenomena. The work offers an accessible alternative to ultrafilter methods and strengthens connections between Ramsey theory and model theory through a unified coheir-based toolkit.

Abstract

We use the model theoretic notion of coheir to give short proofs of old and new theorems in Ramsey Theory. As an illustration we start from Ramsey's theorem itself. Then we prove Hindman's theorem and the Hales-Jewett theorem. Finally, we prove two Ramsey theoretic principles that have among their consequences partition theorems of Carlson and of Gowers.

Ramsey's coheirs

TL;DR

This paper develops a model-theoretic framework based on coheirs to provide succinct proofs of key Ramsey-type results, replacing the Stone-Čech semigroup with a saturated monster model of a semigroup . By constructing coheir sequences that are -indiscernible, the authors derive Ramsey's theorem and extend it to Hindman and Hales-Jewett-type results, including Carlson’s and Gowers’s partition theorems as consequences of an idempotent-orbit structure in semigroups. The approach yields algebraic and combinatorial versions of the theorems, emphasizes stationarity and independence notions, and demonstrates how model-theoretic methods can illuminate classical combinatorial phenomena. The work offers an accessible alternative to ultrafilter methods and strengthens connections between Ramsey theory and model theory through a unified coheir-based toolkit.

Abstract

We use the model theoretic notion of coheir to give short proofs of old and new theorems in Ramsey Theory. As an illustration we start from Ramsey's theorem itself. Then we prove Hindman's theorem and the Hales-Jewett theorem. Finally, we prove two Ramsey theoretic principles that have among their consequences partition theorems of Carlson and of Gowers.

Paper Structure

This paper contains 9 sections, 20 theorems.

Key Result

Proposition 2.2

Every type $q({\color{black} x})\subseteq L({\color{brown}\EuScript U})$ that is finitely satisfiable in $M$ has an extension to a global type finitely satisfiable in $M$.⁠[4] $\Box$

Theorems & Definitions (27)

  • Example 1.1
  • Definition 1.2
  • Proposition 2.2
  • Definition 2.3
  • Lemma 2.4
  • Definition 2.5
  • Proposition 2.6
  • Remark 2.7
  • Lemma 2.8
  • Definition 2.9
  • ...and 17 more