SearcharxivSearch

arXiv subjects

Ruiyuan Chen

Publications and source records attributed to Ruiyuan Chen.

At least 19 recordsLinked to original sources

Hilbert spaces admit no finitary discrete imaginaries

We prove that every functor from the category of Hilbert spaces and linear isometric embeddings to the category of sets which preserves directed colimits must be essentially constant on all infinite-dimensional spaces. In other words, every finitary set-valued imaginary over the theory of Hilbert spaces, in a broad signature-independent sense, must be essentially trivial. This extends a result and answers a question by Lieberman--Rosick\'y--Vasey, who showed that no such functor on the supercategory of Hilbert spaces and injective linear contractions can be faithful.

math.CT

Componentwise Polish groupoids and equivalence relations

We study Borel equivalence relations equipped with a uniformly Borel family of Polish topologies on each equivalence class, and more generally, standard Borel groupoids equipped with such a family of topologies on each connected component. Such "componentwise Polish topologies" capture precisely the topological information determined by the Borel structure of a Polish group action, by the Becker--Kechris theorem. We prove that conversely, every abstract such Borel componentwise Polish groupoid obeying suitable axioms admits a Borel equivalence of groupoids to a global open Polish groupoid. Together with known results, this implies that every such groupoid is Borel equivalent to an action groupoid of a Polish group action; in particular, the induced equivalence relations are Borel bireducible. Our results are also valid for Borel groupoids with componentwise quasi-Polish topologies; and under stronger uniformity assumptions, we show that such groupoids in fact themselves admit global quasi-Polish topologies. As a byproduct, we also generalize several standard tools for Polish groups and their actions to the setting of componentwise quasi-Polish groupoids, including Vaught transforms, Effros's theorem on orbits, and the open mapping theorem.

math.LO

Optimal Syntactic Definitions of Back-and-Forth Types

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is optimal as the set is $\mathbf{\Pi}^0_{2\alpha}$-complete. We are also interested in the one-sided relations $\{ N : M \leq_\alpha N\}$ and $\{ N : M \geq_\alpha N\}$ for a fixed $M$, measuring the $\Pi_\alpha$ and $\Sigma_\alpha$ types of $M$. We show that these sets are always $\mathbf{\Pi}^0_{\alpha + 2}$ and $\mathbf{\Pi}^0_{\alpha+3}$ respectively, and that for most $\alpha$ there are structures $M$ for which these relations are complete at that level. In particular, there are structures $M$ such that there is no $\Pi_\alpha$ (or even $\Pi_{\alpha+1})$ sentence $\varphi$ such that $N \models \varphi \Longleftrightarrow M \leq_\alpha N$. This is unfortunate as not all $\Pi_{\alpha+2}$ sentences are preserved under $\leq_\alpha$. We define a new hierarchy of syntactic complexity closely related to the back-and-forth game, which can both define the back-and-forth types as well as be preserved by them. These hierarchies of formulas have already been useful in certain Henkin constructions, one of which we give in this paper, and another previously used by Gonzalez and Harrison-Trainor to show that every $\Pi_\alpha$ theory of linear orders has a model with Scott rank at most $\alpha+3$.

math.LO

Tree-like graphings, wallings, and median graphings of equivalence relations

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has bounded tree-width or is quasi-isometric to a tree, answering a question of Tucker-Drob. In the latter case, we moreover show that there exists a Borel quasi-isometry to a Borel forest, under the additional assumption of (componentwise) bounded degree. We also extend these results on quasi-treeings to Borel proper metric spaces. In fact, our most general result shows treeability of countable Borel equivalence relations equipped with an abstract wallspace structure on each class obeying some local finiteness conditions, which we call a proper walling. The proof is based on the Stone duality between proper wallings and median graphs, i.e., CAT(0) cube complexes. Finally, we strengthen the conclusion of treeability in these results to hyperfiniteness in the case where the original graph has one (selected) end per component, generalizing the same result for trees due to Dougherty--Jackson--Kechris.

math.LO

Structurable equivalence relations and $\mathcal{L}_{ω_1ω}$ interpretations

We show that the category of countable Borel equivalence relations (CBERs) is dually equivalent to the category of countable $\mathcal{L}_{ω_1ω}$ theories which admit a one-sorted interpretation of a particular theory we call $\mathcal{T}_\mathsf{LN} \sqcup \mathcal{T}_\mathsf{sep}$ that witnesses embeddability into $2^\mathbb{N}$ and the Lusin--Novikov uniformization theorem. This allows problems about Borel combinatorial structures on CBERs to be translated into syntactic definability problems in $\mathcal{L}_{ω_1ω}$, modulo the extra structure provided by $\mathcal{T}_\mathsf{LN} \sqcup \mathcal{T}_\mathsf{sep}$, thereby formalizing a folklore intuition in locally countable Borel combinatorics. We illustrate this with a catalogue of the precise interpretability relations between several standard classes of structures commonly used in Borel combinatorics, such as Feldman--Moore $ω$-colorings and the Slaman--Steel marker lemma. We also generalize this correspondence to locally countable Borel groupoids and theories interpreting $\mathcal{T}_\mathsf{LN}$, which admit a characterization analogous to that of Hjorth--Kechris for essentially countable isomorphism relations.

math.LO

Clones of Borel Boolean Functions

We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le ω$, which are closed under composition and include all projections. This is a natural extension to countable arities of Post's 1941 classification of all clones of finitary Boolean functions. Every Borel clone restricts to a finitary clone, yielding a "projection" from the lattice of all Borel clones to Post's lattice. It is well-known that each finitary clone of affine mod 2 functions admits a unique extension to a Borel clone. We show that over each finitary clone containing either both $\wedge, \vee$, or the 2-out-of-3 median operation, there lie at least 2 but only finitely many Borel clones. Over the remaining clones in Post's lattice, we give only a partial classification of the Borel extensions, and present some evidence that the full structure may be quite complicated.

math.LO

Two-Stage Adaptive Network for Semi-Supervised Cross-Domain Crater Detection under Varying Scenario Distributions

Crater detection can provide valuable information for humans to explore the topography and understand the history of extraterrestrial planets. Due to the significantly varying scenario distributions, existing detection models trained on known labelled crater datasets are hardly effective when applied to new unlabelled planets. To address this issue, we propose a two-stage adaptive network (TAN) for semi-supervised cross-domain crater detection. Our network is built on the YOLOv5 detector, where a series of strategies are employed to enhance its cross-domain generalisation ability. In the first stage, we propose an attention-based scale-adaptive fusion (ASAF) strategy to handle objects with significant scale variances. Furthermore, we propose a smoothing hard example mining (SHEM) loss function to address the issue of overfitting on hard examples. In the second stage, we propose a sort-based pseudo-labelling fine-tuning (SPF) strategy for semi-supervised learning to mitigate the distributional differences between source and target domains. For both stages, we employ weak or strong image augmentation to suit different cross-domain tasks. Experimental results on benchmark datasets demonstrate that the proposed network can enhance domain adaptation ability for crater detection under varying scenario distributions.

cs.CV

Structural, point-free, non-Hausdorff topological realization of Borel groupoid actions

We extend the Becker--Kechris topological realization and change-of-topology theorems for Polish group actions in several directions. For Polish group actions, we prove a single result that implies the original Becker--Kechris theorems, as well as Sami's and Hjorth's sharpenings adapted levelwise to the Borel hierarchy; automatic continuity of Borel actions via homeomorphisms; and the equivalence of "potentially open" versus "orbitwise open" Borel sets. We also characterize "potentially open" $n$-ary relations, thus yielding a topological realization theorem for invariant Borel first-order structures. We then generalize to groupoid actions, and prove a result subsuming Lupini's Becker--Kechris-type theorems for open Polish groupoids, newly adapted to the Borel hierarchy, as well as topological realizations of actions on fiberwise topological bundles and bundles of first-order structures. Our proof method is new even in the classical case of Polish groups, and is based entirely on formal algebraic properties of category quantifiers; in particular, we make no use of either metrizability or the strong Choquet game. Consequently, our proofs work equally well in the non-Hausdorff context, for open quasi-Polish groupoids, and more generally in the point-free context, for open localic groupoids.

math.LO

A universal characterization of standard Borel spaces

We prove that the category $\mathsf{SBor}$ of standard Borel spaces is the (bi-)initial object in the 2-category of countably complete Boolean (countably) extensive categories. This means that $\mathsf{SBor}$ is the universal category admitting some familiar algebraic operations of countable arity (e.g., countable products, unions) obeying some simple compatibility conditions (e.g., products distribute over disjoint unions). More generally, for any infinite regular cardinal $κ$, the dual of the category $κ\mathsf{Bool}_κ$ of $κ$-presented $κ$-complete Boolean algebras is (bi-)initial in the 2-category of $κ$-complete Boolean ($κ$-)extensive categories.

math.LO

A Gelfand duality for continuous lattices

We prove that the category of continuous lattices and meet- and directed join-preserving maps is dually equivalent, via the hom functor to $[0,1]$, to the category of complete Archimedean meet-semilattices equipped with a finite meet-preserving action of the monoid of continuous monotone maps of $[0,1]$ fixing $1$. We also prove an analogous duality for completely distributive lattices. Moreover, we prove that these are essentially the only well-behaved "sound classes of joins $Φ$, dual to a class of meets" for which "$Φ$-continuous lattice" and "$Φ$-algebraic lattice" are different notions, thus for which a $2$-valued duality does not suffice.

math.CT

Étale structures and the Joyal-Tierney representation theorem in countable model theory

An étale structure over a topological space $X$ is a continuous family of structures (in some first-order language) indexed over $X$. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model theory and invariant descriptive set theory. We show that many classical aspects of spaces of countable models can be naturally framed and generalized in the context of étale structures, including the Lopez-Escobar theorem on invariant Borel sets, an omitting types theorem, and various characterizations of Scott rank. We also present and prove the countable version of the Joyal-Tierney representation theorem, which states that the isomorphism groupoid of an étale structure determines its theory up to bi-interpretability; and we explain how special cases of this theorem recover several recent results in the literature on groupoids of models and functors between them.

math.LO

Nonamenable subforests of multi-ended quasi-pmp graphs

We prove the a.e. nonamenability of locally finite quasi-pmp Borel graphs whose every component admits at least three nonvanishing ends with respect to the underlying Radon--Nikodym cocycle. We witness their nonamenability by constructing Borel subforests with at least three nonvanishing ends per component, and then applying Tserunyan and Tucker-Drob's recent characterization of amenability for acyclic quasi-pmp Borel graphs. Our main technique is a weighted cycle-cutting algorithm, which yields a weight-maximal spanning forest. We also introduce a random version of this forest, which generalizes the Free Minimal Spanning Forest, to capture nonunimodularity in the context of percolation theory.

math.DS

On sifted colimits in the presence of pullbacks

We show that in a category with pullbacks, arbitrary sifted colimits may be constructed as filtered colimits of reflexive coequalizers. This implies that "lex sifted colimits", in the sense of Garner--Lack, decompose as Barr-exactness plus filtered colimits commuting with finite limits. We also prove generalizations of these results for $κ$-small sifted and filtered colimits, and their interaction with $λ$-small limits in place of finite ones, generalizing Garner's characterization of algebraic exactness in the sense of Adámek--Lawvere--Rosický. Along the way, we prove a general result on classes of colimits, showing that the $κ$-small restriction of a saturated class of colimits is still "closed under iteration".

math.CT

On the Pettis-Johnstone theorem for localic groups

We explain how Johnstone's 1989 proof of the closed subgroup theorem for localic groups can be viewed as a point-free version of Pettis's theorem for Baire topological groups. We then use it to derive localic versions of the open mapping theorem and automatic continuity of Borel homomorphisms, as well as the non-existence of binary coproducts of complete Boolean algebras.

math.LO

Notes on quasi-Polish spaces

Quasi-Polish spaces were introduced by de Brecht as a possibly non-Hausdorff generalization of Polish spaces sharing many of their descriptive set-theoretic properties. We give a self-contained exposition of the basic theory of quasi-Polish spaces, based on their "logical" characterization as $\mathbfΠ^0_2$ subspaces of countable powers of Sierpinski space, with several new proofs emphasizing this point of view as well as making more extensive use of Baire category techniques.

math.LO

Decompositions and measures on countable Borel equivalence relations

We show that the uniform measure-theoretic ergodic decomposition of a countable Borel equivalence relation $(X, E)$ may be realized as the topological ergodic decomposition of a continuous action of a countable group $Γ\curvearrowright X$ generating $E$. We then apply this to the study of the cardinal algebra $\mathcal K(E)$ of equidecomposition types of Borel sets with respect to a compressible countable Borel equivalence relation $(X, E)$. We also make some general observations regarding quotient topologies on topological ergodic decompositions, with an application to weak equivalence of measure-preserving actions.

math.LO

Double band inversion in the topological phase transition of Ge1-xSnx alloys

We use first-principles simulation and virtual crystal approximation to reveal the unique double band inversion and topological phase transition in Ge1-xSnx alloys. Wavefunction parity, spatial charge distribution and surface state spectrum analyses suggest that the band inversion in Ge1-xSnx is relayed by its first valence band. As the system evolves from Ge to α-Sn, its conduction band moves down, and inverts with the first and the second valence bands consecutively. The first band inversion makes the system nontrivial, while the second one does not change the topological invariant of the system. Both the band inversions yield surface modes spanning the individual inverted gaps, but only the surface mode in the upper gap associates with the nontrivial nature of tensile-strained α-Sn.

cond-mat.mtrl-sci

Borel and analytic sets in locales

We systematically develop analogs of basic concepts from classical descriptive set theory in the context of pointless topology. Our starting point is to take the elements of the free complete Boolean algebra generated by the frame $\mathcal{O}(X)$ of opens to be the "$\infty$-Borel sets" in a locale $X$. We show that several known results in locale theory may be interpreted in this framework as direct analogs of classical descriptive set-theoretic facts, including e.g., the Lusin separation, Lusin-Suslin, and Baire category theorems for locales; we also prove several extensions of these results. We give a detailed analysis of various notions of image, and prove that a continuous map need not have an $\infty$-Borel image. We introduce the category of "analytic $\infty$-Borel locales" as the regular completion under images of the unary site of locales and $\infty$-Borel maps, and prove analogs of several classical results about analytic sets, such as a boundedness theorem for well-founded analytic relations. We also consider the "positive $\infty$-Borel sets" of a locale, formed from opens without using $\neg$. We in fact work throughout with $κ$-copresented $κ$-locales and $κ$-Borel sets for arbitrary regular $ω_1 \le κ\le \infty$, thereby incorporating the classical context as the special case $κ= ω_1$. The basis for the aforementioned localic results is a detailed study of various known and new methods for presenting $κ$-frames, $κ$-Boolean algebras, etc. In particular, we introduce a new type of "two-sided posite" for presenting $(κ, κ)$-frames $A$ (i.e., both $A$ and $A^{op}$ are $κ$-frames), and use this to prove a general $κ$-ary interpolation theorem for $(κ, κ)$-frames, which dualizes to the aforementioned separation theorems.

math.LO