“…Proof. By the main result of [BR19b], in V P , an instance of the proxy principle, much stronger than P − µ (κ, 2, µ ⊑, κ, {E κ µ }, 2, 1 1 2 ), holds. So, by Lemma 7.12, if V P |= µ <µ = µ, then V P |= Pℓ 1 (µ + , µ + , µ).…”
We study the existence of transformations of the transfinite plane that allow to reduce Ramsey-theoretic statements concerning uncountable Abelian groups into classic partition relations for uncountable cardinals.To exemplify: we prove that for every inaccessible cardinal κ, if κ admits a stationary set that does not reflect at inaccessibles, then the classic negative partition relation κ[κ] 2 κ implies that for every Abelian group (G, +) of size κ, there exists a map f : G → G such that, for every X ⊆ G of size κ and every g ∈ G, there exist x = y in X such that f (x + y) = g.
“…Proof. By the main result of [BR19b], in V P , an instance of the proxy principle, much stronger than P − µ (κ, 2, µ ⊑, κ, {E κ µ }, 2, 1 1 2 ), holds. So, by Lemma 7.12, if V P |= µ <µ = µ, then V P |= Pℓ 1 (µ + , µ + , µ).…”
We study the existence of transformations of the transfinite plane that allow to reduce Ramsey-theoretic statements concerning uncountable Abelian groups into classic partition relations for uncountable cardinals.To exemplify: we prove that for every inaccessible cardinal κ, if κ admits a stationary set that does not reflect at inaccessibles, then the classic negative partition relation κ[κ] 2 κ implies that for every Abelian group (G, +) of size κ, there exists a map f : G → G such that, for every X ⊆ G of size κ and every g ∈ G, there exist x = y in X such that f (x + y) = g.
“…Fix a sequence witnessing , and fix a well‐ordering of . Following the proof of [2, Proposition 2.2], we shall recursively construct a sequence such that will constitute a normal prolific full streamlined ‐Souslin tree whose level is . Let , and for all let …”
Section: Full Souslin Trees At Strongly Inaccessiblesmentioning
confidence: 99%
“…Proof. We settle for proving Clause(2). So, suppose that ⟨𝑋 𝛽 | 𝛽 ∈ 𝐸 𝜆 𝜃 ⟩ witnesses ♣(𝐸 𝜆 𝜃 ), for a given 𝜃 ∈ Reg(𝜆), and we shall prove that ♢ * 𝑆,𝐵 (𝜅-trees) holds for 𝐵 ∶= 𝐸 𝜅 𝜃 .…”
A ‐tree is full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full ‐Souslin tree may consistently exist. Shelah gave an affirmative answer of height a strong limit Mahlo cardinal . Here, it is shown that these trees may consistently exist at small cardinals. Indeed, there can be many full ‐trees such that the product of any countably many of them is an ‐Souslin tree.
“…As mentioned earlier, even in the presence of GCH, (κ, <κ) does not imply the existence of a κ-Souslin tree. For this, Brodsky and the author have introduced the following slight strengthening of (κ, <κ): (Brodsky & Rinot;[4]) * (κ) asserts the existence of a sequence C α | α < κ such that 1. for every limit ordinal α < κ, (a) C α is a nonempty collection of club subsets of α, with |C α | < κ; and (b) for every C ∈ C α and everyᾱ ∈ acc(C), we have C ∩ᾱ ∈ Cᾱ; 2. for every cofinal X ⊆ κ, there is α ∈ acc(κ) such that sup(nacc(C) ∩ X ) = α for all C ∈ C α .…”
We present a weak sufficient condition for the existence of Souslin trees at successor of regular cardinals. The result is optimal and simultaneously improves an old theorem of Gregory and a more recent theorem of the author.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.