2019
DOI: 10.1007/s00220-019-03598-y
|View full text |Cite
|
Sign up to set email alerts
|

Orbit Equivalence Rigidity for Product Actions

Abstract: Let Γ1, . . . , Γn be hyperbolic, property (T) groups, for some n ≥ 1. We prove that if a product Γ1 × · · · × Γn X1 × · · · × Xn of measure preserving actions is stably orbit equivalent to a measure preserving action Λ Y , then there exists a direct product decomposition Λ = Λ1×· · ·×Λn into n infinite groups. Moreover, there exists a measure preserving action ΛiYi which is stably orbit equivalent to Γi Xi, for any 1 ≤ i ≤ n, and the product action Λ1 × · · · × Λn Y1 × · · · × Yn is isomorphic to Λ Y .

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
2

Relationship

4
4

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 58 publications
0
3
0
Order By: Relevance
“…In the first part of the section we prove Theorem A (see Theorem 5.2) and therefore, generalize the main results from [CdSS15]. The technology that we use is slightly different from the one in [CdSS15], resembling more the methods developed in [DHI16,Dr19a,Dr19b].…”
Section: W * -Superrigidity For Product Groupsmentioning
confidence: 84%
“…In the first part of the section we prove Theorem A (see Theorem 5.2) and therefore, generalize the main results from [CdSS15]. The technology that we use is slightly different from the one in [CdSS15], resembling more the methods developed in [DHI16,Dr19a,Dr19b].…”
Section: W * -Superrigidity For Product Groupsmentioning
confidence: 84%
“…By using [DHI16, Lemma 2.4] it follows that . By applying [Dri20b, Lemma 2.3], we derive that for any subset , The rest of the proof is divided between three claims.…”
Section: Measure Equivalence and Tensor Product Decompositions For Classmentioning
confidence: 99%
“…R Λ n 1 ×...×Λ n k ≅ (R Λ m 1 ×...×Λ m l ) t . Therefore using [MS02, Theorem 1.16] (see also [Dr19,Theorem ]) we have k = l and after permuting the indices we have R Λ n i ≅ (R Λ m i ) t i for some t 1 t 2 ...t k = t. However using [Ga02, Corollaire 0.4] (see also [CZ88]) this further implies that n i = m i and t, t 1 , t 2 , ..., t k = 1; in particular, G ≅ H.…”
Section: Proofmentioning
confidence: 99%