Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0205331

Continuous Ramsey theory on Polish spaces and covering the plane by functions

Stefan Geschke·Martin Goldstern·Menachem Kojman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the Ramsey theory of continuous pair-colorings on complete, separable metric spaces, and apply the results to the problem of covering a plane by functions. The homogeneity number hm(c) of a pair-coloring c:[X]^2 -> 2 is the number of c-homogeneous subsets of X needed to cover X. We isolate two continuous pair-colorings on the Cantor space 2^omega, c_min and c_max, which satisfy hm(c_min)\le hm(c_max) and prove: 1. For every Polish space X and every continuous pair-coloring c:[X]^2 -> 2 with hm(c) uncountable: hm(c)= hm(c_min) or hm(c)=hm(c_max) 2. There is a model of set theory in which hm(c_min)=aleph_1 and hm(c_max)=aleph_2 (The consistency of hm(c_min) = 2^aleph0 and of hm(c_max) < 2^aleph0 is known) We prove that hm(c_min) is equal to the covering number of (2^omega)^2 by graphs of Lipschitz functions and their reflections on the diagonal. An iteration of an optimal forcing notion associated to c_min gives: There is a model of set theory in which 1. R^2 is coverable by aleph1 graphs and reflections of graphs of continuous real functions; 2. R^2 is not coverable by aleph1 graphs and reflections of graphs of Lipschitz real functions.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefan Geschke, Martin Goldstern, Menachem Kojman. 2002-05-31. Continuous Ramsey theory on Polish spaces and covering the plane by functions. https://arxiv.org/abs/math/0205331

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Amenable C-sequences and ineffability in L

We give a relative consistency counterexample to the conjecture of Inamdar and Rinot that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in the constructible universe L. The existence of a $Π^2_1$-indescribable cardinal is equiconsistent with the existence of a $Π^2_1$-indescribable cardinal carrying no amenable C-sequence and not ineffable in L. For every ground-model C-sequence on a weakly compact cardinal $κ$, generalized Hechler forcing adds a club D with $D\capβ\subseteq C_β$ at stationarily many inaccessible indices. We use this capture theorem in an iteration of length $κ^+$ after Johnstone's local lottery preparation.

math.LO↗
arXiv2026

Omitting Types for Infinitary Real-Valued Logic: A Topological Perspective

For countable vocabularies, we extend the omitting types theorem for countable fragments of infinitary logic to Keisler's general real-valued structures by proving that the space of Henkin types of each such fragment is Čech-complete. The structures interpret function symbols arbitrarily and predicate symbols by bounded real-valued functions, while each formula carries a bound of its own. This extends the setting of Eagle's theorem from metric structures with a prescribed master metric to general structures whose vocabulary prescribes the sorts and bounds of the symbols. Following Keisler and Miller's treatment of logic without equality, we build models from closed terms. Morley's Baire category method then gives every satisfiable theory on a countable fragment a model with countable sorts omitting any countable family of types whose closed-term instances have empty interior in the space of Henkin types satisfying the theory.

math.LO↗
arXiv2026

Friedman--Stanley cofinality without Borel completeness

Friedman and Stanley asked whether an invariant Borel class of countable structures must be Borel complete whenever every countable level of their hierarchy reduces to it. We construct a counterexample in one fixed countable language. The structural counterexample and its principal supporting results have been formalized in Lean~4 and it is available on github.

math.LO↗