Deligne’s construction for extending connections.

In this post I will discuss a construction, due to Deligne, for extending a flat vector bundle to a flat logarithmic vector bundle. The setting of the construction is as follows: let  X be a smooth complex manifold, and let Y \subseteq X be a divisor (i.e. a codimension 1 subvariety). Then given a branch of the logarithm \tau (it is in fact sufficient to choose a ‘set theoretical’ logarithm) Deligne’s construction gives a canonical way of extending a flat holomorphic vector bundle on the complement of Y to a holomorphic vector bundle on X with a flat logarithmic connection having poles along Y:

Theorem. Let (F,\nabla) be a holomorphic vector bundle with flat connection on X \setminus Y. There exists a unique extension (G,\tilde{\nabla}) to all of X such that \tilde{\nabla} has logarithmic singularities along Y \subseteq X and the eigenvalues of the residue of \tilde{\nabla} lie in the image of \tau .

Continue reading “Deligne’s construction for extending connections.”

Advertisements

Matrix Logarithms

Consider the exponential map for matrices {\exp : \text{End}(\mathbb{C}^{m}) \rightarrow \text{Gl}(m, \mathbb{C})}, which can be defined by the formula

\displaystyle e^{x} = \sum_{k = 0}^{\infty} \frac{(2 \pi i)^k}{k!} x^{k},

where {x} is a square matrix. A matrix logarithm is defined to be a right-inverse to the exponential; that is to say, it is a function {\log: \text{Gl}(m, \mathbb{C}) \rightarrow \text{End}(\mathbb{C}^{m})} such that {\exp \circ \log = \text{id}_{ \text{Gl}(m, \mathbb{C})}}. It is a standard result of Lie theory that the exponential is a diffeomorphism in a neighbourhood of {0} in {\text{End}(\mathbb{C}^{m})}, and hence there is a well-defined choice of logarithm in a neighbourhood of the identity in {\text{Gl}(m, \mathbb{C})}. However, it is not at all clear that a logarithm can be globally defined, or that there is a unique way of doing so. This problem also shows up in the more simple case of the exponential for complex numbers. Indeed, there are several choices for the complex logarithm, and none of them are analytic (or even continuous) on all of {\mathbb{C}^{\times}}. However, it turns out that choosing a complex logarithm is enough to determine a unique choice of a matrix logarithm in any dimension. More precisely, we have the following:

Theorem. Consider the exponential sequence for complex numbers

\displaystyle 0 \rightarrow \mathbb{Z} \rightarrow \mathbb{C} \mathop{\rightarrow}^{\exp} \mathbb{C}^{\times} \rightarrow 0,

and let {\tau : \mathbb{C}^{\times} \rightarrow \mathbb{C}} be a set-theoretical splitting of this sequence, in other words, a (not-necessarily continuous) branch of the complex logarithm. Then for any positive integer {m}, there is a uniquely defined matrix logarithm

\displaystyle \log: \text{Gl}(m, \mathbb{C}) \rightarrow \text{End}(\mathbb{C}^{m})

such that for every {x \in \text{Gl}(m, \mathbb{C})} the eigenvalues of {\log(x)} lie in the image of {\tau.}

Continue reading “Matrix Logarithms”