Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1411.0327

On Schauder Equivalence Relations

Xin Ma
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study Schauder equivalence relations, which are Borel equivalence relations generated by Banach spaces with basic sequences. We prove that the set of equivalence relations generated by basic sequences has boundaries. Then we show that equivalence relations generated by the basis in Tsirelson spaces has similar properties of Tsirelson spaces in the Banach space theory. In particular, we prove that both l_p and c_0 are not reducible to the equivalence relation generated by Tsirelson space T with the unit vector basis \{t_n\}. We also show that Borel equivalence relation generated by α-Tsirelson spaces are mutually incompatible. Based on this argument, we show that any basis of Schauder equivalence relations must be of cardinal 2^ω.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Xin Ma. 2014-11-02. On Schauder Equivalence Relations. https://arxiv.org/abs/1411.0327

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

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗