8
$\begingroup$

Throughout, we work in $\mathsf{ZFC+V=L+}$ "There is a weakly compact cardinal," $\kappa$ is the first weakly compact cardinal and "tree" means "subtree of $2^{<\kappa}$ of height $\kappa$"


Despite the weak compactness of $\kappa$ "in reality" the model $L_\kappa$ does not satisfy "$\mathsf{Ord}$ is weakly compact;" see Enayat/Hamkins. On the other hand, by true weak compactness of $\kappa$, there is some $\lambda>\kappa$ such that every tree $T$ in $L_{\kappa+1}$ has a path in $L_\lambda$.

What is the least such $\lambda$?

More generally, what is the function $\kappa^+\setminus\kappa\rightarrow\kappa^+$ sending each $\alpha\in[\kappa+1,\kappa^+)$ to the least $\lambda$ such that every subtree of $2^{<\kappa}$ in $L_\alpha$ has a path in $L_\lambda$?

$\endgroup$
16
  • 1
    $\begingroup$ Very nice question! My result with Enayat is about definable class trees and definable paths, so it only rules out $\lambda=\kappa+1$ as not large enough. It could be that the paths come right away after that, or perhaps one must wait a long time, but I'm just not sure. $\endgroup$ Commented Nov 11 at 5:15
  • 1
    $\begingroup$ A silly upper bound is the least ordinal $\delta$ greater than $\kappa$ such that $L_\delta \prec_{\Sigma_1} L_{\kappa^+}$. (The given $\kappa$-tree $T$ is definable over $L_\kappa$, so we can state 'if $T$ is a $\kappa$-tree then it has an infinite branch' as a $\Sigma^1_1$-statement over $L_\kappa$.) I am unsure if it is optimal. $\endgroup$
    – Hanul Jeon
    Commented Nov 11 at 6:48
  • 1
    $\begingroup$ Is there anything known about the "case" $\kappa=\omega$? It seems plausible to me that there are definable trees on $\omega$ where one has to wait until $L_{\omega_1^{ck}}$ or so for a branch. $\endgroup$ Commented Nov 11 at 13:57
  • 1
    $\begingroup$ @MihaHabič Note that my trees are $2$-branching. Branches through $2^{<\omega}$ trees arrive in $L_{\omega+1}$ by the low basis theorem. If we shift to $\omega^{<\omega}$, then indeed we get trees whose branches arrive arbitrarily late in $L_{\omega_1^{CK}}$ (since otherwise the set of computable ill-founded trees on $\omega$ would be hyperarithmetic), but that's a different setup from my question. $\endgroup$ Commented Nov 11 at 14:19
  • 1
    $\begingroup$ Actually it's strictly less than the less $\Sigma_1$-elementary level, because it's a $\Sigma_1$ statement about the parameter $\kappa$ to say "there is some $\alpha>\kappa$ such that in $L_\alpha$, every $\kappa$-tree which is definable from parameters over $L_\kappa$ has a $\kappa$-branch in $L_\alpha$", and therefore there is some such $\alpha<$ the $\Sigma_1$-elementary level. $\endgroup$
    – Farmer S
    Commented Nov 11 at 23:14

1 Answer 1

9
$\begingroup$

Here is a characterization of $\lambda$, but of course your question is somewhat ambiguous as to what counts as an answer.

For $n<\omega$, let $\alpha_n$ be the least ordinal $\alpha$ such that $\kappa<\alpha$ and $L_\kappa\preccurlyeq_n L_\alpha$. (This exists by weak compactness.) Then $\lambda=\sup_{n<\omega}\alpha_n$.

Proof: To see $\lambda\leq\sup_{n<\omega}\alpha_n$, let $T$ be a $\kappa$-tree which is $\Sigma_m$-definable from parameters over $L_\kappa$. Let $T'$ be the interpretation of such a definition of $T$, over $L_{\alpha_{m+3}}$. Then $T'\cap L_\kappa=T$, and $T'$ has nodes at level $\kappa$, and these give a $\kappa$-branch through $T$, hence in $L_{\alpha_{m+3}}\subseteq L_\lambda$.

To see the converse, fix $n$. Define the natural $\kappa$-tree over $L_\kappa$, searching for a wellfounded model $M$ such that $L_\kappa\preccurlyeq_n M$. This is definable over $L_\kappa$, at roughly $\Sigma_{n+3}$ or so (without using parameters). (At height $\eta<\kappa$ in the tree, where $\eta$ is a reasonably closed limit ordinal, we would have built the restriction $M\upharpoonright\eta$ of the planned eventual model $M$ on elements given by ordinals $<\eta$, and specified its $\Sigma_n$-theory on those elements, and would have also produced some isomorphism between $L_\eta$ and some $\in$-intitial segment of $M\upharpoonright\eta$ (and this must remain an $\in$-initial segment from this node onward). The $\Sigma_n$-theory in $L_\kappa$ of elements of $L_\eta$ must match that of their images in $M\upharpoonright\eta$. Whenever we specify an existential statement in the theory in one of these nodes (of height $\eta$), it must be witnessed in the same node with some element $<\eta$. (That is, if the node specifies the formula $\exists x\ \varphi(x,\vec{p})$, then there must be some $\alpha<\eta$ such that it also specifies $\varphi(\alpha,\vec{p})$.) We also demand that $M\upharpoonright\eta$ is wellfounded; any $\kappa$-branch will then give a wellfounded model, since $\kappa$ is inaccessible.)

Now just note that from a $\kappa$-branch through $T_n$, if $M$ is the corresponding model, then $M=L_\alpha$ for some $\alpha>\kappa$ such that $L_\kappa\preccurlyeq_n L_\alpha$. But we can't have such a branch $\in L_{\alpha_n}$, since we can't have such an $M\in L_{\alpha_n}$, since otherwise $L_{\alpha_n}$ could compute the Mostowski collapse of $M$ and that would give $\alpha<\alpha_n$, a contradiction. (But we get a branch through $T_n$ definable over $L_{\alpha_n}$, since there is a surjection $\kappa\to L_{\alpha_n}$ definable over $L_{\alpha_n}$.) So $\lambda\geq\sup_{n<\omega}\alpha_n$.

$\endgroup$
4
  • 1
    $\begingroup$ And this argument has an affinity with the argument in my result with Enayat, where a similar underlying order is used. $\endgroup$ Commented Nov 12 at 0:17
  • 2
    $\begingroup$ This is great! (I've heard this called a "Welch-style characterization," incidentally, if I'm not misusing the term; @JoelDavidHamkins?) $\endgroup$ Commented Nov 12 at 0:31
  • $\begingroup$ I haven't heard that, but it makes sense, in light of arguments I've heard from Philip. $\endgroup$ Commented Nov 12 at 0:39
  • 4
    $\begingroup$ @JoelDavidHamkins Hang on ... :P $\endgroup$ Commented Nov 12 at 1:57

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .