Ramsey cardinal

In mathematics, a Ramsey cardinal is a certain kind of large cardinal number introduced by and named after Frank P.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, a Ramsey cardinal is a certain kind of large cardinal number introduced by and named after Frank P. Ramsey, whose theorem, called Ramsey's theorem establishes that ω enjoys a certain property that Ramsey cardinals generalize to the uncountable case. Let [κ] <ω denote the set of all finite subsets of κ.

A cardinal number κ is called Ramsey if, for every function :f: [κ] <ω → {0, 1} there is a set A of cardinality κ that is homogeneous for f. That is, for every n, the function f is constant on the subsets of cardinality n from A. A cardinal κ is called ineffably Ramsey if A can be chosen to be a stationary subset of κ. A cardinal κ is called virtually Ramsey if for every function :f: [κ] → {0, 1} there is C, a closed and unbounded subset of κ, so that for every λ in C of uncountable cofinality, there is an unbounded subset of λ that is homogenous for f; slightly weaker is the notion of almost Ramsey where homogenous sets for f are required of order type λ, for every λ # , or indeed that every set with rank less than κ has a sharp.

This in turn implies the falsity of the Axiom of Constructibility of Kurt Gödel. Every measurable cardinal is a Ramsey cardinal, and every Ramsey cardinal is a Rowbottom cardinal.…

In mathematics, a Ramsey cardinal is a certain kind of large cardinal number introduced by and named after Frank P. Ramsey, whose theorem, called Ramsey's theorem establishes that ω enjoys a certain property that Ramsey cardinals generalize to the uncountable case. Let [κ] <ω denote the set of all finite subsets of κ.

A cardinal number κ is called Ramsey if, for every function f: [κ] <ω → {0, 1} there is a set A of cardinality κ that is homogeneous for f. That is, for every n, the function f is constant on the subsets of cardinality n from A. A cardinal κ is called ineffably Ramsey if A can be chosen to be a stationary subset of κ. A cardinal κ is called virtually Ramsey if for every function f: [κ] → {0, 1} there is C, a closed and unbounded subset of κ, so that for every λ in C of uncountable cofinality, there is an unbounded subset of λ that is homogenous for f; slightly weaker is the notion of almost Ramsey where homogenous sets for f are required of order type λ, for every λ # , or indeed that every set with rank less than κ has a sharp.

This in turn implies the falsity of the Axiom of Constructibility of Kurt Gödel. Every measurable cardinal is a Ramsey cardinal, and every Ramsey cardinal is a Rowbottom cardinal.

A property intermediate in strength between Ramseyness and measurability is existence of a κ-complete normal non-principal ideal I on κ such that for every and for every function f: [κ] <ω → {0, 1} there is a set B ⊂ A not in I that is homogeneous for f. This is strictly stronger than κ being ineffably Ramsey. U is an M-ultrafilter: for any sequence ⟨X β : β β = {α β )} ∈ U, U is weakly amenable: for any sequence ⟨X β : β β ∈ U} ∈ M, and U is σ-complete: the intersection of any countable family of members of U is again in U.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1315603771 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.