Misplaced Pages

Erdős cardinal

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

In mathematics, an Erdős cardinal, also called a partition cardinal is a certain kind of large cardinal number introduced by Paul Erdős and András Hajnal (1958).

A cardinal κ {\displaystyle \kappa } is called α {\displaystyle \alpha } -Erdős if for every function f : κ < ω { 0 , 1 } {\displaystyle f:\kappa ^{<\omega }\to \{0,1\}} , there is a set of order type α {\displaystyle \alpha } that is homogeneous for f {\displaystyle f} . In the notation of the partition calculus, κ {\displaystyle \kappa } is α {\displaystyle \alpha } -Erdős if

κ ( α ) < ω {\displaystyle \kappa \rightarrow (\alpha )^{<\omega }} .

The existence of zero sharp implies that the constructible universe L {\displaystyle L} satisfies "for every countable ordinal α {\displaystyle \alpha } , there is an α {\displaystyle \alpha } -Erdős cardinal". In fact, for every indiscernible κ {\displaystyle \kappa } , L κ {\displaystyle L_{\kappa }} satisfies "for every ordinal α {\displaystyle \alpha } , there is an α {\displaystyle \alpha } -Erdős cardinal in C o l l ( ω , α ) {\displaystyle \mathrm {Coll} (\omega ,\alpha )} " (the Lévy collapse to make α {\displaystyle \alpha } countable).

However, the existence of an ω 1 {\displaystyle \omega _{1}} -Erdős cardinal implies existence of zero sharp. If f {\displaystyle f} is the satisfaction relation for L {\displaystyle L} (using ordinal parameters), then the existence of zero sharp is equivalent to there being an ω 1 {\displaystyle \omega _{1}} -Erdős ordinal with respect to f {\displaystyle f} . Thus, the existence of an ω 1 {\displaystyle \omega _{1}} -Erdős cardinal implies that the axiom of constructibility is false.

The least ω {\displaystyle \omega } -Erdős cardinal is not weakly compact, nor is the least ω 1 {\displaystyle \omega _{1}} -Erdős cardinal.

If κ {\displaystyle \kappa } is α {\displaystyle \alpha } -Erdős, then it is α {\displaystyle \alpha } -Erdős in every transitive model satisfying " α {\displaystyle \alpha } is countable."

See also

References

Citations

  1. ^ F. Rowbottom, "Some strong axioms of infinity incompatible with the axiom of constructibility". Annals of Mathematical Logic vol. 3, no. 1 (1971).


Stub icon

This set theory-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: