Alphabeta Math
TheoremStatement: 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.

Amenability is equivalent to Reiter's condition (P1)

Statement

Assume AC. Let G be a locally compact Hausdorff group. Then G is amenable (Amenable locally compact group) if and only if G satisfies Reiter's condition (P1) (Reiter's condition (P1)): for every compact Q⊆G and every ε>0 there is f∈L1(G) with f≥0, ∥f∥1=1 and ΔQ(f)≤ε, with ΔQ as defined in Reiter's condition (P1) (including Δ∅(f)=0). The equivalence is proved through invariant means on L∞(G), so it is stated for a fixed left Haar measure but does not depend on its normalization.

Facts & Assumptions

Given: AC, a locally compact Hausdorff group G, and a fixed left Haar measure μ.

[A1]

AC is assumed in the choice-function form (The Axiom of Choice).

[F1]

The class map embeds actual UCB functions isometrically in L∞(G) and intertwines the left translations (Left-uniformly continuous bounded functions (UCB)).

[F2]

A left-invariant mean on UCB(G) yields Reiter's condition (P1) under AC (An invariant mean produces a Reiter net).

[F3]

Reiter's condition (P1) is equivalent to the existence of a net in P with compact-uniform translation defects (Reiter's condition (P1)).

[F4]

Amenability is existence of a left-invariant mean on complex L∞(G) and is invariant under positive rescaling of Haar measure (Amenable locally compact group, Left-invariant means on L∞ of a locally compact group).

[F6]

Under the ultrafilter lemma, every Reiter net has a weak-star cluster point which is a left-invariant mean on L∞(G) (A Reiter net has an invariant-mean cluster point).

[F7]

Multiplying a left Haar measure by a positive scalar preserves left invariance and the Haar measure convention (Left Haar integral and left Haar measure).

Proof

technique · direct
1.1F1F2F4construct

Suppose G is amenable. Let ν be a left-invariant mean on L∞(G) and define m(ψ):=ν([ψ]) for ψ∈UCB(G). By [F1], the class map is well-defined and injective; positivity, complex linearity, normalization, and left invariance pass from ν to m. Hence [F2] gives Reiter's condition (P1).

1.2A1F3F4F5F6

Suppose G satisfies (P1). By [F3], choose a Reiter net (fi)⊆P. By [A1] and [F5], the ultrafilter lemma holds. The cluster-point result [F6] gives a left-invariant mean on L∞(G), so G is amenable by [F4].

1.3F3F4F7algebra

Let μ′=cμ for c>0. The measures have the same null sets, and f↦f′:=c−1f maps Pμ bijectively to Pμ′. For every compact Q, Lxf′=c−1Lxf on the common almost-everywhere classes, so ΔQ,μ′(f′)=ΔQ,μ(f). Thus (P1) is independent of this rescaling. Amenability is likewise normalization-independent by [F4], with μ′ still a left Haar measure by [F7].

2.1step 1.1step 1.2step 1.3∎

Steps 1.1 and 1.2 prove the two implications for the fixed left Haar measure, and step 1.3 proves normalization independence. Therefore the stated equivalence holds.

Sources

BHV, Kazhdan's Property (T), Appendix G.3, Theorem G.3.1, gives the amenability, Reiter (P1), and invariant-mean equivalence, printed pp. 452–456. The proof here uses the assigned local UCB-to-Reiter and Reiter-cluster-point lemmas rather than its separate weak-star-density assertion for all L1 probability densities. Thomas, Lecture 20, slides 11–17 (PDF pp. 11–17), provides the amenability/invariant-mean-to-Reiter direction.

Depends on

Used by

Dependency tree · two levels

59 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