Some Results on Finitely Splitting Subtrees of Aronszajn Trees
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908541601710080 |
|---|---|
| author | Krueger, John |
| author_facet | Krueger, John |
| contents | For any $2 \le n < ω$, we introduce a forcing poset using generalized promises which adds a normal $n$-splitting subtree to a $(\ge \! n)$-splitting normal Aronszajn tree. Using this forcing poset, we prove several consistency results concerning finitely splitting subtrees of Aronszajn trees. For example, it is consistent that there exists an infinitely splitting Suslin tree whose topological square is not Lindelöf, which solves an open problem due to Marun. For any $2 < n < ω$, it is consistent that every $(\ge \! n)$-splitting normal Aronszajn tree contains a normal $n$-splitting subtree, but there exists a normal infinitely splitting Aronszajn tree which contains no $(< \! n)$-splitting subtree. To show the latter consistency result, we prove a forcing iteration preservation theorem related to not adding new small-splitting subtrees of Aronszajn trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_05380 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Some Results on Finitely Splitting Subtrees of Aronszajn Trees Krueger, John Logic For any $2 \le n < ω$, we introduce a forcing poset using generalized promises which adds a normal $n$-splitting subtree to a $(\ge \! n)$-splitting normal Aronszajn tree. Using this forcing poset, we prove several consistency results concerning finitely splitting subtrees of Aronszajn trees. For example, it is consistent that there exists an infinitely splitting Suslin tree whose topological square is not Lindelöf, which solves an open problem due to Marun. For any $2 < n < ω$, it is consistent that every $(\ge \! n)$-splitting normal Aronszajn tree contains a normal $n$-splitting subtree, but there exists a normal infinitely splitting Aronszajn tree which contains no $(< \! n)$-splitting subtree. To show the latter consistency result, we prove a forcing iteration preservation theorem related to not adding new small-splitting subtrees of Aronszajn trees. |
| title | Some Results on Finitely Splitting Subtrees of Aronszajn Trees |
| topic | Logic |
| url | https://arxiv.org/abs/2408.05380 |