Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

The free group of rank two is nonamenable

Statement

The free group of rank two is nonamenable.

Facts & Assumptions

Given: The free group F2 of rank two.

[L1]

F2 is the free group on two generators, say a and b (The free product of two infinite cyclic groups is the free group on two generators).

[L2]

A paradoxical decomposition forbids a left-invariant mean (Paradoxical groups admit no invariant mean).

[L3]

Paradoxical decompositions are defined by finitely many translated pieces (Paradoxical decompositions of groups).

Proof

technique · direct
1.1

By [L1], write F2=a,b. For x{a,a1,b,b1}, let W(x) be the set of nonempty reduced words whose first letter is x. Put P={an:n0} and P+={an:n1}, and define A1=W(a)P+, A2=W(a1)P, B1=W(b), and B2=W(b1).

L1L3givenconstruct
2.1

The four sets are pairwise disjoint and partition F2: the usual five first-letter classes partition F2, and P+ has merely been moved from W(a) into the piece containing the identity.

step 1.1algebra
3.1

Left multiplication gives aW(a1)=F2W(a) and aP=P+, hence F2=A1aA2. Likewise bW(b1)=F2W(b), hence F2=B1bB2. Thus the pieces of step 1.1, with translators e,a,e,b, satisfy both partition equalities in [L3].

L3step 1.1step 2.1algebra
4.1

Steps 1.1-3.1 give a paradoxical decomposition of F2, so [L2] implies that F2 admits no left-invariant mean and is therefore nonamenable.

L2step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

7 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