Every equivalence relation with countable classes is the orbit relation of one permutation
ProvedCountableOrbit.exists_perm_rel_iff_exists_zpow_eqLet be an equivalence relation on a set whose classes are countable. Then there is a bijection of such that if and only if for some : arrange each class as a finite cycle or as a copy of .
Lodha and Moore define (p. 4): "Let be a Polish space and let be an equivalence relation which is Borel and which has countable equivalence classes. is -amenable if, after discarding a -measure set, is the orbit equivalence relation of an action of ." The definition does not say that the action of is Borel. Read without that, this theorem makes every such relation -amenable, and Theorem 2.2 would be false; Theorem 2.2 says the orbit relation of a countable dense subgroup of on the projective line is not amenable with respect to Lebesgue measure. The Lodha–Moore mission's definition (LodhaMoore.IsMuAmenable) takes the action to be by a Borel automorphism.
import Mathlib
namespace CountableOrbit
theorem exists_perm_rel_iff_exists_zpow_eq {X : Type*} (r : X → X → Prop) (hr : Equivalence r)
(hc : ∀ x, {y | r x y}.Countable) :
∃ T : Equiv.Perm X, ∀ x y, r x y ↔ ∃ n : ℤ, (T ^ n) x = y := by
sorry
end CountableOrbit