ScalingStacks

0P4Y

Lemma 3.2.2. Let σ′,σ′′∈𝔖^n\sigma^{\prime},\sigma^{\prime\prime}\in\hat{{\mathfrak{S}}}_{n} and σ=σ′​σ′′\sigma=\sigma^{\prime}\sigma^{\prime\prime}. Assume ℓ⁡(σ)=ℓ⁡(σ′)+ℓ⁡(σ′′)\ell(\sigma)=\ell(\sigma^{\prime})+\ell(\sigma^{\prime\prime}). Let a∈𝐙/na\in{\mathbf{Z}}/n such that ℓ⁡(σ​sa)<ℓ⁡(σ)\ell(\sigma s_{a})<\ell(\sigma) and ℓ⁡(σ′′​sa)>ℓ⁡(σ′′)\ell(\sigma^{\prime\prime}s_{a})>\ell(\sigma^{\prime\prime}).

Let α′′=σ′′​sa\alpha^{\prime\prime}=\sigma^{\prime\prime}s_{a} and α′=σ′σ′′saσ′′−1\alpha^{\prime}=\sigma^{\prime}\sigma^{\prime\prime}s_{a}\sigma^{\prime\prime-1}. We have σ=α′​α′′\sigma=\alpha^{\prime}\alpha^{\prime\prime} and ℓ⁡(σ)=ℓ⁡(α′)+ℓ⁡(α′′)\ell(\sigma)=\ell(\alpha^{\prime})+\ell(\alpha^{\prime\prime}).

0P4Z

Proof. Multiplying if necessary σ′\sigma^{\prime} and σ′′\sigma^{\prime\prime} by a power of cc, we can assume σ\sigma, σ′\sigma^{\prime} and σ′′\sigma^{\prime\prime} are in WnW_{n}.

Let σ′=sa1⋯sam\sigma^{\prime}=s_{a_{1}}\cdots s_{a_{m}} and σ′′=sam+1⋯sad\sigma^{\prime\prime}=s_{a_{m+1}}\cdots s_{a_{d}} be two reduced decompositions. The Exchange Lemma [Hu, Theorem 5.8] shows that there is ii such that σsa=sa1⋯sai−1sai+1⋯sad\sigma s_{a}=s_{a_{1}}\cdots s_{a_{i-1}}s_{a_{i+1}}\cdots s_{a_{d}}.

If i>mi>m, then σ′′sa=sam+1⋯sai−1sai+1⋯sad\sigma^{\prime\prime}s_{a}=s_{a_{m+1}}\cdots s_{a_{i-1}}s_{a_{i+1}}\cdots s_{a_{d}} and this contradicts ℓ⁡(σ′′​sa)>ℓ⁡(σ′′)\ell(\sigma^{\prime\prime}s_{a})>\ell(\sigma^{\prime\prime}). So, i≤mi\leq m. We have σsa=sa1⋯sai−1sai+1⋯samσ′′\sigma s_{a}=s_{a_{1}}\cdots s_{a_{i-1}}s_{a_{i+1}}\cdots s_{a_{m}}\sigma^{\prime\prime}. We deduce that α′=sa1⋯sai−1sai+1⋯sam\alpha^{\prime}=s_{a_{1}}\cdots s_{a_{i-1}}s_{a_{i+1}}\cdots s_{a_{m}} has length m−1m-1 and the lemma follows. ∎

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Andrew Manion, Raphael Rouquier

Original source: arXiv:2009.09627v2