A note on the transitive Hurwitz action on decompositions of parabolic\n Coxeter elements

Barbara Baumeister, Matthew S. Dyer, Christian Stump, Patrick WegenerarXiv 2014 · DOI · arXiv

TL;DR

This paper provides a streamlined, self-contained proof that the braid group acts transitively on the reduced reflection factorizations of parabolic Coxeter elements. Essentially, it shows that any two ways of writing a specific group element as a minimal product of reflections are connected through a series of simple "braid moves," a result with significant implications for Artin groups and representation theory.

What Problem Does This Paper Address?

In the study of Coxeter groups (mathematical structures that describe symmetries generated by reflections, like those of a kaleidoscope or a regular polygon), a central question is how to decompose elements into products of reflections.

Specifically, researchers are interested in "reduced factorizations"—the shortest possible sequences of reflections that multiply together to form a specific element. The Hurwitz action (driven by the braid group) provides a way to "shuffle" these factorizations without changing the final product. A long-standing challenge in the field was proving that this action is transitive: that you can reach any reduced factorization from any other just by applying these braid moves.

While this was previously proven by Bessis for finite groups and generalized by Igusa and Schiffler, the proofs were often complex. This paper aims to provide a shorter, more intuitive proof that also covers "parabolic" Coxeter elements—a slightly more general class than previously handled.

Methods

The authors utilize the geometry of the Bruhat graph, a directed graph where vertices are group elements and edges represent multiplication by a reflection.

  1. Path Interpretation: They represent a factorization of an element $w$ as a path in this graph starting from the identity element $e$.
  2. Length Functions: They compare two types of "length": $\ell$ (the minimum number of simple reflections needed) and $\ell_T$ (the minimum number of any reflections needed).
  3. Replacement Strategy: The core of the proof (Proposition 2.2) involves a "replacement" technique. If a path in the Bruhat graph behaves "badly" (e.g., increases then decreases in length), they show you can use braid moves to transform it into a canonical "decreasing-then-increasing" form.
  4. Permutation Encoding: For the specific case of parabolic Coxeter elements, they show that these paths can be bijectively encoded as permutations. Since simple transpositions generate the symmetric group, the corresponding braid moves are shown to act transitively.

Datasets

Not discussed in the paper. As a theoretical mathematics paper, it relies on logical proofs and existing mathematical frameworks rather than empirical datasets.

Key Insights and Ideas

  • The "Aha" Moment on Length: The authors leverage a property from previous work (Dyer, 2001) stating that for standard parabolic Coxeter elements, the reflection length and the simple generator length are identical ($\ell_T(w) = \ell(w)$). This alignment simplifies the combinatorial complexity significantly.
  • Geometric Smoothing: By viewing factorizations as paths in the Bruhat graph, the authors treat the Hurwitz action as a way to "smooth out" or reorient paths.
  • Parabolic Subgroup Containment: A key secondary result (Theorem 1.4) shows that if an element belongs to a parabolic subgroup, all of its reduced reflection factorizations are trapped within that same subgroup. This confirms that these local structures are "self-contained" with respect to reflection decompositions.

Key Results

  • Theorem 1.3 (Transitivity): Confirms that for a parabolic Coxeter element $c$, the braid group $B_n$ acts transitively on the set of its reduced factorizations $\text{Red}_T(c)$. This means the Hurwitz action can navigate the entire space of minimal reflection sequences.
  • Theorem 1.4 (Subgroup Integrity): Proves that for any element $w$ in a parabolic subgroup $W'$, the set of reduced factorizations using any reflections in the larger group $W$ is identical to the set of factorizations using only reflections from the subgroup $W'$.
  • Generalization: The paper successfully relaxes the conditions required for these theorems compared to earlier literature, making the result applicable to a broader range of Coxeter elements.

Limitations and Future Work

As a "Note," the paper focuses on providing a more elegant proof of known (or slightly generalized) phenomena rather than proposing a brand-new theory.

  • Computational Complexity: The paper does not discuss the algorithmic efficiency of finding the braid moves required to transform one factorization into another.
  • Non-Parabolic Elements: The transitivity result is specific to parabolic Coxeter elements. The behavior of the Hurwitz action on more general elements in infinite Coxeter groups remains a complex area of study.

Summary updated

Abstract

In this note, we provide a short and self-contained proof that the braid\ngroup on n strands acts transitively on the set of reduced factorizations of a\nCoxeter element in a Coxeter group of finite rank n into products of\nreflections. We moreover use the same argument to also show that all\nfactorizations of an element in a parabolic subgroup of W lie as well in this\nparabolic subgroup.\n
BibTeX
@misc{baumeister2014note,
  author = {Barbara Baumeister and Matthew S. Dyer and Christian Stump and Patrick Wegener},
  title = {{A note on the transitive Hurwitz action on decompositions of parabolic\textbackslash\{\}n Coxeter elements}},
  year = {2014},
  eprint = {1402.2500},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1402.2500},
}

Loading related content...

Figure