Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

The free group on two generators is not amenable

Statement

Let F2=⟨a,b⟩ be the free group on two generators with the discrete topology, and let μ be counting measure, a left Haar measure by Counting measure on a discrete group is Haar, Haar measures there are its multiples, and integrals against them are sums. Then F2 is not amenable: there is no left-invariant mean on L∞(F2,μ) in the sense of Amenable locally compact group. The direct proof below also establishes the published discrete nonamenability claim The free group of rank two is nonamenable.

Facts & Assumptions

Given: The free group F2=⟨a,b⟩ with the discrete topology and its counting Haar measure μ.

[A1]

Counting measure is a left Haar measure on every discrete locally compact group (Counting measure on a discrete group is Haar, Haar measures there are its multiples, and integrals against them are sums).

[F1]

Every subset of a discrete space is Borel. Counting measure has no nonempty null set, so Borel measurable functions modulo almost-everywhere equality are actual functions; their L∞ classes are exactly the bounded complex functions, with the ordinary sup norm (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Complex L∞ space of a locally compact group, [A1]).

[F2]

A mean is a positive complex-linear functional m with m(1)=1; left invariance means m(Lgϕ)=m(ϕ) for every g∈F2 and ϕ∈L∞(F2,μ) (Left-invariant means on L∞ of a locally compact group).

[F3]

Every element of F2 has a unique reduced word in a,a−1,b,b−1 (Free group on a set of generators, Reduced words form the free group on an alphabet).

Proof

technique · paradoxical decomposition by reduced words
1.1A1F1F2algebra

Suppose a left-invariant mean m exists. For each subset E⊆F2 put ν(E):=m(1E), which is defined by [F1]. Positivity gives ν(E)≥0 and monotonicity under inclusion; complex linearity gives finite additivity on disjoint sets. Since Lg1E=1gE, left invariance gives ν(gE)=ν(E) for every g∈F2, and ν(F2)=m(1)=1.

2.1F2F3step 1.1construct

Let A be the set of reduced words whose initial maximal block is ak for some nonzero integer k; the empty word is not in A. Every word outside A is either empty or begins with a nonzero power of b. In the first case a−1∈A; in the second case the reduced word a−1w begins with a−1 and is in A. Thus F2=A∪aA. By [F2], ν(aA)=ν(A); monotonicity and finite subadditivity from step 1.1 give 1=ν(F2)≤ν(A)+ν(aA)=2ν(A), hence ν(A)≥12.

3.1F2F3step 1.1step 2.1∎

The sets A, bA, and b2A are pairwise disjoint: their reduced words have initial maximal blocks respectively a nonzero power of a, exactly one b followed by a nonzero power of a, and exactly two b's followed by a nonzero power of a; no cancellation occurs at these joins. Therefore monotonicity, finite additivity, and left invariance from step 1.1 yield 1=ν(F2)≥ν(A)+ν(bA)+ν(b2A)=3ν(A)≥32, a contradiction. Hence no invariant mean exists, and the amenability definition shows F2 is not amenable. This proves the claim and its stated discrete counterpart.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

53 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