Theorem Reduced lengths and existence of signed representatives
✓ theorem proved

Reduced lengths and existence of signed representatives

Let \(D\) be a Coxeter system with simple generators \(s,t\), length \(\ell\), and signed word values \(w_i\).

If an element \(v\in D\) has \(\ell(v)\ge |i|\), then \[ \ell(w_i)=|i|. \] Every element \(z\in D\) also admits a signed representative \(i\) such that \[ w_i=z,\qquad |i|=\ell(z). \]

Relation to the OpenAI notes

The signed model constructed from word and length identities.

OpenAI notes: The notes index the two alternating rays by positive and negative integers, use -m<i<=m in finite type, and obtain reflection labels as doubled midpoints i+j. The interval-shape lemma gives two vertices in each internal rank and a singleton top. dih:shape, dih:midpoint-order.

Lean (primary): indexWord evaluates rotation powers using Euclidean integer division. A diagram automorphism and reduced prefixes prove the length statements. A maximum length m gives rotation^m=1, hence signed-index period 2m; GoodIndex selects the negative-open, positive-closed range. The internal-rank and signed-sum lemmas retain the zero-rank and singleton-top cases explicitly. DihedralIntervals:41, DihedralIntervals:709, DihedralIntervals:90, DihedralIntervals:763, DihedralIntervals:1378, ReflectionSchedules:1639, DihedralIntervals:1341, DihedralIntervals:779.

Role in the proof: The Blueprint separates integer parameters from their group values, and separates the vertex representative range from the odd reflection-label residues used in finite type.

Proof

Step 1. Exchange the two simple generators

The assignment \(s\mapsto t,\ t\mapsto s\) preserves the Coxeter relations: the two diagonal entries are equal, and the two off-diagonal entries agree by symmetry. It therefore defines the source's homomorphism swapHom.

Applying it twice fixes both generators. Induction on products of generators makes the double application the identity on \(D\). Thus it is an automorphism \(\theta\), called swap.

Applying \(\theta\) to a generator word exchanges its letters without changing the number of letters. A reduced word for \(z\) therefore gives \(\ell(\theta z)\le\ell(z)\). Applying the same inequality to \(\theta z\), and using \(\theta^2=1\), gives the reverse inequality. Hence \[ \ell(\theta z)=\ell(z). \]

Step 2. Obtain both reduced alternating words of a bounded length

Suppose \(n\le\ell(v)\). Choose a reduced alternating expression for \(v\), beginning with one of the two generators. Its first \(n\) letters form a reduced prefix, so their product has length \(n\).

The automorphism \(\theta\) exchanges this alternating prefix with the one of length \(n\) beginning with the other generator. Step 1 preserves its length. Thus both alternating words of length \(n\) have products of length \(n\).

Step 3. Apply this to a signed index

The signed-word definition identifies \(w_n\) and \(w_{-n}\) with these two alternating products. Therefore both have length \(n\) whenever an element of length at least \(n\) exists.

For an arbitrary integer \(i\), take \(n=|i|\). The index is \(n\) or \(-n\), and the displayed length equality follows.

Step 4. Represent an arbitrary group element

Choose a reduced alternating expression for \(z\). Its number of letters is \(\ell(z)\).

If it begins with \(s\), take \(i=\ell(z)\); if it begins with \(t\), take \(i=-\ell(z)\). The positive and negative signed-word identities give \(w_i=z\), and in both cases \(|i|=\ell(z)\). The identity element is represented by \(i=0\).

This proves the length and existence statements used when the later count is expressed in integer coordinates.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.Dihedral.swapHom: DyerPaths.lean:958.

OAI.KLInvariance.Dihedral.swapHom_involutive: DyerPaths.lean:973.

OAI.KLInvariance.Dihedral.swap: DyerPaths.lean:983.

OAI.KLInvariance.Dihedral.swap_wordProd: DyerPaths.lean:996.

OAI.KLInvariance.Dihedral.length_swap: DyerPaths.lean:1003.

OAI.KLInvariance.Dihedral.swap_alt: DihedralIntervals.lean:705.

OAI.KLInvariance.Dihedral.length_alt_le_length: DihedralIntervals.lean:709.

OAI.KLInvariance.Dihedral.length_indexWord_nat: DihedralIntervals.lean:722.

OAI.KLInvariance.Dihedral.length_indexWord_neg_nat: DihedralIntervals.lean:727.

OAI.KLInvariance.Dihedral.length_indexWord: DihedralIntervals.lean:732.

OAI.KLInvariance.Dihedral.exists_indexWord: DihedralIntervals.lean:80.

Used by