Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T16:21:38.703Z Has data issue: false hasContentIssue false

REDUCED POWERS OF SOUSLIN TREES

Published online by Cambridge University Press:  16 January 2017

ARI MEIR BRODSKY
Affiliation:
Department of Mathematics, Bar-Ilan University, Ramat-Gan 5290002, Israel; brodska@macs.biu.ac.il
ASSAF RINOT
Affiliation:
Department of Mathematics, Bar-Ilan University, Ramat-Gan 5290002, Israel; rinotas@math.biu.ac.il

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We study the relationship between a $\unicode[STIX]{x1D705}$ -Souslin tree $T$ and its reduced powers $T^{\unicode[STIX]{x1D703}}/{\mathcal{U}}$ .

Previous works addressed this problem from the viewpoint of a single power $\unicode[STIX]{x1D703}$ , whereas here, tools are developed for controlling different powers simultaneously. As a sample corollary, we obtain the consistency of an $\aleph _{6}$ -Souslin tree $T$ and a sequence of uniform ultrafilters $\langle {\mathcal{U}}_{n}\mid n<6\rangle$ such that $T^{\aleph _{n}}/{\mathcal{U}}_{n}$ is $\aleph _{6}$ -Aronszajn if and only if $n<6$ is not a prime number.

This paper is the first application of the microscopic approach to Souslin-tree construction, recently introduced by the authors. A major component here is devising a method for constructing trees with a prescribed combination of freeness degree and ascent-path characteristics.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2017