Search arXiv⌕ Search

arXiv · 2609.25092

Stationary common-neighborhood properties and partition hypotheses

Abstract

We use stationary common-neighborhood properties to study highly connected Ramsey relations and partition hypotheses. For weakly compact $κ$, $\operatorname{Coll}(ω_1,{<}κ)$ forces $ω_2\to_{\mathrm{hc},<5}(ω_2)^2_ω$ and $\operatorname{PH}_1(ω_2)$. If $κ$ is $T^{κ^+}_{ω_1}$-Ramsey, the same collapse forces that every countable coloring of $[ω_2]^2$ has a stationary set $X\subseteqω_2$ and a color $i$ such that every finite subset of $X$ has stationarily many color-$i$ common neighbors in $X$. From one weakly compact cardinal, we obtain a model of the ${<}5$-edge relation at $ω_3$ and $\operatorname{PH}_1(ω_3)$, in which $\check H^2(ω_3,A_d)\ne0$ for every nontrivial abelian group $A$. This separates $\operatorname{PH}_1(ω_3)$ from $\operatorname{PH}_2(ω_3)$, with the exact consistency strength of one weakly compact cardinal. We also show that $\operatorname{PH}_1(ω_2\timesω_5)$ is equiconsistent with two weakly compact cardinals.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiang Li. 2026-10-06. Stationary common-neighborhood properties and partition hypotheses. https://arxiv.org/abs/2609.25092

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Measuring the complexity of characterizing $[0, 1]$, $S^1$, and $\mathbb{R}$ up to homeomorphism

In analogy to the study of Scott rank/complexity of countable structures, we initiate the study of the Wadge degrees of the set of homeomorphic copies of topological spaces. One can view our results as saying that the classical characterizations of $[0,1]$ (e.g., as the unique continuum with exactly two non-cut points, and other similar characterizations), appropriated expressed, are the simplest possible characterizations of $[0,1]$. Formally, we show that the set of homeomorphic copies of $[0,1]$ is $\mathbfΠ^0_4$-Wadge-complete. We also show that the set of homeomorphic copies of $S^1$ is $\mathbfΠ^0_4$-Wadge-complete. On the other hand, we show that the set of homeomorphic copies of $\mathbb{R}$ is $\mathbfΠ^1_1$-Wadge-complete. It is the local compactness that cannot be expressed in a Borel way; the set of homeomorphic copies of $\mathbb{R}$ is $\mathbfΠ^0_4$-Wadge-complete within the locally compact spaces.

math.LO↗

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO↗