Proxy principles in combinatorial set theory
arxiv(2024)
摘要
The parameterized proxy principles were introduced by Brodsky and Rinot in a
2017 paper, as new foundations for the construction of κ-Souslin trees
in a uniform way that does not depend on the nature of the (regular
uncountable) cardinal κ. Since their introduction, these principles have
facilitated construction of Souslin trees with complex combinations of
features, and have enabled the discovery of completely new scenarios in which
Souslin trees must exist. Furthermore, the proxy principles have found new
applications beyond the construction of trees.
This paper opens with a comprehensive exposition of the proxy principles. We
motivate their very definition, emphasizing the utility of each of the
parameters and the consequent flexibility that they provide. We then survey the
findings surrounding them, presenting a rich spectrum of unrelated models and
configurations in which the proxy principles are known to hold, and showcasing
a gallery of Souslin trees constructed from the principles.
The last two sections of the paper offer new results. In particular, for
every positive integer n, we give a construction of a λ^+-Souslin
tree all of whose n-derived trees are Souslin, but whose (n+1)-power is
special.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要