ISOMORPHISM VIA FULL GROUPS BENJAMIN D. MILLER Abstract. At the request of Medynets, we give a measure-theoretic characterization of the circumstances under which Borel subsets A, B of a Polish space X can be mapped to one another via an element of the full group of a countable Borel equivalence relation on X.

Suppose that X is a Polish space and E is a countable Borel equivalence relation on X. The full group of E is the group [E] of Borel automorphisms f : X → X such that graph(f ) ⊆ E. The full semigroup of E is the semigroup JEK of Borel isomorphisms f : A → B, where A, B ⊆ X are Borel, such that graph(f ) ⊆ E. We write A ∼ B to indicate that there exists f ∈ JEK such that f (A) = B. Theorem 1. Suppose that X is a Polish space, E is a countable Borel equivalence relation on X, and A, B ⊆ X are Borel. Then the following are equivalent: 1. A ∼ B. 2. The following conditions are satisfied: (a) [A]E = [B]E . (b) Every (E|A)-invariant finite measure on A extends to an (E|(A ∪ B))invariant finite measure on A ∪ B such that µ(A) = µ(B). (c) Every (E|B)-invariant finite measure on B extends to an (E|(A ∪ B))invariant finite measure on A ∪ B such that µ(A) = µ(B). Proof. As the proof of (1) ⇒ (2) is straightforward, we prove only (2) ⇒ (1). By Feldman-Moore [2], there is a countable group Γ = {γn }n∈N of Borel automorphisms of X with E = EΓX . Define recursively An ⊆ A and Bn ⊆ B by 

An = A \





[

Am ∩ γn−1 B \

[

Bm



m
m
and 

Bn = γn A \

[



m
S



Am ∩ B \

[



Bm .

m
S

Put A∞ = n∈N An and B∞ = n∈N Bn . As hAn in∈N and hBn in∈N partition A∞ and B∞ , respectively, there is a Borel isomorphism g : A∞ → B∞ in JEK such that ∀n ∈ N (g|An = γn |An ). Lemma 2. ∀x ∈ X (A ∩ [x]E = A∞ ∩ [x]E or B ∩ [x]E = B∞ ∩ [x]E ). 1

2

BENJAMIN D. MILLER

Proof. Suppose, towards a contradiction, that there exists x ∈ X such that both (A \ A∞ ) ∩ [x]E and (B \ B∞ ) ∩ [x]E are non-empty. Fix xA ∈ (A \SA∞ ) ∩ [x]E and xB ∈S(B \ B∞ ) ∩ [x]E , and find n ∈ N such that γn · xA = xB . As m 0, thus ν(A) > ν(g −1 (B)), and one final appeal to invariance implies that ν(A) > ν(B), the desired contradiction. It follows that g −1 (B ∩ XA ) is also compressible, thus so too is A ∩ XA . 2 A Borel set C ⊆ X is countably paradoxical if it can be partitioned into Borel sets C0 , C1 , . . . ⊆ C such that ∀i, j ∈ N (Ci ∼ Cj ). We will need the following fact from Becker-Kechris [1]: Proposition 5 (Becker-Kechris). Suppose that X is a Polish space and E is a countable Borel equivalence relation on X. Then X is compressible ⇔ X is countably paradoxical. Using this, we can now establish the following general fact: Lemma 6. Suppose that X is a Polish space, E is a countable Borel equivalence relation on X, and C ⊆ X is a compressible Borel E-complete section. Then C ∼ X.

ISOMORPHISM VIA FULL GROUPS

3

Proof. By a straightforward Schr¨oder-Bernstein argument, it is enough to find f ∈ JEK such that f (X) ⊆ C. By Theorem 5, there is a partition C0 , C1 , . . . ⊆ C of C into Borel sets as well as bijections fn ∈ JEK of C0 with Cn , for each n ∈ N. By Feldman-Moore [2], there is a countable group Γ = {γn }n∈N of Borel automorphisms of X with E = EΓX . For each x ∈ X, let n(x) be the least natural number such that γn(x) · x ∈ C0 , and observe that the function f (x) = fn(x) (γn(x) · x) is an element of JEK such that f (X) ⊆ C. 2 By Lemmas 4 and 6, there are Borel isomorphisms gA , gB ∈ JEK of A ∩ XA with −1 XA and B ∩ XA with XA , respectively, and it follows that the function gB ◦ gA is the desired element of JEK which sends A ∩ XA to B ∩ XA . 2 As an immediate corollary, we now have the following: Theorem 7. Suppose that X is a Polish space, E is a countable Borel equivalence relation on X, and A, B ⊆ X are Borel, and set Ac = X \ A and B c = X \ B. The following are equivalent: 1. There exists f ∈ [E] such that f (A) = B. 2. The following conditions are satisfied: (a) [A]E = [B]E . (b) Every (E|A)-invariant finite measure on A extends to an (E|(A ∪ B))invariant finite measure on A ∪ B such that µ(A) = µ(B). (c) Every (E|B)-invariant finite measure on B extends to an (E|(A ∪ B))invariant finite measure on A ∪ B such that µ(A) = µ(B). (d) [Ac ]E = [B c ]E . (e) Every (E|Ac )-invariant finite measure on Ac extends to an (E|(Ac ∪B c ))invariant finite measure on Ac ∪ B c such that µ(Ac ) = µ(B c ). (f) Every (E|B c )-invariant finite measure on B c extends to an (E|(Ac ∪B c ))invariant finite measure on Ac ∪ B c such that µ(Ac ) = µ(B c ). References [1] H. Becker and A. Kechris. The descriptive set theory of Polish group actions, volume 232 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1996) [2] J. Feldman and C. Moore. Ergodic equivalence relations, cohomology, and von Neumann algebras. I. Trans. Amer. Math. Soc., 234 (2), (1977), 289–324 [3] M. Nadkarni. On the existence of a finite invariant measure. Proc. Indian Acad. Sci. Math. Sci., 100 (3), (1990), 203–220

Isomorphism via full groups

Suppose that X is a Polish space and E is a countable Borel equivalence relation on X. The full group of E is the group [E] of Borel automorphisms f : X → X such that graph(f) ⊆ E. The full semigroup of E is the semigroup [E] of Borel isomorphisms f : A → B, where A, B ⊆ X are Borel, such that graph(f) ⊆ E. We write A ∼ B to ...

136KB Sizes 9 Downloads 281 Views

Recommend Documents

ISOMORPHISM OF BOREL FULL GROUPS 1. Introduction Suppose ...
Jun 17, 2005 - phism of E and F. Here we establish the connection between Borel .... x(T1) = x(T2), in which case we can easily find an element of T1 which ...

Polynomial-Time Isomorphism Test for Groups with no ...
Keywords: Group Isomorphism, Permutational Isomorphism, Code Equiva- lence. .... lence, in [3] we gave an algorithm to test equivalence of codes of length l over an ... by x ↦→ xg := g−1xg. For S ⊆ G and g ∈ G we set Sg = {sg | s ∈ S}. Pe

Polynomial-time Isomorphism Test for Groups with ...
algorithm to test isomorphism for the largest class of solvable groups yet, namely groups with abelian Sylow towers, defined as ...... qi , qi = pmi . Then we need to use Wedderburn's theory on the structure of semisimple algebras.2. ▷ Lemma 5.4 (L

Generating Text via Adversarial Training -
network (CNN) for adversarial training to generate realistic text. Instead of using .... for the generator by pre-training a standard auto-encoder LSTM model.

Improved Random Graph Isomorphism
probability algorithm for the canonical labeling of a G(n, p) random graph for p ∈ ... Random graph isomorphism is a classic problem in the algorithmic theory of ...

Junto-symmetric Functions, Hypergraph Isomorphism ...
permutations of f is equal to the index of Aut(f) in Sn, i.e.,. |DifPerm(f)| = |Sn .... Definition 2. Let F denote a sequence f1,f2,... of boolean functions with fn : {0, 1}n → {0, 1} for each n ∈ N+ . We say that F is an O(1)-junto-symmetric fam

Design Thinking Crash Course, via faberNovel and... -
Sep 30, 2013 - There is no need to print your ticket. Your name will be on a guest list at the door. 210279557267670141001. 210279557267670141001.

Code Equivalence and Group Isomorphism - Department of Computer ...
where Z(G) is the center of G. No complete structure theory of ... Following [29], we call such groups .... advanced tasks, such as finding a composition series can.

Code Equivalence and Group Isomorphism - Department of Computer ...
Recently, other special classes of solvable groups have been considered; the isomorphism problem of extensions of an abelian group by a cyclic group of.

Via 1617(a) @ via ac97 enhanced audio controller driver download ...
Hp laserjet p1005 drivers windows 7 free download.Intrudactoun tuVia ... Download printer driver for hp officejet pro 8500.288489471588365.Dell 968 aio printer driver windows 7.Download Via ... Canon dr-3060 scsiscanner device driver.

Via Valeriana.pdf
... integratori alimentari, macchina fotografica,. maglietta tecnica di ricambio, occhiali e cappello da sole. Ai partecipanti iscritti verranno forniti i contatti telefonici.

Driver via vt1708 a via vt8237s high definition audio controller ...
High power wireless usb adapter driver mac.Ntl usb ... Driver da placa maeasus p5pe-vm. Aceraspire ... Pdf printer driver download windows xp.Intelr 845g ...

lynda via bpl.pdf
http://www.bpl.org/general/circulation/ecards.htm. Click on “Get oR Renew Your eCard” ... lynda via bpl.pdf. lynda via bpl.pdf. Open. Extract. Open with. Sign In.

casos via FJ.pdf
Loading… Page 1. Whoops! There was a problem loading more pages. Retrying... casos via FJ.pdf. casos via FJ.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying casos via FJ.pdf.

Via Curcis VerboDivino.pdf
Page 3 of 8. Via Curcis VerboDivino.pdf. Via Curcis VerboDivino.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Via Curcis VerboDivino.pdf.

Truthfulness via Proxies
Feb 4, 2011 - Cornell Unversity [email protected]. Hu Fu. Department of Computer Science. Cornell Unversity [email protected]. Robert Kleinberg.

Díptic Via Ferrada.pdf
Loading… Page 1. Whoops! There was a problem loading more pages. Retrying... Díptic Via Ferrada.pdf. Díptic Via Ferrada.pdf. Open. Extract. Open with.

Full page photo -
Feb 5, 2018 - concerns and for keeping us informed of the status of the proposed ... We were pleased to learn Verizon has changed their proposal from a ...

Full page photo -
Chinese New Year Celebration. 2013. 2018. YEAR OF PE SNAKE. Games, art, food, music, dance, crafts red envelopes and more! February 23, 2013. 1:00-3:00 ...

Full page photo -
Indian Students at Rice (ISAR) ... A proudly presents despotsav 2013. -100 November 2013, Sunday. 5 - 8 PM Grand Hall. Rice Memorial Center. Enjoy an ...