Definable Combinatorics of Some Borel Equivalence Relations
Definable Combinatorics of Some Borel Equivalence Relations
复制标题
一些Borel等价关系的可定义组合
DOI:
--
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
C. Meehan
中科院分区:
文献类型:
--
作者:
William Chan;C. Meehan
If $X$ is a set, $E$ is an equivalence relation on $X$, and $n in omega$, then define $$[X]^n_E = {(x_0, ..., x_{n - 1}) in {}^nX : (forall i,j)(i
eq j Rightarrow
eg(x_i E x_j))}.$$
For $n in omega$, a set $X$ has the $n$-Jonsson property if and only if for every function $f : [X]^n_=
ightarrow X$, there exists some $Y subseteq X$ with $X$ and $Y$ in bijection so that $f[[Y]^n_=]
eq X$. A set $X$ has the Jonsson property if and only for every function $f : (igcup_{n in omega}[X]^n_=)
ightarrow X$, there exists some $Y subseteq X$ with $X$ and $Y$ in bijection so that $f[igcup_{n in omega} [Y]^n_=]
eq X$.
Let $n in omega$, $X$ be a Polish space, and $E$ be an equivalence relation on $X$. $E$ has the $n$-Mycielski property if and only if for all comeager $C subseteq {}^nX$, there is some $mathbf{Delta_1^1}$ $A subseteq X$ so that $E leq_{mathbf{Delta_1^1}} E upharpoonright A$ and $[A]^n_E subseteq C$.
The following equivalence relations will be considered: $E_0$ is defined on ${}^omega2$ by $x E_0 y$ if and only if $(exists n)(forall k > n)(x(k) = y(k))$. $E_1$ is defined on ${}^omega({}^omega2)$ by $x E_1 y$ if and only if $(exists n)(forall k > n)(x(k) = y(k))$. $E_2$ is defined on ${}^omega2$ by $x E_2 y$ if and only if $sum{frac{1}{n + 1} : n in x riangle y} < infty$, where $ riangle$ denotes the symmetric difference. $E_3$ is defined on ${}^omega({}^omega2)$ by $x E_3 y$ if and only if $(forall n)(x(n) E_0 y(n))$.
Holshouser and Jackson have shown that $mathbb{R}$ is Jonsson under $mathsf{AD}$. It will be shown that $E_0$ does not have the $3$-Mycielski property and that $E_1$, $E_2$, and $E_3$ do not have the $2$-Mycielski property. Under $mathsf{ZF + AD}$, ${}^omega 2 / E_0$ does not have the $3$-Jonsson property.