Can You Take Komjath's Inaccessible Away?
Abstract
In this paper we aim to compare Kurepa trees and Aronszajn trees. Moreover, we analyze the affect of large cardinal assumptions on this comparison. Using the the method of walks on ordinals, we will show it is consistent with ZFC that there is a Kurepa tree and every Kurepa tree contains an Aronszajn subtree, if there is an inaccessible cardinal. This is stronger than Komjath's theorem that asserts the same consistency from two inaccessible cardinals. Moreover, we prove it is consistent with ZFC that there is a Kurepa tree such that if is a Kurepa tree with the inherited order from , then has an Aronszajn subtree. This theorem uses no large cardinal assumption. Our last theorem immediately implies the following: assume holds and is not a Mahlo cardinal in . Then there is a Kurepa tree with the property that every Kurepa subset has an Aronszajn subtree. Our work entails proving a new lemma about Todorcevic's function which might be useful in other contexts.
Cite
@article{arxiv.2009.08596,
title = {Can You Take Komjath's Inaccessible Away?},
author = {Hossein Lamei Ramandi and Stevo Todorcevic},
journal= {arXiv preprint arXiv:2009.08596},
year = {2023}
}
Comments
33 pages