Thompson's group F is nonamenable
Thompson's group is not amenable.
The proof of Theorem 1.1 follows directly from Proposition 2.3 and the Følner criterion for amenability.
“Theorem 1.1. Thompson’s group F is not amenable.” · Show in paper
Manuscripts from openai/math
git clone https://openversions.com/git/index/openai-math.githttps://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2fdfd8c46870b48511e697cbb43a3c8c91d375fa2fFork to create your own copy with credit to the source. Clone to get a Git copy on your computer.
Sync OpenAI Math manuscripts from 4eaee87548250b2682affda7d05d947c05554bae
Committed
Thompson's group F is nonamenable
The proof of Theorem 1.1 follows directly from Proposition 2.3 and the Følner criterion for amenability.
“Theorem 1.1. Thompson’s group F is not amenable.” · Show in paper
All steps in the variance estimate, correlation comparison, and algebraic rearrangement are rigorous and complete, with positivity guaranteed by .
“Proposition 2.3. For every nonempty finite set A ⊂ F, max_{h∈S} |hA △ A| / |A| ≥ (δ^2/L^2 − 4/D) / (4(1 − 1/D)) > 0.” · Show in paper
The proof accurately uses the piecewise linear dyadic structure of elements of and the nesting property of dyadic intervals.
“Lemma 2.1. For each g ∈ F, the partitions gT(n) are basic for all sufficiently large n, and their meshes tend to zero. In particular, given a finite set K ⊂ F and a finite family J of basic intervals, there is an n0 such that gT(n) is basic and respects every member of J whenever g ∈ K and n ≥ n0.” · Show in paper
The constructive proof cleanly produces the required element .
“Lemma 2.2. If I < J and I′ < J′ are pairs of internal basic intervals, there is an h ∈ F whose restrictions carry I affinely onto I′ and J affinely onto J′.” · Show in paper
While Theorem 1.1 is verified, Corollary 3.1 relies on an external preprint [17] that is not included in the manuscript and cannot be assessed.
“Corollary 3.1. For every ε > 0, there are a separable complex Hilbert space H and a representation π : F → GL(H) such that sup_{g∈F} ∥π(g)∥ ≤ 1 + ε, but no bounded invertible operator S on H makes every Sπ(g)S−1 unitary.” · Show in paper
While Theorem 1.1 is verified, Corollary 3.2 relies on an external preprint [16] that is not included in the manuscript and cannot be assessed.
“Corollary 3.2. For every such generating set S, ∥Tpc∥2→2 < ∞, pc < p2→2 ≤ pu. For each fixed p ∈ (pc, pu), there are almost surely infinitely many infinite open clusters. Moreover, there are deterministic pc < p1 < p2 < 1, depending on S, such that in the coupling with independent uniform [0, 1] edge labels Ue, opening e when Ue ≤ p, there are almost surely infinitely many infinite open clusters simultaneously for every p ∈ [p1, p2].” · Show in paper
The construction and all Lipschitz and lower-bound estimates in Appendix A are detailed and mathematically sound.
“Proposition A.1. Let H = L2([0, 1]; R2) be a real Hilbert space and let B = {x ∈ H : ∥x∥ ≤ 1}. There is a globally Lipschitz map f : B → B such that ∥f(x)∥ = 1, ∥f(x) − x∥ ≥ 1/2 (x ∈ B).” · Show in paper
“Define a color p(T) ∈ B for every basic partition T by induction on its number of cells: p(T) = f( (1/D) sum_{j=1}^D p() ) if T respects every I_j, and 0 otherwise.” · Show in paper
“For every ordered pair I < J in I, choose, using Lemma 2.2, an element ∈ F carrying I, J affinely onto I1, I2, respectively. Let S be the finite set of these elements.” · Show in paper
“It follows that (g) = (g). Apply (2.7) to the globally bounded function and use (2.9). We obtain |E_A⟨X_I, X_J⟩ − α| ≤ η whenever I, J ∈ I are strictly separated.” · Show in paper
“The aim is to construct a Lipschitz map G : B → H bounded away from zero and equal to the identity when ∥x∥ ≥ 1/2. Then f(x) = −G(x)/∥G(x)∥ has the required displacement. A tube about a curve with a bounded tail supplies G.” · Show in paper