How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Amenable Groups and Folner Criteria
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Geometric Actions Svarc Milnor and Growth
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Linear Independence, Bases and Dimension
- Matchings, Covers, Menger and Network Flows
- Metric Spaces
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page treats amenability through three linked lenses: invariant means, Folner sets, and paradoxical decompositions. The early permanence results are proved without hiding them inside Tarski's theorem, and the steps that pass from Folner or paradoxical data back to invariant means record their ultrafilter and matching-extension costs explicitly.
The landmark theorem is the Folner criterion. After that, the page extracts Folner sequences in the countable case, derives amenability from subexponential growth, and then turns to paradoxical decompositions and the nonamenability of the rank-two free group. The closing theorem records that, for finitely generated groups, amenability depends only on quasi-isometry type.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Means on bounded functions on a group
Definition
Let be a group. Write for the real vector space of bounded functions .
A mean on is a linear map
such that:
- pointwise implies ;
- , where is the constant function .
Positivity and normalization imply , so a mean is automatically bounded of norm .
Left translation on bounded functions
Definition
Let be a group and . For , the left translate of by is the bounded function
This defines a left action of on because and .
Left-invariant means and amenable groups
Definition
A mean on is left invariant if
The group is amenable if it admits a left-invariant mean on .
Left and right amenability agree by inversion
Statement
Let be a group. Then admits a left-invariant mean if and only if it admits a right-invariant mean.
Here a mean is right invariant when for every , where .
Facts & Assumptions
Given: A group .
Amenability is defined by existence of a left-invariant mean (Left-invariant means and amenable groups).
Proof
Suppose is left invariant. For bounded , define and . Then is a mean, and for every one has , so left invariance of gives . Thus a left-invariant mean produces a right-invariant mean.
Replacing by in the same computation shows that inversion also carries right-invariant means back to left-invariant means. Hence the two notions are equivalent.
Finite groups are amenable
Statement
Every finite group is amenable.
Facts & Assumptions
Given: A finite group .
A group is amenable exactly when it admits a left-invariant mean (Left-invariant means and amenable groups).
Proof
Define on . This is linear, positive, and satisfies , so it is a mean.
For every , the map is a permutation of , so . Therefore , and [L1] makes amenable.
Under the ultrafilter lemma, abelian groups are amenable
Statement
Assume the ultrafilter lemma. Every abelian group is amenable.
Facts & Assumptions
Given: An abelian group and the ultrafilter lemma.
A finitely generated abelian group is isomorphic to with finite (The fundamental theorem of finitely generated abelian groups from PID modules).
Under the ultrafilter lemma, the Folner condition is equivalent to amenability (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
Proof
Suppose first that is finitely generated. By [L1], write with finite. Let be finite and let . If , then is finite and satisfies for every , so the Folner condition is immediate. Assume now that . Transport across the isomorphism, and let be the maximum of the -norms of the -components of the transported elements. For , put . Then every translate by an element of changes only the -thick boundary layers of the box, so uniformly in , while . For large this gives for every . Thus finitely generated abelian groups satisfy the Folner condition.
By [L2], every finitely generated abelian group is therefore amenable.
Now let be arbitrary. Given a finite subset and , the subgroup is finitely generated and abelian, so step 2.1 makes it amenable. Applying [L2] inside yields a finite nonempty set with for every . The same set witnesses the Folner condition in . Since and were arbitrary, [L2] shows that every abelian group is amenable.
Under the ultrafilter lemma, subgroups and quotients of amenable groups are amenable
Statement
Assume the ultrafilter lemma. Every subgroup of an amenable group is amenable, and every quotient of an amenable group by a normal subgroup is amenable.
Facts & Assumptions
Given: An amenable group and the ultrafilter lemma.
Amenability means existence of a left-invariant mean (Left-invariant means and amenable groups).
Normal subgroups are the conjugation-invariant subgroups for which the quotient group is formed (Normal subgroup: invariance under conjugation).
Under the ultrafilter lemma, amenability is equivalent to the Folner condition (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
Proof
Let . To show that is amenable, by [L3] it is enough to verify the Folner condition in . Fix a finite subset and . If , then is already an -Folner set. Assume now that , and put . Since is amenable, [L3] gives a finite nonempty set with for every . Write , where the are the nonempty intersections of with the finitely many right -cosets that meet , transported back into . For each , left translation by preserves every right -coset , so and hence . Summing over gives Therefore some satisfies , and then each summand is itself . So is an -Folner set in . Since and were arbitrary, satisfies the Folner condition, and [L3] makes amenable.
Let , and let be the quotient map from [L2]. For bounded , define using a left-invariant mean on . Then is a mean, and for one has , so left invariance of implies . Therefore the quotient is amenable.
Steps 1.1 and 1.2 prove the two permanence statements.
Extensions of amenable groups are amenable
Statement
Let . If and are amenable, then is amenable.
Facts & Assumptions
Given: A normal subgroup such that both and are amenable.
Amenability means existence of a left-invariant mean (Left-invariant means and amenable groups).
Quotients are formed from normal subgroups (Normal subgroup: invariance under conjugation).
Proof
Let be a left-invariant mean on . For bounded and , define . If with , then the integrand for is , which is the left translate of by in the -variable. Thus the value of does not depend on the chosen representative of the right coset . The same formula also shows , so is bounded on .
Let be a left-invariant mean on , and set . Positivity and are immediate. For , one has , so . Therefore .
Thus is a left-invariant mean on , so [L1] makes amenable.
Locally finite groups
Definition
A group is locally finite if every finitely generated subgroup of is finite.
Under the ultrafilter lemma, directed unions of amenable subgroups are amenable
Statement
Assume the ultrafilter lemma. Let be a directed union of subgroups. If every is amenable, then is amenable.
Facts & Assumptions
Given: A directed family of amenable subgroups whose union is , and the ultrafilter lemma.
Under the ultrafilter lemma, amenability is equivalent to the Folner condition (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
Proof
Let be finite and let . Because the family is directed and , some index satisfies . Since is amenable, [L1] gives a finite nonempty set with for every .
The set from step 1.1 is also an -Folner set when viewed inside . Since and were arbitrary, satisfies the Folner condition. Therefore [L1] makes amenable.
Under the ultrafilter lemma, solvable groups and locally finite groups are amenable
Statement
Assume the ultrafilter lemma. Every solvable group is amenable, and every locally finite group is amenable.
Facts & Assumptions
Given: A solvable group or a locally finite group, and the ultrafilter lemma.
Solvability is defined by the derived series terminating at the trivial group (The derived series, solvable groups, and derived length).
A group is locally finite when every finitely generated subgroup is finite (Locally finite groups).
Directed unions of amenable subgroups are amenable (Under the ultrafilter lemma, directed unions of amenable subgroups are amenable).
Finite groups are amenable, and under the ultrafilter lemma so are abelian groups (Finite groups are amenable, Under the ultrafilter lemma, abelian groups are amenable).
Extensions of amenable groups are amenable (Extensions of amenable groups are amenable).
Proof
Let be solvable. If its derived length is , then is trivial and hence finite, so [L4] applies. If the derived length is positive, then has smaller derived length by [L1], and the quotient is abelian. Inducting on derived length and applying [L5] shows that every solvable group is amenable.
Let be locally finite. The family of finitely generated subgroups of is directed by inclusion, its union is all of , and every member is finite by [L2]. Hence each member is amenable by [L4], and [L3] gives amenability of .
Steps 1.1 and 1.2 prove the two claims.
Folner sets and the Folner condition
Definition
Let be a group, let be finite, and let . A finite nonempty subset is an -Folner set if
The group satisfies the Folner condition if for every finite and every there exists an -Folner set.
Equivalent boundary formulations of the Folner condition
Statement
Let be a group, finite, and finite nonempty. Then:
- for every if and only if for every .
- Replacing the left translates by right translates gives an equivalent condition after inversion.
Facts & Assumptions
Given: A group , a finite subset , a finite nonempty set , and a real .
An -Folner set is defined by the symmetric-difference inequality (Folner sets and the Folner condition).
Proof
For each , left translation by is a bijection of , so and therefore . Hence the symmetric-difference and one-sided boundary formulations differ only by the factor .
Inversion is a bijection with . Thus the left-translate and right-translate versions are equivalent after replacing by .
Under the ultrafilter lemma, the Folner condition is equivalent to amenability
Statement
Assume the ultrafilter lemma. A group is amenable if and only if it satisfies the Folner condition.
The proof spends the ultrafilter extension twice: first to take a limit of finite averages, and then to extend compatible finite Hall matchings when proving the reverse implication by contradiction.
Facts & Assumptions
Given: A group and the ultrafilter lemma.
Under the ultrafilter lemma, every proper filter extends to an ultrafilter (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter).
Amenability means existence of a left-invariant mean (Left-invariant means and amenable groups).
The Folner condition asks for finite nonempty sets with arbitrarily small boundary under each finite test set (Folner sets and the Folner condition).
One may replace symmetric differences by one-sided boundaries up to a fixed factor (Equivalent boundary formulations of the Folner condition).
Hall's theorem gives a matching saturating the finite left part of a finite bipartite graph exactly when every subset of that left part has enough neighbours (Hall's marriage theorem for a finite bipartite graph).
Proof
Assume satisfies the Folner condition. Let be the directed set of triples with finite, , and an -Folner set, ordered by enlarging and . For , define . These are means, and [L3] implies that if then . The cofinal tails have the finite intersection property, so by [A1] some ultrafilter on contains all of them. The ultrafilter limit of the bounded family is therefore a left-invariant mean on .
Assume instead that is amenable but not Folner. Then some finite and satisfy: for every finite nonempty , some has . Put and . Since , [L3] gives for that , and hence .
Choose with and put . Applying step 1.2 successively to gives for every finite nonempty .
Form the bipartite graph with left vertices , right vertices , and edges for . If is a finite set of left vertices and is its projection to , then and by step 2.1. Thus [L4] gives a matching saturating every prescribed finite left set.
Let be the set of finite partial matchings in this graph, and for finite let be the set of members of whose domains contain . Step 3.1 shows that the family has the finite-intersection property. By [A1], an ultrafilter on contains every . For a left vertex , the set is the disjoint union of the finitely many sets on which the partial matching assigns a fixed neighbour . Exactly one such cell belongs to ; call its neighbour . If distinct left vertices had the same -value, the two corresponding cells would have empty intersection, contradicting closure of under intersections. Hence is injective and satisfies .
Write and, for and , put . For each fixed , the sets partition , while the sets partition the range of ; injectivity of makes and disjoint. If is a left-invariant mean, write . Finite additivity and invariance give for . But , so positivity gives , a contradiction.
Therefore an amenable group cannot fail the Folner condition. Together with step 1.1, this proves the equivalence.
Folner sequences for enumerated groups
Definition
Let be an enumerated countable group. A sequence of finite nonempty subsets of is a Folner sequence if
Equivalently, for every finite subset and every , all sufficiently large are -Folner sets.
Enumerated countable amenable groups admit Folner sequences
Statement
Let be an enumerated countable amenable group. Then admits a Folner sequence.
Facts & Assumptions
Given: An enumerated countable amenable group .
A Folner sequence is a sequence of finite nonempty sets with vanishing relative symmetric-difference error for each fixed group element (Folner sequences for enumerated groups).
Every amenable group satisfies the Folner condition (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
Proof
For each , apply [L2] to the finite test set and the tolerance . This gives a finite nonempty set with for every .
Fix . Once , step 1.1 gives , which tends to . Therefore is a Folner sequence in the sense of [L1].
Under the ultrafilter lemma, subexponential growth implies amenability
Statement
Assume the ultrafilter lemma. Every finitely generated group of subexponential growth is amenable.
Facts & Assumptions
Given: A finitely generated group with a finite generating set , subexponential growth, and the ultrafilter lemma.
The growth function counts word-metric balls (The growth function of a finitely generated group).
Subexponential growth means that no exponential lower bound occurs (Polynomial, subexponential, exponential, and intermediate growth).
Under the ultrafilter lemma, the Folner condition implies amenability (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
Proof
Let be the word-metric ball of radius about the identity. If some satisfied for every , then iterating would give up to multiplicative constants, contradicting the subexponential alternative in [L2]. Therefore for every there exists with .
For such an , every satisfies , so the boundary formulation of [L3] makes an -Folner set. Hence satisfies the Folner condition, and [L3] shows that is amenable.
Paradoxical decompositions of groups
Definition
Let be a group. A paradoxical decomposition of consists of pairwise disjoint subsets
and group elements such that
Thus the group is partitioned into finitely many pieces, and each of the two subfamilies can be translated to cover the whole group again.
Paradoxical groups admit no invariant mean
Statement
If a group admits a paradoxical decomposition, then it admits no left-invariant mean.
Facts & Assumptions
Given: A group with a paradoxical decomposition.
A left-invariant mean is a positive normalized functional on invariant under left translation (Left-invariant means and amenable groups).
In a paradoxical decomposition, disjoint pieces partition , and the translated families and each partition (Paradoxical decompositions of groups).
Proof
Assume toward contradiction that is a left-invariant mean on . By [L2] and positivity, finite additivity on indicator functions gives .
The translated families from [L2] also partition , so left invariance gives and likewise . Combining these equalities with step 1.1 yields , a contradiction.
Under the ultrafilter lemma and a matching-extension principle, a group is amenable if and only if it is not paradoxical
Statement
Assume the ultrafilter lemma and the following perfect-matching extension principle for : whenever a finite set satisfies for every finite nonempty , the finite Hall matchings in the bipartite graph with left vertices , right vertices , and edges for extend to a bijection satisfying .
Under these assumptions, is amenable if and only if it is not paradoxical.
Facts & Assumptions
Given: A group , the ultrafilter lemma, and the matching-extension principle stated above.
A paradoxical decomposition forbids a left-invariant mean (Paradoxical groups admit no invariant mean).
Under the ultrafilter lemma, amenability is equivalent to the Folner condition (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
The perfect-matching extension principle above upgrades the finite Hall matchings coming from a doubling set to an edge-respecting bijection .
Hall's theorem saturates a finite bipartite left part exactly when every finite subfamily has enough neighbors (Hall's marriage theorem for a finite bipartite graph).
Proof
If is paradoxical, then [L1] says that no left-invariant mean exists, so is not amenable. This proves the forward implication of the statement.
Assume now that is not amenable. By contrapositive use of [A1], there is a finite set with such that for every finite nonempty . Indeed, if no such existed, then for a finite test set and one could put , choose with , and find finite nonempty with . Among the layers , some ratio would then be below , giving for every and hence the Folner condition.
Form the bipartite graph from [A2]. For every finite left subset with projection , step 1.2 gives , so [L2] produces a matching saturating . By [A2], these finite matchings extend to an edge-respecting bijection . For and , put The finitely many are pairwise disjoint and partition because is bijective. For fixed , the translated pieces partition , because they are exactly the fibers in the domain copy . Thus the two subfamilies and , with translators , form a paradoxical decomposition.
Steps 1.1 and 2.1 prove both directions, so is amenable exactly when it is not paradoxical.
The free group of rank two is nonamenable
Statement
The free group of rank two is nonamenable.
Facts & Assumptions
Given: The free group of rank two.
is the free group on two generators, say and (The free product of two infinite cyclic groups is the free group on two generators).
A paradoxical decomposition forbids a left-invariant mean (Paradoxical groups admit no invariant mean).
Paradoxical decompositions are defined by finitely many translated pieces (Paradoxical decompositions of groups).
Proof
By [L1], write . For , let be the set of nonempty reduced words whose first letter is . Put and , and define , , , and .
The four sets are pairwise disjoint and partition : the usual five first-letter classes partition , and has merely been moved from into the piece containing the identity.
Left multiplication gives and , hence . Likewise , hence . Thus the pieces of step 1.1, with translators , satisfy both partition equalities in [L3].
Steps 1.1-3.1 give a paradoxical decomposition of , so [L2] implies that admits no left-invariant mean and is therefore nonamenable.
Under the ultrafilter lemma, groups containing a rank-two free subgroup are nonamenable
Statement
Assume the ultrafilter lemma. If a group contains a free subgroup of rank , then it is nonamenable.
Facts & Assumptions
Given: A group containing a subgroup , and the ultrafilter lemma.
The rank-two free group is nonamenable (The free group of rank two is nonamenable).
Under the ultrafilter lemma, subgroups of amenable groups are amenable (Under the ultrafilter lemma, subgroups and quotients of amenable groups are amenable).
Proof
If were amenable, then [L2] would make its subgroup amenable.
But , and [L1] says is nonamenable. This contradiction proves that is nonamenable.
Under the ultrafilter lemma, amenability is a quasi-isometry invariant for finitely generated groups
Statement
Assume the ultrafilter lemma. Amenability is a quasi-isometry invariant of finitely generated groups.
Facts & Assumptions
Given: Two finitely generated quasi-isometric groups and , and the ultrafilter lemma.
A property of finitely generated groups is a quasi-isometry invariant when it depends only on quasi-isometry type (Quasi-isometry invariants and geometric properties of finitely generated groups).
Under the ultrafilter lemma, amenability is equivalent to the Folner condition (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
Proof
Choose word metrics on and , quasi-inverse quasi-isometries and , and constants such that both maps satisfy the upper distance bound, , and . A fiber of has uniformly bounded cardinality: if , the lower quasi-isometry inequality bounds , and a word-metric ball of fixed radius is finite. Let bound those fibers, and define similarly.
Assume is amenable. Let be finite and let . Put , taking when , set , and let be the finite radius- ball in . Set . By [L2], choose a finite nonempty with for every .
Put . It is finite and nonempty, and . If , choose and with and . Then . Moreover , since otherwise would put in . Hence , and the fiber bound for gives .
Since , step 2.1 gives . For , one has and . Combining this with step 3.1 and yields . Thus is an -Folner set in .
Since and were arbitrary, step 4.1 gives the Folner condition in , so [L2] makes amenable. Applying the same argument to the quasi-inverse transfers amenability from to . Therefore amenability depends only on quasi-isometry type, as asserted in [L1].
There exist nonamenable groups without nonabelian free subgroups
Remark
This page proves that containing a rank-two free subgroup forces nonamenability, but the converse fails. Standard constructions due to Adian and Olshanskii produce nonamenable groups with no nonabelian free subgroup.
Accordingly, the implication in Under the ultrafilter lemma, groups containing a rank-two free subgroup are nonamenable is one-way only.
5 · Examples, counterexamples and false statements
FALSE: amenable means finite
Statement
Every amenable group is finite.
Facts & Assumptions
Given: The false claim above and the ultrafilter lemma.
Under the ultrafilter lemma, every abelian group is amenable (Under the ultrafilter lemma, abelian groups are amenable).
Refutation
The additive group is abelian and infinite.
By [L1], is amenable. Since it is infinite, it refutes the statement.
FALSE: every nonamenable group contains a rank-two free subgroup
Statement
Every nonamenable group contains a free subgroup of rank .
Facts & Assumptions
Given: The false claim above.
There exist nonamenable groups without nonabelian free subgroups (There exist nonamenable groups without nonabelian free subgroups ‡).
Refutation
The remark [L1] supplies a group that is nonamenable and has no nonabelian free subgroup at all.
Such a group cannot contain a free subgroup of rank , so it refutes the statement.
FALSE: one finite Folner set proves amenability
Statement
The existence of one finite Folner set is enough to prove that a group is amenable.
Facts & Assumptions
Given: The false claim above.
The Folner condition requires the inequalities over every finite test set and every tolerance; under the ultrafilter lemma it is equivalent to amenability (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
Refutation
Let , which is nonamenable. The singleton satisfies , so it is a -Folner set.
This single accidental Folner set does not make amenable, because [L1] requires the inequalities for all finite test sets and arbitrarily small tolerances. Therefore the statement is false.
FALSE: every uncountable amenable group has a Folner sequence
Statement
Every uncountable amenable group admits a global Folner sequence, meaning a sequence of finite nonempty subsets such that for every in the group. This is the natural extension of the countable definition to a group for which no enumeration is available.
Facts & Assumptions
Given: The false claim above and the ultrafilter lemma.
For an enumerated countable group, a Folner sequence is indexed by the natural numbers and is almost invariant under each fixed group element (Folner sequences for enumerated groups); the Statement explicitly extends that same pointwise condition to arbitrary groups.
Under the ultrafilter lemma, abelian groups are amenable (Under the ultrafilter lemma, abelian groups are amenable).
The Folner criterion is a finite-test condition, not a countable-sequence statement for uncountable groups (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).
The ordered additive group is uncountable ( is uncountable (Cantor's nested intervals, 1874)).
Refutation
Let . It is abelian and therefore amenable by [L2], and it is uncountable by [L4]. Let be any sequence of finite nonempty subsets of , and put . Each finite subset of the ordered set has a unique increasing enumeration, so the sets can be enumerated canonically and is at most countable. By [L4], choose .
For this , one has for every , since an intersection would put in . Hence and the ratio in [L1] is always , never . Thus is not a global Folner sequence. The amenability from step 1.1 does not force a contradiction, because [L3] is only a finite-test criterion and does not supply one countable family for all elements of an uncountable group. Since the sequence was arbitrary, the statement is false.
FALSE: a paradoxical decomposition is just an abstract partition without prescribed translates
Statement
A paradoxical decomposition is nothing more than a set-theoretic partition of a group.
Facts & Assumptions
Given: The false claim above.
A paradoxical decomposition includes specified translating group elements and translated copies covering the whole group (Paradoxical decompositions of groups).
Refutation
Partition into the even integers and the odd integers. This is an ordinary set-theoretic partition.
By [L1], a paradoxical decomposition needs finitely many specified translates whose images each cover the whole group again. The even/odd partition by itself carries no such data, so it is not a paradoxical decomposition. Thus the statement is false.