Stationary set

If ${\displaystyle \kappa }$ is a cardinal of uncountable cofinality, ${\displaystyle S\subseteq \kappa ,}$ and ${\displaystyle S}$ intersects every club set in ${\displaystyle \kappa ,}$ then ${\displaystyle S}$ is called a stationary set.[1] If a set is not stationary, then it is called a thin set. This notion should not be confused with the notion of a thin set in number theory.

If ${\displaystyle S}$ is a stationary set and ${\displaystyle C}$ is a club set, then their intersection ${\displaystyle S\cap C}$ is also stationary. This is because if ${\displaystyle D}$ is any club set, then ${\displaystyle C\cap D}$ is a club set, thus ${\displaystyle (S\cap C)\cap D=S\cap (C\cap D)}$ is non empty. Therefore, ${\displaystyle (S\cap C)}$ must be stationary.

See also: Fodor's lemma

The restriction to uncountable cofinality is in order to avoid trivialities: Suppose ${\displaystyle \kappa }$ has countable cofinality. Then ${\displaystyle S\subseteq \kappa }$ is stationary in ${\displaystyle \kappa }$ if and only if ${\displaystyle \kappa \setminus S}$ is bounded in ${\displaystyle \kappa }$. In particular, if the cofinality of ${\displaystyle \kappa }$ is ${\displaystyle \omega =\aleph _{0}}$, then any two stationary subsets of ${\displaystyle \kappa }$ have stationary intersection.

This is no longer the case if the cofinality of ${\displaystyle \kappa }$ is uncountable. In fact, suppose ${\displaystyle \kappa }$ is regular and ${\displaystyle S\subseteq \kappa }$ is stationary. Then ${\displaystyle S}$ can be partitioned into ${\displaystyle \kappa }$ many disjoint stationary sets. This result is due to Solovay. If ${\displaystyle \kappa }$ is a successor cardinal, this result is due to Ulam and is easily shown by means of what is called an Ulam matrix.

H. Friedman has shown that for every countable successor ordinal ${\displaystyle \beta }$, every stationary subset of ${\displaystyle \omega _{1}}$ contains a closed subset of order type ${\displaystyle \beta }$.

There is also a notion of stationary subset of ${\displaystyle [X]^{\lambda }}$, for ${\displaystyle \lambda }$ a cardinal and ${\displaystyle X}$ a set such that ${\displaystyle |X|\geq \lambda }$, where ${\displaystyle [X]^{\lambda }}$ is the set of subsets of ${\displaystyle X}$ of cardinality ${\displaystyle \lambda }$: ${\displaystyle [X]^{\lambda }=\{Y\subseteq X:|Y|=\lambda \}}$. This notion is due to Thomas Jech. As before, ${\displaystyle S\subseteq [X]^{\lambda }}$ is stationary if and only if it meets every club, where a club subset of ${\displaystyle [X]^{\lambda }}$ is a set unbounded under ${\displaystyle \subseteq }$ and closed under union of chains of length at most ${\displaystyle \lambda }$. These notions are in general different, although for ${\displaystyle X=\omega _{1}}$ and ${\displaystyle \lambda =\aleph _{0}}$ they coincide in the sense that ${\displaystyle S\subseteq [\omega _{1}]^{\omega }}$ is stationary if and only if ${\displaystyle S\cap \omega _{1}}$ is stationary in ${\displaystyle \omega _{1}}$.

The appropriate version of Fodor's lemma also holds for this notion.

There is yet a third notion, model theoretic in nature and sometimes referred to as generalized stationarity. This notion is probably due to Magidor, Foreman and Shelah and has also been used prominently by Woodin.

Now let ${\displaystyle X}$ be a nonempty set. A set ${\displaystyle C\subseteq {\mathcal {P}}(X)}$ is club (closed and unbounded) if and only if there is a function ${\displaystyle F:[X]^{<\omega }\to X}$ such that ${\displaystyle C=\{z:F[[z]^{<\omega }]\subseteq z\}}$. Here, ${\displaystyle [y]^{<\omega }}$ is the collection of finite subsets of ${\displaystyle y}$.

${\displaystyle S\subseteq {\mathcal {P}}(X)}$ is stationary in ${\displaystyle {\mathcal {P}}(X)}$ if and only if it meets every club subset of ${\displaystyle {\mathcal {P}}(X)}$.

To see the connection with model theory, notice that if ${\displaystyle M}$ is a structure with universe ${\displaystyle X}$ in a countable language and ${\displaystyle F}$ is a Skolem function for ${\displaystyle M}$, then a stationary ${\displaystyle S}$ must contain an elementary substructure of ${\displaystyle M}$. In fact, ${\displaystyle S\subseteq {\mathcal {P}}(X)}$ is stationary if and only if for any such structure ${\displaystyle M}$ there is an elementary substructure of ${\displaystyle M}$ that belongs to ${\displaystyle S}$.

• Foreman, Matthew (2002) Stationary sets, Chang's Conjecture and partition theory, in Set Theory (The Hajnal Conference) DIMACS Ser. Discrete Math. Theoret. Comp. Sci., 58, Amer. Math. Soc., Providence, RI. pp. 73–94. File at
• Friedman, Harvey (1974). "On closed sets of ordinals". Proc. Am. Math. Soc. 43: 190–192. doi:10.2307/2039353. Zbl 0299.04003.
• Jech, Thomas (2003). Set Theory. Springer Monographs in Mathematics (Third Millennium ed.). Berlin, New York: Springer-Verlag. ISBN 978-3-540-44085-7. Zbl 1007.03002.

• "Stationary set". PlanetMath.