An almost Kurepa Suslin tree with strongly non-saturated square
John Krueger, Eduardo Martinez Mendoza

TL;DR
This paper constructs a special Suslin tree with a large family of automorphisms, demonstrating a new form of non-saturation related to the structure of the tree's square, using a novel forcing technique.
Contribution
It introduces a new forcing method with $ ho$-separation to add a Suslin tree with many automorphisms, showing the square of the tree is strongly non-saturated.
Findings
Constructed a Knaster forcing adding a Suslin tree with many automorphisms.
Established the strong non-saturation of the square of the Suslin tree.
Introduced the concept of $ ho$-separation for finite conditions.
Abstract
For uncountable downwards closed subtrees and of an -tree , we say that and are strongly almost disjoint if their intersection is a finite union of countable chains. The tree is strongly non-saturated if there exists a strongly almost disjoint family of -many uncountable downwards closed subtrees of . In this article we construct a Knaster forcing which adds a Suslin tree together with a family of -many strongly almost disjoint automorphisms of it (and thus the square of the Suslin tree is strongly non-saturated). To achieve this goal, we introduce a new idea called -separation, which is an adaptation to the finite context of the notion of separation which was recently introduced by Stejskalov\'{a} and the first author for the purpose of adding automorphisms of a tree with a forcing with countable conditions.
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.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Mathematical Dynamics and Fractals
