In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets. Some of the things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Recent developments concern combinatorics of the continuum and combinatorics on successors of singular cardinals.

Ramsey theory for infinite sets

Write for ordinals, m for a cardinal number (finite or infinite) and n for a natural number. introduced the notation as a shorthand way of saying that every partition of the set [\kappa]^n of n-element subsets of \kappa into m pieces has a homogeneous set of order type \lambda. A homogeneous set is in this case a subset of \kappa such that every n-element subset is in the same element of the partition. When m is 2 it is often omitted. Such statements are known as partition relations. Assuming the axiom of choice, there are no ordinals \kappa with, so n is usually taken to be finite. An extension where n is almost allowed to be infinite is the notation which is a shorthand way of saying that every partition of the set of finite subsets of \kappa into m pieces has a subset of order type \lambda such that for any finite n, all subsets of size n are in the same element of the partition. When m is 2 it is often omitted. Another variation is the notation which is a shorthand way of saying that every coloring of the set [\kappa]^n of n-element subsets of \kappa with 2 colors has a subset of order type \lambda such that all elements of [\lambda]^n have the first color, or a subset of order type \mu such that all elements of [\mu]^n have the second color. Some properties of this include: (in what follows \kappa is a cardinal) In choiceless universes, partition properties with infinite exponents may hold, and some of them are obtained as consequences of the axiom of determinacy (AD). For example, Donald A. Martin proved that AD implies

Strong colorings

Wacław Sierpiński showed that the Ramsey theorem does not extend to sets of size \alef_1by showing that. That is, Sierpiński constructed a coloring of pairs of real numbers into two colors such that for every uncountable subset of real numbers X, [X]^2 takes both colors. Taking any set of real numbers of size \alef_1 and applying the coloring of Sierpiński to it, we get that. Colorings such as this are known as strong colorings and studied in set theory. introduced a similar notation as above for this. Write for ordinals, m for a cardinal number (finite or infinite) and n for a natural number. Then is a shorthand way of saying that there exists a coloring of the set [\kappa]^n of n-element subsets of \kappa into m pieces such that every set of order type \lambda is a rainbow set. A rainbow set is in this case a subset A of \kappa such that [A]^n takes all m colors. When m is 2 it is often omitted. Such statements are known as negative square bracket partition relations. Another variation is the notation which is a shorthand way of saying that there exists a coloring of the set [\kappa]^2 of 2-element subsets of \kappa with m colors such that for every subset A of order type \lambda and every subset B of order type \mu, the set A\times B takes all m colors. Some properties of this include: (in what follows \kappa is a cardinal)

Large cardinals

Several large cardinal properties can be defined using this notation. In particular: