Rank fibers and signed sums in a dihedral lower interval
Let \(D\) be a Coxeter system with simple generators \(s,t\), length \(\ell\) and signed word values \(w_i\). Fix \(c\in D\) and put \(C=\ell(c)\). The lower Bruhat interval has these rank fibers:
- the rank-zero fiber is \(\{1\}\);
- for \(0<n<C\), the rank-\(n\) fiber is \(\{w_n,w_{-n}\}\), with two distinct elements;
- the rank-\(C\) fiber is \(\{c\}\).
Consequently, for a function \(f:D\to M\) into an additive commutative monoid, with \(f(1)=0\), \[ \sum_{z\le c}f(z) =\sum_{0\le n<C}\bigl(f(w_n)+f(w_{-n})\bigr)+f(c). \]
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. Identify an internal rank fiber
Take \(n\in\mathbb N\) with \(n<C\). Any element below \(c\) of length \(n\) has an alternating expression beginning with \(s\) or \(t\), so it is \(w_n\) or \(w_{-n}\).
Conversely, the signed-length theorem gives length \(n\) to both values, since the element \(c\) has greater length. The dihedral Bruhat comparison theorem then puts both below \(c\). This proves the fiber formula.
For \(n>0\), the internal-rank theorem makes the two values distinct.
Step 2. Identify the bottom and top fibers
Length zero characterizes the identity, and \(1\le c\), so the zero fiber is \(\{1\}\).
If \(z\le c\) and \(\ell(z)=\ell(c)\), strict length increase along a nontrivial Bruhat comparison forces \(z=c\). Thus the top fiber is \(\{c\}\).
Step 3. Sum by rank
Suppose first that \(C>0\). The interval is finite, and every element in it has length between \(0\) and \(C\). Partition its sum into these rank fibers.
Every internal positive rank contributes \(f(w_n)+f(w_{-n})\). The top contributes \(f(c)\). The rank-zero fiber contributes \(f(1)=0\).
Step 4. Include the zero index in the uniform formula
The displayed sum starts at \(n=0\), where \(w_0=w_{-0}=1\). Its contribution is \(f(1)+f(1)=0\), equal to the true rank-zero contribution.
This yields the stated uniform formula. If \(C=0\), the internal sum is empty and the top is \(c=1\), so the same identity holds.
For the relative later-edge indicator, the value at \(1\) is zero because no upward edge ends at length zero. Hence this signed-sum formula is the one used to pass from the actual lower interval to the numerical countAfter function.
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.Dihedral.lower_length_fiber: DihedralIntervals.lean:1296.
OAI.KLInvariance.Dihedral.lower_zero_fiber: DihedralIntervals.lean:1316.
OAI.KLInvariance.Dihedral.lower_top_fiber: DihedralIntervals.lean:1326.
OAI.KLInvariance.Dihedral.sum_lower_signed: DihedralIntervals.lean:1341.