English

On $\ell^{p}$-like equivalence relations

Logic 2009-11-17 v1 Combinatorics

Abstract

For f ⁣:[0,1]\rar+f \colon [0,1] \rar \real^{+}, consider the relation Ef\mathbf{E}_{f} on [0,1]ω[0,1]^{\omega} defined by (xn)Ef(yn)n<ωf(ynxn)<.(x_{n}) \mathbf{E}_{f} (y_{n}) \Leftrightarrow \sum_{n < \omega} f(|y_{n} - x_{n}|) < \infty. We study the Borel reducibility of Borel equivalence relations of the form Ef\mathbf{E}_{f}. Our results indicate that for every 1p<q<1 \leq p < q < \infty, the order B\leq_{B} of Borel reducibility on the set of equivalence relations {\bE ⁣:\bE\IdpB\bEB\bE\Idq}\{\bE \colon \bE_{\Id^{p}} \leq_{B} \bE \leq_{B} \bE_{\Id^{q}}\} is more complicated than expected, e.g. consistently every linear order of cardinality continuum embeds into it.

Cite

@article{arxiv.0911.2778,
  title  = {On $\ell^{p}$-like equivalence relations},
  author = {Tamás Mátrai},
  journal= {arXiv preprint arXiv:0911.2778},
  year   = {2009}
}
R2 v1 2026-06-21T14:11:36.038Z