
TL;DR
This paper explores how certain proper posets can become improper after applying specific $ ext{κ}$-closed forcing extensions, revealing nuanced behavior of properness under forcing.
Contribution
It provides explicit examples of proper posets that lose their properness in some $ ext{κ}$-closed forcing extensions, highlighting limitations of properness preservation.
Findings
Proper posets can become improper after $ ext{κ}$-closed forcing.
Examples demonstrate properness is not always preserved under certain extensions.
Properness behavior varies with different forcing extensions.
Abstract
For every uncountable regular , we give two examples of proper posets which turn improper in some -closed forcing extension.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Properness under closed forcing
Yasuo Yoshinobu
Graduate School of Information Science
Nagoya University
Furo-cho, Chikusa-ku, Nagoya 464-8601
JAPAN
Abstract.
For every uncountable regular , we give two examples of proper posets which turn improper in some -closed forcing extension.
The author was supported by Grant-in-Aid for Scientific Research (C) (No. 18K03394) from JSPS
1. Introduction
In this paper we prove the following theorem:
Theorem 1**.**
Let be an uncountable regular cardinal. Then there exists a -closed poset and a proper poset such that
[TABLE]
This theorem negatively answers the question raised by Karagila [4], which asks if there exists a sufficiently large cardinal such that any proper poset remains proper after any -closed forcing. The motivation of this question is discussed in a recent article by Asperó and Karagila [1].
In fact, we give two examples witnessing the conclusion of Theorem 1. The first example is a rather simple mimic of the known example of a pair of proper posets whose product is improper, given by Shelah [7, XVII Observation 2.12, p.826]. This example is briefly mentioned in [1]. The second example involves the class of posets introduced by Moore [6] in connection with the Mapping Reflection Principle () he introduced in the same paper. While the second example requires a longer argument, it has the advantage that is taken to be totally proper.
2. The First Example
Let be the complete binary tree of height . Let with the reversed ordering. Clearly is -closed. Let and in . is -closed in . Note that, no new cofinal branches are added to by forcing with , by a well-known argument first proposed by Mitchell [5]. Let be a -name for a cofinal subset of of order type , and let denote the subset of consisting of all nodes of level in (defined in ). Note that, in , forms a tree of size and height , and since every cofinal branch through generates one through , which is in , the number of cofinal branches through is also . Now let be a -name for the c.c.c. poset specializing , as described in Baumgartner [2, §7], and set . is a three step iteration of c.c.c., -closed and c.c.c. posets, and thus is proper. Note that, since is specialized in , must be collapsed in any further extension where new cofinal branches through are added. Since forcing with over adds a new cofinal branch through , forcing with adds a cofinal branch through which is not in . Therefore collapses , and thus is improper. This shows that is improper in .
3. The Second Example
First let us review some relevant definitions and facts we will use in construction of our second example. Let us start with the notion of total properness.
Definition 2**.**
Let be a poset, and a countable -model of a suitable fragment of which contains .
- (1)
is said to be -generic if for every dense subset of , is predense below . 2. (2)
is said to be totally -generic if for every dense subset of , extends some element of .
Note that is proper iff for every sufficiently large regular , every countable containing and every , there exists an -generic condition of which extends .
Definition 3**.**
A poset is said to be totally proper if for every sufficiently large regular , every countable containing and every , there exists a totally -generic condition of which extends .
The notion of total properness has the following simple characterization.
Theorem 4** (Eisworth-Roitman[3]).**
A poset is totally proper iff is proper and -Baire111-Baire posets are sometimes referred to as -distributive posets..∎
Theorem 4 can be proved using the following lemma, which we will use later.
Lemma 5**.**
Suppose is -Baire and is countable. Then every -generic condition can be extended to a totally -generic condition.∎
Next let us review the class of posets first introduced by Moore [6]. They were originally designed to prove the Mapping Reflection Principle () from the Proper Forcing Axiom (). In our second example, will be taken from this class.
Definition 6** (Moore [6]).**
Let be a regular uncountable cardinal, and . For a club subset of , a function is said to be an open stationary set mapping if for every ,
- (1)
is -stationary, that is, for every club subset of , and 2. (2)
is open in the Ellentuck topology, that is, for every there exists a finite such that
[TABLE]
For an open stationary set mapping , the poset is defined as follows: consists of the functions of the form for some such that
- (1)
for every , 2. (2)
for every limit , and 3. (3)
for every limit , there exists such that for all satisfying .
is ordered by initial segment.
The following lemma is the heart of Moore’s proof of from .
Lemma 7** (Moore [6]).**
is totally proper.∎
The following are density lemmata about , which we will use later. For , we write as .
Lemma 8** (Moore [6]).**
Let be an open stationary set mapping, where is a club subset of for an uncountable regular cardinal .
- (1)
For every , is dense in . 2. (2)
For every , is dense in .∎
We also use the following lemma in our construction.
Lemma 9**.**
Let be an uncountable regular cardinal. For every club subset of , there exists a club subset of such that
- (a)
is closed in the Ellentuck topology. 2. (b)
is weakly unbounded, that is, for every there exists such that .
Proof.
Let be such that
[TABLE]
Let
[TABLE]
where denotes the closure of by . Since every union of a strictly -increasing -sequence of elements of is in , it easily follows that is a club subset of . If is an accumulation point of in Ellentuck topology, must be closed under and also cannot be finitely generated by , and thus is in . This shows (a). Since holds for every , we have (b).∎∎
Now we start to describe our construction of the second example. Suppose a regular uncountable cardinal is given. Let be the set of club subsets of , and let . Clearly is -closed, and holds in . Let be the -name for a diagonal intersection of the members of . is a club subset of in .
Let be a sufficiently large regular cardinal, and let
[TABLE]
Fix an arbitrary . Pick a totally -generic condition . Let enumerate . Note that, for each , we may assume that , where is made from as in Lemma 9. By the definition of , for each there exists a -name (for an ordinal below ) such that
[TABLE]
By (a) and (b) of Lemma 9, there exists a -name and both in such that
[TABLE]
[TABLE]
By the total genericity of , for each there exists and such that
[TABLE]
Now let us set . It is easy to check that is an open stationary set mapping ( is clearly open, and is -stationary since for every ). By (3) we have
[TABLE]
Now let . is totally proper by Lemma 7.
Lemma 10**.**
There exists such that
[TABLE]
where is the canonical -name for -generic filter.
Proof.
Suppose otherwise. Then there exists a -name such that
[TABLE]
Let be a sufficiently large regular cardinal, and let be a countable elementary submodel of such that and . Now let be a -generic filter over such that . Then by genericity of it holds that . On the other hand, since and is forced to be a club, it holds that . Thus it follows that , and should be the case. This is a contradiction.∎∎
Now let be as in Lemma 10. We will show that
[TABLE]
Note that it is enough for our goal: we may rename below as , or use the weak homogeneity of .
To this end, let be a -generic filter over such that . Work in . Let
[TABLE]
Since is a club subset of , is a club subset of .
Now for each , let
[TABLE]
It is clear that is a dense subset of (by Lemma 8(1), and the unboundedness of ; note that any can be extended by adding any member of which contains as an element).
Now let . By our choice of , is a stationary subset of .
Now let be a sufficiently large regular caridnal, and set
[TABLE]
Then is stationary in . Pick any . Set and . The following claim is enough to show (5).
**(Claim) **.
There are no -generic conditions.
Proof.
Suppose there is an -generic condition. Since remains -Baire in , by Lemma 5 such a condition can be extended to a totally -generic condition . By the total genericity of , Lemma 8(1)(2), the facts that the domain of every condition of is less than , and that for every , we may assume that
- (a)
, 2. (b)
and 3. (c)
is unbounded in .
By (c) we have
[TABLE]
On the other hand, by (b) there exists such that
[TABLE]
But since , holds, and thus by (4) we have . This is a contradiction.∎∎
This finishes our construction.
Note that our second example is more delicate than the first one in the following sense: although the properness of is destroyed by forcing over , the product remains proper unlike the first example, because is -Baire and therefore remains -closed by forcing over .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] David Asperó and Asaf Karagila. Dependent choice, properness, and generic absoluteness. preprint at https://arxiv.org/abs/1806.04077, 2018.
- 2[2] James E. Baumgartner. Applications of the Proper Forcing Axiom. In K. Kunen and J.E. Vaughan, editors, Handbook of set-theoretic topology , pages 913–959. North-Holland, 1984.
- 3[3] Todd Eisworth and Judith Roitman. CH with no Ostaszewski spaces. Trans. Amer. Math. Soc. , 351(7):2675–2693, 1999.
- 4[4] Asaf Karagila. Open problems. http://karagila.org/problems.html.
- 5[5] William Mitchell. Aronszajn trees and the independence of the transfer property. Annals of Mathematical Logic , 5:21–46, 1972.
- 6[6] Justin Tatch Moore. Set mapping reflection. Journal of Mathematical Logic , 5:87–97, 2005.
- 7[7] Saharon Shelah. Proper and Improper Forcing . Perspectives in Mathematical Logic. Springer-Verlag, 1998.
