The Ostaszewski square and homogeneous Souslin trees

DOI10.1007/S11856-013-0065-0zbMATH Open1300.03024arXiv1105.2944OpenAlexW2094173414MaRDI QIDQ2017149FDOQ2017149

Assaf Rinot

Publication date: 25 June 2014

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: Assume GCH and let $lambda$ denote an uncountable cardinal. We prove that if $squar{e}_{l}ambda$ holds, then this may be witnessed by a coherent sequence $<C_{a}lpha|alpha<lambd{a}^{+}>$ with the following remarkable guessing property: For every sequence $<A_i|i<lambda>$ of unbounded subsets of $lambd{a}^{+}$, and every limit $heta<lambda$, there exists some $alpha<lambd{a}^{+}$ such that $otp(C_{a}lpha)=heta$, and the $(i+1{)}_{th}$-element of $C_{a}lpha$ is a member of $A_i$, for all $i<heta$. As an application, we construct an homogenous $lambd{a}^{+}$-Souslin tree from $GCH+squar{e}_{l}ambda$, for every singular cardinal $lambda$. In addition, as a by-product, a theorem of Farah and Velickovic, and a theorem of Abraham, Shelah and Solovay are generalized to cover the case of successors of regulars.

Full work available at URL: https://arxiv.org/abs/1105.2944

zbMATH Keywords

clubsquaregeneralized continuum hypothesisdiamondSouslin tree

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45)

Cites Work

• Title not available (Why is that?)
• The fine structure of the constructible hierarchy
• Jensen's ⃞ principles and the Novák number of partially ordered sets
• Walks on ordinals and their characteristics
• Squares with diamonds and Souslin trees with special squares
• Diamonds
• Optimal matrices of partitions and an application to Souslin trees
• The uniformization property for \(chi_ 2\).
• Diamonds, uniformization
• VON NEUMANN'S PROBLEM AND LARGE CARDINALS
• A relative of the approachability ideal, diamond and non-saturation
• The failure of diamond on a reflecting stationary set

Cited In (12)

• ON FOREMAN’S MAXIMALITY PRINCIPLE
• REDUCED POWERS OF SOUSLIN TREES
• Transforming rectangles into squares, with applications to strong colorings
• Chromatic numbers of graphs -- large gaps
• Higher Souslin trees and the GCH, revisited
• Chain conditions of products, and weakly compact cardinals
• Weak square sequences and special Aronszajn trees
• Putting a diamond inside the square
• A microscopic approach to Souslin-tree constructions. I.
• A club guessing toolbox. I
• Hedetniemi's conjecture for uncountable graphs
• A microscopic approach to Souslin-tree construction. II

Recommendations

• The n-dimensional Stern–Brocot tree 👍 👎
• SCHUR MULTIPLIERS AND SPHERICAL FUNCTIONS ON HOMOGENEOUS TREES 👍 👎
• Higher Souslin trees and the GCH, revisited 👍 👎
• Hadwiger's conjecture for squares of 2-trees 👍 👎
• Degrees of Souslin And Aronszajn Trees 👍 👎
• Aronszajn trees, square principles, and stationary reflection 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The Ostaszewski square and homogeneous Souslin trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017149)