{"title":"具有强不饱和方的几乎Kurepa Suslin树","authors":"John Krueger, Eduardo Martinez Mendoza","doi":"10.1016/j.aim.2025.110540","DOIUrl":null,"url":null,"abstract":"<div><div>For uncountable downwards closed subtrees <em>U</em> and <em>W</em> of an <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-tree <em>T</em>, we say that <em>U</em> and <em>W</em> are <em>strongly almost disjoint</em> if their intersection is a finite union of countable chains. The tree <em>T</em> is <em>strongly non-saturated</em> if there exists a strongly almost disjoint family of <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-many uncountable downwards closed subtrees of <em>T</em>. In this article we construct a Knaster forcing which adds a Suslin tree together with a family of <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-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 <em>ρ-separation</em>, which is an adaptation to the finite context of the notion of separation which was recently introduced by Stejskalová and the first author for the purpose of adding automorphisms of a tree with a forcing with countable conditions.</div></div>","PeriodicalId":50860,"journal":{"name":"Advances in Mathematics","volume":"481 ","pages":"Article 110540"},"PeriodicalIF":1.5000,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An almost Kurepa Suslin tree with strongly non-saturated square\",\"authors\":\"John Krueger, Eduardo Martinez Mendoza\",\"doi\":\"10.1016/j.aim.2025.110540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>For uncountable downwards closed subtrees <em>U</em> and <em>W</em> of an <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-tree <em>T</em>, we say that <em>U</em> and <em>W</em> are <em>strongly almost disjoint</em> if their intersection is a finite union of countable chains. The tree <em>T</em> is <em>strongly non-saturated</em> if there exists a strongly almost disjoint family of <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-many uncountable downwards closed subtrees of <em>T</em>. In this article we construct a Knaster forcing which adds a Suslin tree together with a family of <span><math><msub><mrow><mi>ω</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-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 <em>ρ-separation</em>, which is an adaptation to the finite context of the notion of separation which was recently introduced by Stejskalová and the first author for the purpose of adding automorphisms of a tree with a forcing with countable conditions.</div></div>\",\"PeriodicalId\":50860,\"journal\":{\"name\":\"Advances in Mathematics\",\"volume\":\"481 \",\"pages\":\"Article 110540\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0001870825004384\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0001870825004384","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
An almost Kurepa Suslin tree with strongly non-saturated square
For uncountable downwards closed subtrees U and W of an -tree T, we say that U and W are strongly almost disjoint if their intersection is a finite union of countable chains. The tree T is strongly non-saturated if there exists a strongly almost disjoint family of -many uncountable downwards closed subtrees of T. 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á and the first author for the purpose of adding automorphisms of a tree with a forcing with countable conditions.
期刊介绍:
Emphasizing contributions that represent significant advances in all areas of pure mathematics, Advances in Mathematics provides research mathematicians with an effective medium for communicating important recent developments in their areas of specialization to colleagues and to scientists in related disciplines.