This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

The Second-order Version of Morley’s Theorem on the Number of Countable Models does not Require Large Cardinals

Franklin D. Tall1 University of Toronto, Department of Mathematics, 40 St. George St., Toronto, Ontario, Canada M5S 2E4 [email protected] http://www.math.toronto.edu/tall/  and  Jing Zhang2 University of Toronto, Department of Mathematics, 40 St. George St., Toronto, Ontario, Canada M5S 2E4 [email protected]
Abstract.

The consistency of a second-order version of Morley’s Theorem on the number of countable models was proved in [EHMT23] with the aid of large cardinals. We here dispense with them.

Key words and phrases:
Morley’s theorem, countable models, Cohen forcing, σ\sigma-projective equivalence relations, large cardinals, generic absoluteness.
2020 Mathematics Subject Classification:
Primary 03C85, 03C55, 03E35, 03C52
1 Supported by Natural Sciences and Engineering Research Council Grants RGPIN-2016-06319 and RGPIN-2023-03420
2 Supported by Natural Sciences and Engineering Research Council discovery grants

1. Introduction

Vaught’s Conjecture [12], which asserts that a countable first-order theory must have either at most countably many or exactly 202^{\aleph_{0}} many non-isomorphic countable models, is one of the most important problems in Model Theory. A strong positive result about Vaught’s Conjecture is a result of the late Michael Morley [10] which states that the number of isomorphism classes of countable models of a countable first-order theory is always at most 1\aleph_{1} or exactly 202^{\aleph_{0}}. Under this formulation, the result follows trivially from the continuum hypothesis. To avoid this artifact, one can identify countable models with members of the Cantor set (see [7] or [5]) and prove:

Theorem 1.1 (Absolute Morley).

Let TT be a first-order theory (or more generally, a sentence of Lω1,ωL_{\omega_{1},\omega}) in a countable signature. Then either TT has at most 1\aleph_{1} isomorphism classes of countable models, or there is a perfect set of non-isomorphic countable models of TT.

The isomorphism relation among countable models can be formulated as a 𝚺11\mathbf{\Sigma}_{1}^{1} equivalence relation, using a code for TT as a parameter. It is then easy to see that the following result [3] (see [7]) is a strengthening of the Absolute Morley Theorem:

Theorem 1.2.

Let EE be a 𝚺11\mathbf{\Sigma}_{1}^{1} equivalence relation on \mathbb{R}. If there is no perfect set of pairwise inequivalent reals, then there are at most 1\aleph_{1} equivalence classes.

Second-order logic is the natural generalization of first-order logic to a two-sorted language with variables for relations as well as for individuals. For a precise formulation of its syntax and semantics, see e.g. [5]. We then can formulate:

Second-order Absolute Morley: If TT is a second-order theory in a countable signature, then either TT has at most 1\aleph_{1} isomorphism classes of countable models, or there is a perfect set of (in particular 202^{\aleph_{0}} many) non-isomorphic countable models of TT.

The σ\sigma-projective hierarchy is obtained by extending the projective hierarchy up through the countable ordinals. See [8] and [2]. We can then formulate:

Second-order Absolute Morley for σ\sigma-projective equivalence relations Let EE be a σ\sigma-projective equivalence relation on \mathbb{R}. If there is no perfect set of pairwise EE-inequivalent reals, then EE has at most 1\aleph_{1} equivalence classes.

Note that Second-order Absolute Morley for σ\sigma-projective equivalence relations implies Second-order Absolute Morley. This is done in [5, Section 2.3] by showing that the complexity of the class of reals that code countable models of a given second-order theory is a countable intersection of projective sets, in particular, is σ\sigma-projective.

This motivates the following apparently slightly weaker assertion:

Second-order Absolute Morley for countable intersections of projective sets Let EE be an equivalence relation on \mathbb{R} which is a countable intersection of projective sets. If there is no perfect set of pairwise EE-inequivalent reals, then EE has at most 1\aleph_{1} equivalence classes.

We do not know if Second-order Absolute Morley for countable intersections of projective sets is strictly weaker than Second-order Absolute Morley for σ\sigma-projective equivalence relations.

In [5], the following results are established:

Theorem (Theorem A).

Force over LL by first adding 2\aleph_{2} Cohen reals and then 3\aleph_{3} random reals. In the resulting universe of set theory, 20=32^{\aleph_{0}}=\aleph_{3} but there is a second-order theory TT in a countable signature such that the number of non-isomorphic models of TT is exactly 2\aleph_{2}.

Theorem (Theorem C).

If there are infinitely many Woodin cardinals, then there is a model of set theory in which Second-order Absolute Morley for countable intersections of projective sets holds.

The authors of [5] state as their first problem:

Prove that large cardinals are necessary to prove the consistency of Second-order Absolute Morley.

We shall refute that conjecture here by proving:

Theorem 1.3.

Adjoin at least 2\aleph_{2} Cohen reals to a model of CH\operatorname{CH}. Then Second-order Absolute Morley for σ\sigma-projective equivalence relations holds in the resulting model.

The main idea of both 1.3 and Theorem C occurs in the earlier work [6], in which Foreman and Magidor prove:

Theorem (Theorem B).

In the usual iterated forcing model of PFA\operatorname{PFA} (thus assuming the existence of a supercompact cardinal), if EE is an equivalence relation on \mathbb{R} such that EE is a member of L()L(\mathbb{R}), then EE has either no more than 1\aleph_{1} equivalence classes or else perfectly many equivalence classes.

The key is generic absoluteness. Call an equivalence relation on sets of reals thin if it does not have a perfect set of equivalence classes. Simplifying the argument by considering EE’s definable from a real rr, we note they prove (using the large cardinal) that the formula ϕ\phi that defines EE defines a thin equivalence relation EE^{\prime} in cofinally many intermediate models that contain rr and satisfy CH\mathrm{CH}. This is downwards generic absoluteness. In any of such intermediate models, since CH\operatorname{CH} holds, EE^{\prime} has 1\leq\aleph_{1} equivalence classes. Next they show that the rest of the forcing (after which the formula ϕ\phi defines EE) cannot add a new equivalence class to EE^{\prime} unless EE has perfectly many equivalence classes in the final model. This is upwards generic absoluteness. [5] follows the same approach but with a weaker large cardinal hypothesis. We follow the same approach here, but it turns out that because Cohen real forcing is so simple and homogeneous and because adding one Cohen real by forcing adds perfectly many, we don’t need the large cardinal. This latter observation substitutes for upwards generic absoluteness, and hence no large cardinal is needed for that. If we add 2\aleph_{2} many Cohen reals, then the real that codes the σ\sigma-projective set appears at an initial stage at which CH\operatorname{CH} holds. If we add more than 2\aleph_{2} Cohen reals, we need to apply an automorphism argument to get that without loss of generality, we may assume rr appears in the first ω1\omega_{1} stages. The required downwards generic absoluteness is proved by induction on the complexity of the σ\sigma-projective formulas that define our equivalence relations. A version of our generic absoluteness theorem was proved by Joan Bagaria many years ago with essentially the same proof, but he never published it. We rediscovered it and are not aware of any published reference. Now for the details.

Let us start with the definition of σ\sigma-projective formulas and σ\sigma-projective sets of reals. For the semantics of the infinitary logic ω1,ω\mathcal{L}_{\omega_{1},\omega}, we refer the reader to [9].

Definition 1.4.

Let ϕ\phi be a formula in the language ω1,ω\mathcal{L}_{\omega_{1},\omega}.

  1. (1)

    ϕ\phi is Σ01(x)\Sigma^{1}_{0}(\vec{x}) if it is a disjunction of quantifier-free formulas with no infinite connectives with finitely many free variables x=(x0,,xk1)\vec{x}=(x_{0},\cdots,x_{k-1}) where kωk\in\omega.

  2. (2)

    ϕ\phi is Πα1(x)\Pi^{1}_{\alpha}(\vec{x}) if it is ω1,ω\mathcal{L}_{\omega_{1},\omega}-equivalent to the negation of a Σα1(x)\Sigma^{1}_{\alpha}(\vec{x}) formula.

  3. (3)

    ϕ\phi is Σα+11(x)\Sigma^{1}_{\alpha+1}(\vec{x}) if it is of the form yψ(y,x)\exists y\psi(y,\vec{x}) where ψ(y,x)\psi(y,\vec{x}) is a Σα1(y,x)\Sigma^{1}_{\alpha}(y,\vec{x}) formula.

  4. (4)

    ϕ\phi is Σα1(x)\Sigma^{1}_{\alpha}(\vec{x}) where α<ω1\alpha<\omega_{1} is a limit ordinal, if it is of the form kωϕk\bigvee_{k\in\omega}\phi_{k} where each ϕk\phi_{k} is a Σαk1(x)\Sigma^{1}_{\alpha_{k}}(\vec{x}) formula for some αk<α\alpha_{k}<\alpha.

We say a formula ϕ\phi in the language ω1,ω\mathcal{L}_{\omega_{1},\omega} is σ\sigma-projective if it is Σα1(x)\Sigma^{1}_{\alpha}(\vec{x}) for some α<ω1\alpha<\omega_{1}. Recall that H(ω1)H(\omega_{1}) is the collection of all hereditarily countable sets.

Definition 1.5.

A set of reals AA is Σα1(y)\Sigma^{1}_{\alpha}(\vec{y}) for α<ω1\alpha<\omega_{1} and reals y\vec{y}, if there exists a Σα1(x)\Sigma^{1}_{\alpha}(\vec{x}) formula ϕ(z,x)\phi(z,\vec{x}) such that A={r:H(ω1)ω1,ωϕ(r,y)}A=\{r\in\mathbb{R}:H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\phi(r,\vec{y})\}.

We say AA is σ\sigma-projective if there is an α<ω1\alpha<\omega_{1} and a finite tuple of reals y\vec{y} such that AA is Σα1(y)\Sigma^{1}_{\alpha}(\vec{y}). It is not hard to see that the collection of σ\sigma-projective sets is exactly the smallest σ\sigma-algebra on \mathbb{R} containing the open sets and closed under continuous images. We refer the reader to [2] and [1] for more information. In what follows, for cardinals α,β\alpha,\beta, Add(α,β)Add(\alpha,\beta) is the standard Cohen poset for adding β\beta many Cohen subsets of α\alpha. Namely, conditions are partial functions from β2\beta\to 2 with domain of size <α<\alpha, ordered by inclusion.

Lemma 1.6.

For any cardinals λ,κ\lambda,\kappa, the following is true in VAdd(ω,ω1)×Add(ω,λ)V^{Add(\omega,\omega_{1})\times Add(\omega,\lambda)}: for any σ\sigma-projective formula φ(x¯)\varphi(\bar{x}) and any a¯|x¯|\bar{a}\in\mathbb{R}^{|\bar{x}|}

H(ω1)ω1,ωφ(a¯) if and only if Add(ω,κ)``H(ω1)ω1,ωφ(a¯)".H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\varphi(\bar{a})\text{ if and only if }\Vdash_{Add(\omega,\kappa)}``H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\varphi(\bar{a})".
Remark 1.7.

Since all the ω1,ω\mathcal{L}_{\omega_{1},\omega}-formulas we consider use real parameters and all the quantifiers are bounded by the set of real numbers, they are absolute between VV and H(ω1)H(\omega_{1}), since the latter contains all reals and is closed under countable sequences.

Proof.

We induct on the complexity of the formulas. Observe that the homogeneity of Cohen forcing implies that if for some pp, pAdd(ω,κ)H(ω1)ω1,ωφ(a¯)p\Vdash_{Add(\omega,\kappa)}H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\varphi(\bar{a}), then Add(ω,κ)H(ω1)ω1,ωφ(a¯)\Vdash_{Add(\omega,\kappa)}H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\varphi(\bar{a}). In particular, this means if we have proved the result for 𝚺ξ1\mathbf{\Sigma}^{1}_{\xi} formulas, then we get the result for 𝚷ξ1\mathbf{\Pi}^{1}_{\xi} formulas immediately.

Suppose we have proved the theorem for all formulas that are 𝚺ν1\mathbf{\Sigma}^{1}_{\nu} for ν<ξ<ω1\nu<\xi<\omega_{1} and ξ\xi is a limit, then φ(x¯)\varphi(\bar{x}) is of the form n{ψn(x¯):ψn𝚺ξn1}\bigvee_{n}\{\psi_{n}(\bar{x}):\psi_{n}\in\mathbf{\Sigma}^{1}_{\xi_{n}}\} for a sequence ξn<ξ:nω\langle\xi_{n}<\xi:n\in\omega\rangle. Let G×HAdd(ω,ω1)×Add(ω,λ)G\times H\subseteq Add(\omega,\omega_{1})\times Add(\omega,\lambda). In V[G×H]V[G\times H], suppose H(ω1)ω1,ωφ(a¯)H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\varphi(\bar{a}), equivalently, there is an nωn\in\omega, H(ω1)ω1,ωψn(a¯)H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\psi_{n}(\bar{a}). By the induction hypothesis, we know that Add(ω,κ)H(ω1)ω1,ωψn(a¯)\Vdash_{Add(\omega,\kappa)}H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\psi_{n}(\bar{a}). As a result, Add(ω,κ)H(ω1)ω1,ωφ(a¯)\Vdash_{Add(\omega,\kappa)}H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\varphi(\bar{a}). A similar argument shows that if H(ω1)ω1,ω¬φ(a¯)H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\neg\varphi(\bar{a}), then Add(ω,κ)H(ω1)ω1,ω¬φ(a¯)\Vdash_{Add(\omega,\kappa)}H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\neg\varphi(\bar{a}).

Suppose we have proved the theorem for 𝚺ξ1\mathbf{\Sigma}_{\xi}^{1}-formulas for ξ<ω1\xi<\omega_{1}. Let xψ(x,y¯)\exists x\psi(x,\bar{y}) be a 𝚺ξ+11\mathbf{\Sigma}_{\xi+1}^{1}-formula. Suppose

V[G×H]Add(ω,κ)``H(ω1)ω1,ωφ(a¯)",V[G\times H]^{Add(\omega,\kappa)}\models``H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\varphi(\bar{a})",

where a¯V[G×H]\bar{a}\in V[G\times H]. Given (p,q)P=defAdd(ω,ω1)×Add(ω,λ)(p,q)\in P=_{def}Add(\omega,\omega_{1})\times Add(\omega,\lambda) and x˙\dot{x} a P×Add(ω,κ)P\times Add(\omega,\kappa)-name and a¯˙,φ˙\dot{\bar{a}},\dot{\varphi} PP-names such that (p,q)(p,q) forces the above holds for the respective names, find α<ω1,Aλ,Bκ\alpha<\omega_{1},A\subseteq\lambda,B\subseteq\kappa countable such that these conditions and names are in Add(ω,α)×Add(ω,A)×Add(ω,B)Add(\omega,\alpha)\times Add(\omega,A)\times Add(\omega,B) or are Add(ω,α)×Add(ω,A)×Add(ω,B)Add(\omega,\alpha)\times Add(\omega,A)\times Add(\omega,B)-names.

Define an automorphism π\pi on P×Add(ω,κ)P\times Add(\omega,\kappa) as follows: π(r,s,t)=(r,s,t)\pi(r,s,t)=(r^{*},s^{*},t^{*}) if and only if

  1. (1)

    rω1[α,α+otp(B))=rω1[α,α+otp(B))r\restriction\omega_{1}-[\alpha,\alpha+otp(B))=r^{*}\restriction\omega_{1}-[\alpha,\alpha+otp(B)), s=ss=s^{*},

  2. (2)

    r(α+i)=t(i)r^{*}(\alpha+i)=t(i), t(i)=r(α+i)t^{*}(i)=r(\alpha+i) for all iBi\in B,

  3. (3)

    tκB=tκBt^{*}\restriction\kappa-B=t\restriction\kappa-B.

In particular, π\pi fixes (p,q)(p,q), a¯˙\dot{\bar{a}} and φ˙\dot{\varphi}. Therefore, (p,q,)P×Add(ω,κ)ψ(π(x˙),a¯˙)(p,q,\emptyset)\Vdash_{P\times Add(\omega,\kappa)}\psi(\pi(\dot{x}),\dot{\bar{a}}).

Let G×H×RP×Add(ω,κ)G\times H\times R\subseteq P\times Add(\omega,\kappa) be generic containing (p,q,)(p,q,\emptyset). Then we know that V[G×H×R]H(ω1)ω1,ωψ((π(x˙)G×H×R),a¯)V[G\times H\times R]\models H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\psi((\pi(\dot{x})^{G\times H\times R}),\bar{a}). Let x=π(x˙)G×H×Rx^{*}=\pi(\dot{x})^{G\times H\times R}. By the definition of π\pi, we know that π(x˙)\pi(\dot{x}) is an Add(ω,ω1)×Add(ω,λ)Add(\omega,\omega_{1})\times Add(\omega,\lambda)-name, in particular, xV[G×H]x^{*}\in V[G\times H]. By the induction hypothesis, we know that V[G×H×R]H(ω1)ω1,ωψ(x,a¯)V[G\times H\times R]\models H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\psi(x^{*},\bar{a}) if and only if V[G×H]H(ω1)ω1,ωψ(x,a¯)V[G\times H]\models H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\psi(x^{*},\bar{a}). Therefore, V[G×H]H(ω1)ω1,ωxψ(x,a¯)V[G\times H]\models H(\omega_{1})\models_{\mathcal{L}_{\omega_{1},\omega}}\exists x\psi(x,\bar{a}), as desired. ∎

Remark 1.8.

The result holds in a more general context, namely, after adding 1\aleph_{1} many Cohen reals, there exists an elementary embedding j:(L())V(L())V[G]j:(L(\mathbb{R}))^{V}\to(L(\mathbb{R}))^{V[G]} that is identity on the ordinals where GG is any further Cohen extension. In particular, all ω1,ω\mathcal{L}_{\omega_{1},\omega} sentences with reals and ordinals as parameters are absolute between L()L(\mathbb{R}) and (L())V[G](L(\mathbb{R}))^{V[G]}. This was known to Bagaria and probably others. The proof we supply is only for what we need.

Lemma 1.9.

For any λω1\lambda\geq\omega_{1}, the following holds in VAdd(ω,λ)V^{Add(\omega,\lambda)}: let EE be a σ\sigma-projective equivalence relation; if Add(ω,1)``σ\Vdash_{Add(\omega,1)}``\exists\sigma\in\mathbb{R} such that for all rVr\in V, ¬(σEr)\neg(\sigma Er)”, then Add(ω,1)\Vdash_{Add(\omega,1)} there exist perfectly many EE-classes.

Proof.

Let σ˙\dot{\sigma} be an Add(ω,1)Add(\omega,1)-name such that Add(ω,1)``¬σ˙Er\Vdash_{Add(\omega,1)}``\neg\dot{\sigma}Er for any rVr\in V”.

Claim 1.

Add(ω,1)×Add(ω,1)¬σ˙leftEσ˙right\Vdash_{Add(\omega,1)\times Add(\omega,1)}\neg\dot{\sigma}_{\mathrm{left}}E\dot{\sigma}_{\mathrm{right}}, where σ˙left\dot{\sigma}_{\mathrm{left}} (σ˙right\dot{\sigma}_{\mathrm{right}}) is the name σ˙\dot{\sigma} produced from the left (right) generic.

Proof of the Claim.

For notational simplicity, let σ˙0=σ˙left\dot{\sigma}_{0}=\dot{\sigma}_{\mathrm{left}} and σ˙1=σ˙right\dot{\sigma}_{1}=\dot{\sigma}_{\mathrm{right}}. Suppose otherwise, let (p,s,t)Add(ω,λ)×Add(ω,1)×Add(ω,1)(p,s,t)\in Add(\omega,\lambda)\times Add(\omega,1)\times Add(\omega,1) force that σ˙0Eσ˙1\dot{\sigma}_{0}E\dot{\sigma}_{1} and ¬σ˙iEr\neg\dot{\sigma}_{i}Er for any rVAdd(ω,λ)r\in V^{Add(\omega,\lambda)}, where i=0,1i=0,1. Let AλA\subseteq\lambda be countable such that pAdd(ω,A)p\in Add(\omega,A) and E˙\dot{E} is an Add(ω,A)Add(\omega,A)-name. More precisely, the defining formula and the parameters of EE are Add(ω,A)Add(\omega,A)-names. Fix some γλA\gamma\in\lambda-A. Consider the following automorphism π\pi on Add(ω,λ)×Add(ω,1)×Add(ω,1)Add(\omega,\lambda)\times Add(\omega,1)\times Add(\omega,1): π(a,b,c)=(a,b,c)\pi(a,b,c)=(a^{*},b^{*},c^{*}) where

  • aλ{γ}=aλ{γ}a\restriction\lambda-\{\gamma\}=a^{*}\restriction\lambda-\{\gamma\},

  • a(γ)=ba^{*}(\gamma)=b,

  • b=a(γ)b^{*}=a(\gamma),

  • c=cc=c^{*}.

Hence, π(p,s,t)π(σ˙0)π(E˙)π(σ˙1)\pi(p,s,t)\Vdash\pi(\dot{\sigma}_{0})\pi(\dot{E})\pi(\dot{\sigma}_{1}). By the definition of π\pi, we know that π(p,s,t)\pi(p,s,t) is compatible with (p,s,t)(p,s,t), π(E˙)=E˙\pi(\dot{E})=\dot{E}, π(σ˙1)=σ˙1\pi(\dot{\sigma}_{1})=\dot{\sigma}_{1} and π(σ˙0)\pi(\dot{\sigma}_{0}) is an Add(ω,λ)Add(\omega,\lambda)-name. Let G×g0×g1Add(ω,λ)×Add(ω,1)×Add(ω,1)G\times g_{0}\times g_{1}\subseteq Add(\omega,\lambda)\times Add(\omega,1)\times Add(\omega,1) be generic containing both (p,s,t)(p,s,t) and π(p,s,t)\pi(p,s,t). Then in the generic extension we have that σEσ1\sigma^{*}E\sigma_{1} where σ=(π(σ˙0))G×g0×g1V[G]\sigma^{*}=(\pi(\dot{\sigma}_{0}))^{G\times g_{0}\times g_{1}}\in V[G], since π(σ˙0)\pi(\dot{\sigma}_{0}) is an Add(ω,λ)Add(\omega,\lambda)-name. However, as (p,s,t)G×g0×g1(p,s,t)\in G\times g_{0}\times g_{1}, we have that ¬(σEσ1)\neg(\sigma^{*}E\sigma_{1}), which is a contradiction. ∎

Let V=V[G]V^{*}=V[G] where GAdd(ω,λ)G\subseteq Add(\omega,\lambda) is generic over VV. Work in VV^{*}.

Consider the following forcing QQ: pQp\in Q if and only if p:2nAdd(ω,1)p:2^{\leq n}\to Add(\omega,1) for some nωn\in\omega such that

  • for each s2ns\in 2^{\leq n}, there is some ksωk_{s}\in\omega such that p(s)σ˙ks=τsp(s)\Vdash\dot{\sigma}\restriction k_{s}=\tau_{s},

  • for ss2ms\neq s^{\prime}\in 2^{m} and mnm\leq n, τsτs\tau_{s}\perp\tau_{s^{\prime}}, namely τsτs\tau_{s}\cup\tau_{s^{\prime}} is not a function.

  • for ss2ns\sqsubseteq s^{\prime}\in 2^{\leq n}, p(s)p(s)p(s^{\prime})\leq p(s) and τsτs\tau_{s^{\prime}}\sqsupset\tau_{s}, namely τs\tau_{s} is a proper initial segment of τs\tau_{s^{\prime}}.

The order of QQ is inclusion. Since QQ is a non-trivial countable forcing, QQ is forcing-equivalent to Add(ω,1)Add(\omega,1). Let TQT\subseteq Q be generic over VV^{*}. In V[T]V^{*}[T], an easy density argument shows that TT is a perfect subtree of 2<ω2^{<\omega} and the branches of TT are mutually generic Cohen reals over VV^{*}. Consider {σb:b[T]}\{\sigma_{b}:b\in[T]\}. By Claim 1, we know that if bb[T]b\neq b^{\prime}\in[T], then in V[b,b]V^{*}[b,b^{\prime}], ¬σbEσb\neg\sigma_{b}E\sigma_{b^{\prime}}. By Lemma 1.6, in V[T]V^{*}[T], ¬σbEσb\neg\sigma_{b}E\sigma_{b^{\prime}}. It remains to see that {σb:b[T]}\{\sigma_{b}:b\in[T]\} is a perfect set. This is the case since σb=sbτs\sigma_{b}=\bigcup_{s\sqsubseteq b}\tau_{s} for any b[T]b\in[T]. ∎

Theorem 1.10.

Fix a regular cardinal κω2\kappa\geq\omega_{2}. Over a model of CH, Add(ω,κ)\Vdash_{Add(\omega,\kappa)} every σ\sigma-projective equivalence relation either has 1\leq\aleph_{1} or perfectly many equivalence classes.

Proof.

Let pAdd(ω,κ)p\in Add(\omega,\kappa) and let E˙\dot{E} be a name for a thin σ\sigma-projective equivalence relation, namely, the σ\sigma-projective formula along with the parameters that define it. Since the σ\sigma-projective formula and the parameters are essentially countable, there exists AκA\subseteq\kappa such that ω1A\omega_{1}\subseteq A and |A|=1|A|=\aleph_{1} such that pAdd(ω,A)p\in Add(\omega,A) and E˙\dot{E} is an Add(ω,A)Add(\omega,A)-name. By Lemma 1.6, we know that pAdd(ω,A)E˙p\Vdash_{Add(\omega,A)}\dot{E} is thin. Indeed, if some extension qq of pp forces that E˙\dot{E} is not thin, then Lemma 1.6 implies that E˙\dot{E} is not thin in VAdd(ω,κ)V^{Add(\omega,\kappa)}, which is impossible.

Claim 1.

In VAdd(ω,A)V^{Add(\omega,A)}, Add(ω,1)\Vdash_{Add(\omega,1)} “for any σ\sigma\in\mathbb{R}, there is an rVr\in V such that σEr\sigma Er”.

Proof of the Claim.

Otherwise, there is a p``σp\Vdash``\exists\sigma\in\mathbb{R} such that ¬(σEr)\neg(\sigma Er) for any rVr\in V”. By the homogeneity of Cohen forcing, we have ``σ\Vdash``\exists\sigma\in\mathbb{R} such that ¬(σEr)\neg(\sigma Er) for any rVr\in V”. By Lemme 1.9, we know that Add(ω,1)\Vdash_{Add(\omega,1)} “there exist perfectly many EE-classes”. By Lemma 1.6, Add(ω,κ)\Vdash_{Add(\omega,\kappa)} “there exist perfectly many EE-classes”, contradicting the assumption on the thinness of EE. ∎

Consequently, Claim 1 implies that in VAdd(ω,A)V^{Add(\omega,A)}, Add(ω,κA)\Vdash_{Add(\omega,\kappa-A)} “for any σ\sigma\in\mathbb{R}, there is an rVr\in V such that σEr\sigma Er”. Since VAdd(ω,A)V^{Add(\omega,A)} is a model of CH, we have that the number of EE-classes in VAdd(ω,κ)V^{Add(\omega,\kappa)} is 1\leq\aleph_{1}. ∎

We conclude the paper with some observations that the Second-order Absolute Morley in general is strictly stronger than its non-absolute version.

Second-order Morley: If TT is a second-order theory in a countable signature, then either TT has at most 1\aleph_{1} isomorphism classes of countable models, or there are 202^{\aleph_{0}} many non-isomorphic countable models of TT.

If 20=22^{\aleph_{0}}=\aleph_{2}, Second-order Morley trivially holds. Although Second-order Absolute Morley holds in the Cohen model, Second-order Morley does not imply Second-order Absolute Morley in general.

Lemma 1.11.

Second-order Absolute Morley implies that for any light-face projective set AA, either AA has size 1\leq\aleph_{1} or AA includes a perfect set.

Proof.

The proof is similar to that of Lemma 3.1 in [5], adapted to the “absolute” scenario. Therefore, we will only sketch the proof. The second-order theory TT considered here is second-order Peano Arithmetic with an additional unary predicate RR. Let \mathcal{L} be the natural language for this. Intuitively speaking, this predicate is coding a real that belongs to AA. Namely, our model will be of the form of 𝒜=(ω,+,,<,0,1,R𝒜)\mathcal{A}=(\omega,+,\cdot,<,0,1,R^{\mathcal{A}}) with R𝒜AR^{\mathcal{A}}\in A. There is a natural translation of a projective formula ψ\psi to a second-order \mathcal{L}-formula ψ\psi^{\mathcal{L}} that is truth-preserving (see [11, 8B.15] for more information). In particular, if φ(x)\varphi(x) is a projective definition of AA, then the requirement that R𝒜AR^{\mathcal{A}}\in A can be expressed as 𝒜``Y((n(nYnR))φ(Y))\mathcal{A}\models``\exists Y((\forall n(n\in Y\leftrightarrow n\in R))\wedge\varphi^{\mathcal{L}}(Y))”. As a result, the above procedure describes a second-order theory TT in the language \mathcal{L} such that any 𝒜T\mathcal{A}\models T, R𝒜AR^{\mathcal{A}}\in A. Note that for any 𝒜0,𝒜1ModT\mathcal{A}_{0},\mathcal{A}_{1}\in Mod_{T} (namely, the collection of models for the theory TT), 𝒜0𝒜1\mathcal{A}_{0}\cong\mathcal{A}_{1} if and only if R𝒜0=R𝒜1R^{\mathcal{A}_{0}}=R^{\mathcal{A}_{1}}. Also the natural product topology on ModTMod_{T} is generated by Uσ={𝒜ModT:σR𝒜}U_{\sigma}=\{\mathcal{A}\in Mod_{T}:\sigma\sqsubset R^{\mathcal{A}}\} for σ2<ω\sigma\in 2^{<\omega}.

Assume that |A|>1|A|>\aleph_{1}. Apply Second-order Absolute Morley. By the assumption that |A|>1|A|>\aleph_{1}, ModTMod_{T} must contain more than 1\aleph_{1} many non-isomorphic models. In particular, there is a continuous injection π:2ωModT\pi^{\prime}:2^{\omega}\to Mod_{T} such that the images of π\pi^{\prime} are pairwise non-isomorphic. Let π:2ωA\pi:2^{\omega}\to A be defined on 2ω2^{\omega} such that π(σ)=Rπ(σ)\pi(\sigma)=R^{\pi^{\prime}(\sigma)}. We check that π\pi is a continuous injection. The fact that π\pi is an injection follows from the fact that for σ0σ1\sigma_{0}\neq\sigma_{1}, π(σ0)≄π(σ1)\pi^{\prime}(\sigma_{0})\not\simeq\pi^{\prime}(\sigma_{1}), which implies Rπ(σ0)Rπ(σ1)R^{\pi^{\prime}(\sigma_{0})}\neq R^{\pi^{\prime}(\sigma_{1})}. For any basic open set [σ]A=def{gA:σg}[\sigma]_{A}=_{def}\{g\in A:\sigma\sqsubset g\} where σ2<ω\sigma\in 2^{<\omega} and fπ1([σ]A)f\in\pi^{-1}([\sigma]_{A}), since π\pi^{\prime} is continuous and f(π)1(Uσ)f\in(\pi^{\prime})^{-1}(U_{\sigma}), there is some τ2<ω\tau\in 2^{<\omega} such that f[τ]=def{g2ω:τg}(τ)1(Uσ)f\in[\tau]=_{def}\{g\in 2^{\omega}:\tau\sqsubset g\}\subset(\tau^{\prime})^{-1}(U_{\sigma}). For any h[τ]h\in[\tau], π(h)=Rπ(f)σ\pi(h)=R^{\pi^{\prime}(f)}\sqsupset\sigma. As a result, f[τ]π1([σ]A)f\in[\tau]\subset\pi^{-1}([\sigma]_{A}). Hence π\pi is continuous.

Remark 1.12.

The proof above still works if AA is bold-face. In this case we just need to add a unary predicate for each of the real parameters in the definition of AA.

Theorem 1.13.

There is a model of ZFC\operatorname{ZFC} in which 20=22^{\aleph_{0}}=\aleph_{2} and in which there is a projective equivalence relation on \mathbb{R} which has 202^{\aleph_{0}}-many equivalence classes but does not have a perfect set of equivalence classes.

Proof.

It is well-known that it is consistent that there is a light-face projective well order of the reals and 20=22^{\aleph_{0}}=\aleph_{2} (see [4]). We use a projective well order of the reals to produce a projective set witnessing the failure of Lemma 1.11. More precisely, we will construct a projective Bernstein set BB, i.e. such that neither BB nor B\mathbb{R}\setminus B includes a perfect set. In detail, let \preceq be the projective well order. Recursively coding pairs of reals as reals, \preceq induces a projective well order on pairs of reals that we will also call \preceq. For each real, we can ask if it codes a perfect subtree of 2<ω2^{<\omega} by some recursive bijection between ω\omega and 2<ω2^{<\omega}. Define f:2f:\mathbb{R}\to\mathbb{R}^{2} such that f(x)=yx,zxf(x)=\langle y_{x},z_{x}\rangle if:

  1. 1)

    for any xxx^{\prime}\prec x, yxy_{x} and zxz_{x} are not equal to either yxy_{x^{\prime}} or zxz_{x^{\prime}},

  2. 2)

    if xx codes a perfect subtree TxT_{x} of 2<ω2^{<\omega}, then yxy_{x} and zxz_{x} are different branches through TxT_{x}, the tree determined by xx,

  3. 3)

    yx,zx\langle y_{x},z_{x}\rangle is the \preceq-least pair satisfying 1) and 2).

Since \preceq is projective, so is ff. Let

B={y:xz(f(x)=y,z)}.B=\{y\,:\,\exists x\exists z(f(x)=\langle y,z\rangle)\}.

Then y=yxBy=y_{x}\in B implies zxBz_{x}\notin B.

Then BB is projective since ff is. However we claim that neither BB nor B\mathbb{R}\setminus B includes a perfect set, for if such a perfect set PP were realized as a perfect TxT_{x}, then yxy_{x} would be in BB and zxz_{x} would be in B\mathbb{R}\setminus B, yet both are in PP. ∎

2. Acknowledgment

We thank the referee for their comments, suggestions and corrections that greatly improve the quality of this paper.

References

  • [1] J. Aguilera, σ\sigma-projective Determinacy, preprint, https://www.dropbox.com/s/g853hj5ern1kkyb/SPReversal.pdf?dl=0.
  • [2] J. P. Aguilera, S. Müller, and P. Schlicht, Long games and σ\sigma-projective sets, Annals of Pure and Applied Logic 172 (2021), 102939.
  • [3] J. Burgess, Infinitary languages and descriptive set theory, Ph.D. thesis, University of California at Berkeley, Berkeley, California, 1974.
  • [4] Andrés Eduardo Caicedo and Ralf Schindler, Projective well-orderings of the reals, Arch. Math. Logic 45 (2006), no. 7, 783–793. MR 2266903
  • [5] Christopher J. Eagle, Clovis Hamel, Sandra Müller, and Franklin D. Tall, An undecidable extension of Morley’s theorem on the number of countable models, Ann. Pure Appl. Logic 174 (2023), no. 9, Paper No. 103317, 25. MR 4617948
  • [6] M. Foreman and M. Magidor, Large cardinals and definable counterexamples to the continuum hypothesis, Annals of Pure and Applied Logic 76 (1995), no. 1, 47–97.
  • [7] S. Gao, Invariant descriptive set theory, Chapman and Hall/CRC, New York, 2008.
  • [8] A.   S. Kechris, Classical descriptive set theory, Springer-Verlag, New York, 1995.
  • [9] David Marker, Lectures on infinitary model theory, Lecture Notes in Logic, vol. 46, Association for Symbolic Logic, Chicago, IL; Cambridge University Press, Cambridge, 2016. MR 3558585
  • [10] M. Morley, The number of countable models, J. Symb. Logic 35 (1970), 14–18.
  • [11] Y.N. Moschovakis, Descriptive set theory, Mathematical Surveys and Monographs, vol. 155, American Mathematical Society, Providence, R.I., 2009.
  • [12] R. Vaught, Denumerable models of complete theories, Proc. Sympos. Foundations of Mathematics, Infinitistic Methods (Warsaw), Pergamon Press, 1961, pp. 303–321.