Sacks Forcing and the Shrink Wrapping Property

نویسنده

  • DAN HATHAWAY
چکیده

We consider a property stronger than the Sacks property which holds between the ground model and the Sacks forcing extension. 1. The Shrink Wrapping Property Suppose that V is a Sacks forcing extension of a model M . Then the Sacks property holds between V and M . That is, for each x ∈ ω, there exists a tree T ⊆ ω in M such that x ∈ [T ] and each level of T is finite. The following is a stronger property that we might want to hold between V and M : for every sequence X = 〈xn ∈ ω : n < ω〉 there exists a sequence of trees 〈Tn ⊆ ω : n < ω〉 such that 1) (∀n ∈ ω)xn ∈ [Tn]; 2) (∀n1, n2 ∈ ω) one of the following holds: a) xn1 = xn2 ; b) [Tn1 ] ∩ [Tn2 ] = ∅. Unfortunately, if the sequence X is such that 〈(n1, n2) : xn1 = xn2〉 6∈M, then there can be no such sequence of trees in M . Thus, we need a weaker notion: a shrink wrapper. In this next definition, we fix a canonical bijection η : ω → [ω] so that for each ñ ∈ ω, we may talk about the ñ-th pair η(ñ) ∈ [ω]. The idea is that for each {n1, n2} = η(ñ) ∈ [ω], the functions Fñ,n1 and Fñ,n2 , together with the finite sets I(n1) and I(n2), separate xn1 and xn2 as much as possible. For n ∈ η(ñ), the function Fñ,n : 2→ P(ω) is shrink-wrapping 2 possibilities for the value of xn. We need to make sure that what contains one possibility for xn1 is sufficiently disjoint from what contains another possibility for xn2 , even if it is not possible that simultaneously both xn1 and xn2 are in the respective containers. The main idea of shrink-wrapping is that for a fixed ñ, if {n1, n2} is the ñ-th pair, the trees Fñ,n1(s) for s ∈ 2 and Fñ,n2(s) for s ∈ 2 separate xn1 from xn2 as much as possible. If xn1 = xn2 , they 1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property

(See below for a definition of the Sacks property.) A “definable” variant of this question has been answered in [Sh 480]: Every nontrivial Souslin forcing notion which has the Sacks property has an uncountable antichain. (A Souslin forcing notion is a forcing notion for which the set of conditions, the comparability relation and the incompatibility relation are all analytic subsets of the reals...

متن کامل

N - Localization Property

The present paper is concerned with the n–localization property and its preservation in countable support (CS) iterations. This property was first introduced in Newelski and Ros lanowski [10, p. 826]. Definition 0.1. Let n be an integer greater than 1. (1) A tree T is an n–ary tree provided that (∀s ∈ T)(|succ T (s)| ≤ n). (2) A forcing notion P has the n–localization property if P " ∀f ∈ ω ω ∃...

متن کامل

Projective Absoluteness under Sacks Forcing

We show that Σ3-absoluteness under Sacks forcing is equivalent to the Sacks measurability of every ∆2 set of reals. We also show that Sacks forcing is the weakest forcing notion among all of the preorders which always add a new real with respect to Σ3 forcing absoluteness.

متن کامل

Occupational asthma due to polyethylene shrink wrapping (paper wrapper's asthma).

Occupational asthma due to the pyrolysis products of polyvinyl chloride (PVC) produced by shrink wrapping processes has previously been reported. The first case of occupational asthma in a shrink wrap worker using a different plastic, polyethylene, is reported; the association was confirmed by specific bronchial provocation testing.

متن کامل

Shrink-Wrapping trajectories for Linear Programming

Hyperbolic Programming (HP) –minimizing a linear functional over an affine subspace of a finite-dimensional real vector space intersected with the so-called hyperbolicity cone– is a class of convex optimization problems that contains well-known Linear Programming (LP). In particular, for any LP one can readily provide a sequence of HP relaxations. Based on these hyperbolic relaxations, a new Sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016