Is there Ramsey Theorem for infinitary tuples?

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

I'm wondering if there's any sort of Ramsey relation that allows for the tuples to be of arbitrary infinite size $\mu$? This $\mu$ is below some strongly compact cardinal, so I'm not worried about large cardinal hypotheses.

-

1
There are some generalizations of the Galvin-Prikry Ramsey theorem to higher cardinals. The experts here can no doubt point to them. One source I found with a quick google search is R.J. Watro's paper, "On partitioning the infinite subsets of large cardinals", J. Symbolic Logic 49 no. 2, June, 1984. – Bill Johnson Jun 11 2011 at 4:57

2 Answers

Infinite exponent partition relations are inconsistent with the axiom of choice, so in ZFC, this phenomenon does not exist, but nevertheless, in the context of $ZF+\neg AC$ there is a robust theory. See for example Andres Caicedo's discussion, this Kleinberg article, and the items in this Google search.

-

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

As emphasized in Joel Hamkins' answer, the generalization of Ramsey's theorem for infinite (unordered) tuples contradicts the axiom of choice [Erdős-Hajnal, 1966], and is a line of investigation that has close ties to large cardinals.

The classical Erdős-Hajnal proof uses the axiom of choice - in the guise of a well-ordering of the power set of $\Bbb {N}$ - to construct a "wild" coloring $C$ of infinite subsets $[\Bbb{N}]^\omega$ of $\Bbb{N}$ into two colors such that there is no infinite monochromatic set for $C$.

In contrast, Galvin and Prikry showed that for Borel colorings $C$ of $[\Bbb{N}]^\omega$, an infinite monochromatic subset for $C$ always exists. Silver then extended this result to analytic colorings. Note that $[\Bbb{N}]^\omega$ inherits a natural topology from $P(\Bbb{N})$, which is itself topologized via an identification with the product space $2^\Bbb{N}$.

The Galvin-Prikry paper appeared in 1973, but that of Silver appeared in 1970 (this is not a typo!). This work was simplified and extended by Ellentuck in 1974.

The metamathematics of Ramsey theory, including Galvin-Prikry type theorems, has been vigorously investigated in reverse mathematics.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 14, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9127689599990845, "perplexity_flag": "middle"}