The Mouse Set Theorem Just Past Projective

arXiv2302.02581MaRDI QIDQ6425518FDOQ6425518

Publication date: 6 February 2023

Abstract: We identify a particular mouse,

M^{e x t l d}

, the minimal ladder mouse, that sits in the mouse order just past

M_{n}^{s h a r p}

for all

n

, and we show that

m a t h b b R c a p M^{e x t l d} = Q_{o m e g a + 1}

, the set of reals that are

D e l t a_{o m e g a + 1}^{1}

in a countable ordinal. Thus

Q_{o m e g a + 1}

is a mouse set. This is analogous to the fact that

m a t h b b R c a p M_{1}^{s h a r p} = Q_{3}

where

M_{1}^{s h a r p}

is the the sharp for the minimal inner model with a Woodin cardinal, and

Q_{3}

is the set of reals that are

D e l t a_{3}^{1}

in a countable ordinal. More generally

m a t h b b R c a p M_{2 n + 1}^{s h a r p} = Q_{2 n + 3}

. The mouse

M^{e x t l d}

and the set

Q_{o m e g a + 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.

m a t h b b R c a p M^{e x t l d} s u b s e t e q Q_{o m e g a + 1}

was known in the 1990's. But

Q_{o m e g a + 1} s u b s e t e q M^{e x t l d}

was open until Woodin found a proof in 2018. The main goal of this paper is to give Woodin's proof.

Mathematics Subject Classification ID

Descriptive set theory (03E15) Large cardinals (03E55)

This page was built for publication: The Mouse Set Theorem Just Past Projective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425518)