Alphabeta Math

Artin Presentation Completeness and Braid Combing

About this page
Pipeline-generated
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.

✓ 7 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Algebraic Topology
Braid Groups
Category Theory
Combinatorics
Complex Analysis
Coxeter Groups
Differential Geometry
Functional Analysis
Group Theory
Linear Algebra
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Definition

The Zariski combing words αᵢ and xᵢ in the Artin presentation

Lemma

Prefix insertion rewrites a trivial braid word into combing factors

Lemma

Lower-rank Artin letters conjugate x-letters

Lemma

Each combing factor reduces to a lower-rank letter or an x-letter

Lemma

Every trivial braid word combs as W₁W₂

Lemma

The combed geometric decomposition is unique

Theorem

The Artin presentation is complete for geometric braids

Corollary

All four classical braid models realize the Artin presentation

Sources