Combinatorial invariance of Kazhdan–Lusztig polynomials
If is an isomorphism of abstract Bruhat interval posets in arbitrary Coxeter systems and , then their equal-parameter Kazhdan–Lusztig polynomials satisfy .
The proof is complete and logically sound, with each step—reduction to finite rank, graph reconstruction, local dihedral decomposition, edge-image comparison, and reciprocal induction—rigorously established.
“Theorem 1.1 (Combinatorial invariance). Let (W, S) and (W′, S′) be arbitrary Coxeter systems, and let u ≤ b in W and u′ ≤ b′ in W′. If ι : [u, b] −→ [u′, b′] is an isomorphism of abstract Bruhat interval posets, then their equal-parameter Kazhdan–Lusztig polynomials satisfy P^(q) = _{u',b'}(q).” · Show in paper