Partition Regular Functions

• Partition regular functions are combinatorial objects that generalize classical notions in Ramsey theory, topology, and ultrafilters.
• They encode set‐theoretic structures to extract large homogeneous configurations from infinite sets under arbitrary finite colourings.
• They bridge ideal theory, descriptive set theory, and compactness, underpinning applications from IP-convergence to Mazurkiewicz-type selection theorems.

A partition regular function is a combinatorial object designed to unify and generalize classical notions of regularity in Ramsey theory, topological convergence, and the theory of ultrafilters. It encodes, via a structural set-theoretic framework, the information that allows the extraction of rich combinatorial content from infinite sets under arbitrary partitions. Partition regular functions quantify the persistence of large homogeneous structures under arbitrary finite colourings, and thereby serve as a bridge between ideal theory, descriptive set theory, and compactness in topology.

1. Formal Definition

Let $\Lambda$ and $\Omega$ be countably infinite sets, and let $\mathcal F\subseteq[\Omega]^\omega$ be a family of infinite subsets closed under finite removal: if $F\in\mathcal F$ and $K\subseteq\Omega$ is finite, then $F\setminus K\in\mathcal F$. A function

$\rho\colon\mathcal F\to[\Lambda]^\omega$

is called partition regular if it satisfies:

• Monotonicity (M):

$$E\subseteq F \;\Rightarrow\; \rho(E)\subseteq\rho(F).$$

• Ramsey property (R): For every $F\in\mathcal F$ and every partition $\rho(F)=A\cup B$ with $\Omega$0, there exists $\Omega$1 with $\Omega$2 such that either $\Omega$3 or $\Omega$4.
• Sparseness (S): For each $\Omega$5, there exists $\Omega$6, $\Omega$7, such that for every $\Omega$8 there is a finite $\Omega$9 with $\mathcal F\subseteq[\Omega]^\omega$0.

To every partition regular function $\mathcal F\subseteq[\Omega]^\omega$1 is associated the ideal

$\mathcal F\subseteq[\Omega]^\omega$2

Conversely, every ideal $\mathcal F\subseteq[\Omega]^\omega$3 on $\mathcal F\subseteq[\Omega]^\omega$4 gives rise to the PRF $\mathcal F\subseteq[\Omega]^\omega$5 for $\mathcal F\subseteq[\Omega]^\omega$6; in this sense, PRFs strictly generalize ideals.

2. Canonical Examples

Partition regular functions encompass diverse paradigms of combinatorial and topological regularity:

• Ordinary convergence: Setting $\mathcal F\subseteq[\Omega]^\omega$7 and $\mathcal F\subseteq[\Omega]^\omega$8, the identity $\mathcal F\subseteq[\Omega]^\omega$9 is partition regular, associated to the ideal of finite sets. The corresponding structural property $F\in\mathcal F$0 is equivalent to sequential compactness.
• IP-convergence: The map

$F\in\mathcal F$1

is a PRF, capturing the infinite partition regularity underpinning Hindman's theorem. The ideal $F\in\mathcal F$2 characterizes sets lacking an infinite IP-set.

• Ramsey-type convergence: More generally, the map sending $F\in\mathcal F$3 to infinite configurations guaranteed by Ramsey's theorem (e.g., monochromatic infinite cliques or arithmetic progressions) yields PRFs reflecting classical infinitary regularity.

3. Structural Theorems and the Katětov Order

A central organizing principle for PRFs is the generalized Katětov order: For partition regular functions $F\in\mathcal F$4 and $F\in\mathcal F$5,

$F\in\mathcal F$6

The following results explicate the role of PRFs as critical witnesses for compactness-type properties:

• Finite spaces: For $F\in\mathcal F$7, the following are equivalent: (1) $F\in\mathcal F$8 is the class of all finite spaces, (2) $F\in\mathcal F$9, (3) $K\subseteq\Omega$0, (4) $K\subseteq\Omega$1.
• Boring spaces: For $K\subseteq\Omega$2, $K\subseteq\Omega$3 is the class of boring spaces iff $K\subseteq\Omega$4 and $K\subseteq\Omega$5.
• Compact metric spaces: For $K\subseteq\Omega$6 with small accretions,

$K\subseteq\Omega$7

Thus, PRFs such as $K\subseteq\Omega$8, $K\subseteq\Omega$9, and $F\setminus K\in\mathcal F$0 act as critical thresholds in the topological and combinatorial landscape, determining which classes of spaces or systems exhibit corresponding regularity properties (Filipów et al., 17 Jan 2026).

4. Unification of Topological and Ramsey-type Convergence

The theory of partition regular functions provides a unified formalism encompassing ordinary convergence (sequences), IP-convergence (sumsets), Ramsey-theoretic regularity (combinatorial structures), and more. The Katětov order on PRFs induces the classical Katětov order on ideals via

$F\setminus K\in\mathcal F$1

In this regime, properties of PRFs reflect the strength of convergence, compactness, or combinatorial largeness in the corresponding spaces or configurations. This framework allows simultaneous reasoning about sequential compactness, Hindman–Milliken–Taylor phenomena, and Ramsey-theoretic configurations under partitions and colorings.

5. PRFs, Ideals, and Partition Regularity in Linear Systems

The partition regular function perspective encompasses, and is illuminated by, the classical theory of image partition regular (IPR) matrices:

• A system of linear equations $F\setminus K\in\mathcal F$2 is partition regular iff, for every finite colouring of $F\setminus K\in\mathcal F$3, there exists $F\setminus K\in\mathcal F$4 with all coefficients of $F\setminus K\in\mathcal F$5 monochromatic (Hindman et al., 2014).
• The function $F\setminus K\in\mathcal F$6 is then partition regular in the sense that it takes some monochromatic input to a monochromatic output under any finite colouring. The matrix-theoretic approach underlies the encoding of Ramsey-theoretic theorems (e.g., Schur's, van der Waerden's, Finite-Sums) as assertions about IPR-matrices.

The extension to infinite matrices and more general PRFs enables the articulation of maximality, image domination, and universal image maximality, describing how partition regularity can be preserved or destroyed under certain extensions (Hindman et al., 2014).

6. Applications and Mazurkiewicz-Type Selection Theorems

PRFs are intrinsically connected to selection theorems and compactness principles. For instance, Mazurkiewicz's theorem on uniform convergence on perfect sets is captured via the critical role of PRFs:

Theorem (Ideal Mazurkiewicz): For an ideal $F\setminus K\in\mathcal F$7 on $F\setminus K\in\mathcal F$8,

• $F\setminus K\in\mathcal F$9 iff every uniformly bounded sequence $\rho\colon\mathcal F\to[\Lambda]^\omega$0 admits a subsequence indexed outside $\rho\colon\mathcal F\to[\Lambda]^\omega$1 that converges uniformly on a nonempty perfect set.

This equivalence is governed by the criticality of $\rho\colon\mathcal F\to[\Lambda]^\omega$2 in the Katětov order—$\rho\colon\mathcal F\to[\Lambda]^\omega$3 is necessary and sufficient for the Mazurkiewicz selection principle (Filipów et al., 17 Jan 2026).

7. Impact and Open Problems

Partition regular functions offer a robust abstraction for Ramsey-theoretic, linear algebraic, and topological regularity, capturing subtle distinctions not visible in the language of ideals or traditional compactness alone. Their critical thresholds and ordering structure facilitate sharp characterizations of which regularities transfer across combinatorial and topological frameworks. Open problems include the full classification of maximal partition regular structures, the identification of universally image maximal matrices, and finer interplay between combinatorial, algebraic, and topological criticalities. The ongoing investigation reveals new connections between infinite combinatorics, the algebra of ultrafilters, and the architecture of compactness in topology (Hindman et al., 2014, Filipów et al., 17 Jan 2026).