Admissible signed vertex indices
Let \(D\) be a Coxeter system with simple generators \(s,t\), length \(\ell\), and signed word values \(w_i\). An integer \(i\) is an admissible signed index when, for every maximum-length element \(w\), \[ -\ell(w)<i\le\ell(w). \] Here maximum-length means that \(\ell(z)\le\ell(w)\) for every \(z\in D\). This is the source's predicate GoodIndex.
If lengths are unbounded, there is no maximum-length element and the predicate holds for every integer.
If there is a maximum length \(m\), all maximum-length elements have that same length, and the condition is \[ -m<i\le m. \] Thus the chosen range includes the positive endpoint \(m\).
The longest vertex
The period-and-representative theorem proves \(w_{-m}=w_m\). Both evaluate to the longest vertex, so the interval \((-m,m]\) records that vertex once.
The same theorem proves that every group element has a representative satisfying both GoodIndex and \[ |i|=\ell(w_i). \] These two pieces of data are used in the finite angular comparison lemmas.
The A2 example
For type \(A_2\), the maximum length is \(3\), and the braid relation gives \[ w_{-3}=tst=sts=w_3. \] The admissible vertex representatives are \[ -2,-1,0,1,2,3, \] with values \(ts,t,1,s,st,sts\).
An edge reflection uses the parameter \(i+j\). This parameter is subsequently reduced modulo \(2m\) in the finite root-order comparison. For example, the parameters \(3\) and \(-3\) represent the same reflection modulo \(6\) in type \(A_2\).
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.
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.Dihedral.GoodIndex: DihedralIntervals.lean:1378.