3 edited tags
2 added 251 characters in body

Hi,

The covering lemma for L[U] (minimal k-model) is stated in Mitchel's handbook chapter:

"Assuming zero-dagger does not exist then covering holds for L[U] or there is a sequence C ⊆ κ, which is Prikry generic over L[U], such that for all sets x of ordinals there is a set y ∈ L[U,C] such that y ⊇ x and |y| = |x| + ℵ1."

And so a Prikry sequence is the only counter example to covering.

a) Kanamori (19.18) prove proves a theorem of Solovay saying that the critical points of an iteration define a Prikry sequence. Can someone explain the connection to the proof of So in the theorem above?

bcore model L[U] (under zero-dagger) we must have prikry sequences.

What are the main differences between the proof of the (more familiar) covering lemma for L and the theorem above for L[U]? I assume that since the mice of L[U] are not simple $L_\alpha$'s we get indiscernibles when trying to cover a set X in a collapsed model. But is there an easier more the proof the same as before "high-level" reference for modulu" Prikry sequences, or is it more complicated than that and more cases should be handled regarding these sequences?

1

# The Covering Lemma for L[U]

Hi,

The covering lemma for L[U] (minimal k-model) is stated in Mitchel's handbook chapter:

"Assuming zero-dagger does not exist then covering holds for L[U] or there is a sequence C ⊆ κ, which is Prikry generic over L[U], such that for all sets x of ordinals there is a set y ∈ L[U,C] such that y ⊇ x and |y| = |x| + ℵ1."

And so a Prikry sequence is the only counter example to covering.

a) Kanamori (19.18) prove a theorem of Solovay saying that the critical points of an iteration define a Prikry sequence. Can someone explain the connection to the proof of the theorem above?

b) What are the main differences between the proof of the (more familiar) covering lemma for L and the theorem above? is there an easier more "high-level" reference for it?