ScalingStacks

8.2.5. Complement

We provide here a more direct description of the equivalence relation ∼\sim on CC.

0PDG

Corollary 8.2.13. We have E⊂CE\subset C and F⊂CF\subset C.

We define an equivalence relation ∼′\sim^{\prime} on CC as the relation generated by α′∗(T1α)∗α′′∼′α′∗(αT1)∗α′′\alpha^{\prime}\ast(T_{1}\alpha)\ast\alpha^{\prime\prime}\sim^{\prime}\alpha^{\prime}\ast(\alpha T_{1})\ast\alpha^{\prime\prime} for α′,α′′∈C\alpha^{\prime},\alpha^{\prime\prime}\in C and α∈D2\alpha\in D_{2}.

0PDH

Lemma 8.2.14. Let σ∈Gn\sigma\in G_{n} and i∈{1,…,n−1}i\in\{1,\ldots,n-1\}

If σ​Ti∈Cn∖{0}\sigma T_{i}\in C_{n}\setminus\{0\}, then Ti​σ∈CnT_{i}\sigma\in C_{n} and σTi∼′Tiσ\sigma T_{i}\sim^{\prime}T_{i}\sigma.

If Ti​σ∈Cn∖{0}T_{i}\sigma\in C_{n}\setminus\{0\}, then σ​Ti∈Cn\sigma T_{i}\in C_{n} and σTi∼′Tiσ\sigma T_{i}\sim^{\prime}T_{i}\sigma.

0PDI

Proof. Put σ′=σ​Ti\sigma^{\prime}=\sigma T_{i} and assume σ′∈Cn∖{0}\sigma^{\prime}\in C_{n}\setminus\{0\}. There are γ∈Cn−i−1\gamma\in C_{n-i-1}, β∈C2\beta\in C_{2} and α∈Ci−1\alpha\in C_{i-1} such that σ′=α∗β∗γ\sigma^{\prime}=\alpha\ast\beta\ast\gamma.

Lemma 8.2.4 shows that [−n+i−1→−n+i]∈D(σ′)[-n+i-1\to-n+i]\in D(\sigma^{\prime}). We have σ|{−n+i−1,−n+i}′=(α∗β)|(−i−1,−i)∘([−n+i−1→−i−1]⊠[−n+i→−i])\sigma^{\prime}_{|\{-n+i-1,-n+i\}}=(\alpha\ast\beta)_{|(-i-1,-i)}\circ([-n+i-1\to-i-1]\boxtimes[-n+i\to-i]). It follows from Lemma 8.2.4 that [−i−1→−i]∈D(α∗β)[-i-1\to-i]\in D(\alpha\ast\beta). Since [−i−1→−i]∈L((α∗β)|(−i−1,−i))[-i-1\to-i]\in L((\alpha\ast\beta)_{|(-i-1,-i)}), it follows that β⁡(−1)≠1\beta(-1)\neq 1, hence β∈D2\beta\in D_{2}.

∙\bullet\ Assume [−1→−2]∈D(β)[-1\to-2]\in D(\beta). We have β=β′​T1\beta=\beta^{\prime}T_{1} for some β′∈G2\beta^{\prime}\in G_{2} by Lemma 8.2.4. Since β∈D2\beta\in D_{2}, we have β′∈D2⊂A2\beta^{\prime}\in D_{2}\subset A_{2}. We deduce that β′∈E2\beta^{\prime}\in E_{2}, hence T1​β′∈E2⊂C2T_{1}\beta^{\prime}\in E_{2}\subset C_{2} (Corollary 8.2.13). So, σTi=α∗(β′T1)∗γ∼′α∗(T1β′)∗γ=Tiσ\sigma T_{i}=\alpha\ast(\beta^{\prime}T_{1})\ast\gamma\sim^{\prime}\alpha\ast(T_{1}\beta^{\prime})\ast\gamma=T_{i}\sigma.

∙\bullet\ Assume now [−1→−2]∉D(β)[-1\to-2]{\not\in}D(\beta), i.e., β∈E2\beta\in E_{2}. We have T1​β,β​T1∈D2⊂A2T_{1}\beta,\beta T_{1}\in D_{2}\subset A_{2} and T1​β⊂E2⊂C2T_{1}\beta\subset E_{2}\subset C_{2} (Corollary 8.2.13).

⋄\ \ \diamond\ Assume T1​β=0T_{1}\beta=0. There is β′′∈G2\beta^{\prime\prime}\in G_{2} such that β=T1​β′′\beta=T_{1}\beta^{\prime\prime} (Lemma 8.2.4). Since β∈E2∩D2\beta\in E_{2}\cap D_{2}, we have β′′∈E2∩D2⊂C2\beta^{\prime\prime}\in E_{2}\cap D_{2}\subset C_{2}, hence also β′′∈F2\beta^{\prime\prime}\in F_{2}. As a consequence, β′′​T1∈F2⊂C2\beta^{\prime\prime}T_{1}\in F_{2}\subset C_{2}. We deduce that α∗β∼′α∗(β′′T1)\alpha\ast\beta\sim^{\prime}\alpha\ast(\beta^{\prime\prime}T_{1}). We have L(α|β((−2,−1)))≠∅L(\alpha_{|\beta((-2,-1))})\neq\emptyset and L((β′′T1)|(−2,−1))≠∅L((\beta^{\prime\prime}T_{1})_{|(-2,-1)})\neq\emptyset, hence (α∗(β′′T1))|(−2,−1)=0(\alpha\ast(\beta^{\prime\prime}T_{1}))_{|(-2,-1)}=0 and α∗(β′′​T1)=0\alpha\ast(\beta^{\prime\prime}T_{1})=0. We have σTi=α∗(T1β′′)∗γ∼′α∗(β′′T1)∗γ=0\sigma T_{i}=\alpha\ast(T_{1}\beta^{\prime\prime})\ast\gamma\sim^{\prime}\alpha\ast(\beta^{\prime\prime}T_{1})\ast\gamma=0. Since Ti​σ​Ti=0T_{i}\sigma T_{i}=0 and σ​Ti≠0\sigma T_{i}\neq 0, it follows that L((σTi)|(σTi)−1({i,i+1}))≠∅L((\sigma T_{i})_{|(\sigma T_{i})^{-1}(\{i,i+1\})})\neq\emptyset, by applying Lemma 8.2.4 to ZoppZ^{{\operatorname{opp}\nolimits}}. Since σ​Ti∈An\sigma T_{i}\in A_{n}, we deduce that L(σ|σ−1({i,i+1}))≠∅L(\sigma_{|\sigma^{-1}(\{i,i+1\})})\neq\emptyset, hence Tiσ=0∼′σTiT_{i}\sigma=0\sim^{\prime}\sigma T_{i} (using Lemma 8.2.4 for ZoppZ^{{\operatorname{opp}\nolimits}} again).

⋄\ \ \diamond\ Assume now T1​β≠0T_{1}\beta\neq 0. It follows that β∈F2\beta\in F_{2}, hence β​T1∈F2⊂C2\beta T_{1}\in F_{2}\subset C_{2}.

There are α1,…,αi−1∈C1\alpha^{1},\ldots,\alpha^{i-1}\in C_{1} with α=αi−1∗⋯∗α1\alpha=\alpha^{i-1}\ast\cdots\ast\alpha^{1}. Let si=β⁡(−i)s_{i}=\beta(-i) for i∈{1,2}i\in\{1,2\}. Consider j≥1j\geq 1 minimal such that L((αj∗⋯∗α1)|{s1,s2})≠∅L((\alpha^{j}\ast\cdots\ast\alpha^{1})_{|\{s_{1},s_{2}\}})\neq\emptyset.

Define u′=αj⊠([l→l+1])1≤l≤j+1u^{\prime}=\alpha^{j}\boxtimes([l\to l+1])_{1\leq l\leq j+1} and u′′=(αj−1∗⋯α1∗β)⊠[−j−2→−1]u^{\prime\prime}=(\alpha^{j-1}\ast\cdots\alpha^{1}\ast\beta)\boxtimes[-j-2\to-1].

Let ζ=u−2′′∘[−1→−2]∘(u−1′′)−1\zeta=u^{\prime\prime}_{-2}\circ[-1\to-2]\circ(u^{\prime\prime}_{-1})^{-1}. Define II and JJ to be the domain and codomain of u′′u^{\prime\prime}, intersected with MM. Note that ζ⁡(0),ζ⁡(1)∈M\zeta(0),\zeta(1)\in M. Let v′=(u′)ζ=(αj)ζ⊠([l→l+1])1≤l≤j+1v^{\prime}=(u^{\prime})^{\zeta}=(\alpha^{j})^{\zeta}\boxtimes([l\to l+1])_{1\leq l\leq j+1} and define v′′:I⊔(−j−2,−1)→J⊔(1,2)⊔{−1}⊔(1,j+1)v^{\prime\prime}:I\sqcup(-j-2,-1)\to J\sqcup(1,2)\sqcup\{-1\}\sqcup(1,j+1) by

vs′′={u′′−2∘[−1→−2] if ​s=−1u′′−1∘[−2→−1] if ​s=−2us′′ otherwise.v^{\prime\prime}_{s}=\begin{cases}u^{\prime\prime}_{-2}\circ[-1\to-2]&\text{ if }s=-1\\ u^{\prime\prime}_{-1}\circ[-2\to-1]&\text{ if }s=-2\\ u^{\prime\prime}_{s}&\text{ otherwise.}\end{cases}

Lemma 7.4.35 shows that v′v^{\prime} and v′′v^{\prime\prime} are braids and αj∗⋯∗α1∗β=u′⋅u′′=v′⋅v′′\alpha^{j}\ast\cdots\ast\alpha^{1}\ast\beta=u^{\prime}\cdot u^{\prime\prime}=v^{\prime}\cdot v^{\prime\prime}. We have v′′=(αj−1∗⋯α1∗(βT1))⊠[−j−2↦−1]v^{\prime\prime}=(\alpha^{j-1}\ast\cdots\alpha^{1}\ast(\beta T_{1}))\boxtimes[-j-2\mapsto-1] and we deduce that α∗β=α′∗(β​T1)\alpha\ast\beta=\alpha^{\prime}\ast(\beta T_{1}), where α′=αi−1∗⋯∗αj+1∗(αj)ζ∗αj−1⋯∗α1∈Ci−1\alpha^{\prime}=\alpha^{i-1}\ast\cdots\ast\alpha^{j+1}\ast(\alpha^{j})^{\zeta}\ast\alpha^{j-1}\cdots\ast\alpha^{1}\in C_{i-1}. We have σTi=α′∗(βT1)∗γ∼′α′∗(T1β)∗γ=Tiσ\sigma T_{i}=\alpha^{\prime}\ast(\beta T_{1})\ast\gamma\sim^{\prime}\alpha^{\prime}\ast(T_{1}\beta)\ast\gamma=T_{i}\sigma. This completes the proof of the first statement of the lemma.

The second statement of the lemma follows from the first one applied to ZoppZ^{\operatorname{opp}\nolimits} thanks to Remark 8.2.6. ∎

0PDJ

Proposition 8.2.15. Let α,β∈Cn\alpha,\beta\in C_{n}. We have α∼′β\alpha\sim^{\prime}\beta if and only if α∼β\alpha\sim\beta.

0PDK

Proof. It is clear that α∼′β\alpha\sim^{\prime}\beta implies α∼β\alpha\sim\beta. The converse follows from Lemma 8.2.14. ∎

0PDL

Corollary 8.2.16. We have C/∼′=G/∼C/\!\sim^{\prime}\ =G/\!\sim.

0PDM

Proof. The surjectivity of C/∼′→G/∼C/\!\sim^{\prime}\ \to G/\!\sim\ is given by Lemma 8.2.10. The injectivity follows from Lemmas 8.2.12 and 8.2.15. ∎

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

Andrew Manion, Raphael Rouquier

Original source: arXiv:2009.09627v2