TransWikia.com

Where is the copy of $mathbb{N}$ in the constructible hierarchy relative to a real closed field?

Mathematics Asked on December 23, 2021

Let $X$ be a real closed field. Let us define a constructible hierarchy relative to $X$ is defined as follows. (This is slightly nonstandard terminology.). Let $L_0(X)=X$. For any ordinal $beta$, let $L_{beta+1}(X)=Def(L_{beta+1}(X))$. For any limit ordinal $gamma$, let $L_gamma(X)=cup_{beta<gamma}L_beta$. And finally let $L(X) = cup_alpha L_alpha$.

Now let $M={n1_X: ninmathbb{N}}$. Then my question is, what is the smallest ordinal $alpha$ such that $M$ is guaranteed to be an element of $L_{alpha}(X)$?

Or is it consistent that $Mnotin L(X)$? What if we were to add the axiom $V=L(X)$?

One Answer

To avoid notational clash, I'll use the notation $D_alpha(X)$ to describe the hierarchy built on an RCF $X=(A;f_1,f_2)$ with underlying set $A$, addition function $f_1$, and multiplication function $f_2$, defined precisely as follows:

  • At the successor and limit steps we take definable powersets and unions respectively, as usual.

  • We start with $D_0(X)=Acup A^2cup{f_1,f_2}$.

Here are a couple quick comments to demonstrate that $D_0(X)$ really does have at least the "bare minimum" of expressive power we want for a set-theoretic implementation of an RCF:

  • We have $f_1, f_2subseteq D_0(X)$ (and consequently $f_1,f_2$ are definable subsets of $D_0(X)$ since also $f_1,f_2in D_0(X)$). This is because $A^2subseteq D_0(X)$ and $f_1,f_2subseteq A^2$.

  • We have that $A$ is a definable subset of $D_0(X)$ - e.g. as "The set of left coordinates of elements of $f_1$."

  • We can tell which of $f_1$ and $f_2$ is addition and which is multiplication, by asking which has an annihilator.


Now right away, we can make the following observation. As we go along the $D$-hierarchy, we "accidentally" wind up following the usual construction of $L$. In particular, we have $A^{<omega}subseteq D_omega(X)$. This lets us implement the "natural" definition of $M$ in $D_{omega+1}(X)$: "$M$ is the set of $min A$ such that there is some finite sequence of elements of $A$ whose first term is $1_X$, whose last term is $m$, and whose $(i+1)$th term is the $i$th term $+_X1_X$." This gives us the following:

$alphaleomega+1.$

Can we do better? Well, at least for some presentations we can easily. Specifically, suppose that $$mathcal{P}(A)cap D_1(X)=Def(X),$$ where $Def(X)$ is the set of subsets of $A$ which are definable in the RCF $X$ in the model-theoretic sense. Then by o-minimality of RCF, we have that the following are equivalent for $Uin mathcal{P}(A)cap D_1(X)=Def(X)$:

  • $U$ is discrete, has $1_X$ as its least element, and for each $din U$ with $dnot=1_X$ we have $d-_X1_Xin U$.

  • $U={1cdot 1_X, 2cdot 1_X, ..., ncdot 1_X}$ for some $ninmathbb{N}_{ge 1}$.

This gives us $Min D_2(X)$: we have $min M$ iff there is some $Uin mathcal{P}(A)cap D_1(X)=Def(X)$ satisfying the above two bulletpoints with $min U$. Consequently, we have:

Restricted to "model-theoretically efficient" presentations of RCFs, that is, ones where $D_1(X)$ is "minimal," we have $alpha=2$.

(It's easy to show $alpha>1$.)

Moreover, we can get this unconditionally if $X$ is additionally Archimedean. This is because we can simply add the criterion that $U$ be bounded above and below; the only subsets of $A$ which are bounded above and below, contain $1_X$, and are closed under subtracting $1_X$ from ever non-$1_X$ element are the sets of the form ${1cdot 1_X, 2cdot 1_X, ..., ncdot 1_X}$ for some $ninmathbb{N}$. That is:

If $X$ is Archimedean, then $alpha=2$.

However, we run into a problem if $X$ is non-Archimedean and is presented in such a way that non-definable-in-$X$ subsets of $A$ show up in $D_1(X)$. In general I don't see a way to improve on the $omega+1$ bound.

Conjecture: There is an RCF $X$ whose $alpha$ is exactly $omega+1$.

Answered by Noah Schweber on December 23, 2021

Add your own answers!

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP