The two-stage kernel data for upper-coordinate images
Fix a finite-generator Coxeter system, a simple reflection \(s\), a tail word \(\mathbf t\), and \(U\subseteq W\). Put \[ J=U\cup sU,\qquad K=U\cap sU,\qquad M'=L_{s\mathbf t}(U). \] Write \(L=L_{\mathbf t}\) and \(L'=L_{s\mathbf t}\) for the two image families.
The two-stage argument uses \[ r:M'\to L'(K),\qquad F_U:M'\to L(U),\qquad k:L(U)\to L(K), \] where \(r,k\) are coordinate restrictions and \(F_U\) is the first image tail map.
Restriction commutes with this first map: \[ kF_U=F_Kr. \] Hence \(F_U\) sends \(\ker r\) into \(\ker k\).
The common kernel
Define \[ D=\ker r\cap\ker F_U\subseteq M'. \] Thus \(z\in D\) has zero new-word coordinates on \(K\), and its first tail image vanishes throughout \(U\). This is bottCommonKernel.
The second image tail map restricts to \[ \gamma:D\to{}^\tau L(sU),\qquad \gamma(z)=G_U(z). \] It is injective: if two elements have the same second image, their first images are both zero, and joint injectivity of \(F_U,G_U\) makes the elements equal. This is bottCommonSecond.
The old union-restriction kernel
Define \[ T=\ker\bigl(r_{J,U}:L(J)\to L(U)\bigr). \] Its vectors are old image assignments on \(J\) vanishing on \(U\). Restriction to the other part gives \[ j:T\to L(sU). \] This is bottUnionKernelSecond. It is injective because an assignment on \(J=U\cup sU\) is determined by these two restrictions, and its restriction to \(U\) is already zero.
Twisting gives another injective map \[ {}^\tau j:{}^\tau T\to{}^\tau L(sU). \] The common-kernel theorem proves that \(\gamma\) and \({}^\tau j\) have the same image when \(U\) is upper and the shorter word has compatible-tuple lifting. This identifies \(D\) with the twisted old kernel.
The two successive sequences
Once \(F_U:\ker r\to\ker k\) is shown surjective, the two sequences are \[ 0\to D\to\ker r\to\ker k\to0, \qquad 0\to\ker r\to M'\xrightarrow{r}L'(K)\to0. \] They organize the projectivity proof: the first controls \(\ker r\), and the second controls the new image \(M'\).
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.TitsSpace.bottInterRestriction: IntegralPairings.lean:1086.
OAI.KLInvariance.TitsSpace.bottUnionRestriction: IntegralPairings.lean:1090.
OAI.KLInvariance.TitsSpace.bottUnionPullRestriction: IntegralPairings.lean:1094.
OAI.KLInvariance.TitsSpace.bottCommonKernel: IntegralPairings.lean:1099.
OAI.KLInvariance.TitsSpace.bottCommonSecond: IntegralPairings.lean:1103.
OAI.KLInvariance.TitsSpace.bottCommonSecond_injective: IntegralPairings.lean:1108.
OAI.KLInvariance.TitsSpace.bottUnionKernelSecond: IntegralPairings.lean:1112.
OAI.KLInvariance.TitsSpace.bottUnionKernelSecond_injective: IntegralPairings.lean:1117.
OAI.KLInvariance.TitsSpace.bottInter_first_zero: IntegralPairings.lean:1373.