Erdős cardinal explained

In mathematics, an Erdős cardinal, also called a partition cardinal is a certain kind of large cardinal number introduced by .

A cardinal

\kappa

is called

\alpha

-Erdős if for every function

f:\kappa<\omega\to\{0,1\}

, there is a set of order type

\alpha

that is homogeneous for

f

. In the notation of the partition calculus,

\kappa

is

\alpha

-Erdős if

\kappa(\alpha)<\omega

.

L

satisfies "for every countable ordinal

\alpha

, there is an

\alpha

-Erdős cardinal". In fact, for every indiscernible

\kappa

,

L\kappa

satisfies "for every ordinal

\alpha

, there is an

\alpha

-Erdős cardinal in

Coll(\omega,\alpha)

" (the Lévy collapse to make

\alpha

countable).

However, the existence of an

\omega1

-Erdős cardinal implies existence of zero sharp. If

f

is the satisfaction relation for

L

(using ordinal parameters), then the existence of zero sharp is equivalent to there being an

\omega1

-Erdős ordinal with respect to

f

. Thus, the existence of an

\omega1

-Erdős cardinal implies that the axiom of constructibility is false.

The least

\omega

-Erdős cardinal is not weakly compact,[1] p. 39. nor is the least

\omega1

-Erdős cardinal.p. 39

If

\kappa

is

\alpha

-Erdős, then it is

\alpha

-Erdős in every transitive model satisfying "

\alpha

is countable."

See also

References

Citations

Notes and References

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