ScalingStacks

6.2.2. Length

Consider ฯƒโˆˆHom๐’ฎnโก(I,J)\sigma\in\operatorname{Hom}\nolimits_{{\mathcal{S}}_{n}}(I,J). We define

Lโก(ฯƒ)={(i,iโ€ฒ)โˆˆI~2|iโก<iโ€ฒ,ฯƒโก(i)>โ€‹ฯƒโ€‹(iโ€ฒ)}L(\sigma)=\{(i,i^{\prime})\in\tilde{I}^{2}\ |\ i<i^{\prime},\ \sigma(i)>\sigma(i^{\prime})\}

and L~โ€‹(ฯƒ)={(i,iโ€ฒ)โˆˆLโก(ฯƒ)| 1โ‰คiโ‰คn}\tilde{L}(\sigma)=\{(i,i^{\prime})\in L(\sigma)\ |\ 1\leq i\leq n\}. The canonical map L~โ€‹(ฯƒ)โ†’Lโ€‹(ฯƒ)/nโ€‹๐™\tilde{L}(\sigma)\to L(\sigma)/n{\mathbf{Z}} is bijective. We define โ„“โ€‹(ฯƒ)=|L~โ€‹(ฯƒ)|\ell(\sigma)=|\tilde{L}(\sigma)|.

0P7F

Lemma 6.2.1. We have โ„“โก(ฯƒโ€ฒโˆ˜ฯƒ)โ‰คโ„“โก(ฯƒโ€ฒ)+โ„“โก(ฯƒ)\ell(\sigma^{\prime}\circ\sigma)\leq\ell(\sigma^{\prime})+\ell(\sigma) for all ฯƒโˆˆHom๐’ฎnโก(I,J)\sigma\in\operatorname{Hom}\nolimits_{{\mathcal{S}}_{n}}(I,J) and ฯƒโ€ฒโˆˆHom๐’ฎnโก(J,K)\sigma^{\prime}\in\operatorname{Hom}\nolimits_{{\mathcal{S}}_{n}}(J,K).

0P7G

Proof. We have

L(ฯƒโ€ฒโˆ˜ฯƒ)={(i1,i2)โˆˆI~2|i1<i2,ฯƒ(i1)>ฯƒ(i2),ฯƒโ€ฒโˆ˜ฯƒ(i1)>ฯƒโ€ฒโˆ˜ฯƒ(i2)}โŠ”{(i1,i2)โˆˆI~2|i1<i2,ฯƒ(i1)<ฯƒ(i2),ฯƒโ€ฒโˆ˜ฯƒ(i1)>ฯƒโ€ฒโˆ˜ฯƒ(i2)}={(i1,i2)โˆˆLโก(ฯƒ)|ฯƒโ€ฒโˆ˜ฯƒโก(i1)>ฯƒโ€ฒโˆ˜ฯƒโก(i2)}โŠ”(ฯƒโˆ’1ร—ฯƒโˆ’1)โ€‹({(j1,j2)โˆˆLโก(ฯƒโ€ฒ)|ฯƒโˆ’1โ€‹(j1)<ฯƒโˆ’1โ€‹(j2)}).L(\sigma^{\prime}\circ\sigma)=\{(i_{1},i_{2})\in\tilde{I}^{2}\ |\ i_{1}<i_{2},\ \sigma(i_{1})>\sigma(i_{2}),\ \sigma^{\prime}\circ\sigma(i_{1})>\sigma^{\prime}\circ\sigma(i_{2})\}\sqcup\\ \{(i_{1},i_{2})\in\tilde{I}^{2}\ |\ i_{1}<i_{2},\ \sigma(i_{1})<\sigma(i_{2}),\ \sigma^{\prime}\circ\sigma(i_{1})>\sigma^{\prime}\circ\sigma(i_{2})\}\\ =\{(i_{1},i_{2})\in L(\sigma)\ |\ \sigma^{\prime}\circ\sigma(i_{1})>\sigma^{\prime}\circ\sigma(i_{2})\}\sqcup(\sigma^{-1}\times\sigma^{-1})\bigl(\{(j_{1},j_{2})\in L(\sigma^{\prime})\ |\ \sigma^{-1}(j_{1})<\sigma^{-1}(j_{2})\}\bigr).

It follows that

โ„“(ฯƒโ€ฒ)+โ„“(ฯƒ)โˆ’โ„“(ฯƒโ€ฒโˆ˜ฯƒ)=2|{(i1,i2)โˆˆI~2|i1<i2,ฯƒ(i1)>ฯƒ(i2),ฯƒโ€ฒโˆ˜ฯƒ(i1)<ฯƒโ€ฒโˆ˜ฯƒ(i2)}/n๐™|โ‰ฅ0.\ell(\sigma^{\prime})+\ell(\sigma)-\ell(\sigma^{\prime}\circ\sigma)=2|\{(i_{1},i_{2})\in\tilde{I}^{2}\ |\ i_{1}<i_{2},\ \sigma(i_{1})>\sigma(i_{2}),\ \sigma^{\prime}\circ\sigma(i_{1})<\sigma^{\prime}\circ\sigma(i_{2})\}/n{\mathbf{Z}}|\geq 0.

โˆŽ

Let ฯƒโˆˆHom๐’ฎnโก(I,J)\sigma\in\operatorname{Hom}\nolimits_{{\mathcal{S}}_{n}}(I,J). We have โ„“โก(ฯƒ)=0\ell(\sigma)=0 if and only if ฯƒ\sigma is an increasing bijection.

Given ฯ„โˆˆHom๐’ฎnโก(J,I)\tau\in\operatorname{Hom}\nolimits_{{\mathcal{S}}_{n}}(J,I) with โ„“โก(ฯ„)=0\ell(\tau)=0, we have Lโก(ฯ„โˆ˜ฯƒ)=Lโก(ฯƒ)=(ฯ„ร—ฯ„)โ€‹(Lโก(ฯƒโˆ˜ฯ„))L(\tau\circ\sigma)=L(\sigma)=(\tau\times\tau)\bigl(L(\sigma\circ\tau)\bigr), hence โ„“โก(ฯ„โˆ˜ฯƒ)=โ„“โก(ฯƒโˆ˜ฯ„)=โ„“โก(ฯƒ)\ell(\tau\circ\sigma)=\ell(\sigma\circ\tau)=\ell(\sigma).

Since Lโก(ฯ„โˆ˜ฯƒ)=(ฮฒIร—ฮฒI)โ€‹(Lโก(FIโˆ’1โ€‹(ฯ„โˆ˜ฯƒ)))L(\tau\circ\sigma)=(\beta_{I}\times\beta_{I})(L(F_{I}^{-1}(\tau\circ\sigma))), we have โ„“โก(ฯƒ)=โ„“โก(FIโˆ’1โ€‹(ฯ„โˆ˜ฯƒ))\ell(\sigma)=\ell(F_{I}^{-1}(\tau\circ\sigma)). As a consequence, we deduce the following result from Lemma 3.2.3.

0P7H

Lemma 6.2.2. Let ฯƒโˆˆHom๐’ฎnโก(I,J)\sigma\in\operatorname{Hom}\nolimits_{{\mathcal{S}}_{n}}(I,J). We have

โ„“โก(ฯƒ)=โˆ‘0โ‰คi1<i2<ni1,i2โˆˆI~|โŒŠฯƒโก(i2)โˆ’ฯƒโก(i1)nโŒ‹|.\ell(\sigma)=\sum_{\begin{subarray}{c}0\leq i_{1}<i_{2}<n\\ i_{1},i_{2}\in\tilde{I}\end{subarray}}\bigl|{\lfloor\frac{\sigma(i_{2})-\sigma(i_{1})}{n}\rfloor}\bigr|.

The next lemma relates length and number of intersections of paths on a cylinder.

0P7I

Lemma 6.2.3. Let ฯƒโˆˆHom๐’ฎnโก(I,J)\sigma\in\operatorname{Hom}\nolimits_{{\mathcal{S}}_{n}}(I,J) where I={i1+nโ€‹๐™,i2+nโ€‹๐™}I=\{i_{1}+n{\mathbf{Z}},i_{2}+n{\mathbf{Z}}\} and J={j1+nโ€‹๐™,j2+nโ€‹๐™}J=\{j_{1}+n{\mathbf{Z}},j_{2}+n{\mathbf{Z}}\} with 1โ‰คi1โ‰ i2โ‰คn1\leq i_{1}\neq i_{2}\leq n, 1โ‰คj1โ‰ j2โ‰คn1\leq j_{1}\neq j_{2}\leq n and ฯƒโก(ir)=jr(modn)\sigma(i_{r})=j_{r}\pmod{n} for rโˆˆ{1,2}r\in\{1,2\}. Fix ฮฒ:{i1,i2,j1,j2}โ†’๐‘\beta:\{i_{1},i_{2},j_{1},j_{2}\}\to{\mathbf{R}} increasing with |ฮฒโก(u)โˆ’ฮฒโก(v)|<1|\beta(u)-\beta(v)|<1 for all u,vu,v.

Consider ฮณr:[0,1]โ†’๐‘\gamma_{r}:[0,1]\to{\mathbf{R}} continuous with ฮณrโ€‹(0)=ฮฒโก(ir)\gamma_{r}(0)=\beta(i_{r}) and ฮณrโ€‹(1)=ฮฒโก(jr)+ฯƒโก(ir)โˆ’jrn\gamma_{r}(1)=\beta(j_{r})+\frac{\sigma(i_{r})-j_{r}}{n} for rโˆˆ{1,2}r\in\{1,2\}. We have

โ„“โก(ฯƒ)โ‰ค|{tโˆˆ[0,1]|e2โ€‹iโ€‹ฯ€โ€‹ฮณ1โ€‹(t)=e2โ€‹iโ€‹ฯ€โ€‹ฮณ2โ€‹(t)}|\ell(\sigma)\leq|\{t\in[0,1]\ |\ e^{2i\pi\gamma_{1}(t)}=e^{2i\pi\gamma_{2}(t)}\}|

with equality if, for all rโˆˆ{1,2}r\in\{1,2\}, the map ฮณr\gamma_{r} is affine.

0P7J

Proof. Without loss of generality, we can assume i1<i2i_{1}<i_{2}. The lemma follows by applying the intermediate value theorem to ฮณ2โ€‹(t)โˆ’ฮณ1โ€‹(t)\gamma_{2}(t)-\gamma_{1}(t) and using Lemma 6.2.2, considering four cases according to the signs of j2โˆ’j1j_{2}-j_{1} and ฯƒโก(i2)โˆ’ฯƒโก(i1)\sigma(i_{2})-\sigma(i_{1}). โˆŽ

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

Andrew Manion, Raphael Rouquier

Original source: arXiv:2009.09627v2