Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-10-08
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.

Folner sequences for second countable compactly generated groups

Statement

Assume AC. Let G be an amenable second countable compactly generated locally compact Hausdorff group (Amenable locally compact group, Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) with fixed left Haar measure μ (Left Haar integral and left Haar measure), and let S⊆G be a compact generating set (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Topological group: multiplication and inversion are continuous) with S=S−1 containing e and a nonempty open set. Then there is a sequence (Fn)n≥0 of Borel sets with 0<μ(Fn)<∞ such that for every compact Q⊆G lim⁡n→∞ΔQ(Fn)=0,ΔQ(F):=sup⁡({0}∪{μ(xF△F)/μ(F):x∈Q}). Thus Δ∅(F)=0. Such a sequence is a Følner sequence for G. Conversely, a locally compact Hausdorff group with such a sequence satisfies the left Følner condition (Left Følner nets for locally compact groups) and hence is amenable, so for such a group amenability is equivalent to the existence of a Følner sequence. Only compact generation, not second countability, is used by the construction.

Facts & Assumptions

Given: AC; a locally compact Hausdorff group G with fixed left Haar measure μ; the amenability of G; a compact generating set S⊆G with S=S−1 containing e and a nonempty open set U⊆S, with G=⋃n≥1Sn.

[A1]

AC implies ACω: for a sequence (Xn)n∈N of nonempty sets one applies AC to the family {Xn:n∈N} and evaluates the resulting selector at each Xn (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

Under AC, G is amenable, meaning that there is a left-invariant mean m on L∞(G) (Amenable locally compact group), if and only if G satisfies the left Følner condition: for every compact Q⊆G and every ε>0 there is a Borel set F⊆G with 0<μ(F)<∞ and ΔQ(F)≤ε (The Følner criterion for locally compact groups).

[F2]

For a Borel set F⊆G with 0<μ(F)<∞ and compact Q⊆G one has ΔQ(F)=sup⁡({0}∪{μ(xF△F)/μ(F):x∈Q}), so in particular Δ∅(F)=0 (Left Følner nets for locally compact groups).

Proof

Given: AC; a locally compact Hausdorff group G with fixed left Haar measure μ; the amenability of G; a compact generating set S=S−1∋e containing the nonempty open set U⊆S, with G=⋃n≥1Sn.

Proof technique: direct.

1.1F3given

For n≥1 put Kn:=Sn={s1⋯sn:s1,…,sn∈S}. The map (s1,…,sn)↦s1⋯sn is continuous from the finite product S×⋯×S, which is compact, onto Kn, so Kn is compact; and Kn⊆Kn+1 because e∈S.

1.2F1F2algebra

For the reverse implication suppose that (Fn)n≥0 is a sequence of Borel sets with 0<μ(Fn)<∞ for which ΔQ(Fn) tends to 0 for every compact Q⊆G. Given a compact Q and ε>0, the convergence to 0 gives n1 with ΔQ(Fn)≤ε for every n≥n1; then F:=Fn1 is Borel with 0<μ(F)<∞ and ΔQ(F)≤ε by [F2]. Thus G satisfies the left Følner condition, and [F1] makes G amenable.

2.1F3F4step 1.1givenconstruct

Put W:=U⋅U−1. Then W is open, being a union of translates of the open set U⊆S; e∈W because e=u⋅u−1 for any u∈U; and W⊆S⋅S−1=S2 because U⊆S=S−1. For y∈Sm the translate yW is open and contains y=ye, while yW⊆SmS2=Sm+2; hence Sm⊆int⁡(Sm+2) for every m≥1. Therefore the open sets int⁡(K2n)=int⁡(S2n) increase, and they cover G: for x∈Sm padding with e∈S gives x∈S2m⊆int⁡(S2m+2)=int⁡(K2m+2), so x lies in the member of index m+1. If Q=∅, take n0=1. Otherwise [F4] gives a finite subcover of the compact Q⊆G by these ambient open sets; taking the largest index gives n0 with Q⊆int⁡(K2n0)⊆K2n0, and step 1.1 gives Q⊆Kn for all n≥2n0.

2.2A1F1F2step 1.1choose

For each n≥0, [F1] applied to the compact set Kn+1 with tolerance 1/(n+1) produces a Borel set F with 0<μ(F)<∞ and ΔKn+1(F)≤1/(n+1), so the family of all such witnesses is nonempty; by [A1] choose a sequence (Fn)n≥0 in which Fn is a witness for Kn+1 at tolerance 1/(n+1), so each Fn is Borel with 0<μ(Fn)<∞ and ΔKn+1(Fn)≤1/(n+1).

3.1F2step 2.1step 2.2algebra

Let Q⊆G be compact and choose m as in step 2.1, so Q⊆Kr for all r≥2m. For every n≥2m−1, one has Q⊆Kn+1, so the family defining ΔQ(Fn) is contained in the family defining ΔKn+1(Fn), hence 0≤ΔQ(Fn)≤ΔKn+1(Fn)≤1/(n+1) by step 2.2. This also covers Q=∅ because both families include 0. Thus ΔQ(Fn)→0 and (Fn) is a Følner sequence.

4.1A1F1step 3.1step 1.2∎

Steps 1.1, 2.1, 2.2, and 3.1 produce a Følner sequence for an amenable G from the compact sets Sn and their open exhaustion of G, and step 1.2 reverses the implication, giving the stated equivalence; the construction never uses second countability, and the stated AC is spent only through the criterion in [F1] and the countable selection in [A1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources