Table of Contents
Fetching ...

On a Conjecture Regarding the Mouse Order for Weasels

Jan Kruschewski, Farmer Schlutzenberg

Abstract

We investigate Steel's conjecture in 'The Core Model Iterability Problem', that if $W$ and $R$ are $Ω+1$-iterable, $1$-small weasels, then $W\leq^{*}R$ iff there is a club $C\subsetΩ$ such that for all $α\in C$, if $α$ is regular, then the cardinal successor of $α$ in $W$ is less or equal than the cardinal successor of $α$ in $R$ . We will show that the conjecture fails, assuming that there is an iterable premouse which models $KP$ and which has a $Σ_{1}$-Woodin cardinal. On the other hand, we show that assuming there is no transitive model of $KP$ with a Woodin cardinal the conjecture holds. In the course of this we will also show that if $M$ is an iterable admissible premouse with a largest, regular, uncountable cardinal $δ$, and $\mathbb{P}$ is a forcing poset with the $δ$-c.c. in $M$, and $g$ is $M$-generic, but not necessarily $Σ_{1}$-generic, $M[g]$ is a model of $KP$. Moreover, if $M$ is such a mouse and $T$ is maximal normal iteration tree on $M$ such that $T$ is non-dropping on its main branch, then $M_{\infty}^{T}$ is again an iterable admissible premouse with a largest regular and uncountable cardinal. At last we answer another open question from 'The Core Model Iterability Problem' regarding the S-hull property.

On a Conjecture Regarding the Mouse Order for Weasels

Abstract

We investigate Steel's conjecture in 'The Core Model Iterability Problem', that if and are -iterable, -small weasels, then iff there is a club such that for all , if is regular, then the cardinal successor of in is less or equal than the cardinal successor of in . We will show that the conjecture fails, assuming that there is an iterable premouse which models and which has a -Woodin cardinal. On the other hand, we show that assuming there is no transitive model of with a Woodin cardinal the conjecture holds. In the course of this we will also show that if is an iterable admissible premouse with a largest, regular, uncountable cardinal , and is a forcing poset with the -c.c. in , and is -generic, but not necessarily -generic, is a model of . Moreover, if is such a mouse and is maximal normal iteration tree on such that is non-dropping on its main branch, then is again an iterable admissible premouse with a largest regular and uncountable cardinal. At last we answer another open question from 'The Core Model Iterability Problem' regarding the S-hull property.
Paper Structure (8 sections, 31 theorems, 69 equations)

This paper contains 8 sections, 31 theorems, 69 equations.

Key Result

Theorem 1

Let $\kappa$ be an inaccessible cardinal. Let $\mathcal{M}$ and $\mathcal{N}$ be premice such that $\mathop{\mathrm{OR}}\nolimits^{\mathcal{M}}=\mathop{\mathrm{OR}}\nolimits^{\mathcal{N}}=\kappa$, and suppose that $\mathcal{M}$ and $\mathcal{N}$ are $\kappa+1$-iterable. Let $(\mathcal{T},\mathcal{U}

Theorems & Definitions (80)

  • Theorem 1
  • Lemma 2
  • Lemma 3
  • Lemma 4
  • Definition 5
  • Definition 6
  • Lemma 7
  • proof
  • Theorem 8
  • Lemma 9
  • ...and 70 more