Dehornoy order

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In the mathematical area of braid theory, the Dehornoy order is a left-invariant total order on the braid group, found by Patrick Dehornoy (1994, 1995).

Dehornoy's original discovery of the order on the braid group used huge cardinals, but there are now several more elementary constructions of it.


Suppose that σ1, ..., σn−1 are the usual generators of the braid group Bn on n strings. The set P of positive elements in the Dehornoy order is defined to be the elements that can be written as word in the elements σ1, ..., σn−1 and their inverses, such that for some i the word contains σi but does not contain σ
±1 for j < i nor σ

The set P has the properties PP ⊆ P, and the braid group is a disjoint union of P, 1, and P−1. These properties imply that if we define a < b to mean a−1b ∈ P then we get a left-invariant total order on the braid group.


The Dehornoy order is a well-ordering when restricted to the monoid generated by σ1, ..., σn−1.


Further reading

Retrieved from ""
This content was retrieved from Wikipedia :
This page is based on the copyrighted Wikipedia article "Dehornoy order"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA