A Topological Rainbow Ramsey Theorem
Hannes Jakob, Jing Zhang

Abstract
We show that it is consistent relative to the existence of suitable large cardinals that for any countable-to-one coloring , there exists a closed subset of order type such that is injective. This theorem simultaneously strengthens two theorems, one by Abraham, Cummings and Smyth and another one by Garti and Zhang, as well as answers a question raised by Garti and Zhang. New combinatorial principles involving towers of countable elementary submodels, games concerning regressive functions and variants of strong Chang's conjecture, which are key elements of the proof, are investigated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
