Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Følner sequence
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
In [[mathematics]], a '''Følner sequence''' for a [[group (mathematics)|group]] is a [[sequence]] of [[Set (mathematics)|sets]] satisfying a particular condition. If a group has a Følner sequence with respect to its action on itself, the group is [[amenable group|amenable]]. A more general notion of Følner [[net (mathematics)|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>G</math> that [[Group action (mathematics)|acts]] on a countable set <math>X</math>, a Følner sequence for the action is a sequence of finite [[subset]]s <math>F_1, F_2, \dots</math> of <math>X</math> which exhaust <math>X</math> and which "don't move too much" when acted on by any group element. Precisely, :For every <math>x\in X</math>, there exists some <math>i</math> such that <math>x \in F_j</math> for all <math> j > i</math>, and :<math>\lim_{i\to\infty}\frac{|gF_i\mathbin\triangle F_i|}{|F_i|} = 0</math> for all group elements <math>g</math> in <math>G</math>. Explanation of the notation used above: *<math>gF_i\ </math> is the result of the set <math>F_i\ </math> being acted on the left by <math>g</math>. It consists of elements of the form <math>gf</math> for all <math>f</math> in <math>F_i</math>. *<math>\triangle</math> is the [[symmetric difference]] operator, i.e., <math>A\mathbin\triangle B</math> is the set of elements in exactly one of the sets <math>A</math> and <math>B</math>. *<math>|A|</math> is the [[cardinality]] of a set <math>A</math>. Thus, what this definition says is that for any group element <math>g</math>, the proportion of elements of <math>F_i\ </math> that are moved away by <math>g</math> goes to 0 as <math>i</math> gets large. In the setting of a [[locally compact group]] acting on a measure space <math>(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>\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>G</math> trivially has a Følner sequence <math>F_i=G</math> for each <math>i</math>. * Consider the group of [[integer]]s, acting on itself by addition. Let <math>F_i</math> consist of the integers between <math>-i</math> and <math>i</math>. Then <math>gF_i</math> consists of integers between <math>g-i</math> and <math>g+i</math>. For large <math>i</math>, the symmetric difference has size <math>2g</math>, while <math>F_i</math> has size <math>2i+1</math>. The resulting ratio is <math>2g/(2i+1)</math>, which goes to 0 as <math>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|date=May 2013}}== We have a group <math>G</math> and a Følner sequence <math>F_i</math>, and we need to define a measure <math>\mu</math> on <math>G</math>, which philosophically speaking says how much of <math>G</math> any subset <math>A</math> takes up. The natural definition that uses our Følner sequence would be :<math>\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 (set theory)|ultrafilter]] <math>U</math> on the natural numbers that contains intervals <math>[n,\infty)</math>. Then we use an [[ultralimit]] instead of the regular [[Limit (mathematics)|limit]]: :<math>\mu(A)=U - \lim{|A\cap F_i|\over|F_i|}.</math> It turns out ultralimits have all the properties we need. Namely, #<math>\mu</math> is a ''probability measure''. That is, <math>\mu(G)=U - \lim1=1</math>, since the ultralimit coincides with the regular limit when it exists. #<math>\mu</math> is ''finitely additive''. This is since ultralimits commute with addition just as regular limits do. #<math>\mu</math> is ''left invariant''. This is since #:<math>\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>\leq{|A\cap(g^{-1}F_i\mathbin\triangle F_i)|\over|F_i|}\to0</math> :by the Følner sequence definition. == References == * {{Cite journal|author=Erling Følner|title=On groups with full Banach mean value|journal=[[Mathematica Scandinavica]]|volume=3|pages=243–254|year=1955|url=http://resolver.sub.uni-goettingen.de/purl?GDZPPN00234405X}} {{DEFAULTSORT:Folner sequence}} [[Category:Geometric group theory]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Citation needed
(
edit
)
Template:Cite journal
(
edit
)