2012
DOI: 10.1017/s0143385711000988
|View full text |Cite
|
Sign up to set email alerts
|

Bernoulli actions are weakly contained in any free action

Abstract: Let Γ be a countable group and let f be a free probability measure preserving action of Γ. We show that all Bernoulli actions of Γ are weakly contained in f .It follows that for a finitely generated group Γ, the cost is maximal on Bernoulli actions for Γ and that all free factors of i.i.d. of Γ have the same cost.We also show that if f is ergodic, but not strongly ergodic, then f is weakly equivalent to f × I where I denotes the trivial action of Γ on the unit interval. This leads to a relative version of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
67
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(69 citation statements)
references
References 9 publications
2
67
0
Order By: Relevance
“…A similar rephrasing also applies to weak containment of measure preserving actions, as pointed out by Abért-Weiss [AW11]. If we view a finite Borel partition A 0 , .…”
mentioning
confidence: 79%
See 1 more Smart Citation
“…A similar rephrasing also applies to weak containment of measure preserving actions, as pointed out by Abért-Weiss [AW11]. If we view a finite Borel partition A 0 , .…”
mentioning
confidence: 79%
“…Several invariants of measure preserving actions such as groupoid cost [AW11] ( [Ke10] for the case of free actions) and independence number [CK10] are known to increase or decrease with weak containment (see also [AE11a] and [CKT-D11] for other examples). A consequence of Theorem 1.5 is that, for a finitely generated group Γ, among all nonatomic measure preserving actions of type θ, the groupoid cost attains its maximum and the independence number attains its minimum on s θ,λ .…”
Section: Is the Bernoulli Shift Action Of γ Then ι × S γ Is A Free Amentioning
confidence: 99%
“…Thus, we have used the first element in our stack [0,1] N to set up an Γ-equivariant colouring of the set of cycles. We now will use the other elements in the stack to set up an infinite recursive Γ-equivariant cutting procedure which will have the property, that it does not disconnect the graph G. Let's pick a standard enumeration α : N × N ∼ = N and set ψ x := α • ϕ x .…”
Section: Relative Minimal Spanning Forestsmentioning
confidence: 99%
“…Note that the set ψ x (0), we cut the edge with the maximal label (this is the second in our stack [0,1] N ) not in L(a). Clearly, this does not disconnect G.…”
Section: Relative Minimal Spanning Forestsmentioning
confidence: 99%
“…In [AW13], M. Abért and B. Weiss exhibit a remarkable anti-rigidity phenomenon for weak containment by showing that every free p.m.p. action of Γ weakly contains the Bernoulli action over an atomless base space.…”
Section: Introductionmentioning
confidence: 99%