Search arXiv⌕ Search

arXiv · 2610.35025

Comparisons of benchmark equivalence relations

Abstract

We determine the Borel-reducibility comparison of each pair of $\mathbfΠ^0_3$ benchmark equivalence relations in Gao's monograph. The additional comparisons we prove are $E_\infty\leq_B c_0$, $E_\infty\nleq_B\ell_p$ for $2<p<\infty$, $\ell_p\nleq_B{\equiv_m}$ for $2<p<\infty$, $c_0\nleq_B{\equiv_m}$, $c_0\nleq_B\ell_\infty^+$ and $\equiv_m\nleq_B\ell_\infty^+$. Together with the previous positive direction, these give $\ell_p\leq_B{\equiv_m}$ if and only if $p\leq2$. These answer several questions in Gao's monograph and Kanovei' monograph. We also prove that unitary equivalence of all bounded linear operators is not Borel reducible to $\equiv_m$. This answers a question of Ding and Gao. Equivalently, unitary equivalence of arbitrary representations of $F_\infty$ is strictly more complicated than that of arbitrary representations of $\mathbb Z$. This answers a question of Thomas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruijun Wang. 2026-10-26. Comparisons of benchmark equivalence relations. https://arxiv.org/abs/2610.35025

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

KEEP EXPLORING

Related papers

Integration in Hensel minimal fields

We develop a framework of motivic integration in the style of Hrushovski--Kazhdan in arbitrary Hensel minimal fields of equicharacteristic zero. Hence our work generalizes that of Hrushovski--Kazhdan and Yin, but applies more broadly to discretely valued fields, almost real closed fields with analytic structure, pseudo-local fields, and coarsenings. In more detail, we obtain isomorphisms of Grothendieck rings of definable sets, with or without volume forms, in the valued field sort and in the leading term sort. Along the way we develop a theory of effective 1-h-minimal structures, where finite definable sets can be lifted from the leading term sort to the valued fields sort. We show that many natural examples of 1-h-minimal structures are effective, and develop dimension theory and a theory of differentiation in $\mathrm{RV}$ for effective structures.

math.LO↗

Demodalising Gödel's God? Ultrafilters, Rigidity and Modal Collapse Revisited

Gödel's ontological argument is modal by design. Possibility and necessity are among its central concerns, and connected interpretation decisions -- extensions or intensions for the positive properties, constant or varying quantifier domains, the choice of modal logic, etc. -- subtly shape the argument and, in particular, whether the modal collapse is implied or not. It is tempting to abstract the modality away and to read the positive properties as merely forming an ultrafilter -- which, however, may replace Gödel's argument with a perhaps more manageable alternative that may have little to do with Gödel's original intention. In this spirit, Odifreddi and Gomes argue that modal collapse is an intrinsic structural feature of any theory that characterises positive properties as an ultrafilter and identifies God as its principal generator. This comment shows that the structural claim is false. There is an explicit S5 model, with constant domains, in which positivity is at every world a modal ultrafilter principally generated by a unique and necessarily existing Godlike individual, and in which the modal collapse nevertheless fails -- already for an atomic formula. What drives the collapse is not the ultrafilter structure but the rigidity of positivity -- itself a thoroughly modal condition: given only that positivity is a modal ultrafilter, modal collapse and rigidity are equivalent. Rigidity is thus exactly what the collapse adds to the ultrafilter structure, and the disagreement is whether it is to be counted part of that structure at all. Two further claims of Odifreddi and Gomes are clarified: one on the derivability of Gödel's Theorem IV, one on the extensionality of positivity. All results are machine-checked in Isabelle/HOL, which distinguishes kernel-checked proofs from model-finder output.

math.LO↗

Bistationary Traces, Wide Levels, and Branch-Cover Rigidity for an Unrestricted Typed Variant of the Hayut-Magidor Forcing

For every uncountable regular cardinal $α$, $\mathbb S^{\ast}(α)$ is an explicitly typed four-coordinate forcing motivated by the ladder-system construction of Hayut and Magidor. The forcing is $σ$-closed and, after adjoining a formal maximum, $α$-strategically closed. For $α\geqω_2$, every nonempty countable family of designated generic branches has a stationary and costationary common trace on the generic ladder-coordinate set $L_α$, while no countable family of cofinal branches generates $L_α$. These conclusions persist under a Kurepa-style level-size bound. In the unrestricted forcing, for every infinite cardinal $μ<α$ in the ground model, some level of the generic tree contains a copy of $({}^μ2)^V$. Consequently, the endpoint-corrected restriction family indexed by $\mathcal P_{ω_2}α$ is too wide, whereas the scaled restriction system indexed by $\mathcal P_αα$ has all levels of size less than $α$ exactly when $α$ is strongly inaccessible in the ground model. When these equivalent conditions hold, the branch-covering number of $L_α$ relative to the scaled system is at least $ω_1$. The low-cofinality empty-value convention also ensures that the set of domains of $L_α$ contains no club in $\mathcal P_αα$. The unrestricted tree clause of the motivating presentation is retained, without asserting forcing equivalence.

math.LO↗