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 admits a paradoxical decomposition.
Facts & Assumptions
Given: The free group .
Paradoxical decompositions are the translated finite partitions from Paradoxical decompositions of groups.
The rank-two free group is nonamenable (The free group of rank two is nonamenable).
Verification
For let be the set of nonempty reduced words beginning with , and put and . Define , , , and .
The four sets in step 1.1 are pairwise disjoint and partition : the nonidentity reduced words have one of the four possible first letters, and has been moved from into the piece containing the identity.
Reduction of the first letter gives and , hence . Similarly , hence . Therefore the pieces in step 1.1 with translators satisfy [L1] and form a paradoxical decomposition.
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.