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.
Group presentation by generators and relations
Definition
Let be a free group and let be a set of words, called relations. The group with presentation
is the quotient by the normal closure of . The members of are its generators. In this quotient, every relation in becomes the identity, as do all consequences forced by normality.
Depends on
Used by
- Compute the twisted Burau determinant for a colored braid closure Algorithm
- Wirtinger presentation from a finite diagram code Algorithm
- All four classical braid models realize the Artin presentation Corollary
- Every finite group has a finite presentation from its multiplication table Corollary
- Equal abelianizations do not classify knots Counterexample
- Exponent sum is not a complete braid normal form Counterexample
- In ⟨ a,b∣ ab, aba⟩, delete-only relator rewriting sends aba either to the empty word or to the stuck word a Counterexample
- In ⟨ a,b∣ ab⟩, the trivial word ba is stuck under free cancellation and delete-only relator rewriting Counterexample
- In ⟨ a,b∣ aba⁻¹b⁻¹⟩, the trivial word a²b²a⁻²b⁻² is stuck under free cancellation and delete-only relator rewriting Counterexample
- Visible Artin relations alone do not prove presentation completeness Counterexample
- An HNN extension with its stable letter Definition
- Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order Definition
- Artin monoid and Artin group presentations, and the canonical monoid-to-group map Definition
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups Definition
- Racks, diagram fundamental quandles, and adjoint groups Definition
- Recursive presentations and finite presentations of groups Definition
- Relators and relations; finitely generated, finitely related, and finite presentations Definition
- Sc toolkit symmetrised relators and pieces Definition
- Singular planar labelled relator diagrams and their outer walks Definition
- The admissible Wada quotient of a deficiency-one exterior spine Definition
- The braid group by Artin presentation Definition
- The free-presentation Lyndon bar bicomplex Definition
- The path group of a graph of groups Definition
- The symmetrisation of a relator set closes under inverses and cyclic conjugates Definition
- Tietze transformations: dictionary generators, redundant relators, renaming, and their inverses Definition
- Van Kampen diagrams, boundary labels, and diagram area for a presentation Definition
- ⟨ a,b∣ a², b², aba⁻¹b⁻¹⟩≅(ℤ/2)×(ℤ/2) Example
- ⟨ a,b∣ aba⁻¹b⁻¹⟩≅(ℤ,+)×(ℤ,+) Example
- ⟨ a∣ aⁿ⟩≅(ℤ/n,+) for every n≥ 1 Example
- A Baumslag-Solitar group gives a noninjective completion map Example
- A small-cancellation presentation gives a hyperbolic group Example
- A strict C prime(1/6) presentation that is a free group of rank six Example
- Amalgamating infinite cyclic groups by multiplication by m and n gives the presentation with relation xᵐ=yⁿ Example
- Bridge and unknotting numbers of the trefoil Example
- Dₙ≅⟨ r,s∣ rⁿ, s², srs⁻¹r⟩ for the dihedral group Dₙ=⟨{ρ,σ}⟩leqSym(ℤ/n), n≥ 3 Example
- Sym({0,1,2})≅⟨ s,t∣ s², t², (st)³⟩ Example
- The infinite dihedral group is quasi-isometric to ℤ, and to ℤ×ℤ/2 Example
- Worked Wirtinger presentations Example
- FALSE: Greendlinger's lemma holds for every finite presentation False statement
- Algebraic relator area controls coarse filling area Lemma
…and 27 more results.
Dependency tree · two levels
10 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
- Brittenham, Group Presentations, Class Notes (standard reference, not scraped)