The countable invariant uniformization characterization of reducibility to countable

Let EE be a Borel equivalence relation on a Polish space XX. Say that EE is reducible to countable if there are a Polish space ZZ, a countable Borel equivalence relation FF on ZZ, and a Borel function S ⁣:XZS\colon X\to Z such that

x1Ex2    S(x1)FS(x2).x_1 E x_2 \iff S(x_1) F S(x_2).

For a Polish space YY, an EE-invariant countable uniformization of an EE-invariant Borel set PX×YP\subseteq X\times Y with full projection is a Borel function f ⁣:XYNf\colon X\to Y^\mathbb{N} such that (x,f(x)n)P(x,f(x)_n)\in P for all x,nx,n, and x1Ex2x_1 E x_2 implies

{f(x1)n:nN}={f(x2)n:nN}.\{f(x_1)_n:n\in\mathbb{N}\}=\{f(x_2)_n:n\in\mathbb{N}\}.

We say that EE satisfies measure, category, or KσK_\sigma countable invariant uniformization when the corresponding uniformization property holds for every YY, measure or category structure, and PP in the relevant uniformization theorem, provided PP is EE-invariant.

Countable invariant uniformization conjecture. Let EE be a Borel equivalence relation on a Polish space XX. Then the following are equivalent: (a) EE is reducible to countable; (b) EE satisfies measure countable invariant uniformization; (c) EE satisfies category countable invariant uniformization; (d) EE satisfies KσK_\sigma countable invariant uniformization.

The implication from reducibility to countable to each of the three uniformization properties follows from the preceding argument, while the converse equivalences are conjectured and remain unresolved.

Sources & referencesView supporting material

Primary source

Alexander S. Kechris and Michael Wolman, “Invariant uniformization”, arXiv:2405.15111 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.