ScalingStacks

0PBP

Proof. We prove the lemma by induction on |θ||\theta|. Assume there is a set I′I^{\prime} satisfying the assumptions of Lemma 7.4.26 and such that μ⁡(u)=0\mu(u)=0. By induction, there is a decomposition θu=r′​(θu)⋅r⁡(θu)\theta^{u}=r^{\prime}(\theta^{u})\cdot r(\theta^{u}) as in the lemma. Now r⁡(θ)=r⁡(θu)⋅ur(\theta)=r(\theta^{u})\cdot u and r′​(θ)=r′​(θu)r^{\prime}(\theta)=r^{\prime}(\theta^{u}) satisfy the requirements of the lemma.

Assume now that given any set I′I^{\prime} satisfying the assumptions of Lemma 7.4.26, we have μ⁡(u)≥1\mu(u)\geq 1.

Let s∈Is\in I with μ⁡(θs)≥1\mu(\theta_{s})\geq 1 such that given s′∈Is^{\prime}\in I with μ⁡(θs′)≥1\mu(\theta_{s^{\prime}})\geq 1, we have supp⁡(θsr)⊂supp⁡(θs′r)\mathrm{supp}(\theta_{s}^{r})\subset\mathrm{supp}(\theta_{s^{\prime}}^{r}). Given s′∈I∖{s}s^{\prime}\in I\setminus\{s\}, we have μ⁡(αs′)=0\mu(\alpha^{s^{\prime}})=0 (notations of §7.4.5).

Let I′I^{\prime} be the set of s′∈Is^{\prime}\in I such that there is a sequence s0=s,s1,…,sr=s′s_{0}=s,s_{1},\ldots,s_{r}=s^{\prime} of elements of II such that si→si+1s_{i}\to s_{i+1} is an arrow of Γ⁡(θ)\Gamma(\theta) for 0≤i<r0\leq i<r. Assume there exist s1,…,sds_{1},\ldots,s_{d} in I′∖{s0}I^{\prime}\setminus\{s_{0}\} such that sd=s1s_{d}=s_{1} and si→si+1s_{i}\to s_{i+1} is an arrow of Γ⁡(θ)\Gamma(\theta) for 1≤i<d1\leq i<d. Then I′′={s1,…,sd}I^{\prime\prime}=\{s_{1},\ldots,s_{d}\} satisfies the assumptions of Lemma 7.4.26. On the other hand, we have μ⁡(αs′)=0\mu(\alpha^{s^{\prime}})=0 for s′∈I′′s^{\prime}\in I^{\prime\prime}, hence we get a contradiction. It follows that I′I^{\prime} is a cycle or a line and it satisfies the assumptions of Lemma 7.4.26. The braids r′​(θ)=θur^{\prime}(\theta)=\theta^{u} and r⁡(θ)=ur(\theta)=u of Lemma 7.4.26 satisfy the requirements of the lemma. ∎

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

Andrew Manion, Raphael Rouquier

Original source: arXiv:2009.09627v2