Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 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.

Left Følner nets for locally compact groups

Definition

Fix a left Haar measure μ on a locally compact Hausdorff group G. For a Borel set F⊆G with 0<μ(F)<∞ and a compact set Q⊆G, put ΔQ(F):=sup⁡({0}∪{μ(gF△F)/μ(F):g∈Q}). The value is 0 when Q=∅. The group G satisfies the left Følner condition if for every compact Q⊆G and every ε>0 there is such a set F with ΔQ(F)≤ε.

A left Følner net is a net (Fi)i∈I of Borel sets with 0<μ(Fi)<∞ such that for every compact Q⊆G and every ε>0 there is i0∈I for which ΔQ(Fi)≤ε whenever i⪰i0. This is uniform convergence to zero on compact subsets. The left Følner condition holds if and only if a left Følner net exists. In the single-set condition it is equivalent to test only compact sets containing the identity. Only left translates gF occur.

Facts & Assumptions

Given: A locally compact Hausdorff group G with a fixed left Haar measure μ.

[A1]

Left translation is a homeomorphism, carries Borel sets to Borel sets, and preserves μ; μ is finite on compact sets (Left Haar integral and left Haar measure).

[F1]

A net is a function from a nonempty directed preorder; antisymmetry is not required (Directed preorders and nets).

Proof

technique · direct
1.1A1givenalgebra

For every g∈G, [A1] gives μ(gF)=μ(F), so μ(gF△F)≤μ(gF)+μ(F)=2μ(F). Thus each ratio in ΔQ(F) is in [0,2] and the displayed supremum is a finite real; including 0 also defines it when Q is empty. If the condition has been checked for compact sets containing e, then for arbitrary compact Q apply it to Q∪{e}, which is compact as a finite union of compact sets; the resulting estimate restricts to Q. The reverse implication is immediate.

1.2F1given

If (Fi)i∈I is a left Følner net, then for any compact Q and ε>0 its defining uniform-convergence condition supplies an index i0 with ΔQ(Fi)≤ε for every i⪰i0. In particular Fi0 is Borel, has finite positive measure, and satisfies the single-set Følner estimate.

2.1A1F1constructalgebra∎

Conversely, assume the single-set condition. Let I be the set of all triples (Q,ε,F) with Q compact, ε>0, F Borel, 0<μ(F)<∞, and ΔQ(F)≤ε. Order these triples by (Q,ε,F)⪯(Q′,ε′,F′) exactly when Q⊆Q′ and ε′≤ε. This is a directed preorder: for two indices apply the condition to the compact union of their test sets and the positive minimum of their tolerances, obtaining a witness that gives a common upper bound. By [F1], the third-coordinate map i↦Fi is a net. Given any compact Q and ε>0, the condition supplies an index i0=(Q,ε,F0); every i⪰i0 then satisfies ΔQ(Fi)≤ΔQi(Fi)≤εi≤ε. This proves uniform convergence on compact sets. The witness-indexed set contains every possible witness, so this construction uses no global choice function.

Depends on

Used by

Dependency tree · two levels

9 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