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.
Computing an algebraic relator area
Example
In the presentation , the null word has algebraic relator area .
Facts & Assumptions
Given: The relator-area definition for a finite presentation.
The algebraic relator area of a null word is the least number of conjugates of defining relators and their inverses whose product equals that word. (Algebraic relator area and the Dehn function of a finite presentation)
Every null word has a minimal algebraic relator area. (Every null word has a minimal algebraic relator area)
Verification
The word is the product , so [L1] gives .
It is not , because a single conjugate of the only relator or its inverse is just or in this cyclic presentation. Thus [L2] forces the minimum to be exactly .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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
- John Meier, Groups, Graphs and Trees (standard reference, not scraped)