A Statement in Combinatorics that is Independent of ZFC (an exposition)
Stephen Fenner, William Gasarch

TL;DR
This paper discusses a statement in combinatorics related to coloring the reals and its independence from ZFC, providing an exposition of Erdős's proof linking it to the negation of the Continuum Hypothesis.
Contribution
It offers an accessible exposition of Erdős's proof that the combinatorial statement is independent of ZFC, connecting it to the continuum hypothesis.
Findings
The statement S is equivalent to the negation of CH.
S is independent of ZFC.
Modern observations relate to results of similar independence.
Abstract
It is known that, for any finite coloring of the naturals, there exists distinct naturals that are the same color such that . Consider the following statement which we denote S: For every -coloring of the reals there exists distinct reals such that ?} Is it true? Erdos showed that S is equivalent to the negation of the Continuum Hypothesis, and hence S is indepedent of ZFC. We give an exposition of his proof and some modern observations about results of this sort.
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
