Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ordinal Definability and Combinatorics of Equivalence Relations

Published 12 Nov 2017 in math.LO | (1711.04353v1)

Abstract: Assume $\mathsf{ZF + AD+ + V = L(\mathscr{P}(\mathbb{R}))}$. Let $E$ be a $\mathbf{\Sigma}1_1$ equivalence relation coded in $\mathrm{HOD}$. $E$ has an ordinal definable equivalence class without any ordinal definable elements if and only if $\mathrm{HOD} \models E$ is unpinned. $\mathsf{ZF + AD+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves $E$-class section uniformization when $E$ is a $\mathbf{\Sigma}1_1$ equivalence relation on $\mathbb{R}$ which is pinned in every transitive model of $\mathsf{ZFC}$ containing the real which codes $E$: Suppose $R$ is a relation on $\mathbb{R}$ such that each section $R_x = {y : (x,y) \in R}$ is an $E$-class, then there is a function $f : \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x \in \mathbb{R}$, $R(x,f(x))$. $\mathsf{ZF + AD}$ proves that $\mathbb{R} \times \kappa$ is J\'onsson whenever $\kappa$ is an ordinal: For every function $f : [\mathbb{R} \times \kappa]{<\omega}_= \rightarrow \mathbb{R} \times \kappa$, there is an $A \subseteq \mathbb{R} \times \kappa$ with $A$ in bijection with $\mathbb{R} \times \kappa$ and $f[[A]{<\omega}_=] \neq \mathbb{R} \times \kappa$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.