Английская Википедия:Indescribable cardinal

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

In set theory, a branch of mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language Q. There are many different types of indescribable cardinals corresponding to different choices of languages Q. They were introduced by Шаблон:Harvtxt.

A cardinal number <math>\kappa</math> is called <math>\Pi^n_m</math>-indescribable if for every <math>\Pi_m</math> proposition <math>\phi</math>, and set <math>A\subseteq V_\kappa</math> with <math>(V_{\kappa+n},\in,A)\vDash\phi</math> there exists an <math>\alpha<\kappa</math> with <math>(V_{\alpha+n},\in,A\cap V_\alpha)\vDash\phi</math>. Following Lévy's hierarchy, here one looks at formulas with m-1 alternations of quantifiers with the outermost quantifier being universal. <math>\Sigma^n_m</math>-indescribable cardinals are defined in a similar way, but with an outermost existential quantifier. Prior to defining the structure <math>(V_{\kappa+n},\in,A)</math>, one new predicate symbol is added to the language of set theory, which is interpreted as <math>A</math>. The idea is that <math>\kappa</math> cannot be distinguished (looking from below) from smaller cardinals by any formula of n+1-th order logic with m-1 alternations of quantifiers even with the advantage of an extra unary predicate symbol (for A). This implies that it is large because it means that there must be many smaller cardinals with similar properties. Шаблон:Citation needed

The cardinal number <math>\kappa</math> is called totally indescribable if it is <math>\Pi^n_m</math>-indescribable for all positive integers m and n.

If <math>\alpha</math> is an ordinal, the cardinal number <math>\kappa</math> is called <math>\alpha</math>-indescribable if for every formula <math>\phi</math> and every subset <math>U</math> of <math>V_\kappa</math> such that <math>\phi(U)</math> holds in <math>V_{\kappa+\alpha}</math> there is a some <math>\lambda<\kappa</math> such that <math>\phi(U\cap V_\lambda)</math> holds in <math>V_{\lambda+\alpha}</math>. If <math>\alpha</math> is infinite then <math>\alpha</math>-indescribable ordinals are totally indescribable, and if <math>\alpha</math> is finite they are the same as <math>\Pi^\alpha_\omega</math>-indescribable ordinals. There is no <math>\alpha</math> that is <math>\alpha</math>-indescribable, nor does <math>\alpha</math>-indescribability necessarily imply <math>\beta</math>-indescribability for any <math>\beta<\alpha</math>, but there is an alternative notion of shrewd cardinals that makes sense when <math>\alpha\geq\kappa</math>: if <math>\phi(U,\kappa)</math> holds in <math>V_{\kappa+\alpha}</math>, then there are <math>\lambda<\kappa</math> and <math>\beta</math> such that <math>\phi(U\cap V_\lambda,\lambda)</math> holds in <math>V_{\lambda+\beta}</math>.

Historical note

Originally, a cardinal κ was called Q-indescribable if for every Q-formula <math>\phi</math> and relation <math>A</math>, if <math>(\kappa,<,A)\vDash\phi</math> then there exists an <math>\alpha<\kappa</math> such that <math>(\alpha,\in,A\upharpoonright\alpha)\vDash\phi</math>. Using this definition, <math>\kappa</math> is <math>\Pi^1_0</math>-indescribable iff <math>\kappa</math> is regular and greater than <math>\aleph_0</math>.^p.207 The cardinals <math>\kappa</math> satisfying the above version based on the cumulative hierarchy were called strongly Q-indescribable. This property has also been referred to as "ordinal <math>Q</math>-indescribability".^p.32

Equivalent conditions

A cardinal is <math>\Sigma^1_{n+1}</math>-indescribable iff it is <math>\Pi^1_n</math>-indescribable. A cardinal is inaccessible if and only if it is <math>\Pi^0_n</math>-indescribable for all positive integers <math>n</math>, equivalently iff it is <math>\Pi^0_2</math>-indescribable, equivalently if it is <math>\Sigma^1_1</math>-indescribable.

<math>\Pi^1_1</math>-indescribable cardinals are the same as weakly compact cardinals.

The indescribability condition is equivalent to <math>V_\kappa</math> satisfying the reflection principle (which is provable in ZFC), but extended by allowing higher-order formulae with a second-order free variable.

For cardinals <math>\kappa<\theta</math>, say that an elementary embedding <math>j:M\to H(\theta)</math> a small embedding if <math>M</math> is transitive and <math>j(\textrm{crit}(j))=\kappa</math>. For any natural number <math>1\leq n</math>, <math>\kappa</math> is <math>\Pi^1_n</math>-indescribable iff there is an <math>\alpha>\kappa</math> such that for all <math>\theta>\alpha</math> there is a small embedding <math>j:M\to H_\theta</math> such that <math>H(\textrm{crit}(j)^+)^M\prec_{\Sigma_n}H(\textrm{crit}(j)^+)</math>.^{, Corollary 4.3}

If V=L, then for a natural number n>0, an uncountable cardinal is ΠШаблон:Su-indescribable iff it's (n+1)-stationary.

Enforceable classes

For a class <math>X</math> of ordinals and a <math>\Gamma</math>-indescribable cardinal <math>\kappa</math>, <math>X</math> is said to be enforced at <math>\alpha</math> (by some formula <math>\phi</math> of <math>\Gamma</math>) if there is a <math>\Gamma</math>-formula <math>\phi</math> and an <math>A\subseteq V_\kappa</math> such that <math>(V_\kappa,\in,A)\vDash\phi</math>, but for no <math>\beta<\alpha</math> with <math>\beta\notin X</math> does <math>(V_\beta,\in,A\cap V_\beta)\vDash\phi</math> hold.^p.277 This gives a tool to show necessary properties of indescribable cardinals.

Properties

The property of <math>\kappa</math> being <math>\Pi^1_n</math>-indescribable is <math>\Pi^1_{n+1}</math> over <math>V_\kappa</math>, i.e. there is a <math>\Pi^1_{n+1}</math> sentence that <math>V_\kappa</math> satisfies iff <math>\kappa</math> is <math>\Pi^1_n</math>-indescribable. For <math>m>1</math>, the property of being <math>\Pi^m_n</math>-indescribable is <math>\Sigma^m_n</math> and the property of being <math>\Sigma^m_n</math>-indescribable is <math>\Pi^m_n</math>. Thus, for <math>m>1</math>, every cardinal that is either <math>\Pi^m_{n+1}</math>-indescribable or <math>\Sigma^m_{n+1}</math>-indescribable is both <math>\Pi^m_n</math>-indescribable and <math>\Sigma^m_n</math>-indescribable and the set of such cardinals below it is stationary. The consistency strength of <math>\Sigma^m_n</math>-indescribable cardinals is below that of <math>\Pi^m_n</math>-indescribable, but for <math>m>1</math> it is consistent with ZFC that the least <math>\Sigma^m_n</math>-indescribable exists and is above the least <math>\Pi^m_n</math>-indescribable cardinal (this is proved from consistency of ZFC with <math>\Pi^m_n</math>-indescribable cardinal and a <math>\Sigma^m_n</math>-indescribable cardinal above it).

Totally indescribable cardinals remain totally indescribable in the constructible universe and in other canonical inner models, and similarly for <math>\Pi^m_n</math>- and <math>\Sigma^m_n</math>-indescribability.

For natural number <math>n</math>, if a cardinal <math>\kappa</math> is <math>n</math>-indescribable, there is an ordinal <math>\alpha<\kappa</math> such that <math>(V_{\alpha+n},\in)\equiv(V_{\kappa+n},\in)</math>, where <math>\equiv</math> denotes elementary equivalence. For <math>n=0</math> this is a biconditional (see Two model-theoretic characterisations of inaccessibility).

Measurable cardinals are <math>\Pi^2_1</math>-indescribable, but the smallest measurable cardinal is not <math>\Sigma^2_1</math>-indescribable. However, assuming choice, there are many totally indescribable cardinals below any measurable cardinal.

For <math>n\geq 1</math>, ZFC+"there is a <math>\Sigma^1_n</math>-indescribable cardinal" is equiconsistent with ZFC+"there is a <math>\Sigma^1_n</math>-indescribable cardinal <math>\kappa</math> such that <math>2^\kappa>\kappa^+</math>", i.e. "GCH fails at a <math>\Sigma^1_n</math>-indescribable cardinal".

References

• Шаблон:Citation
• Шаблон:Cite book