Theorem The subgroup generated by two distinct involutions is a dihedral Coxeter group
✓ theorem proved

The subgroup generated by two distinct involutions is a dihedral Coxeter group

Let \(s,t\) be distinct nonidentity elements of a group \(G\), with \(s^2=t^2=1\). Put \(m=\operatorname{ord}(st)\), using \(m=0\) to encode infinite order.

Then \(\langle s,t\rangle\) has the rank-two Coxeter system with simple generators \(s,t\) and off-diagonal exponent \(m\). Its matrix has diagonal entries \(1\) and both off-diagonal entries \(m\).

Proof

Step 1. Construct the homomorphism from the presented group

The exponent \(m\) is not one: \(st=1\) would give \(s=t\). Thus it is a permitted off-diagonal Coxeter entry.

Let \(D\) be the Coxeter group of this matrix, with simple generators \(u,v\). The assignments \(u\mapsto s,\ v\mapsto t\) satisfy the involution relations. When \(m>0\), they also satisfy \((st)^m=1\). When \(m=0\), the matrix records an infinite exponent, so it imposes no finite-order relation on the product.

The Coxeter presentation therefore gives a homomorphism \(F:D\to G\).

Step 2. Identify its image

Every element of \(D\) is a product of its simple generators, so every image lies in \(\langle s,t\rangle\). Conversely, \(s,t\) are images of \(u,v\), so the image subgroup contains the subgroup they generate. Hence \(\operatorname{im}F=\langle s,t\rangle\).

Step 3. Exclude a nontrivial even-length kernel element

Take \(w\in\ker F\), and choose a reduced word for it. Adjacent equal simple letters would cancel, so the word alternates.

If it has even length \(2n\), then \[ w=(uv)^n\quad\text{or}\quad w=(vu)^n. \] Its image is \((st)^n\) or \((ts)^n\). Since \(ts=(st)^{-1}\), both products have the same order \(m\).

If this image is one and \(m>0\), then \(m\mid n\); the Coxeter product relation consequently gives \(w=1\). If \(m=0\), the product has infinite order, so the image can be one only when \(n=0\), again giving \(w=1\).

Step 4. Exclude an odd-length kernel element

An alternating word of odd length is a palindrome. If its first half is \(a\) and its middle letter is \(q\in\{u,v\}\), then it represents \(a q a^{-1}\), because every simple letter is its own inverse.

Its image is a conjugate of \(s\) or \(t\), both nonidentity. Thus an odd-length word cannot lie in the kernel.

Step 5. Transport the Coxeter structure

Steps 3–4 show that \(F\) has trivial kernel. Together with Step 2, it is an isomorphism from \(D\) onto \(\langle s,t\rangle\). Transporting the presented Coxeter system through this isomorphism gives the claimed system, with \(u,v\) mapping to the specified elements \(s,t\).

References

The local source declarations below define the objects and prove the stated properties.

Lean formalization

OAI.KLInvariance.Dihedral.pairMatrix: Decomposition.lean:240.

OAI.KLInvariance.Dihedral.wordProd_alt_even: Decomposition.lean:257.

OAI.KLInvariance.Dihedral.injective_of_simple_order: Decomposition.lean:269.

OAI.KLInvariance.Dihedral.pairLift: Decomposition.lean:299.

OAI.KLInvariance.Dihedral.pairLift_injective: Decomposition.lean:319.

OAI.KLInvariance.Dihedral.pairLift_range: Decomposition.lean:335.

OAI.KLInvariance.Dihedral.pairSystem: Decomposition.lean:357.

OAI.KLInvariance.Dihedral.pairSystem_simple: Decomposition.lean:366.

Used by