Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-28
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.

Under the ultrafilter lemma, abelian groups are amenable

Statement

Assume the ultrafilter lemma. Every abelian group is amenable.

Facts & Assumptions

Given: An abelian group A and the ultrafilter lemma.

[L1]

A finitely generated abelian group is isomorphic to Zr⊕T with T finite (The fundamental theorem of finitely generated abelian groups from PID modules).

[L2]

Under the ultrafilter lemma, the Folner condition is equivalent to amenability (Under the ultrafilter lemma, the Folner condition is equivalent to amenability).

Proof

technique · direct
1.1L1givenalgebra

Suppose first that A is finitely generated. By [L1], write A≅Zr⊕T with T finite. Let S⊆A be finite and let ε>0. If r=0, then A=T is finite and F=A satisfies sF=F for every s∈S, so the Folner condition is immediate. Assume now that r≥1. Transport S across the isomorphism, and let M be the maximum of the ℓ∞-norms of the Zr-components of the transported elements. For n≥1, put Bn=[−n,n]r×T. Then every translate by an element of S changes only the M-thick boundary layers of the box, so ∣(s+Bn)△Bn∣=O(nr−1) uniformly in s∈S, while ∣Bn∣=(2n+1)r∣T∣. For large n this gives ∣(s+Bn)△Bn∣<ε∣Bn∣ for every s∈S. Thus finitely generated abelian groups satisfy the Folner condition.

2.1L2step 1.1

By [L2], every finitely generated abelian group is therefore amenable.

3.1L2step 2.1given∎

Now let A be arbitrary. Given a finite subset S⊆A and ε>0, the subgroup ⟨S⟩ is finitely generated and abelian, so step 2.1 makes it amenable. Applying [L2] inside ⟨S⟩ yields a finite nonempty set F⊆⟨S⟩ with ∣sF△F∣<ε∣F∣ for every s∈S. The same set F witnesses the Folner condition in A. Since S and ε were arbitrary, [L2] shows that every abelian group is amenable.

Depends on

Used by

Dependency tree · two levels

15 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