Ramsey class

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 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 the area of mathematics known as Ramsey theory, a Ramsey class is one which satisfies a generalization of Ramsey's theorem. Suppose A , B and C are structures and k is a positive integer. We denote by \binom{B}{A} the set of all subobjects A' of B which are isomorphic to A . We further denote by C \rightarrow (B)^A_k the property that for all partitions X_1 \cup X_2\cup \dots\cup X_k of \binom{C}{A} there exists a B' \in \binom{C}{B} and an 1 \leq i \leq k such that \binom{B'}{A} \subseteq X_i .

Suppose K is a class of structures closed under isomorphism and substructures. We say the class K has the A-Ramsey property if for ever positive integer k and for every B\in K there is a C \in K such that C \rightarrow (B)^A_k holds. If K has the A -Ramsey property for all A \in K then we say K is a Ramsey class. Ramsey's theorem is equivalent to the statement that the class of all finite sets is a Ramsey class.

In the area of mathematics known as Ramsey theory, a Ramsey class is one which satisfies a generalization of Ramsey's theorem. Suppose A , B and C are structures and k is a positive integer. We denote by \binom{B}{A} the set of all subobjects A' of B which are isomorphic to A . We further denote by C \rightarrow (B)^A_k the property that for all partitions X_1 \cup X_2\cup \dots\cup X_k of \binom{C}{A} there exists a B' \in \binom{C}{B} and an 1 \leq i \leq k such that \binom{B'}{A} \subseteq X_i .

Suppose K is a class of structures closed under isomorphism and substructures. We say the class K has the A-Ramsey property if for ever positive integer k and for every B\in K there is a C \in K such that C \rightarrow (B)^A_k holds. If K has the A -Ramsey property for all A \in K then we say K is a Ramsey class. Ramsey's theorem is equivalent to the statement that the class of all finite sets is a Ramsey class.

References

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

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.