English

The Mouse Set Theorem Just Past Projective

Logic 2023-10-24 v2

Abstract

We identify a particular mouse, MldM^{\text{ld}}, the minimal ladder mouse, that sits in the mouse order just past MnM_n^{\sharp} for all nn, and we show that RMld=Qω+1\mathbb{R}\cap M^{\text{ld}} = Q_{\omega+1}, the set of reals that are Δω+11\Delta^1_{\omega+1} in a countable ordinal. Thus Qω+1Q_{\omega+1} is a mouse set. This is analogous to the fact that RM1=Q3\mathbb{R}\cap M^{\sharp}_1 = Q_3 where M1M^{\sharp}_1 is the the sharp for the minimal inner model with a Woodin cardinal, and Q3Q_3 is the set of reals that are Δ31\Delta^1_3 in a countable ordinal. More generally RM2n+1=Q2n+3\mathbb{R}\cap M^{\sharp}_{2n+1} = Q_{2n+3}. The mouse MldM^{\text{ld}} and the set Qω+1Q_{\omega+1} compose the next natural pair to consider in this series of results. Thus we are proving the mouse set theorem just past projective. Some of this is not new. RMldQω+1\mathbb{R}\cap M^{\text{ld}} \subseteq Q_{\omega+1} was known in the 1990's. But Qω+1MldQ_{\omega+1} \subseteq M^{\text{ld}} was open until Woodin found a proof in 2018. The main goal of this paper is to give Woodin's proof.

Cite

@article{arxiv.2302.02581,
  title  = {The Mouse Set Theorem Just Past Projective},
  author = {Mitch Rudominer},
  journal= {arXiv preprint arXiv:2302.02581},
  year   = {2023}
}

Comments

30 pages

R2 v1 2026-06-28T08:32:40.316Z