Coxeter Element¶

A product containing each simple reflection of a Coxeter system exactly once, organizing conjugacy, order, spectrum, and reflection geometry.

Version: v2 · 2026-09-06 · History
Domain-specific #: 1577
Origin domain: group theory
Subdomain: coxeter groups

Core Idea¶

Let \((W,S)\) be a finite-rank Coxeter system, with distinguished simple reflections \(S=\{s_1,\ldots,s_n\}\). A Coxeter element is a group element represented by a product

\[ c=s_{\pi(1)}s_{\pi(2)}\cdots s_{\pi(n)}, \]

where \(\pi\) orders the generators and every simple reflection occurs exactly once. The order matters: different words can represent different elements. Commuting nonadjacent generators can yield the same element, and cyclically moving the first generator to the end conjugates the element.

For a finite irreducible Coxeter group, the Coxeter elements form one conjugacy class, so they share an order called the Coxeter number \(h\). Their action in the reflection representation has a distinguished spectrum governed by the group's exponents, and a primitive eigenvalue pair defines the Coxeter plane. Humphreys treats Coxeter elements, eigenvalues, finite reflection groups, and the Coxeter number as an organizing part of the theory.^[1]

The abstraction is the once-each product relative to a chosen simple system, together with its conjugacy, orientation, order, and geometric consequences. It is not merely any important element of a Coxeter group.

Structural Signature¶

Mandatory roles:

Coxeter system: a group \(W\) with distinguished simple generating reflections \(S\).
Finite rank: the simple set can be listed for the product.
Once-each word: every member of \(S\) occurs exactly once.
Ordering choice: a permutation of \(S\) determines a Coxeter word.
Commutation equivalence: swapping commuting simple reflections does not change the element.
Graph orientation: ordering adjacent generators orients each edge of the Coxeter graph acyclically.
Rotation/conjugation move: moving an initial generator to the end conjugates the product by that generator.
Finite-type order: in finite irreducible type, the common order is the Coxeter number.
Reflection action: eigenvalues and a Coxeter-plane rotation connect the algebraic element to geometry.

Recognition test. Specify \((W,S)\), list every simple generator exactly once, and evaluate the product. A product of arbitrary reflections or a word omitting or repeating a simple generator is not a Coxeter element relative to that system.

What It Is Not¶

A Coxeter element is not the Coxeter group itself and not Coxeter notation for regular polytopes or reflection groups. It is an element selected by the simple generating set.

It is not an arbitrary reflection. Simple reflections have order two, while a Coxeter element is generally a product with larger or infinite order. It is not the longest element \(w_0\) of a finite Coxeter group, whose defining property is maximal Coxeter length; the once-each word has length equal to rank.^[2]

It is not the Coxeter number. The number is the order of a Coxeter element in finite irreducible type, not the element itself. It is not the dual Coxeter number, which arises from coroot and Lie-theoretic data and can differ from \(h\).

It is not guaranteed that all Coxeter elements are conjugate in an arbitrary infinite Coxeter group. Eriksson and Eriksson characterize conjugacy by rotation equivalence, and Coxeter graphs with cycles can have multiple classes.^[3]

Scope of Application¶

Coxeter elements organize finite real reflection groups, Weyl groups, root systems, regular-polytope symmetry, Lie theory, and algebraic combinatorics. Their order supplies the Coxeter number; their eigenvalues encode exponents; their plane provides symmetric projections of roots and polytopes; and their orientations connect group elements to quivers, chip firing, and sortable combinatorics.

The construction also exists in infinite Coxeter groups of finite rank. The word definition survives exactly, but order, conjugacy, spectrum, and geometric conclusions must be restated. An infinite irreducible group typically has infinite-order Coxeter elements, and cyclic Coxeter graphs can support several conjugacy classes.^[3]

Extensions to complex reflection groups use generalized notions such as regular elements of order \(h\). Those agree with familiar Coxeter elements in appropriate real cases but should not be imported without naming the changed definition.

Clarity¶

The element depends on the Coxeter system, not only the abstract group. A group may admit different distinguished simple systems. “Each reflection once” means each simple reflection in the chosen \(S\), not every reflection in the group; the full reflection set consists of conjugates and is usually much larger.

Product convention matters. If permutations act on the left versus right, a displayed cycle may be inverted. Statements about conjugacy and order survive inversion, but worked examples should state composition convention.

Different orderings need not give different elements because nonconnected generators commute. The corresponding acyclic orientation records only the relative order of adjacent generators; it is therefore the right combinatorial invariant of a Coxeter word.^[3]

Manages Complexity¶

One short word samples the whole simple generating system. Rather than analyze all group elements, one obtains a distinguished conjugacy class whose order and eigenvalues reflect global type data. In finite irreducible type, \(h\) connects root counts, invariant degrees, and rotational geometry.

The graph-orientation encoding compresses factorially many orderings. Swapping commuting generators leaves the orientation and element unchanged. A source-to-sink move corresponds to cyclic rotation and conjugation. Thus word comparison becomes a graph reachability problem rather than brute-force multiplication.^[3]

The Coxeter plane further compresses high-dimensional reflection geometry into a two-dimensional projection on which the Coxeter element acts as rotation by \(2\pi/h\). Root orbits and polytope structure can become visually organized without claiming that the projection preserves every metric relation.

Abstract Reasoning¶

If \(c=s_1s_2\cdots s_n\), then

\[ s_1cs_1=s_2s_3\cdots s_ns_1, \]

because \(s_1^2=1\). Thus cyclic rotation of a Coxeter word is conjugation. Legal commutations preserve the represented element. These moves explain why source-to-sink changes in the oriented graph track conjugacy.^[3]

In finite irreducible rank \(n\), let the invariant degrees be \(d_1,\ldots,d_n\), exponents \(m_i=d_i-1\), and Coxeter number \(h=d_n\) under conventional ordering. In the reflection representation, a Coxeter element has eigenvalues

\[ \exp(2\pi i m_i/h),\qquad i=1,\ldots,n. \]

For a finite irreducible Coxeter group of rank at least two, the eigenvalues with exponents \(1\) and \(h-1\) span a real invariant two-plane, the Coxeter plane, on which \(c\) acts as a rotation. Rank-one type \(A_1\) has no two-dimensional reflection subspace. These finite-type results should not be inferred from the once-each definition alone in infinite type.^[1]

Knowledge Transfer¶

Literal transfer occurs across finite Coxeter types because the same system, once-each word, conjugacy, order, and reflection-action roles recur. Symmetric, dihedral, crystallographic, and exceptional groups change the diagram and numerical data but not the construction.

Transfer to quiver orientations retains the graph orientation and source-to-sink moves, while representation-theoretic Coxeter transformations may add categorical or linear-algebraic structure. They are related uses, not automatic synonyms.

The parent Group provides elements, products, generators, and conjugacy. The Coxeter abstraction adds a distinguished reflection-generating set and a once-each product whose consequences are highly specific.

Examples¶

Type \(A_{n-1}\). Identify \(W\) with the symmetric group \(S_n\) and take simple transpositions \(s_i=(i\ i+1)\). Under a standard composition convention, \(s_1s_2\cdots s_{n-1}\) is an \(n\)-cycle. Its order is \(n\), so the Coxeter number of type \(A_{n-1}\) is \(n\).

Dihedral type \(I_2(m)\). Two simple reflections \(s,t\) generate reflections in lines meeting at angle \(\pi/m\). The products \(st\) and \(ts=(st)^{-1}\) are rotations of order \(m\) and are conjugate Coxeter elements.

Nonexample. In type \(A_3\), the word \(s_1s_2s_1\) is not a Coxeter word: it repeats \(s_1\) and omits \(s_3\), regardless of whether the resulting group element is otherwise interesting.

Structural Tensions¶

Ordering dependence versus conjugacy stability: orderings may give distinct elements while finite-type invariants remain common. Diagnostic: distinguish equality after commuting generators from conjugacy after rotations.
Finite-type uniformity versus infinite-type plurality: the word definition persists while common finite order and one conjugacy class can fail. Diagnostic: identify whether \(W\) is finite and whether the claimed theorem assumes finite irreducible type.
Abstract word versus geometric rotation: the product is algebraic, yet its reflection representation yields a Coxeter-plane rotation. Diagnostic: name the representation and eigenplane before treating the element as a geometric rotation.
Chosen simple system versus all reflections: the construction is relative to \(S\), not the full reflection set. Diagnostic: verify every factor is one of the chosen simple generators and appears once.
Autonomy versus generic group: Group supplies multiplication and conjugacy but not the once-each reflection product or its spectrum. Diagnostic: subtract generic group structure; if simple-system coverage, Coxeter number, and orientation remain, the node is autonomous.

Structural–Framed Character¶

Coxeter Element is a formal structural abstraction. Its roles are generators, products, graph orientations, conjugacy, order, and eigenvalues, with no institutional or evaluative content. It is nevertheless framed by specialized algebraic and geometric vocabulary that does not transfer literally outside mathematics.

The distinction between finite and infinite types is part of the structure, not an optional historical footnote. It controls which invariants travel with the definition.

Structural Core vs. Domain Accent¶

The portable core is a product that covers a distinguished generating set exactly once and thereby summarizes global structure. The domain accent specifies involutive simple reflections, Coxeter relations, conjugacy moves, reflection representations, exponents, and Coxeter geometry.

Removing that accent leaves generic generator coverage or composition. Those primes do not recover the mathematical identity, so the abstraction remains domain-specific.

prime:group is the minimal parent because a Coxeter element is a distinguished element inside a group, defined through its generators, product, order, and conjugacy. The proposal uses a part-of relation rather than calling the element a subtype of group. Composition describes multiplication of reflections but is not a sufficient taxonomic parent.

Relationships to Other Abstractions¶

Current abstraction Coxeter Element Domain-specific

Parents (1) — more general patterns this builds on

Coxeter Element is part of Group Prime

prime:group is the minimal parent because a Coxeter element is a distinguished element inside a group, defined through its generators, product, order, and conjugacy.

Neighborhood in Abstraction Space¶

Coxeter Element sits in a sparse region of the domain-specific corpus (93^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Coxeter Notation — 0.83
Baxter Permutation — 0.79
Ring — 0.77
Zero-Sum Problem — 0.77
Post Canonical System — 0.77

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Coxeter group: the ambient group and chosen simple system.
Coxeter notation: symbol system for reflection groups and regular polytopes.
Coxeter number: finite-type order of a Coxeter element.
Dual Coxeter number: related Lie-theoretic invariant.
Simple reflection: one factor, usually of order two.
Longest element: maximum-length finite-group element, generally a different word.
Coxeter transformation: related linear or categorical operators whose definition must be stated.

References¶

[1] James E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge Studies in Advanced Mathematics 29, Cambridge University Press, 1990, especially §3.16 and §8.4. https://sites.math.washington.edu/~billey/classes/reflection.groups/references/Humphreys.ReflectionGroupsAndCoxeterGroups.pdf registry ↩a ↩b

[2] Anders Björner and Francesco Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer, 2005. https://link.springer.com/book/10.1007/3-540-27596-7 registry ↩

[3] Henrik Eriksson and Kimmo Eriksson, “Conjugacy of Coxeter Elements,” Electronic Journal of Combinatorics 16(2) (2009), R4. registry ↩a ↩b ↩c ↩d ↩e