Jordan Decomposition for Formal G-Connections
Masoud Kamgarpour, Samuel Weatherhog

TL;DR
This paper provides straightforward proofs of the Jordan decomposition theorem for formal G-connections, extending classical results to the context of semisimple groups and emphasizing the analogy with linear algebra.
Contribution
It offers simplified proofs of the Hukuhara-Levelt-Turrittin theorem and its generalization to formal G-connections, clarifying the conceptual parallels with linear algebra.
Findings
Proofs of Jordan decomposition for formal G-connections
Extension of classical theorems to semisimple group context
Enhanced understanding of the analogy between linear and differential settings
Abstract
A theorem of Hukuhara, Levelt, and Turrittin states that every formal differential operator has a Jordan decomposition. This theorem was generalised by Babbit and Varadarajan to the case of formal -connections where is a semisimple group. In this paper, we provide straightforward proofs of these facts, highlighting the analogy between the linear and differential settings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Algebraic structures and combinatorial models · Algebraic Geometry and Number Theory
\DefineSimpleKey
bibmyurl
Jordan decomposition for formal -connections
Masoud Kamgarpour and Samuel Weatherhog
School of Mathematics and Physics, The University of Queensland, St. Lucia, Queensland, Australia
Abstract.
A theorem of Hukuhara, Levelt, and Turrittin states that every formal differential operator has a Jordan decomposition. This theorem was generalised by Babbit and Varadarajan to the case of formal -connections where is a semisimple group. In this paper, we provide straightforward proofs of these facts, highlighting the analogy between the linear and differential settings.
Key words and phrases:
Meromorphic ordinary differential equations, formal differential operators, Hukuhara-Levelt-Turrittin Theorem, Differential polynomials, Differential Hensel’s Lemma, Newton polygons, formal -connections, canonical form, Babbit-Varadarajan Theorem
2010 Mathematics Subject Classification:
13N10
Contents
- 1 Introduction
- 2 Factorisation of differential polynomials
- 3 Formal differential operators
- 4 Formal -connections
1. Introduction
Let be the field of formal Laurent series and consider the derivation defined by . Let be a finite dimensional vector space over . A formal differential operator is a -linear map satisfying the Leibniz rule
[TABLE]
It is well-known that linear operators encode linear equations. Similarly, differential operators encode (ordinary) differential equations. Thus, the study of formal differential operators is indispensable in the theory of meromorphic differential equations; see [Varadarajan] for an extensive review.
In analogy with linear operators, differential operators have matrix presentations and it will be convenient to have these at our disposal. Indeed, choosing a basis for , we can represent as an operator where is an matrix with values in . Changing the basis by an element amounts to changing the operator to . Here denotes the matrix obtained by applying the derivation to each entry of the matrix . The map
[TABLE]
is called gauge transformation and plays an important role in the theory.
1.1. Semisimple Connections
To formulate a Jordan decomposition, we need a notion of semisimplicity. We start with a definition for formal differential operators.
Definition 1**.**
Let be a formal differential operator. Then is
- (i)
simple* if has no -invariant subspace* 2. (ii)
semisimple* if every -invariant subspace has a -invariant complement* 3. (iii)
diagonalisable* if it has a presentation of the form where is a diagonal matrix* 4. (iv)
potentially diagonalisable* if it is diagonalisable after a finite base change.*
It is easy to show that an operator is semisimple if and only if it is a direct sum of simple ones. The following theorem gives an explicit description of semisimple operators.
Theorem 2** (Levelt).**
A formal differential operator is semisimple if and only if it is potentially diagonalisable.
For future use, we will need the following functorial property. Let be a differential operator and write with . Consider the adjoint map
[TABLE]
Then is a linear operator on ; therefore, is a differential operator on . The following observation will be useful.
Proposition 3**.**
The differential operator is semisimple if and only if the differential operator is semisimple.
1.2. Jordan Decomposition
We are now ready to discuss the notion of Jordan decomposition.
Theorem 4** (Hukuhara-Levelt-Turrittin).**
Every formal differential operator can be written as a sum of a semisimple differential operator together with a nilpotent -linear operator such that and commute (as -linear maps). Moreover, the pair is unique.
The above theorem has numerous applications in the theory of differential operators and other areas of mathematics, cf. [KatzNilpotent, Katz, Luu, BoalchYamakawa, KamgarpourSage]. The existence result was first proved by Turrittin [Turrittin], building on earlier work of Hukuhara [Hukuhara]. Turrittin’s argument was rather complicated involving nine different cases. Subsequently, Levelt gave a more conceptual (albeit still not straightforward) proof and formulated the correct uniqueness statement [Levelt]. As a corollary, he concluded:
Corollary 5**.**
Every formal differential operator has, after an appropriate finite base change, an eigenvalue.
Levelt asked for a direct proof of this corollary, noting that this would considerably simplify the proofs of the above theorems. Subsequently, several authors provided alternative approaches to these theorems cf. [Wasow, Malgrange, Robba, BV, Praagman, SingerVanDerPut, Kedlaya]. One of our main goals is to provide an elementary proof of the fact that every differential operator has an eigenvalue and use it to provide a simple proof of the existence of Jordan decomposition, thus fulfilling Levelt’s vision.
We now provide a brief summary of our approach. Let denote the non-commutative ring of differential polynomials. As an abelian group but multiplication is modified by the rule for all . Using a version of Hensel’s lemma and Newton polygons, we prove:
Theorem 6**.**
Every non-constant differential polynomial in has a linear factorisation over a finite extension of .
The above result is established in §2. Note that Malgrange [Malgrange] and Robba [Robba] also use Newton polygons and differential Hensel’s lemma in their treatment of the Hukuhara-Levelt-Turrittin Theorem; however, our formulation and proof of Jordan decomposition is different from theirs; for instance, we do not use the cyclic vector lemma.111For the advantages and disadvantages of the cyclic vector lemma, cf. [Kedlaya, §5.7].
In §3, we show that Theorem 2 and Corollary 5 follow easily from Theorem 6, thus illustrating the analogies between linear and differential setting. Using these results, we obtain a generalised eigenspace decomposition for differential operators. In other words, we obtain that every differential operator has a representation where is a block-upper triangular matrix and each block has a unique (up to similarity) eigenvalue. At this point, we encounter a subtle difference between the linear and differential setting. Let us write where is diagonal and is strictly upper triangular. If we were considering linear operators, then would be the semisimple and the nilpotent part of and these two commute. In the differential setting, however, the situation is more subtle because the operators and do not necessarily commute. In fact, these two operators commute if and only if the entries of are complex numbers (i.e. have no powers of ). We prove that indeed we can arrange so that the entries of are complex numbers by using Katz’s classification of unipotent differential operators [Katz].
1.3. Formal -connections
The above considerations have a natural generalisation to the setting of algebraic groups. Let be a connected, semisimple, linear algebraic group over and let denote its Lie algebra. A formal -connection is an expression of the form
[TABLE]
The group acts on the space of connections by gauge transformation
[TABLE]
One way to make sense of the expression is to choose a faithful representation (e.g. the adjoint representation) and show that , a priori in , actually belongs to , and is independent of the chosen representation; see [BV]§1.6, [frenkel]§1.2.4, [raskin]*§1.12.
1.3.1. Semisimple -connections
To discuss Jordan decomposition, we first need a notion of semisimplicity for formal -connections. Proposition 3 allows us to define such a notion:
Definition 7**.**
A -connection , , is called semisimple if is semisimple (as a formal -connection).
The above is analogous to the definition of ad-semisimplicity for elements in a semisimple Lie algebra, cf. [humphreys]*§5.4. Next, let be a maximal (complex) torus and the corresponding Cartan subalgebra. We then have an analogue of Theorem 2:
Theorem 8**.**
A -connection is semisimple if and only if, after a finite base change , is gauge equivalent to a connection of the form where .
As far as we know this is the first time the above natural theorem has been formulated in the literature. We use properties of the differential Galois group to establish the above theorem; see §4.
1.3.2. Jordan decomposition
We are ready to state Jordan decomposition for formal -connections.
Theorem 9** (Jordan decomposition).**
Every -connection can be written as a sum , where is a semisimple -connection, is a nilpotent element and and commute. Moreover, the pair is unique.
When we say and commute, we mean they commute as elements of the extended loop algebra , where the bracket is defined by
[TABLE]
with .
Following a suggestion of Deligne, Babbit and Varadarajan proved an equivalent form of the above theorem in [BV]. Their proof, which uses intrinsic properties of algebraic groups, is the only proof of this fundamental result available in the literature. In this note, we give an alternative proof which uses the adjoint representation and reduces the problem to the -case. Our approach is thus similar to the standard proofs of (usual) Jordan decomposition for semisimple Lie algebras, cf. [humphreys]. We refer the reader to §4 for details.
1.4. Acknowledgment
We thank Philip Boalch, Peter McNamara, Daniel Sage, Ole Warnaar, and Sinead Wilson for helpful conversations. We are grateful to Claude Sabbah for sending copies of [Malgrange] and [Sabbah]. The material in this paper forms a part of SW’s Master’s Thesis. MK was supported by an ARC DECRA Fellowship.
2. Factorisation of differential polynomials
The goal of this section is to prove Theorem 6. This theorem should be thought of as a differential analogue of a classical theorem of Puiseux. As in Section 1, we consider the differential field with derivation . An important implication of Puiseux’s theorem is that for every positive integer , is the unique extension of of degree . The derivation extends canonically to a derivation on .
Let be a -algebra and a derivation. We denote by the ring of differential polynomials over . We will generally be interested in the cases and with derivation of the form , for some positive integer . According to [Ore], the ring is a left and right principal ideal domain.
2.1. Differential Hensel’s Lemma
Let be a differential polynomial. We write for the polynomial obtained by first moving all factors of to the left and then reducing the coefficients modulo . We denote by . Note that this is a polynomial in . Without loss of generality, we assume throughout that .
Now suppose we have a factorisation of the form
[TABLE]
Our aim is to lift this to a factorisation of in . We think of the following result as a differential analogue of Hensel’s lemma.
Proposition 10**.**
Let and as above. Suppose that
[TABLE]
Then we have a factorisation with , , and .
We note that a version of this proposition appeared in [Praagman]*Lemma 1.
Proof.
First of all, in the differential polynomial ring , easy induction arguments show that
[TABLE]
and
[TABLE]
for some constants , .
Our goal is to inductively build a sequence of polynomials
[TABLE]
which satisfy:
[TABLE]
If we can do this, then by letting we will obtain elements such that .
Suppose that we know the and for . In view of (4) and (5) we have:
[TABLE]
Requiring that then gives us the following condition:
[TABLE]
We need to shift the powers of to the left. By (2), , so we have:
[TABLE]
and thus
[TABLE]
For notational convenience, we set:
[TABLE]
so that we have
[TABLE]
Now if , then (6) reduces to
[TABLE]
Since is a Euclidean domain, we will be able to solve this for and provided that and are coprime. On the other hand, if , then (6) becomes
[TABLE]
In this case, we will only be able to generate the entire sequence if and are coprime for all .
All that remains to show is that we can control the degree of the ’s. We will show this in the case . The proof in the case is similar (replace with everywhere). Since and are coprime, we can find such that
[TABLE]
Multiplying through by yields
[TABLE]
Using the division algorithm we can find unique and such that . Write:
[TABLE]
with . Equation (7) then becomes:
[TABLE]
Setting and gives us the required and . ∎
Corollary 11**.**
Let be a monic differential polynomial. Then admits a factorisation of the form
[TABLE]
with and .
Proof.
Let be the reduction of mod . Since is monic, is non-constant and hence factors over into linear factors:
[TABLE]
Without loss of generality, we can order these factors so that . With this ordering we then have
[TABLE]
where
[TABLE]
By our choice of ordering, has no common factor with for all . Hence we can apply Proposition 10 to obtain a factorisation of the form
[TABLE]
as required. ∎
Remark 12*.*
Note that the above result is false for the usual polynomial ring . Indeed, does not have a linear factorisation over this ring, but if we consider it as an element of , then .
2.2. From power series to Laurent series via Newton polygons
In the previous section, we settled linear factorisation for differential polynomials in . In this section, we explain how, by a change of variable, we can transform polynomials with coefficients in to those with power series coefficients. The price is that we have to go to a finite extension of and, more seriously, the derivation is not simply the canonical extension of to . Nevertheless, we shall see that this change of variable allows us to factor elements of . Throughout we let denote the -adic valuation on .
Lemma 13**.**
Consider the monic differential polynomial . Let r:=\min\big{\{}\frac{v_{t}(a_{i})}{i}\big{\}}. Then is a monic differential polynomial with power series coefficients.
Proof.
To be more precise, write with and . If , then each and so . Since we have already dealt with this case in Corollary 11, we may assume that . In order to make the change of variables , we require a field extension to . Let so that our change of variables becomes . Note that this change of variables means that the relation becomes . Hence differential polynomials in lie in the ring (note this new derivation sends to ).
Applying (3) to yields where
[TABLE]
Let denote the -adic valuation on . Since , implies that . Thus, for , the coefficient, , of in satisfies
[TABLE]
where the last equality follows since .
It is clear that will be [math] exactly when , that is, if, and only if, . For the “constant” term of we have
[TABLE]
again with equality exactly when . Thus
[TABLE]
with . Furthermore, if, and only if, . This shows that . ∎
Consider from the above lemma. If has two distinct roots, then Hensel’s lemma allows us to factor it. We now study the opposite extreme, i.e., when all roots of are equal. It will be helpful to use the notion of Newton polygons for differential polynomials, cf. [Kedlaya, §6.4]. Throughout the rest of this section, we will assume that , unless explicitly stated otherwise.
Definition 14** (Newton Polygon).**
Let be a differential polynomial and write
[TABLE]
Consider the lower boundary of the convex hull of the points
[TABLE]
The Newton polygon of , denoted , is obtained from this boundary by replacing all line segments of slope less than with a single line segment of slope exactly .
Lemma 13 now has the following corollary.
Corollary 15**.**
Let and be as in Lemma 13 and suppose that , . Then is non-zero and the Newton polygon of has a single integral slope.
Proof.
As in Lemma 13, write
[TABLE]
Since , . Now since, , expanding the bracket shows that for all and hence . Thus, the Newton polygon of has a single slope of and since , is an integer. ∎
For future use, we also record the following lemma.
Lemma 16**.**
Let and be as in Lemma 13 and suppose that , . Then the slopes of the Newton polygon of are all strictly smaller than the slope of the Newton polygon of .
Proof.
By Corollary 15, is an integer and hence no extension of is necessary. Since , we can write as
[TABLE]
with for all . Now
[TABLE]
and hence
[TABLE]
Applying (3), we have, for ,
[TABLE]
Since , the valuation of the coefficient of in is strictly greater than the corresponding coefficient in . This means that the slopes of the Newton polygon for are strictly less than the slope of the Newton polygon for . ∎
Example 17*.*
In order to illustrate Corollary 15 and Lemma 16, consider the differential polynomial
[TABLE]
In this case, and the change of variables yields
[TABLE]
and so . The figure below shows that the Newton polygon of has only a single slope of (cf. Cor 15). Making the translation as in Lemma 16 yields the new polynomial
[TABLE]
This has a single slope and a final translation yields . This can easily be factorised and reversing the change of variables yields the full factorisation .
[TABLE]
2.3. Proof of Theorem 6
Write and let r:=\min\big{\{}\frac{v_{t}(a_{i})}{i}\big{\}}\in\mathbb{Q}. If , then the result follows from the differential Hensel’s Lemma (see Corollary 11) so we may assume . Let us write
[TABLE]
Consider the transformation . Under this transformation the differential field changes to \big{(}\mathcal{K}_{q},\frac{1}{q}s^{1-p}\frac{d}{ds}\big{)} where . Moreover, we obtain a monic differential polynomial . Let denote the reduction of modulo the maximal ideal of . If has two distinct roots, then we can again apply Proposition 10 to reduce the problem to a polynomial of degree strictly less than . Thus, we are reduced to the case that has a unique repeated root . For inductive purposes, we rename to . In this case, by Corollary 15, and the Newton polygon of has a single integral slope. Now we make the transformation . As shown in Lemma 16, under this transformation is mapped to a polynomial whose Newton polygon has slopes strictly less than that of . Note that this transformation does not change the differential field.
Now we start the process with the polynomial ; i.e., we let r_{2}:=\min\big{\{}\frac{v(b_{i})}{i}\big{\}}. If we are done. Otherwise, we make the change of variable to obtain a new polynomial . If has distinct roots, then we are done; otherwise, applying Corollary 15 again, we conclude that the Newton polygon of has a single integral slope. Since the slope of is a nonnegative integer strictly less than slope of , this process must stop in finitely many steps at which point we have a factorisation of our polynomial.
∎
3. Formal differential operators
Recall that for each positive integer , denotes the unique finite extension of of degree . Given a differential operator , one has a canonical differential operator
[TABLE]
called the base change of to . All base changes considered in this article are of this form. Henceforth, we will use the notation and .
3.1. Proof of Corollary 5 (Every differential operator has an eigenvalue)
The argument proceeds exactly as in the linear setting. Let be a differential operator and be a non-zero vector. Consider the sequence . As has finite dimension over , we must have that
[TABLE]
where . Now consider the polynomial in the twisted polynomial ring . After a finite extension, we can write
[TABLE]
Thus,
[TABLE]
Let be the largest number such that . If , then is an eigenvector of with eigenvalue . Otherwise is an eigenvector of with eigenvalue . ∎
3.2. Proof of Theorem 2 (Semisimple operators are diagonalisable)
We need the following lemma. The proof is an easy argument using the Galois group ; see [Levelt, §1(e)] for details.
Lemma 18**.**
* is semisimple if and only if is.*
Now we are ready to prove Theorem 2. Suppose is semisimple. We prove by induction on that, after an appropriate base change, it is diagonalisable. If the result is obvious, so assume . Without loss of generality, assume has an eigenvector (if not, do an appropriate base change; by the previous lemma, the operator remains semisimple). Let . Then is a one-dimensional, -invariant subspace222Indeed, if , , and then . of ; thus, there exists a -invariant complement . Now is semisimple so by our induction hypothesis (after an appropriate base change), we can write as a direct sum of one-dimensional subspaces. Thus, after an appropriate base change, we have a decomposition of our vector space into one-dimensional, invariant subspaces and so is diagonalisable.
Conversely, suppose is a diagonalisable operator. Then clearly is semisimple and thus, by Lemma 18, so is . ∎
3.3. Invariant Properties of Differential Operators
The goal of this section is to prove Proposition 3. To this end, we need to establish some properties of differential operators.
3.3.1. Invariant Subspaces
Lemma 19**.**
Let be a differential operator with Jordan decomposition . Suppose that is a -invariant subspace. Then is also -invariant.
Proof.
Note that decomposes into generalised eigenspaces and that these generalised eigenspaces are , and invariant [Levelt]*§4. Hence we need only consider the case where itself is a generalised eigenspace. In this case, there exists a finite extension, , of such that for some . We first prove the result in the case of unipotent differential operators (i.e. in the case ). As in Section 3.5, we denote by the category of unipotent differential operators. Recall this category is equivalent to the category whose objects are pairs where is a -vector space and is a nilpotent linear operator.
The restriction gives us a monomorphism in the category . Under the equivalence we obtain a monomorphism in . Hence, there is a basis of for which we can write . Since , in this basis we have . That is, is -invariant.
This result clearly extends to differential operators with a unique (up to similarity) eigenvalue.
For the general case, recall that after a finite extension to , we can write where is diagonalisable. Now is a -invariant subspace of and so by the above, is also -invariant. If were not -invariant, then would not be -invariant, hence must be -invariant. ∎
3.3.2. Adjoint differential operator
Let be a finite dimensional vector space over . Given a differential operator , we write for its Jordan decomposition. Note that is not necessarily a semisimple linear operator on ; rather, is a semisimple differential operator on .
Lemma 20**.**
Let be a differential operator, where . Then is the Jordan decomposition of .
Proof.
There exists a finite extension of such that we can pick a basis for to put in Jordan normal form. In this case, is diagonal and is a constant nilpotent matrix with ’s or [math]’s on the super-diagonal, and and commute. Thus, is a semisimple differential operator on . We claim that it commutes with . Indeed,
[TABLE]
where the bracket is for the extended Lie algebra . Now is constant, so the first bracket is zero. Since and commute, the second bracket is also zero. ∎
3.3.3. Proof of Proposition 3
If is semisimple, then we have seen that so is . If is not semisimple, then suppose is its Jordan decomposition. By assumption, . This implies that is not trivial. Thus, is not semisimple.
3.4. Generalised eigenspace decomposition
Let be a formal differential operator and let .
Definition 21**.**
The generalised eigenspace of is defined as
[TABLE]
The goal of this section is to prove the following theorem.
Theorem 22** (Generalised eigenspace decomposition).**
For some finite extension of there exists a canonical decomposition . Moreover,
[TABLE]
Before proving this theorem, we need to recall some facts about differential operators. Let be a differential operator. Define
[TABLE]
[TABLE]
Note that these are vector spaces over (not over ). The following proposition due to Malgrange [Malgrange2, Theorem 3.3] is an analogue of the rank-nullity theorem for formal differential operators.
Proposition 23**.**
Let be a formal differential operator. Then
[TABLE]
Next, recall that the dual differential operator is the operator on the vector space defined by
[TABLE]
Let and be differential operators. Then, we can define a differential operator on by
[TABLE]
The set of all of -linear maps from to is denoted . This is a -vector space. The Yoneda extension group consists of equivalence classes of extensions of -modules
[TABLE]
As usual, two extensions are equivalent if there exists a -linear isomorphism between them inducing the identity on and .
Proposition 24**.**
Let and be two formal differential operators. Then, we have
- (i)
. 2. (ii)
If no eigenvalue of is similar to an eigenvalue of , then .
Proof.
One can show (see [Kedlaya]*Lemma 5.3.3) that there is a canonical isomorphism of -vector spaces:
[TABLE]
This fact together with Proposition 23 implies (i).
The eigenvalues of are of the form where and are eigenvalues of and , respectively. By assumption, is never similar to zero; thus, kernel of is trivial. Part (ii) now follows from Part (i). ∎
Proof of Theorem 22.
We may assume, without the loss of generality, that all eigenvalues of are already in (if not, do an appropriate base change). We use induction on to prove the theorem. If then the claim is trivial. Suppose . Then by assumption has an eigenvector. Hence, we have a one-dimensional invariant subspace . Let . Then defines a differential operator on . Moreover, . By induction we may assume that decomposes as
[TABLE]
for non-similar . Now
[TABLE]
If the eigenvalue of is not similar to any then by the above proposition all the extension groups are zero, and so and the theorem is established. If is similar to , for some , then the only non-trivial component in the above direct sum is . But it is easy to see that all differential operators in have only a single eigenvalue (up to similarity). Hence has the required decomposition. ∎
3.5. Unipotent differential operators
Theorem 22 implies that we only need to prove Jordan decomposition for differential operators with a unique eigenvalue. By translating if necessary, we can assume this eigenvalue is zero. Thus, we arrive at the following:
Definition 25** (Unipotent Operators).**
A differential operator is unipotent if all of its eigenvalues are similar to zero.
We now give a complete description of unipotent differential operators. Let denote the category whose objects are pairs where is a -vector space and is a nilpotent endomorphism. The morphisms of are linear maps which commute with . Let be the category of pairs consisting of a vector space and a unipotent differential operator . Define a functor
[TABLE]
The following result appears (without proof) in [Katz, §2].
Lemma 26**.**
The functor defines an equivalence of categories with inverse given by
[TABLE]
Proof.
We first show that the composition equals the identity. Let with and consider . The kernel of the operator acting on is the set of all constant vectors. This is an -dimensional -vector space. Since acts as 0 on this space, applying to recovers the pair .
Next, let be a unipotent differential operator and let . We first show by induction that contains , -linearly independent vectors. If this is obvious. If , then there exists such that . Set and consider the differential module . This has dimension so we may assume there exist -linearly independent vectors in . For each we have and hence for some . Now observe that we can choose such that where is the constant term of ; since we can always “integrate” elements with no constant term. Now we have
[TABLE]
Hence so is a set of -linearly independent vectors in .
Note the functor sends to the -vector space . Moreover, induces a -linear operator on . By construction, this operator is nilpotent and for this basis, the matrix of is constant (i.e., its entries belong to ). Applying the functor to now recovers the differential module . ∎
Remark 27*.*
A formal differential operator is said to be regular singular if it has a matrix representation of the form
[TABLE]
It is known that, in this case, can actually be represented by a constant matrix; i.e., by a matrix . The conjugacy class of is uniquely determined by and is called the monodromy [BV, §3]. The above lemma implies that a unipotent differential operator is the same as a regular singular differential operator with unipotent monodromy.
3.6. Proof of Theorem 4 (Jordan Decomposition)
The uniqueness part of the theorem is relatively easy. Since we don’t have anything new to add to Levelt’s original proof, we refer the reader to [Levelt] for the details. It remains to prove existence.
Let be a formal differential operator. By Theorem 22, there exists a positive integer such that admits a generalised eigenspace decomposition. Thus, can be represented by a block diagonal matrix where each block is upper triangular with a unique (up to similarity) eigenvalue. Thus, we may assume without the loss of generality that has a unique, up to similarity, eigenvalue . Replacing by , we may assume that is unipotent in which case the result follows from Lemma 26. This proves the existence of Jordan decomposition for .
We now show that the Jordan decomposition of descends to a decomposition of . The proof is similar to the linear setting. Picking a -basis of and extending it to a basis of allows us to write where is a matrix with entries in . Let and for matrices and with respect to this basis. Then, for any , it is clear that is a second Jordan decomposition of . Thus, we must have and . Hence, and are defined over . ∎
4. Formal -connections
4.1. Description of semisimple -connections
We start by recalling basic facts about the differential Galois group. Let denote the differential Galois group of as defined in [Katz, §2.5]. By definition, for every -connection , we get a homomorphism . The Zariski closure of the image of is an algebraic subgroup of called the differential Galois group of and denoted by . For an alternative point of view on , cf. [SingerVanDerPut]*§1.4.
Proof of Theorem 8.
We are now ready to prove the theorem. Suppose the differential operator , , is gauge equivalent to with for some finite extension of . Then and is contained in some Cartan subalgebra of . Then there exists such that where consists of diagonal matrices in . As , the gauge action of on yields . Thus is gauge equivalent to a diagonal differential operator and is therefore semisimple by Theorem 2. As is gauge equivalent to , this implies that is semisimple. By definition, then is semisimple.
Conversely, suppose that is semisimple, i.e. is semisimple. By Theorem 2, is diagonalizable after a finite extension of . This implies that the image of the composition
[TABLE]
is a subgroup of a torus in . This then implies that the image of is a subgroup of a maximal torus ; that is, the above map factors through a map . Thus, is equivalent to a connection of the form for some . ∎
Remark 28*.*
Let be a semisimple formal -connection. By Theorem 8, we may assume (after a finite base change) that where is a Cartan subalgebra of . Write where and set
[TABLE]
Let
[TABLE]
Then gauge transformation of by yields . This is the canonical form of in the sense of [BV].
4.2. Jordan decomposition for -connections
We start with a lemma, which is an analogue of a standard result in Lie theory, c.f. [humphreys]*§6.4.
Lemma 29**.**
Let be a Lie subalgebra. Let , , be a differential operator with Jordan decomposition (as a -connection) . Then ; moreover, is a semisimple -connection.
Proof.
By definition is a -invariant subspace of . Thus, by Lemma 19, it is also -invariant. By definition, is invariant. Thus, is -invariant. This implies that is a -linear derivation on and hence (since every -linear derivation is inner). ∎
Proof of Theorem 9.
We are now ready to prove the theorem. Let be a -connection. Note that the adjoint action gives an embedding . Let denote the Jordan decomposition of as a differential operator . Then by the previous lemma, and is a semisimple -connection. It follows that is a nilpotent element of . Now and commute in the extended loop algebra of . This implies that they commute in the extended loop algebra of , this establishes the existence of Jordan decomposition.
For uniqueness, suppose and are Jordan decompositions for . Then and are Jordan decompositions for . By uniqueness of Jordan decomposition for differential operators (Theorem 4), we obtain and . As the adjoint representation is faithful, we conclude and . ∎
Remark 30*.*
A formal -connection is called unipotent if its semisimple part is trivial. One can show that is unipotent if and only if its differential Galois group is unipotent. According to [SingerVanDerPut, thm. 11.2], is then a one-parameter subgroup of generated by a unipotent element. This implies that the map
[TABLE]
from nilpotent elements of to formal unipotent -connections defines a bijection between nilpotent orbits in and equivalence classes of unipotent connections. Thus, one obtains a generalisation of Katz’s results (Lemma 26) to the setting of -connections.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1AUTHOR = Babbitt, B., Author=Varadarajan, P., TITLE = formal reduction theory of formal differential equations: a group theoretic view, JOURNAL = Pacific J. Math., FJOURNAL = Pacific Journal of Mathematics, VOLUME = 109, YEAR = 1983, NUMBER = 1, PAGES = 1–80,
- 2author = Boalch, P., author=Yamakawa, D., title = Twisted wild character varieties, journal = ar Xiv:1512.08091, year = 2015,
- 3author=Hukuhara, M., title=Théorèmes fondamentaux de la théorie des équations différentielles ordinaires. II, journal=Mem. Fac. Sci. Kyūsyū Imp. Univ. A., volume=2, date=1941, pages=1–25
- 4Author=Kamgarpour, M., Author=Sage, D., title=A geometric analogue of a conjecture of Gross and Reeder, Journal=ar Xiv:1606.00943, date=2016
- 5author=Katz, Nicholas M., title=Nilpotent connections and the monodromy theorem: Applications of a result of Turrittin, journal=Inst. Hautes Études Sci. Publ. Math., number=39, date=1970, pages=175–232, issn=0073-8301
- 6AUTHOR = Katz, N. M., TITLE = On the calculation of some differential Galois groups, JOURNAL = Invent. Math., VOLUME = 87, YEAR = 1987, NUMBER = 1, PAGES = 13–61,
- 7Author=Levelt, G., TITLE = Jordan decomposition for a class of singular differential operators, JOURNAL = Ark. Mat., FJOURNAL = Arkiv för Matematik, VOLUME = 13, YEAR = 1975, PAGES = 1–27,
- 8Author=Luu, M., Title=Local Langlands duality and a duality of conformal field theories, Journal=ar Xiv:1506.00663, Date=2015,
