Ordinal Definability and Combinatorics of Equivalence Relations

TL;DR

This paper explores the properties of certain equivalence relations under strong set-theoretic assumptions, establishing results about definability, uniformization, and Jf3nsson properties in the context of determinacy and inner models.

Contribution

It proves new results on the structure of b4;1_1 equivalence relations and their classes under AD^+ assumptions, including uniformization and definability properties.

Findings

Existence of ordinal definable equivalence classes without ordinal definable elements under certain conditions.

Proves E-class section uniformization for b4;1_1 equivalence relations that are pinned in models containing the coding real.

Shows f6;R imes f6;appa is Jf3nsson under AD, for any ordinal f6;appa.

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$.