The avoiding-path sum becomes a full path polynomial after rotation
Fix a finite-generator Coxeter system, a simple generator \(s=s_i\), and ratio orders \(O,O'\). Assume \(\alpha_i\) is greatest for \(O'\), and that the two orders satisfy \[ \sigma_{O'}(s\star a)<\sigma_{O'}(s\star b) \Longleftrightarrow \sigma_O(a)<\sigma_O(b) \quad(a,b\ne\alpha_i). \tag{1} \] Let \(x,y\in W\) satisfy \(\ell(sy)<\ell(y)\). Then \[ \sum_{q\in\mathcal N_{O,i}(x,y)}X^{|q|} =F_{O'}(sx,sy;X), \tag{2} \] where \(\mathcal N_{O,i}\) is the finite selected path set avoiding \(\alpha_i\).
Relation to the OpenAI notes
Actual edge rotation and the two path-sum bijections.
OpenAI notes: The notes present the increasing-path expression as the normalized R-polynomial and cite Dyer for the formula. bg:paths, eq:bg-path-formula.
Lean (primary): The independent path proof partitions actual finite path sets by avoidance of one chosen simple label. Rotating the avoiding paths gives a full target path set because the chosen label is greatest there and the rotated endpoint is an ascent. Paths containing the least label are obtained by prefixing the uniquely determined simple edge. DyerPaths:2091, DyerPaths:2160, DyerPaths:2268, DyerPaths:2174, DyerPaths:2184, DyerPaths:2198, DyerPaths:2247, DyerPaths:2276, DyerPaths:2340, DyerPaths:2376.
Role in the proof: The Blueprint defines the exact avoidance predicate and total edge map, proves both finite bijections and identifies the extra polynomial factor with the prefixed edge.
Proof
Step 1. Rotation maps into the target path set
Let \(G(q)=g_i(q)\), the edgewise rotation. For \(q\in\mathcal N_{O,i}(x,y)\), the list is an increasing path for \(O\) and avoids \(\alpha_i\). The simple-root path transport theorem applies using (1), and gives \[ G(q)\in\operatorname{Paths}_{O'}(sx,sy). \] The same theorem gives \(|G(q)|=|q|\).
Step 2. Injectivity of the list map
The edge rotation is an involution, so \(G(G(q))=q\). If \(G(q)=G(q')\), applying \(G\) to both sides gives \(q=q'\). Thus the map in Step 1 is injective.
Step 3. Every target path avoids the chosen label
Take \(r\in\operatorname{Paths}_{O'}(sx,sy)\). The hypothesis \(\ell(sy)<\ell(y)\) and the equality \(s(sy)=y\) give \[ \neg\bigl(\ell(s(sy))<\ell(sy)\bigr). \] Thus \(s\) is not a left descent at the new endpoint \(sy\). The label \(\alpha_i\) is greatest for \(O'\), so the final-endpoint part of the extremal-label theorem proves that \(r\) avoids \(\alpha_i\).
Step 4. The inverse map and surjectivity
Put \(q=G(r)\). Avoidance is preserved by rotation, and \(G(q)=r\). Apply the selected-path equivalence in the simple-root path transport theorem to this avoiding list \(q\). Since \[ G(q)=r\in\operatorname{Paths}_{O'}(sx,sy), \] it follows that \(q\in\operatorname{Paths}_O(x,y)\). Together with avoidance, this places \(q\) in \(\mathcal N_{O,i}(x,y)\), and its image is the original \(r\). This proves surjectivity onto the full target path set.
Step 5. Reindexing the weights
Steps 1–4 give a bijection from \(\mathcal N_{O,i}(x,y)\) to \(\operatorname{Paths}_{O'}(sx,sy)\), preserving the length of every list. Reindexing the finite sum therefore gives \[ \sum_{q\in\mathcal N_{O,i}(x,y)}X^{|q|} =\sum_{r\in\operatorname{Paths}_{O'}(sx,sy)}X^{|r|} =F_{O'}(sx,sy;X). \] The endpoint ascent in Step 3 is the condition that makes the target the full selected path set.
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.AdaptedDyer.sum_nonsimple_rotate: DyerPaths.lean:2276.