English
Related papers

Related papers: A separation result for countable unions of Borel …

200 papers

We give, for each countable ordinal $\xi \geq 1$, an example of a ${\bf\Delta}^0_2$ countable union of Borel rectangles that cannot be decomposed into countably many ${\bf\Pi}^0_\xi$ rectangles. In fact, we provide a graph of a partial…

Logic · Mathematics 2013-08-22 Dominique Lecomte , Miroslav Zeleny

We provide Hurewicz tests for the separation of disjoint analytic sets by rectangles of the form $\Gamma\times\Gamma'$ for $\Gamma,\Gamma'\in {\mathbf\Sigma^0_1 , \mathbf\Pi^0_1 , \mathbf\Pi^0_2 }$.

General Topology · Mathematics 2014-11-12 Rafael Zamora

We show that if an equivalence relation $E$ on a Polish space is a countable union of smooth Borel subequivalence relations, then there is either a Borel reduction of $E$ to a countable Borel equivalence relation on a Polish space or a…

Logic · Mathematics 2025-01-22 N. de Rancourt , B. D. Miller

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

Operator Algebras · Mathematics 2016-05-06 Martino Lupini

We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $\Sigma$ 0 $\xi$ (or $\Pi$ 0 $\xi$). We characterize…

Logic · Mathematics 2018-05-30 Dominique Lecomte

We prove that the equivalence of pure states of a separable C*-algebra is either smooth or it continuously reduces $[0,1]^{\bbN}/\ell_2$ and it therefore cannot be classified by countable structures. The latter was independently proved by…

Operator Algebras · Mathematics 2010-02-01 Ilijas Farah

A scalar integer partition problem asks for a number of nonnegative integer solutions to a linear Diophantine equation with integer positive coefficients. The manuscript discusses an algorithm of derivation of linear relations involving the…

Number Theory · Mathematics 2025-09-16 Boris Y. Rubinstein

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

Logic · Mathematics 2015-12-16 Pedro Sánchez Terraf

We give an affirmative answer to the following question: Is any Borel subset of a Cantor set $\textbf{ C}$ a sum of a countable number of pairwise disjoint $h$-homogeneous subspaces that are closed in $X$? It follows that every Borel set $X…

Logic · Mathematics 2011-02-17 Alexey Ostrovsky

A classical theorem of Luzin is that the separation principle holds for the Pi^0_alpha sets but fails for the Sigma^0_alpha sets. We show that for every Sigma^0_alpha set A which is not Pi^0_alpha there exists a Sigma^0_alpha set B which is…

Logic · Mathematics 2007-05-23 Arnold W. Miller

Let $\xi\geq 1$ be a countable ordinal. We study the Borel subsets of the plane that can be made ${\bf\Pi}^0_\xi$ by refining the Polish topology on the real line. These sets are called potentially ${\bf\Pi}^0_\xi$. We give a Hurewicz-like…

Logic · Mathematics 2009-06-01 Dominique Lecomte

We study the possibility of splitting any bounded analytic function with singularities in a closed set E union F as a sum of two bounded analytic functions with singularities in E and F respectively. We obtain some results under geometric…

Complex Variables · Mathematics 2008-08-12 V. P. Havin , A. H. Nersessian , J. Ortega-Cerda

Let $\mathcal R$ be a $\Sigma^1_1$ binary relation and call a set $\mathcal R$-discrete iff no two distinct of its elements are $\mathcal R$-related. We show that in the extension of $\mathbf{L}$ by iterated Sacks forcing, there is a…

Logic · Mathematics 2025-10-28 David Schrittesser

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

Rings and Algebras · Mathematics 2023-06-22 Robin Hirsch , Brett McLean

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

Logic · Mathematics 2012-11-28 Mohammad Assem

Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem…

Formal Languages and Automata Theory · Computer Science 2013-03-12 Lorijn van Rooijen , Marc Zeitoun

A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…

Commutative Algebra · Mathematics 2016-02-01 Emilie Dufresne

We prove in this paper that there exists some infinitary rational relations which are Sigma^0_3-complete Borel sets and some others which are Pi^0_3-complete. This implies that there exists some infinitary rational relations which are…

Logic in Computer Science · Computer Science 2010-07-26 Olivier Finkel

We are concerned with two separation theorems about analytic sets by Dyck and Preiss, the former involves the positively-defined subsets of the Cantor space and the latter the Borel-convex subsets of finite dimensional Banach spaces. We…

Logic · Mathematics 2017-03-21 Vassilios Gregoriades

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

Quantum Physics · Physics 2007-05-23 D. Salgado , J. L. Sanchez-Gomez , M. Ferrero
‹ Prev 1 2 3 10 Next ›