We formalize in Lean some results on Coxeter groups, following the textbook [1]. The results are organized as follows:
- Basic.lean
- Basic definitions and lemmas
- Opposite.lean
- The opposite of a Coxeter group
- PermutationRepresentation.lean
- Construction of the permutation repersentation
- StrongExchange.lean
- Strong exchange
- Deletion property
- Bruhat.lean
- Definition of the Bruhat order
- Subword property
- Lifting property
- The longest element of a finite Coxeter group
[1]: A. Björner and F. Brenti, Combinatorics of Coxeter Groups. Springer, 2005. DOI: 10.1007/3-540-27596-7