[Paper Review] Nonassociative Ramsey Theory and the amenability of Thompson's group

Justin Tatch Moore|arXiv (Cornell University)|Sep 10, 2012

Advanced Topology and Set Theory15 references3 citations

TL;DR

This paper proves the amenability of Thompson's group F using novel nonassociative Ramsey-theoretic methods, establishing a generalization of Hindman's theorem for the free nonassociative binary system on one generator. The key contribution is a new structural framework linking combinatorial dynamics to group amenability via nonassociative algebraic systems.

ABSTRACT

The purpose of this article is prove that Thompson's group F is amenable. The methods developed will then be used to prove a generalization of Hindman's theorem for the free nonassociative binary system on one generator.

Motivation & Objective

• To establish the amenability of Thompson's group F, a long-standing open problem in geometric group theory.
• To develop a nonassociative Ramsey-theoretic framework applicable to algebraic structures without associativity.
• To generalize Hindman's theorem to the setting of the free nonassociative binary system on a single generator.
• To connect combinatorial properties of nonassociative systems with structural properties of infinite groups.
• To provide a new methodological bridge between Ramsey theory and group amenability.

Proposed method

• Utilizes the free nonassociative binary system on one generator as a foundational algebraic structure to model nonassociative operations.
• Applies a nonassociative version of Hindman-type Ramsey-theoretic results to analyze combinatorial configurations in the system.
• Introduces a dynamical interpretation of nonassociative words via a shift action on infinite trees or bracketings.
• Employs ultrafilter techniques and partition regularity in nonassociative settings to derive structural constraints.
• Translates combinatorial regularity in the nonassociative system into growth conditions on the group F.
• Uses the derived regularity to construct a finitely additive invariant mean, proving amenability of F.

Experimental results

Research questions

• RQ1 Can nonassociative Ramsey theory be extended to provide structural results in non-associative algebras?
• RQ2 Does the free nonassociative binary system on one generator satisfy a Hindman-type theorem?
• RQ3 Can combinatorial properties of nonassociative systems be used to deduce group-theoretic properties of Thompson's group F?
• RQ4 Is Thompson's group F amenable, and if so, what novel methods can prove its amenability?
• RQ5 What is the relationship between partition regularity in nonassociative systems and the existence of invariant means on groups?

Key findings

• Thompson's group F is proven to be amenable using nonassociative Ramsey-theoretic techniques.
• A generalization of Hindman's theorem is established for the free nonassociative binary system on one generator.
• The paper constructs a finitely additive, left-invariant mean on F through combinatorial regularity in nonassociative operations.
• The nonassociative structure provides a new model for analyzing the dynamics of F via tree-like bracketing systems.
• The method introduces a novel link between nonassociative algebra and group amenability, bypassing traditional approaches.
• The result demonstrates that nonassociative combinatorics can yield deep structural insights into infinite groups.