Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

The Zariski combing words alpha_i and x_i in the Artin presentation

Definition

Fix n≥2 and let Bn=⟨σ1,…,σn−1⟩ be the abstract braid group of The braid group by Artin presentation, the group presented by the generators σ1,…,σn−1 and the relations

σiσi+1σi=σi+1σiσi+1(1≤i≤n−2),

σiσj=σjσi(1≤i,j≤n−1, ∣i−j∣>1).

Reading convention for words. A word w1w2⋯wm in this alphabet and its inverses is read first letter first: it denotes the product [w1][w2]⋯[wm] in Bn, and under the published stacking convention [γ][β]:=[γ⋆β] of Stacking of geometric braids is a well-defined associative operation on isotopy classes and The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, in which the first factor of a stacking is the upper one, its geometric image is the stacking w1⋆w2⋆⋯⋆wm whose first factor is the topmost layer. Here the geometric image is taken through the published surjection φ ⁣:Bn→Gn, φ(σi)=[σi] of The Artin presentation surjects onto the geometric braid group. In particular the empty word is the identity of Bn. No injectivity or completeness of φ is asserted, and nothing below depends on how many factors the stacking has.

The words αi. For 1≤i≤n−1 put

αi:=σiσi+1⋯σn−1∈Bn,andαn:=1,

the last being the empty word. Each αi is a word of length n−i in the generators, and αn−1=σn−1.

The words xi. For 1≤i≤n−1 put

xi:=σn−1−1⋯σi+1−1σi2σi+1⋯σn−1=αi+1−1σi2αi+1∈Bn.

The two displayed words for xi are literally the same word written in two ways: expanding αi+1−1 gives σn−1−1⋯σi+1−1 and expanding αi+1 gives σi+1⋯σn−1, so the middle factor σi2 sits in the same position in both readings. In particular xn−1=σn−12, and xi is a word of length 2(n−i) in the generators and their inverses.

These words are the Zariski combing words of the Artin presentation. The definition is choice-free, it uses no relation of the presentation, and it asserts no property of αi or xi inside any geometric braid model; all of that is established, when needed, by the items that cite this definition.

Depends on

Used by

Dependency tree · two levels

24 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