ScalingStacks

Example 3.2 . [02ZB]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Example 3.2.

Let Δ⊆ℝ4\Delta\subseteq\mathbb{R}^{4} be the convex hull of the points

(−1,−1,−1,−1),\displaystyle(-1,-1,-1,-1),
(4,−1,−1,−1),\displaystyle(4,-1,-1,-1),
(−1,4,−1,−1),\displaystyle(-1,4,-1,-1),
(−1,−1,4,−1),\displaystyle(-1,-1,4,-1),
(−1,−1,−1,4).\displaystyle(-1,-1,-1,4).

Choose a triangulation 𝒫\mathscr{P} of B=∂ΔB=\partial\Delta into standard simplices; this can be done in a regular way so that the restriction of 𝒫\mathscr{P} to each two-dimensional face of Δ\Delta is as given by the light lines in Figure 1. This gives a discriminant locus Γ\Gamma depicted by the dark lines in the figure; the line segments coming out of the boundary of the two-face are meant to illustrate the pieces of discriminant locus contained in adjacent two-faces. The discriminant locus there is not contained in the plane of the two-face. In particular, the discriminant locus is not planar at the vertices of Γ\Gamma on the edges of Ξ\Xi with respect to the affine structure we define. Note Γ\Gamma is a trivalent graph, with two types of trivalent vertices, the non-planar ones just mentioned and the planar vertices contained in the interior of two-faces.

Refer to caption
Figure 1.

For an affine manifold, the monodromy of the local system Λ\Lambda is an important feature of the affine structure. In this example, it is very useful to analyze this monodromy around loops about the discriminant locus. If vv is a vertex of Γ\Gamma contained in the interior of a two-face of Δ\Delta, one can consider loops based near vv in B0B_{0} around the three line segments of Γ\Gamma adjacent to vv. It is an enjoyable exercise to calculate that these monodromy matrices take the form, in a suitable basis,

T1=(100110001),T2=(100010101),T3=(100−110−101).T_{1}=\begin{pmatrix}1&0&0\\ 1&1&0\\ 0&0&1\end{pmatrix},T_{2}=\begin{pmatrix}1&0&0\\ 0&1&0\\ 1&0&1\end{pmatrix},T_{3}=\begin{pmatrix}1&0&0\\ -1&1&0\\ -1&0&1\end{pmatrix}.

They are computed by studying the composition of transition maps between charts that a loop passes through. These matrices can be viewed as specifying the obstruction to extending the affine structure across a neighbourhood of vv in Γ\Gamma. Of course, the monodromy of Λˇ\check{\Lambda} is the transpose inverse of these matrices. Similarly, if vv is a vertex of Γ\Gamma contained in an edge of Δ\Delta, then the monodromy will take the form

T1=(1−10010001),T2=(10−1010001),T3=(111010001).T_{1}=\begin{pmatrix}1&-1&0\\ 0&1&0\\ 0&0&1\end{pmatrix},T_{2}=\begin{pmatrix}1&0&-1\\ 0&1&0\\ 0&0&1\end{pmatrix},T_{3}=\begin{pmatrix}1&1&1\\ 0&1&0\\ 0&0&1\end{pmatrix}.

So we see that the monodromy of the two types of vertices are interchanged between Λ\Lambda and Λˇ\check{\Lambda}.

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.