Ordinal Definability and Combinatorics of Equivalence Relations
Abstract
Assume ZF + AD+ + V = L(P(R)). Let E be a 11 equivalence relation coded in HOD. E has an ordinal definable equivalence class without any ordinal definable elements if and only if HOD E is unpinned. ZF + AD+ + V = L(P(R)) proves E-class section uniformization when E is a 11 equivalence relation on R which is pinned in every transitive model of ZFC containing the real which codes E: Suppose R is a relation on R such that each section Rx = \y : (x,y) ∈ R\ is an E-class, then there is a function f : R → R such that for all x ∈ R, R(x,f(x)). ZF + AD proves that R × is J\'onsson whenever is an ordinal: For every function f : [R × ]<ω= → R × , there is an A ⊂eq R × with A in bijection with R × and f[[A]<ω=] ≠ R × .
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.