Erdős cardinals

From Cantor's Attic
Jump to: navigation, search

The $\alpha$-Erdős cardinals were introduced by Erdős and Hajnal in [1] and arose out of their study of partition relations. A cardinal $\kappa$ is $\alpha$-Erdős for an infinite limit ordinal $\alpha$ if it is the least cardinal $\kappa$ such that $\kappa\rightarrow (\alpha)^{\lt\omega}_2$ (if any such cardinal exists).

For infinite cardinals $\kappa$ and $\lambda$, the partition property $\kappa\to(\lambda)^n_\gamma$ asserts that for every function $F:[\kappa]^n\to\gamma$ there is $H\subseteq\kappa$ with $|H|=\lambda$ such that $F\upharpoonright[H]^n$ is constant. Here $[X]^n$ is the set of all $n$-elements subsets of $X$. The more general partition property $\kappa\to(\lambda)^{\lt\omega}_\gamma$ asserts that for every function $F:[\kappa]^{\lt\omega}\to\gamma$ there is $H\subseteq\kappa$ with $|H|=\lambda$ such that $F\upharpoonright[H]^n$ is constant for every $n$, although the value of $F$ on $[H]^n$ may be different for different $n$. Indeed, if $\kappa$ is $\alpha$-Erdős for some infinite ordinal $\alpha$, then $\kappa\rightarrow (\alpha)^{\lt\omega}_\lambda$ for all $\lambda<\kappa$ (Silver's PhD thesis).

The $\alpha$-Erdős cardinal is precisely the least cardinal $\kappa$ such that for any language $\mathcal{L}$ of size less than $\kappa$ and any structure $\mathcal{M}$ with language $\mathcal{L}$ and domain $\kappa$, there is a set of indescernibles for $\mathcal{M}$ of order-type $\alpha$.

A cardinal $\kappa$ is called Erdős if and only if it is $\alpha$-Erdős for some infinite limit ordinal $\alpha$. Because there exists at most one $\alpha$-Erdős cardinal, the notations $\eta_\alpha$ and $\kappa(\alpha)$ are sometimes used to denote the $\alpha$-Erdős cardinal.


  • $\eta_\alpha<\eta_\beta$ whenever $\alpha<\beta$ and $\eta_\alpha\geq\alpha$. [2]

Erdős cardinals and the constructible universe:

  • $\omega_1$-Erdős cardinals imply that $0^\sharp$ exists and hence there cannot be $\omega_1$-Erdős cardinals in $L$. [3]
  • $\alpha$-Erdős cardinals are downward absolute to $L$ for $L$-countable $\alpha$. More generally, $\alpha$-Erdős cardinals are downward absolute to any transitive model of ZFC for $M$-countable $\alpha$. [4]

Relations with other large cardinals:

  • Every Erdős cardinal is inaccessible. (Silver's PhD thesis)
  • Every Erdős cardinal is subtle. [5]
  • $\eta_\omega$ is a stationary limit of ineffable cardinals. [6]
  • $η_ω$ is a limit of virtually rank-into-rank cardinals. [7]
  • The existence of $\eta_\omega$ implies the consistency of a proper class of $n$-iterable cardinals for every $1\leq n<\omega$.[8]
  • For an additively indecomposable ordinal $λ ≤ ω_1$, $η_λ$ (the least $λ$-Erdős cardinal) is a limit of $λ$-iterable cardinals and if there is a $λ + 1$-iterable cardinal, then there is a $λ$-Erdős cardinal below it.[7]
  • The consistency strength of the existence of an Erdős cardinal is stronger than that of the existence of an $n$-iterable cardinal for every $n<\omega$ and weaker than that of the existence of $0^{\#}$.
  • The existence of a proper class of Erdős cardinals is equivalent to the existence of a proper class of almost Ramsey cardinals. The consistency strength of this is weaker than a worldly almost Ramsey cardinal, but stronger than an almost Ramsey cardinal.
  • The existence of an almost Ramsey cardinal is stronger than the existence of an $\omega_1$-Erdős cardinal. [9]
  • A cardinal $\kappa$ is Ramsey precisely when it is $\kappa$-Erdős.

Weakly Erdős and greatly Erdős

(Information in this section from [9])

Suppose that $κ$ has uncountable cofinality, $\mathcal{A}$ is $κ$-structure, with $X ⊆ κ$, and $t_\mathcal{A} ( X ) = \{ α ∈ κ \text{ — limit ordinal} : \text{there exists a set $I ⊆ α ∩ X$ of good indiscernibles for $\mathcal{A}$ cofinal in $α$} \}$. Using this one can define a hierarchy of normal filters $\mathcal{F}_\alpha$ potentially for all $α < κ^+$ ; these are generated by suprema of sets of nested indiscernibles for structures $\mathcal{A}$ on $κ$ using the above basic $t_\mathcal{A} (X)$ operation. A cardinal $κ$ is weakly $α$-Erdős when $\mathcal{F}_\alpha$ is non-trivial.

$κ$ is greatly Erdős iff there is a non-trivial normal filter $\mathcal{F}$ on $\mathcal{F}$ such that $F$ is closed under $t_\mathcal{A} (X)$ for every $κ$-structure $\mathcal{A}$. Equivalently (for uncountable cofinality of cardinal $κ$):

  • $\mathcal{G} = \bigcup_{\alpha < \kappa^+} \mathcal{F}_\alpha \not\ni \varnothing$
  • $κ$ is $α$-weakly Erdős for all $α < κ^+$

and (for inaccessible $κ$ and any choice $⟨ f_β : β < κ^+ ⟩$ of canonical functions for $κ$):

  • $\{γ < κ : f_β (γ) ⩽ o_\mathcal{A} (γ)\} \neq \varnothing$ for all $β < κ^+$ and $κ$-structures $\mathcal{A}$ such that $\mathcal{A} \models ZFC$


  • If $κ$ is a $2$-weakly Erdős cardinal then $κ$ is almost Ramsey.
  • If $κ$ is virtually Ramsey then $κ$ is greatly Erdős.
  • There are stationarily many completely ineffable, greatly Erdős cardinals below any Ramsey cardinal.


  1. Erdős, Paul and Hajnal, Andras. On the structure of set-mappings. Acta Math Acad Sci Hungar 9:111--131, 1958. MR   bibtex
  2. Kanamori, Akihiro. The higher infinite. Second, Springer-Verlag, Berlin, 2009. (Large cardinals in set theory from their beginnings, Paperback reprint of the 2003 edition) www   bibtex
  3. Silver, Jack. Some applications of model theory in set theory. Ann Math Logic 3(1):45--110, 1971. MR   bibtex
  4. Silver, Jack. A large cardinal in the constructible universe. Fund Math 69:93--100, 1970. MR   bibtex
  5. Jensen, Ronald and Kunen, Kenneth. Some combinatorial properties of $L$ and $V$. Unpublished, 1969. www   bibtex
  6. Jech, Thomas J. Set Theory. Third, Springer-Verlag, Berlin, 2003. (The third millennium edition, revised and expanded) www   bibtex
  7. Gitman, Victoria and Shindler, Ralf. Virtual large cardinals. www   bibtex
  8. Gitman, Victoria. Ramsey-like cardinals. The Journal of Symbolic Logic 76(2):519-540, 2011. www   arχiv   MR   bibtex
  9. Sharpe, Ian and Welch, Philip. Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties. Ann Pure Appl Logic 162(11):863--902, 2011. www   DOI   MR   bibtex
Main library