Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 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.

A paradoxical decomposition of a free group of rank two

Example

The free group F(a,b) admits a paradoxical decomposition.

Facts & Assumptions

Given: The free group F(a,b).

[L1]

Paradoxical decompositions are the translated finite partitions from Paradoxical decompositions of groups.

[L2]

The rank-two free group is nonamenable (The free group of rank two is nonamenable).

Verification

technique · direct
1.1

For x{a,a1,b,b1} let W(x) be the set of nonempty reduced words beginning with x, and put P={an:n0} and P+={an:n1}. Define A1=W(a)P+, A2=W(a1)P, B1=W(b), and B2=W(b1).

L2givenconstruct
2.1

The four sets in step 1.1 are pairwise disjoint and partition F(a,b): the nonidentity reduced words have one of the four possible first letters, and P+ has been moved from W(a) into the piece containing the identity.

step 1.1algebra
3.1

Reduction of the first letter gives aW(a1)=F(a,b)W(a) and aP=P+, hence F(a,b)=A1aA2. Similarly bW(b1)=F(a,b)W(b), hence F(a,b)=B1bB2. Therefore the pieces in step 1.1 with translators e,a,e,b satisfy [L1] and form a paradoxical decomposition.

L1step 1.1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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.