# About Kazhdan Lusztig polynomial evaluating at q=1

Given $$w\le w'$$ (in Bruhat ordering), does $$P_{x,w}(1)\le P_{x,w'}(1)$$ (in usual ordering of $$\mathbb{R}$$), where $$P_{x,w}(q)$$ is the Kazhdan Lusztig polynomial?

• No. Suppose that $W$ is finite and $w_0$ is the longest element. Then $P_{x,w_0} = 1$, but $w \le w_0$ for all $w$. Hence any non-trivial KL polynomial gives a counter-example. For example $P_{t,tsut} = 1 + q$ but $P_{t,stsuts} = 1$, when $s,t,u$ are the standard generators of $S_4$ (symmetric group on $4$ letters). – Geordie Williamson Nov 16 '18 at 12:33
• Thank you. My follow up question would be: Given $I\subseteq \Delta$, consider the Weyl group generated by $I$, denote by $W_I$, let $w_I$ be the longest element of $W_I$ and ${}^IW$ denote the set of minimal length coset representatives of $W_I\backslash W$. Given $w_Iw\le w_Iw'$, does $P_{w_Ix, w_Iw}(1)\le P_{w_Ix, w_Iw'}(1)$ for $x,w,w'\in {}^IW$? – James Cheung Nov 16 '18 at 13:25
• Doesn't $I = \emptyset$ yield your earlier question? So ... no again! – Geordie Williamson Nov 16 '18 at 20:51
• by the way, the statement $P_{x',w}(1) \le P_{x,w}(1)$ is true for $x' \le x$. Perhaps this is what you meant? See the Braden-MacPherson paper. It is known in general. This has been written down by Plaza. – Geordie Williamson Nov 17 '18 at 23:09