Følner sequence

From HandWiki
Revision as of 19:30, 6 March 2023 by Unex (talk | contribs) (fixing)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, a Følner sequence for a group is a sequence of sets satisfying a particular condition. If a group has a Følner sequence with respect to its action on itself, the group is amenable. A more general notion of Følner nets can be defined analogously, and is suited for the study of uncountable groups. Følner sequences are named for Erling Følner.

Definition

Given a group [math]\displaystyle{ G }[/math] that acts on a countable set [math]\displaystyle{ X }[/math], a Følner sequence for the action is a sequence of finite subsets [math]\displaystyle{ F_1, F_2, \dots }[/math] of [math]\displaystyle{ X }[/math] which exhaust [math]\displaystyle{ X }[/math] and which "don't move too much" when acted on by any group element. Precisely,

For every [math]\displaystyle{ x\in X }[/math], there exists some [math]\displaystyle{ i }[/math] such that [math]\displaystyle{ x \in F_j }[/math] for all [math]\displaystyle{ j \gt i }[/math], and
[math]\displaystyle{ \lim_{i\to\infty}\frac{|gF_i\mathbin\triangle F_i|}{|F_i|} = 0 }[/math] for all group elements [math]\displaystyle{ g }[/math] in [math]\displaystyle{ G }[/math].

Explanation of the notation used above:

  • [math]\displaystyle{ gF_i\ }[/math] is the result of the set [math]\displaystyle{ F_i\ }[/math] being acted on the left by [math]\displaystyle{ g }[/math]. It consists of elements of the form [math]\displaystyle{ gf }[/math] for all [math]\displaystyle{ f }[/math] in [math]\displaystyle{ F_i }[/math].
  • [math]\displaystyle{ \triangle }[/math] is the symmetric difference operator, i.e., [math]\displaystyle{ A\mathbin\triangle B }[/math] is the set of elements in exactly one of the sets [math]\displaystyle{ A }[/math] and [math]\displaystyle{ B }[/math].
  • [math]\displaystyle{ |A| }[/math] is the cardinality of a set [math]\displaystyle{ A }[/math].

Thus, what this definition says is that for any group element [math]\displaystyle{ g }[/math], the proportion of elements of [math]\displaystyle{ F_i\ }[/math] that are moved away by [math]\displaystyle{ g }[/math] goes to 0 as [math]\displaystyle{ i }[/math] gets large.

In the setting of a locally compact group acting on a measure space [math]\displaystyle{ (X,\mu) }[/math] there is a more general definition. Instead of being finite, the sets are required to have finite, non-zero measure, and so the Følner requirement will be that

  • [math]\displaystyle{ \lim_{i\to\infty}\frac{\mu(gF_i\mathbin\triangle F_i)}{\mu(F_i)} = 0 }[/math],

analogously to the discrete case. The standard case is that of the group acting on itself by left translation, in which case the measure in question is normally assumed to be the Haar measure.

Examples

  • Any finite group [math]\displaystyle{ G }[/math] trivially has a Følner sequence [math]\displaystyle{ F_i=G }[/math] for each [math]\displaystyle{ i }[/math].
  • Consider the group of integers, acting on itself by addition. Let [math]\displaystyle{ F_i }[/math] consist of the integers between [math]\displaystyle{ -i }[/math] and [math]\displaystyle{ i }[/math]. Then [math]\displaystyle{ gF_i }[/math] consists of integers between [math]\displaystyle{ g-i }[/math] and [math]\displaystyle{ g+i }[/math]. For large [math]\displaystyle{ i }[/math], the symmetric difference has size [math]\displaystyle{ 2g }[/math], while [math]\displaystyle{ F_i }[/math] has size [math]\displaystyle{ 2i+1 }[/math]. The resulting ratio is [math]\displaystyle{ 2g/(2i+1) }[/math], which goes to 0 as [math]\displaystyle{ i }[/math] gets large.
  • With the original definition of Følner sequence, a group has a Følner sequence if and only if it is countable and amenable.
  • A locally compact group has a Følner sequence (with the generalized definition) if and only if it is amenable and second countable.

Proof of amenability[citation needed]

We have a group [math]\displaystyle{ G }[/math] and a Følner sequence [math]\displaystyle{ F_i }[/math], and we need to define a measure [math]\displaystyle{ \mu }[/math] on [math]\displaystyle{ G }[/math], which philosophically speaking says how much of [math]\displaystyle{ G }[/math] any subset [math]\displaystyle{ A }[/math] takes up. The natural definition that uses our Følner sequence would be

[math]\displaystyle{ \mu(A)=\lim_{i\to\infty}{|A\cap F_i|\over|F_i|}. }[/math]

Of course, this limit doesn't necessarily exist. To overcome this technicality, we take an ultrafilter [math]\displaystyle{ U }[/math] on the natural numbers that contains intervals [math]\displaystyle{ [n,\infty) }[/math]. Then we use an ultralimit instead of the regular limit:

[math]\displaystyle{ \mu(A)=U - \lim{|A\cap F_i|\over|F_i|}. }[/math]

It turns out ultralimits have all the properties we need. Namely,

  1. [math]\displaystyle{ \mu }[/math] is a probability measure. That is, [math]\displaystyle{ \mu(G)=U - \lim1=1 }[/math], since the ultralimit coincides with the regular limit when it exists.
  2. [math]\displaystyle{ \mu }[/math] is finitely additive. This is since ultralimits commute with addition just as regular limits do.
  3. [math]\displaystyle{ \mu }[/math] is left invariant. This is since
    [math]\displaystyle{ \left|{|gA\cap F_i|\over|F_i|}-{|A\cap F_i|\over|F_i|}\right| = \left|{|A\cap g^{-1}F_i|\over|F_i|}-{|A\cap F_i|\over|F_i|}\right| }[/math]
    [math]\displaystyle{ \leq{|A\cap(g^{-1}F_i\mathbin\triangle F_i)|\over|F_i|}\to0 }[/math]
by the Følner sequence definition.

References