On continuous Polish group actions and equivalence relations
Abstract
Let X = \P ∈ [0,1] N : (∀ ∈ N ) (P (\ \ ) > 0 ) Σ = 0∞ P (\ \ ) = 1 \ be the Polish space of probability measures on N, each of which assigns positive probability to every elementary event, while for any P ∈ X, let P = \ ∈ L1( N, P) : (∀ ∈ N ) ( () > 0 ) Σ = 0∞ () P (\ \ ) = 1 \ and let P : P P() ∈ X be defined by the relation (P() ) (\ \ ) = () P (\ \ ) , whenever ∈ N. If we consider the equivalence relation E = \(P,Q) ∈ X2 : (∃ ∈ P ) (Q = P() ) \ , the Polish space P = \ x ∈ 1 ( R ) : (∀ n ∈ N ) ( x(n) > 0 ) \ and the commutative Polish group G = \ g ∈ (0, ∞) N : n → ∞ g(n) = 1 \ , while we set ( g · x ) (n) = g(n) x(n), whenever g ∈ G, x ∈ P and n ∈ N, then E is definable and it admits a strong approximation by the turbulent Polish group action of G on P.
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.